Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer pair #487095726
details
property
value
status
complete
benchmark
Fibonacci.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
3.45204 seconds
cpu usage
10.8728
user time
10.3689
system time
0.503864
max virtual memory
1.9089448E7
max residence set size
912940.0
stage attributes
key
value
starexec-result
NO
output
NO proof of /export/starexec/sandbox/benchmark/theBenchmark.c # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given C Problem could be disproven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) IRS2T2 [EQUIVALENT, 0 ms] (4) T2IntSys (5) T2 [COMPLETE, 1646 ms] (6) NO ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(n, i, j, t) -> f2(x_1, i, j, t) :|: TRUE f2(x, x1, x2, x3) -> f3(x, 0, x2, x3) :|: TRUE f3(x4, x5, x6, x7) -> f4(x4, x5, 1, x7) :|: TRUE f4(x8, x9, x10, x11) -> f5(x8, x9, x10, 0) :|: TRUE f6(x12, x13, x14, x15) -> f7(x12, x13, x14, arith) :|: TRUE && arith = x14 + x13 f7(x16, x17, x18, x19) -> f8(x16, x18, x18, x19) :|: TRUE f8(x20, x21, x22, x23) -> f9(x20, x21, x23, x23) :|: TRUE f5(x24, x25, x26, x27) -> f6(x24, x25, x26, x27) :|: x26 < x24 f5(x36, x37, x38, x39) -> f6(x36, x37, x38, x39) :|: x38 > x36 f9(x28, x29, x30, x31) -> f5(x28, x29, x30, x31) :|: TRUE f5(x32, x33, x34, x35) -> f10(x32, x33, x34, x35) :|: x34 = x32 Start term: f1(n, i, j, t) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_4,1) (f2_4,2) (f3_4,3) (f4_4,4) (f5_4,5) (f6_4,6) (f7_4,7) (f8_4,8) (f9_4,9) (f10_4,10) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := x3; oldX4 := nondet(); assume(0 = 0); x0 := oldX4; x1 := oldX1; x2 := oldX2; x3 := oldX3; TO: 2; FROM: 2; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := x3; assume(0 = 0); x0 := oldX0; x1 := 0; x2 := oldX2; x3 := oldX3; TO: 3; FROM: 3; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := x3; assume(0 = 0); x0 := oldX0; x1 := oldX1; x2 := 1; x3 := oldX3;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer