Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275492
details
property
value
status
complete
benchmark
p-61.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n110.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.029319 seconds
cpu usage
0.029481
user time
0.022487
system time
0.006994
max virtual memory
113176.0
max residence set size
5860.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.02 YES 0.00/0.02 0.00/0.02 Solver Timeout: 4 0.00/0.02 Global Timeout: 300 0.00/0.02 No parsing errors! 0.00/0.02 Init Location: 0 0.00/0.02 Transitions: 0.00/0.02 <l0, l5, true> 0.00/0.02 <l1, l2, (((1 + __const_9^0) + (~(1) * x_6^0)) <= 0) /\ (undef6 = 0) /\ (undef2 = (0 + undef6)), par{Result_4^0 -> (0 + undef2), __cil_tmp4_8^0 -> undef2, __retres3_7^0 -> undef6}> 0.00/0.02 <l1, l2, (0 <= ((0 + __const_9^0) + (~(1) * x_6^0))) /\ (((1 + (~(1) * __const_101^0)) + i_5^0) <= 0) /\ (undef14 = 0) /\ (undef10 = (0 + undef14)), par{Result_4^0 -> (0 + undef10), __cil_tmp4_8^0 -> undef10, __retres3_7^0 -> undef14}> 0.00/0.02 <l1, l3, (0 <= ((0 + __const_9^0) + (~(1) * x_6^0))) /\ (0 <= ((0 + (~(1) * __const_101^0)) + i_5^0)), par{i_5^0 -> (~(1) + i_5^0)}> 0.00/0.02 <l3, l1, true> 0.00/0.02 <l4, l1, true, par{i_5^0 -> (0 + __const_1000^0)}> 0.00/0.02 <l5, l4, true> 0.00/0.02 0.00/0.02 Fresh variables: 0.00/0.02 undef2, undef6, undef10, undef14, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef2, undef6, undef10, undef14, 0.00/0.02 0.00/0.02 Abstraction variables: 0.00/0.02 0.00/0.02 Exit nodes: 0.00/0.02 0.00/0.02 Accepting locations: 0.00/0.02 0.00/0.02 Asserts: 0.00/0.02 0.00/0.02 Preprocessed LLVMGraph 0.00/0.02 Init Location: 0 0.00/0.02 Transitions: 0.00/0.02 <l0, l1, (i_5^0 = (0 + __const_1000^0))> 0.00/0.02 <l1, l2, (((1 + __const_9^0) + (~(1) * x_6^0)) <= 0) /\ (undef6 = 0) /\ (undef2 = (0 + undef6))> 0.00/0.02 <l1, l2, (0 <= ((0 + __const_9^0) + (~(1) * x_6^0))) /\ (((1 + (~(1) * __const_101^0)) + i_5^0) <= 0) /\ (undef14 = 0) /\ (undef10 = (0 + undef14))> 0.00/0.02 <l1, l1, (0 <= ((0 + __const_9^0) + (~(1) * x_6^0))) /\ (0 <= ((0 + (~(1) * __const_101^0)) + i_5^0)), par{i_5^0 -> (~(1) + i_5^0)}> 0.00/0.02 0.00/0.02 Fresh variables: 0.00/0.02 undef2, undef6, undef10, undef14, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef2, undef6, undef10, undef14, 0.00/0.02 0.00/0.02 Abstraction variables: 0.00/0.02 0.00/0.02 Exit nodes: 0.00/0.02 0.00/0.02 Accepting locations: 0.00/0.02 0.00/0.02 Asserts: 0.00/0.02 0.00/0.02 ************************************************************* 0.00/0.02 ******************************************************************************************* 0.00/0.02 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.02 ******************************************************************************************* 0.00/0.02 0.00/0.02 Init Location: 0 0.00/0.02 Graph 0: 0.00/0.02 Transitions: 0.00/0.02 Variables: 0.00/0.02 0.00/0.02 Graph 1: 0.00/0.02 Transitions: 0.00/0.02 <l1, l1, __const_101^0 <= i_5^0 /\ x_6^0 <= __const_9^0, {i_5^0 -> -1 + i_5^0, rest remain the same}> 0.00/0.02 Variables: 0.00/0.02 __const_101^0, __const_9^0, i_5^0, x_6^0 0.00/0.02 0.00/0.02 Graph 2: 0.00/0.02 Transitions: 0.00/0.02 Variables: 0.00/0.02 0.00/0.02 Precedence: 0.00/0.02 Graph 0 0.00/0.02 0.00/0.02 Graph 1 0.00/0.02 <l0, l1, __const_1000^0 = i_5^0, {all remain the same}> 0.00/0.02 0.00/0.02 Graph 2 0.00/0.02 <l1, l2, 1 + __const_9^0 <= x_6^0 /\ undef2 = undef6 /\ undef6 = 0, {all remain the same}> 0.00/0.02 <l1, l2, 1 + i_5^0 <= __const_101^0 /\ x_6^0 <= __const_9^0 /\ undef10 = undef14 /\ undef14 = 0, {all remain the same}> 0.00/0.02 0.00/0.02 Map Locations to Subgraph: 0.00/0.02 ( 0 , 0 ) 0.00/0.02 ( 1 , 1 ) 0.00/0.02 ( 2 , 2 ) 0.00/0.02 0.00/0.02 ******************************************************************************************* 0.00/0.02 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.02 ******************************************************************************************* 0.00/0.02 0.00/0.02 Proving termination of subgraph 0 0.00/0.02 Proving termination of subgraph 1 0.00/0.02 Checking unfeasibility... 0.00/0.02 Time used: 0.002724 0.00/0.02 0.00/0.02 Checking conditional termination of SCC {l1}... 0.00/0.02 0.00/0.02 LOG: CALL solveLinear 0.00/0.02 0.00/0.02 LOG: RETURN solveLinear - Elapsed time: 0.001139s
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer_Transition_Systems 2019-03-29 01.54