Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739694
details
property
value
status
complete
benchmark
p-45.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n112.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0359768867493 seconds
cpu usage
0.032213529
max memory
4530176.0
stage attributes
key
value
output-size
4419
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/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, true> <l2, l3, (1 <= (0 + x_13^0)) /\ ((0 + y_15^0) <= 0), par{result_11^0 -> (0 + temp0_14^0)}> <l2, l3, ((0 + x_13^0) <= 0) /\ (undef19 = undef19) /\ ((0 + undef19) <= 0), par{result_11^0 -> (0 + temp0_14^0), x_13^0 -> undef19}> <l2, l4, (undef28 = undef28) /\ (undef24 = undef24) /\ (1 <= (0 + x_13^0)) /\ (1 <= (0 + y_15^0)) /\ (undef29 = (0 + x_13^0)) /\ (undef30 = (~(2) + y_15^0)) /\ (undef31 = (1 + undef29)) /\ (undef23 = (0 + undef30)) /\ (undef26 = (~(2) + undef31)) /\ (undef27 = (1 + undef23)) /\ ((0 + undef26) <= (~(1) + undef24)) /\ ((~(1) + undef24) <= (0 + undef26)) /\ ((0 + undef27) <= (1 + undef23)) /\ ((1 + undef23) <= (0 + undef27)) /\ ((0 + undef23) <= (~(2) + undef28)) /\ ((~(2) + undef28) <= (0 + undef23)) /\ (1 <= (0 + undef28)) /\ (1 <= (0 + undef24)), par{t_16^0 -> undef23, t_22^0 -> undef24, x_13^0 -> undef26, y_15^0 -> undef27, y_21^0 -> undef28}> <l4, l2, true> <l5, l1, true> Fresh variables: undef19, undef23, undef24, undef26, undef27, undef28, undef29, undef30, undef31, Undef variables: undef19, undef23, undef24, undef26, undef27, undef28, undef29, undef30, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, true> <l2, l3, (1 <= (0 + x_13^0)) /\ ((0 + y_15^0) <= 0)> <l2, l3, ((0 + x_13^0) <= 0) /\ (undef19 = undef19) /\ ((0 + undef19) <= 0), par{x_13^0 -> undef19}> <l2, l2, (undef28 = undef28) /\ (undef24 = undef24) /\ (1 <= (0 + x_13^0)) /\ (1 <= (0 + y_15^0)) /\ (undef29 = (0 + x_13^0)) /\ (undef30 = (~(2) + y_15^0)) /\ (undef31 = (1 + undef29)) /\ (undef23 = (0 + undef30)) /\ (undef26 = (~(2) + undef31)) /\ (undef27 = (1 + undef23)) /\ ((0 + undef26) <= (~(1) + undef24)) /\ ((~(1) + undef24) <= (0 + undef26)) /\ ((0 + undef27) <= (1 + undef23)) /\ ((1 + undef23) <= (0 + undef27)) /\ ((0 + undef23) <= (~(2) + undef28)) /\ ((~(2) + undef28) <= (0 + undef23)) /\ (1 <= (0 + undef28)) /\ (1 <= (0 + undef24)), par{x_13^0 -> undef26, y_15^0 -> undef27}> Fresh variables: undef19, undef23, undef24, undef26, undef27, undef28, undef29, undef30, undef31, Undef variables: undef19, undef23, undef24, undef26, undef27, undef28, undef29, undef30, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 <= x_13^0 /\ 1 <= y_15^0 /\ 1 <= undef24 /\ 1 <= undef28 /\ 1 + undef23 = undef27 /\ 1 + undef29 = undef31 /\ x_13^0 = undef29 /\ undef23 = undef30 /\ 2 + undef23 = undef28 /\ 2 + undef26 = undef31 /\ y_15^0 = 2 + undef30 /\ undef24 = 1 + undef26, {x_13^0 -> undef26, y_15^0 -> undef27, rest remain the same}> Variables: x_13^0, y_15^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l2, true, {all remain the same}> Graph 2 <l2, l3, 1 <= x_13^0 /\ y_15^0 <= 0, {all remain the same}> <l2, l3, x_13^0 <= 0 /\ undef19 <= 0, {x_13^0 -> undef19, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 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