Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273014
details
property
value
status
complete
benchmark
Velroyen08-upAndDown.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n127.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
42.9486 seconds
cpu usage
42.8702
user time
40.438
system time
2.43218
max virtual memory
1107916.0
max residence set size
443984.0
stage attributes
key
value
starexec-result
NO
output
42.83/42.94 NO 42.83/42.94 42.83/42.94 Solver Timeout: 4 42.83/42.94 Global Timeout: 300 42.83/42.94 No parsing errors! 42.83/42.94 Init Location: 0 42.83/42.94 Transitions: 42.83/42.94 <l0, l3, true> 42.83/42.94 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 0}> 42.83/42.94 <l2, l2, (arg2 < 10) /\ (arg2 < 11) /\ (arg2 > 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}> 42.83/42.94 <l2, l2, (arg2 < 10) /\ (arg2 > 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}> 42.83/42.94 <l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}> 42.83/42.94 <l2, l2, (0 = arg2), par{arg1 -> 1, arg2 -> 1}> 42.83/42.94 <l3, l1, true, par{arg1 -> undef11, arg2 -> undef12}> 42.83/42.94 42.83/42.94 Fresh variables: 42.83/42.94 undef11, undef12, 42.83/42.94 42.83/42.94 Undef variables: 42.83/42.94 undef11, undef12, 42.83/42.94 42.83/42.94 Abstraction variables: 42.83/42.94 42.83/42.94 Exit nodes: 42.83/42.94 42.83/42.94 Accepting locations: 42.83/42.94 42.83/42.94 Asserts: 42.83/42.94 42.83/42.94 Preprocessed LLVMGraph 42.83/42.94 Init Location: 0 42.83/42.94 Transitions: 42.83/42.94 <l0, l2, (arg1 = 0) /\ (arg2 = undef12) /\ (undef11 > 0) /\ (undef12 > ~(1))> 42.83/42.94 <l2, l2, (arg2 < 10) /\ (arg2 < 11) /\ (arg2 > 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}> 42.83/42.94 <l2, l2, (arg2 < 10) /\ (arg2 > 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}> 42.83/42.94 <l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}> 42.83/42.94 <l2, l2, (0 = arg2), par{arg1 -> 1, arg2 -> 1}> 42.83/42.94 42.83/42.94 Fresh variables: 42.83/42.94 undef11, undef12, 42.83/42.94 42.83/42.94 Undef variables: 42.83/42.94 undef11, undef12, 42.83/42.94 42.83/42.94 Abstraction variables: 42.83/42.94 42.83/42.94 Exit nodes: 42.83/42.94 42.83/42.94 Accepting locations: 42.83/42.94 42.83/42.94 Asserts: 42.83/42.94 42.83/42.94 ************************************************************* 42.83/42.94 ******************************************************************************************* 42.83/42.94 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 42.83/42.94 ******************************************************************************************* 42.83/42.94 42.83/42.94 Init Location: 0 42.83/42.94 Graph 0: 42.83/42.94 Transitions: 42.83/42.94 Variables: 42.83/42.94 42.83/42.94 Graph 1: 42.83/42.94 Transitions: 42.83/42.94 <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}> 42.83/42.94 <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}> 42.83/42.94 <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}> 42.83/42.94 <l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}> 42.83/42.94 Variables: 42.83/42.94 arg1, arg2 42.83/42.94 42.83/42.94 Precedence: 42.83/42.94 Graph 0 42.83/42.94 42.83/42.94 Graph 1 42.83/42.94 <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}> 42.83/42.94 42.83/42.94 Map Locations to Subgraph: 42.83/42.94 ( 0 , 0 ) 42.83/42.94 ( 2 , 1 ) 42.83/42.94 42.83/42.94 ******************************************************************************************* 42.83/42.94 ******************************** CHECKING ASSERTIONS ******************************** 42.83/42.94 ******************************************************************************************* 42.83/42.94 42.83/42.94 Proving termination of subgraph 0 42.83/42.94 Proving termination of subgraph 1 42.83/42.94 Checking unfeasibility... 42.83/42.94 Time used: 0.154362 42.83/42.94 42.83/42.94 Checking conditional termination of SCC {l2}... 42.83/42.94 42.83/42.94 LOG: CALL solveLinear 42.83/42.94 42.83/42.94 LOG: RETURN solveLinear - Elapsed time: 0.002436s 42.83/42.94 42.83/42.94 LOG: CALL solveLinear 42.83/42.94 42.83/42.94 LOG: RETURN solveLinear - Elapsed time: 0.017162s 42.83/42.94 Trying to remove transition: <l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
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