Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739688
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
n026.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0308561325073 seconds
cpu usage
0.02812306
max memory
4227072.0
stage attributes
key
value
output-size
3503
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l5, true> <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}> <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}> <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)}> <l3, l1, true> <l4, l1, true, par{i_5^0 -> (0 + __const_1000^0)}> <l5, l4, true> Fresh variables: undef2, undef6, undef10, undef14, Undef variables: undef2, undef6, undef10, undef14, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (i_5^0 = (0 + __const_1000^0))> <l1, l2, (((1 + __const_9^0) + (~(1) * x_6^0)) <= 0) /\ (undef6 = 0) /\ (undef2 = (0 + undef6))> <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))> <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)}> Fresh variables: undef2, undef6, undef10, undef14, Undef variables: undef2, undef6, undef10, undef14, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <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}> Variables: __const_101^0, __const_9^0, i_5^0, x_6^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l1, __const_1000^0 = i_5^0, {all remain the same}> Graph 2 <l1, l2, 1 + __const_9^0 <= x_6^0 /\ undef2 = undef6 /\ undef6 = 0, {all remain the same}> <l1, l2, 1 + i_5^0 <= __const_101^0 /\ x_6^0 <= __const_9^0 /\ undef10 = undef14 /\ undef14 = 0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 2 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility...
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634