Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer 2019-03-28 22.15 pair #432272176
details
property
value
status
complete
benchmark
ChenFlurMukhopadhyay-SAS2012-Ex2.15_false-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n070.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
3.21853 seconds
cpu usage
9.55255
user time
9.12122
system time
0.431336
max virtual memory
2.0266836E7
max residence set size
577660.0
stage attributes
key
value
starexec-result
NO
output
8.88/3.18 NO 9.50/3.19 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 9.50/3.19 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.50/3.19 9.50/3.19 9.50/3.19 Termination of the given C Problem could be disproven: 9.50/3.19 9.50/3.19 (0) C Problem 9.50/3.19 (1) CToIRSProof [EQUIVALENT, 0 ms] 9.50/3.19 (2) IntTRS 9.50/3.19 (3) IRS2T2 [EQUIVALENT, 0 ms] 9.50/3.19 (4) T2IntSys 9.50/3.19 (5) T2 [COMPLETE, 1342 ms] 9.50/3.19 (6) NO 9.50/3.19 9.50/3.19 9.50/3.19 ---------------------------------------- 9.50/3.19 9.50/3.19 (0) 9.50/3.19 Obligation: 9.50/3.19 c file /export/starexec/sandbox/benchmark/theBenchmark.c 9.50/3.19 ---------------------------------------- 9.50/3.19 9.50/3.19 (1) CToIRSProof (EQUIVALENT) 9.50/3.19 Parsed C Integer Program as IRS. 9.50/3.19 ---------------------------------------- 9.50/3.19 9.50/3.19 (2) 9.50/3.19 Obligation: 9.50/3.19 Rules: 9.50/3.19 f1(x, y) -> f2(x_1, y) :|: TRUE 9.50/3.19 f2(x1, x2) -> f3(x1, x3) :|: TRUE 9.50/3.19 f4(x4, x5) -> f5(arith, x5) :|: TRUE && arith = x4 + x5 9.50/3.19 f3(x6, x7) -> f4(x6, x7) :|: x6 > 0 9.50/3.19 f5(x8, x9) -> f3(x8, x9) :|: TRUE 9.50/3.19 f3(x10, x11) -> f6(x10, x11) :|: x10 <= 0 9.50/3.19 Start term: f1(x, y) 9.50/3.19 9.50/3.19 ---------------------------------------- 9.50/3.19 9.50/3.19 (3) IRS2T2 (EQUIVALENT) 9.50/3.19 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 9.50/3.19 9.50/3.19 (f1_2,1) 9.50/3.19 (f2_2,2) 9.50/3.19 (f3_2,3) 9.50/3.19 (f4_2,4) 9.50/3.19 (f5_2,5) 9.50/3.19 (f6_2,6) 9.50/3.19 9.50/3.19 ---------------------------------------- 9.50/3.19 9.50/3.19 (4) 9.50/3.19 Obligation: 9.50/3.19 START: 1; 9.50/3.19 9.50/3.19 FROM: 1; 9.50/3.19 oldX0 := x0; 9.50/3.19 oldX1 := x1; 9.50/3.19 oldX2 := nondet(); 9.50/3.19 assume(0 = 0); 9.50/3.19 x0 := oldX2; 9.50/3.19 x1 := oldX1; 9.50/3.19 TO: 2; 9.50/3.19 9.50/3.19 FROM: 2; 9.50/3.19 oldX0 := x0; 9.50/3.19 oldX1 := x1; 9.50/3.19 oldX2 := nondet(); 9.50/3.19 assume(0 = 0); 9.50/3.19 x0 := oldX0; 9.50/3.19 x1 := oldX2; 9.50/3.19 TO: 3; 9.50/3.19 9.50/3.19 FROM: 4; 9.50/3.19 oldX0 := x0; 9.50/3.19 oldX1 := x1; 9.50/3.19 oldX2 := -(-(oldX0 + oldX1)); 9.50/3.19 assume(0 = 0 && oldX2 = oldX0 + oldX1); 9.50/3.19 x0 := -(-(oldX0 + oldX1)); 9.50/3.19 x1 := oldX1; 9.50/3.19 TO: 5; 9.50/3.19 9.50/3.19 FROM: 3; 9.50/3.19 oldX0 := x0; 9.50/3.19 oldX1 := x1; 9.50/3.19 assume(oldX0 > 0); 9.50/3.19 x0 := oldX0; 9.50/3.19 x1 := oldX1; 9.50/3.19 TO: 4; 9.50/3.19 9.50/3.19 FROM: 5; 9.50/3.19 oldX0 := x0; 9.50/3.19 oldX1 := x1; 9.50/3.19 assume(0 = 0); 9.50/3.19 x0 := oldX0; 9.50/3.19 x1 := oldX1; 9.50/3.19 TO: 3; 9.50/3.19 9.50/3.19 FROM: 3;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer 2019-03-28 22.15