Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737194
details
property
value
status
complete
benchmark
RetValRec.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n080.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
1.11685109138 seconds
cpu usage
3.2156244
max memory
7.102464E7
stage attributes
key
value
output-size
6629
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, (undef3 > ~(1)) /\ (arg2 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (arg1 > 0)> <l2, l3, (undef7 > ~(1)) /\ (arg2 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (arg1 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> <l1, l2, (undef11 > ~(1)) /\ (arg2 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (arg1 > 0)> <l2, l3, (undef15 > ~(1)) /\ (arg2 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (arg1 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> <l3, l3, (arg1 = arg2), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1)}> <l4, l1, true, par{arg1 -> undef19, arg2 -> undef20}> Fresh variables: undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, Undef variables: undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (undef3 > ~(1)) /\ (undef20 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (undef19 > 0) /\ (undef7 > ~(1)) /\ (undef20 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (undef19 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> <l0, l3, (undef3 > ~(1)) /\ (undef20 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (undef19 > 0) /\ (undef15 > ~(1)) /\ (undef20 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef19 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> <l0, l3, (undef11 > ~(1)) /\ (undef20 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef19 > 0) /\ (undef7 > ~(1)) /\ (undef20 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (undef19 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> <l0, l3, (undef11 > ~(1)) /\ (undef20 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef19 > 0) /\ (undef15 > ~(1)) /\ (undef20 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef19 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> <l3, l3, (arg1 = arg2), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1)}> Fresh variables: undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, Undef variables: undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, arg1 = arg2, {arg1 -> -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 <l0, l3, 1 <= undef19 /\ 1 <= undef20 /\ 0 <= undef3 /\ 0 <= undef7 /\ undef3 = 1 + 2*undef4 /\ undef7 = 1 + 2*undef8, {arg1 -> 1, arg2 -> 0, rest remain the same}> <l0, l3, 1 <= undef19 /\ 1 <= undef20 /\ 0 <= undef3 /\ 0 <= undef15 /\ undef3 = 1 + 2*undef4 /\ undef15 = 2*undef16, {arg1 -> 0, arg2 -> 1, rest remain the same}> <l0, l3, 1 <= undef19 /\ 1 <= undef20 /\ 0 <= undef7 /\ 0 <= undef11 /\ undef7 = 1 + 2*undef8 /\ undef11 = 2*undef12, {arg1 -> 1, arg2 -> 0, rest remain the same}> <l0, l3, 1 <= undef19 /\ 1 <= undef20 /\ 0 <= undef11 /\ 0 <= undef15 /\ undef11 = 2*undef12 /\ undef15 = 2*undef16, {arg1 -> 0, arg2 -> 1, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002998 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634