Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432274802
details
property
value
status
complete
benchmark
fibcall.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n145.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.030199 seconds
cpu usage
0.030311
user time
0.022417
system time
0.007894
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, l5, true> 0.00/0.02 <l1, l2, ((1 + n3^0) <= (0 + i4^0)) /\ (undef5 = (0 + Fnew5^0)) /\ (undef8 = (0 + undef5)), par{ans8^0 -> undef5, ret_fib9^0 -> undef8, tmp^0 -> (0 + undef8)}> 0.00/0.02 <l1, l3, ((0 + i4^0) <= (0 + n3^0)) /\ (undef19 = (0 + Fnew5^0)), par{Fnew5^0 -> ((0 + Fnew5^0) + Fold6^0), Fold6^0 -> (0 + undef19), i4^0 -> (1 + i4^0), temp7^0 -> undef19}> 0.00/0.02 <l3, l1, true> 0.00/0.02 <l4, l3, (undef34 = (0 + __const_30^0)), par{Fnew5^0 -> 1, Fold6^0 -> 0, a^0 -> undef34, i4^0 -> 2, n3^0 -> (0 + undef34)}> 0.00/0.02 <l5, l4, true> 0.00/0.02 0.00/0.02 Fresh variables: 0.00/0.02 undef5, undef8, undef19, undef34, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef5, undef8, undef19, undef34, 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, (Fnew5^0 = 1) /\ (Fold6^0 = 0) /\ (i4^0 = 2) /\ (n3^0 = (0 + undef34)) /\ (undef34 = (0 + __const_30^0))> 0.00/0.02 <l3, l2, ((1 + n3^0) <= (0 + i4^0)) /\ (undef5 = (0 + Fnew5^0)) /\ (undef8 = (0 + undef5))> 0.00/0.02 <l3, l3, ((0 + i4^0) <= (0 + n3^0)) /\ (undef19 = (0 + Fnew5^0)), par{Fnew5^0 -> ((0 + Fnew5^0) + Fold6^0), Fold6^0 -> (0 + undef19), i4^0 -> (1 + i4^0)}> 0.00/0.02 0.00/0.02 Fresh variables: 0.00/0.02 undef5, undef8, undef19, undef34, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef5, undef8, undef19, undef34, 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, i4^0 <= n3^0 /\ Fnew5^0 = undef19, {Fnew5^0 -> Fnew5^0 + Fold6^0, Fold6^0 -> undef19, i4^0 -> 1 + i4^0, rest remain the same}> 0.00/0.02 Variables: 0.00/0.02 Fnew5^0, Fold6^0, i4^0, n3^0 0.00/0.02 0.00/0.02 Graph 2: 0.00/0.02 Transitions: 0.00/0.02 Variables: 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, Fold6^0 = 0 /\ __const_30^0 = undef34 /\ n3^0 = undef34 /\ Fnew5^0 = 1 /\ i4^0 = 2, {all remain the same}> 0.00/0.02 0.00/0.02 Graph 2 0.00/0.02 <l3, l2, 1 + n3^0 <= i4^0 /\ Fnew5^0 = undef5 /\ undef5 = undef8, {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 ( 2 , 2 ) 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.003361 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.001167s 0.00/0.02 �[33mRanking function: �[36m-i4^0 + n3^0�[0m 0.00/0.02 New Graphs: 0.00/0.02 Proving termination of subgraph 2
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