Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432272786
details
property
value
status
complete
benchmark
PastaB15.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n147.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0297201 seconds
cpu usage
0.029865
user time
0.022913
system time
0.006952
max virtual memory
113176.0
max residence set size
6052.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.02 YES 0.00/0.02 0.00/0.02 Solver Timeout: 4 0.00/0.02 Global Timeout: 300 0.00/0.02 No parsing errors! 0.00/0.02 Init Location: 0 0.00/0.02 Transitions: 0.00/0.02 <l0, l4, true> 0.00/0.02 <l1, l2, (undef2 > ~(1)) /\ (arg2 > ~(1)) /\ (undef1 > ~(1)) /\ (undef3 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}> 0.00/0.02 <l2, l3, (arg2 > arg1) /\ (arg2 = arg3), par{arg1 -> arg2, arg3 -> arg2, arg4 -> arg1}> 0.00/0.02 <l3, l2, (arg4 >= arg2) /\ (arg2 = arg3), par{arg1 -> arg4, arg2 -> arg1, arg3 -> arg2, arg4 -> undef12}> 0.00/0.02 <l3, l3, (arg4 < arg2) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> 0.00/0.02 <l4, l1, true, par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}> 0.00/0.02 0.00/0.02 Fresh variables: 0.00/0.02 undef1, undef2, undef3, undef4, undef12, undef17, undef18, undef19, undef20, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef1, undef2, undef3, undef4, undef12, undef17, undef18, undef19, undef20, 0.00/0.02 0.00/0.02 Abstraction variables: 0.00/0.02 0.00/0.02 Exit nodes: 0.00/0.02 0.00/0.02 Accepting locations: 0.00/0.02 0.00/0.02 Asserts: 0.00/0.02 0.00/0.02 Preprocessed LLVMGraph 0.00/0.02 Init Location: 0 0.00/0.02 Transitions: 0.00/0.02 <l0, l3, (arg1 = undef2) /\ (arg2 = undef2) /\ (arg3 = undef2) /\ (arg4 = undef1) /\ (undef2 > ~(1)) /\ (undef18 > ~(1)) /\ (undef1 > ~(1)) /\ (undef3 > ~(1)) /\ (undef17 > 0) /\ (undef2 > undef1) /\ (undef2 = undef3)> 0.00/0.02 <l3, l3, (arg4 < arg2) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> 0.00/0.02 0.00/0.02 Fresh variables: 0.00/0.02 undef1, undef2, undef3, undef4, undef12, undef17, undef18, undef19, undef20, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef1, undef2, undef3, undef4, undef12, undef17, undef18, undef19, undef20, 0.00/0.02 0.00/0.02 Abstraction variables: 0.00/0.02 0.00/0.02 Exit nodes: 0.00/0.02 0.00/0.02 Accepting locations: 0.00/0.02 0.00/0.02 Asserts: 0.00/0.02 0.00/0.02 ************************************************************* 0.00/0.02 ******************************************************************************************* 0.00/0.02 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.02 ******************************************************************************************* 0.00/0.02 0.00/0.02 Init Location: 0 0.00/0.02 Graph 0: 0.00/0.02 Transitions: 0.00/0.02 Variables: 0.00/0.02 0.00/0.02 Graph 1: 0.00/0.02 Transitions: 0.00/0.02 <l3, l3, 1 + arg4 <= arg2 /\ arg2 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 0.00/0.02 Variables: 0.00/0.02 arg1, arg2, arg3, arg4 0.00/0.02 0.00/0.02 Precedence: 0.00/0.02 Graph 0 0.00/0.02 0.00/0.02 Graph 1 0.00/0.02 <l0, l3, 1 + undef1 <= undef2 /\ 1 <= undef17 /\ 0 <= undef1 /\ 0 <= undef2 /\ 0 <= undef3 /\ 0 <= undef18 /\ arg1 = undef2 /\ arg2 = undef2 /\ arg3 = undef2 /\ arg4 = undef1 /\ undef2 = undef3, {all remain the same}> 0.00/0.02 0.00/0.02 Map Locations to Subgraph: 0.00/0.02 ( 0 , 0 ) 0.00/0.02 ( 3 , 1 ) 0.00/0.02 0.00/0.02 ******************************************************************************************* 0.00/0.02 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.02 ******************************************************************************************* 0.00/0.02 0.00/0.02 Proving termination of subgraph 0 0.00/0.02 Proving termination of subgraph 1 0.00/0.02 Checking unfeasibility... 0.00/0.02 Time used: 0.004035 0.00/0.02 0.00/0.02 Checking conditional termination of SCC {l3}... 0.00/0.02 0.00/0.02 LOG: CALL solveLinear 0.00/0.02 0.00/0.02 LOG: RETURN solveLinear - Elapsed time: 0.000838s 0.00/0.02 �[33mRanking function: �[36m-1 + arg2 - arg4�[0m 0.00/0.02 New Graphs: 0.00/0.02 �[32mProgram Terminates�[0m 0.00/0.02 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.02 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.02 EOF
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer_Transition_Systems 2019-03-29 01.54