Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739204
details
property
value
status
complete
benchmark
Diff.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n101.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.46337389946 seconds
cpu usage
0.45933035
max memory
6.3819776E7
stage attributes
key
value
output-size
8383
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, l4, true> <l1, l2, true, par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> undef4, arg5 -> undef5}> <l2, l3, (arg2 < 20) /\ (arg2 = arg3), par{arg3 -> 0, arg4 -> 0, arg5 -> 0}> <l3, l2, (arg4 > 19) /\ (1 = arg3) /\ (arg4 = arg5), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> undef14, arg5 -> undef15}> <l3, l2, (arg4 < 20) /\ (1 = arg3) /\ (arg4 = arg5), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> undef19, arg5 -> undef20}> <l3, l3, (arg2 < 20) /\ (undef26 > undef27) /\ (arg4 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 0, arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}> <l3, l3, (arg2 < 20) /\ (undef33 < undef34) /\ (arg4 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 0, arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}> <l3, l2, (arg1 < 20) /\ (arg2 < 20) /\ (arg4 > 19) /\ (0 = arg3) /\ (arg4 = arg5), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> undef38, arg5 -> undef39}> <l3, l3, (arg4 < 20) /\ (arg2 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 1, arg5 -> arg4}> <l4, l1, true, par{arg1 -> undef45, arg2 -> undef46, arg3 -> undef47, arg4 -> undef48, arg5 -> undef49}> Fresh variables: undef4, undef5, undef14, undef15, undef19, undef20, undef26, undef27, undef33, undef34, undef38, undef39, undef45, undef46, undef47, undef48, undef49, Undef variables: undef4, undef5, undef14, undef15, undef19, undef20, undef26, undef27, undef33, undef34, undef38, undef39, undef45, undef46, undef47, undef48, undef49, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = 0) /\ (arg4 = 0) /\ (arg5 = 0) /\ (0 < 20) /\ (0 = 0)> <l3, l3, (arg4 > 19) /\ (1 = arg3) /\ (arg4 = arg5) /\ ((arg2 + 1) < 20) /\ ((arg2 + 1) = (arg2 + 1)), par{arg2 -> (arg2 + 1), arg3 -> 0, arg4 -> 0, arg5 -> 0}> <l3, l3, (arg4 < 20) /\ (1 = arg3) /\ (arg4 = arg5) /\ ((arg2 + 1) < 20) /\ ((arg2 + 1) = (arg2 + 1)), par{arg2 -> (arg2 + 1), arg3 -> 0, arg4 -> 0, arg5 -> 0}> <l3, l3, (arg2 < 20) /\ (undef26 > undef27) /\ (arg4 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 0, arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}> <l3, l3, (arg2 < 20) /\ (undef33 < undef34) /\ (arg4 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 0, arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}> <l3, l3, (arg1 < 20) /\ (arg2 < 20) /\ (arg4 > 19) /\ (0 = arg3) /\ (arg4 = arg5) /\ ((arg2 + 1) < 20) /\ ((arg2 + 1) = (arg2 + 1)), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1), arg3 -> 0, arg4 -> 0, arg5 -> 0}> <l3, l3, (arg4 < 20) /\ (arg2 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 1, arg5 -> arg4}> Fresh variables: undef4, undef5, undef14, undef15, undef19, undef20, undef26, undef27, undef33, undef34, undef38, undef39, undef45, undef46, undef47, undef48, undef49, Undef variables: undef4, undef5, undef14, undef15, undef19, undef20, undef26, undef27, undef33, undef34, undef38, undef39, undef45, undef46, undef47, undef48, undef49, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, 20 <= arg4 /\ arg2 <= 18 /\ arg4 = arg5 /\ arg3 = 1, {arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}> <l3, l3, arg4 <= 19 /\ arg2 <= 18 /\ arg4 = arg5 /\ arg3 = 1, {arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}> <l3, l3, 1 + undef27 <= undef26 /\ arg2 <= 19 /\ arg4 <= 19 /\ arg3 = 0 /\ arg4 = arg5, {arg3 -> 0, arg4 -> 1 + arg4, arg5 -> 1 + arg4, rest remain the same}> <l3, l3, 1 + undef33 <= undef34 /\ arg2 <= 19 /\ arg4 <= 19 /\ arg3 = 0 /\ arg4 = arg5, {arg3 -> 0, arg4 -> 1 + arg4, arg5 -> 1 + arg4, rest remain the same}> <l3, l3, 20 <= arg4 /\ arg1 <= 19 /\ arg2 <= 18 /\ arg3 = 0 /\ arg4 = arg5, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}> <l3, l3, arg2 <= 19 /\ arg4 <= 19 /\ arg3 = 0 /\ arg4 = arg5, {arg3 -> 1, arg5 -> arg4, rest remain the same}> Variables: arg2, arg3, arg4, arg5, arg1 Precedence: Graph 0 Graph 1 <l0, l3, arg1 = 0 /\ arg2 = 0 /\ arg3 = 0 /\ arg4 = 0 /\ arg5 = 0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634