Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737782
details
property
value
status
complete
benchmark
CyclicalListDuplicate.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n088.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
9.57180309296 seconds
cpu usage
13.816151623
max memory
2.30555648E8
stage attributes
key
value
output-size
13999
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l4, true> <l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> (arg2 - 1), arg4 -> 0, arg5 -> arg2}> <l2, l2, (arg5 > ~(1)) /\ (arg3 > arg2) /\ (undef6 <= arg1) /\ (arg1 > 0) /\ (undef6 > 0), par{arg1 -> undef6, arg2 -> (arg2 + 1), arg3 -> (arg5 - 1), arg4 -> undef9}> <l2, l3, (arg3 <= arg2) /\ (arg4 > 0) /\ (undef12 > arg4) /\ (arg1 > 0), par{arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}> <l2, l3, (arg1 > 0) /\ (arg3 <= arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}> <l3, l3, (arg2 > ~(1)) /\ (undef26 > 0) /\ (undef26 < arg2) /\ (undef26 < undef22) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25}> <l3, l3, (undef32 < arg2) /\ (arg2 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, arg5 -> undef31}> <l3, l3, (arg2 > ~(1)) /\ (undef38 > 0) /\ (undef38 < arg2) /\ (undef39 > undef38) /\ (undef40 > undef38) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 0, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}> <l3, l3, (undef46 < arg2) /\ (arg2 > ~(1)) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 2, arg3 -> undef43, arg4 -> undef44, arg5 -> undef45}> <l4, l1, true, par{arg1 -> undef47, arg2 -> undef48, arg3 -> undef49, arg4 -> undef50, arg5 -> undef51}> Fresh variables: undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Undef variables: undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = undef1) /\ (arg2 = 0) /\ (arg3 = (undef48 - 1)) /\ (arg4 = 0) /\ (arg5 = undef48) /\ (undef1 <= undef47) /\ (undef48 > ~(1)) /\ (undef47 > 0) /\ (undef1 > 0)> <l2, l2, (arg5 > ~(1)) /\ (arg3 > arg2) /\ (undef6 <= arg1) /\ (arg1 > 0) /\ (undef6 > 0), par{arg1 -> undef6, arg2 -> (arg2 + 1), arg3 -> (arg5 - 1), arg4 -> undef9}> <l2, l3, (arg3 <= arg2) /\ (arg4 > 0) /\ (undef12 > arg4) /\ (arg1 > 0), par{arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}> <l2, l3, (arg1 > 0) /\ (arg3 <= arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}> <l3, l3, (arg2 > ~(1)) /\ (undef26 > 0) /\ (undef26 < arg2) /\ (undef26 < undef22) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25}> <l3, l3, (undef32 < arg2) /\ (arg2 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, arg5 -> undef31}> <l3, l3, (arg2 > ~(1)) /\ (undef38 > 0) /\ (undef38 < arg2) /\ (undef39 > undef38) /\ (undef40 > undef38) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 0, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}> <l3, l3, (undef46 < arg2) /\ (arg2 > ~(1)) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 2, arg3 -> undef43, arg4 -> undef44, arg5 -> undef45}> Fresh variables: undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Undef variables: undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef6 /\ undef6 <= arg1 /\ 0 <= arg5, {arg1 -> undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Graph 2: Transitions: <l3, l3, 1 + undef26 <= arg2 /\ 1 + undef26 <= undef22 /\ 1 <= undef26 /\ 0 <= arg2 /\ arg1 = 0, {arg1 -> 1, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25, rest remain the same}> <l3, l3, 1 + undef32 <= arg2 /\ 0 <= arg2 /\ arg1 = 0, {arg1 -> 1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, arg5 -> undef31, rest remain the same}> <l3, l3, 1 + undef38 <= arg2 /\ 1 + undef38 <= undef39 /\ 1 + undef38 <= undef40 /\ 1 <= undef38 /\ 0 <= arg2 /\ arg1 = 1, {arg1 -> 0, arg2 -> 0, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37, rest remain the same}> <l3, l3, 1 + undef46 <= arg2 /\ 0 <= arg2 /\ arg1 = 1, {arg1 -> 0, arg2 -> 2, arg3 -> undef43, arg4 -> undef44, arg5 -> undef45, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= undef1 /\ 1 <= undef47 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}> Graph 2 <l2, l3, 1 <= arg1 /\ 1 + arg4 <= undef12 /\ 1 <= arg4 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}> <l2, l3, 1 <= arg1 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20, rest remain the same}>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634