Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738502
details
property
value
status
complete
benchmark
FactSLR.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0656881332397 seconds
cpu usage
0.116835551
max memory
2.3658496E7
stage attributes
key
value
output-size
4958
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, l3, true> <l1, l2, (arg1 > 0) /\ (0 = arg2), par{arg1 -> ~(1), arg2 -> 0, arg3 -> 0, arg4 -> 0}> <l1, l2, (undef9 > ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> ((3 * undef9) - 1), arg2 -> (3 * undef9), arg3 -> arg2, arg4 -> 1}> <l2, l2, (arg2 > 0) /\ (arg4 >= arg3) /\ (arg3 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> arg1}> <l2, l2, (arg2 > 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg4 < arg3), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg4 -> (arg4 + 1)}> <l3, l1, true, par{arg1 -> undef18, arg2 -> undef19, arg3 -> undef20, arg4 -> undef21}> Fresh variables: undef9, undef18, undef19, undef20, undef21, Undef variables: undef9, undef18, undef19, undef20, undef21, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (undef18 > 0) /\ (0 = undef19), par{arg1 -> ~(1), arg2 -> 0, arg3 -> 0, arg4 -> 0}> <l0, l2, (undef9 > ~(1)) /\ (undef19 > 0) /\ (undef18 > 0), par{arg1 -> ((3 * undef9) - 1), arg2 -> (3 * undef9), arg3 -> undef19, arg4 -> 1}> <l2, l2, (arg2 > 0) /\ (arg4 >= arg3) /\ (arg3 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> arg1}> <l2, l2, (arg2 > 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg4 < arg3), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg4 -> (arg4 + 1)}> Fresh variables: undef9, undef18, undef19, undef20, undef21, Undef variables: undef9, undef18, undef19, undef20, undef21, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, arg3 <= arg4 /\ 0 <= arg3 /\ 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, rest remain the same}> <l2, l2, 0 <= arg3 /\ 0 <= arg4 /\ 1 <= arg2 /\ 1 + arg4 <= arg3, {arg1 -> -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= undef18 /\ undef19 = 0, {arg1 -> -1, arg2 -> 0, arg3 -> 0, arg4 -> 0, rest remain the same}> <l0, l2, 0 <= undef9 /\ 1 <= undef18 /\ 1 <= undef19, {arg1 -> -1 + 3*undef9, arg2 -> 3*undef9, arg3 -> undef19, arg4 -> 1, rest 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.00728 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001635s �[33mRanking function: �[36marg3 - arg4�[0m
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634