Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739054
details
property
value
status
complete
benchmark
PastaB8.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n084.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0343351364136 seconds
cpu usage
0.03075863
max memory
4358144.0
stage attributes
key
value
output-size
3913
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, l4, true> <l1, l2, (undef1 > 0) /\ (arg2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> <l2, l3, ((arg1 - (2 * undef5)) = 1) /\ (arg1 > 0), par{arg2 -> undef4}> <l3, l2, (arg1 > 0) /\ ((arg1 - (2 * undef8)) = 1) /\ ((arg1 - (2 * undef8)) < 2) /\ ((arg1 - (2 * undef8)) >= 0), par{arg1 -> (arg1 - 1), arg2 -> undef7}> <l2, l3, ((arg1 - (2 * undef11)) = 0) /\ (arg1 > undef12) /\ (arg1 > 0), par{arg2 -> undef10}> <l3, l2, ((arg1 - (2 * undef15)) = 0) /\ (arg1 > 0) /\ (arg1 > undef13) /\ ((arg1 - (2 * undef15)) >= 0) /\ ((arg1 - (2 * undef15)) < 2) /\ ((arg1 - (2 * undef13)) < 2) /\ ((arg1 - (2 * undef13)) >= 0), par{arg1 -> undef13, arg2 -> undef14}> <l4, l1, true, par{arg1 -> undef16, arg2 -> undef17}> Fresh variables: undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, Undef variables: undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = undef1) /\ (undef1 > 0) /\ (undef17 > ~(1)) /\ (undef16 > 0)> <l2, l2, ((arg1 - (2 * undef5)) = 1) /\ (arg1 > 0) /\ (arg1 > 0) /\ ((arg1 - (2 * undef8)) = 1) /\ ((arg1 - (2 * undef8)) < 2) /\ ((arg1 - (2 * undef8)) >= 0), par{arg1 -> (arg1 - 1)}> <l2, l2, ((arg1 - (2 * undef11)) = 0) /\ (arg1 > undef12) /\ (arg1 > 0) /\ ((arg1 - (2 * undef15)) = 0) /\ (arg1 > 0) /\ (arg1 > undef13) /\ ((arg1 - (2 * undef15)) >= 0) /\ ((arg1 - (2 * undef15)) < 2) /\ ((arg1 - (2 * undef13)) < 2) /\ ((arg1 - (2 * undef13)) >= 0), par{arg1 -> undef13}> Fresh variables: undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, Undef variables: undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, 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 /\ arg1 = 1 + 2*undef5 /\ arg1 = 1 + 2*undef8, {arg1 -> -1 + arg1, rest remain the same}> <l2, l2, 2*undef13 <= arg1 /\ 1 <= arg1 /\ 1 + undef12 <= arg1 /\ 1 + undef13 <= arg1 /\ arg1 <= 1 + 2*undef13 /\ arg1 = 2*undef11 /\ arg1 = 2*undef15, {arg1 -> undef13, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 <l0, l2, 0 <= undef17 /\ 1 <= undef1 /\ 1 <= undef16 /\ arg1 = undef1, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003386 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001655s �[33mRanking function: �[36m-1 + arg1�[0m New Graphs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634