Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275237
details
property
value
status
complete
benchmark
qrdcmp.c.i.qrdcmp.pl.t2.fixed.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n167.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.999931 seconds
cpu usage
1.00003
user time
0.813604
system time
0.186428
max virtual memory
809136.0
max residence set size
150492.0
stage attributes
key
value
starexec-result
YES
output
0.95/0.99 YES 0.95/0.99 0.95/0.99 Solver Timeout: 4 0.95/0.99 Global Timeout: 300 0.95/0.99 No parsing errors! 0.95/0.99 Init Location: 0 0.95/0.99 Transitions: 0.95/0.99 <l0, l28, true> 0.95/0.99 <l1, l2, ((1 + n^0) <= (0 + i^0))> 0.95/0.99 <l1, l3, ((0 + i^0) <= (0 + n^0)) /\ (undef30 = undef30), par{maxarg1^0 -> (0 + scale^0), maxarg2^0 -> (0 + undef30), tmp^0 -> undef30}> 0.95/0.99 <l4, l1, true> 0.95/0.99 <l5, l6, true> 0.95/0.99 <l7, l5, true> 0.95/0.99 <l7, l5, true> 0.95/0.99 <l7, l5, true> 0.95/0.99 <l8, l9, ((1 + n^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}> 0.95/0.99 <l8, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> 0.95/0.99 <l10, l8, true> 0.95/0.99 <l11, l10, ((1 + n^0) <= (0 + i^0)) /\ (undef191 = undef191), par{tau^0 -> undef191}> 0.95/0.99 <l11, l12, ((0 + i^0) <= (0 + n^0)) /\ (undef208 = undef208), par{i^0 -> (1 + i^0), sum^0 -> undef208}> 0.95/0.99 <l12, l11, true> 0.95/0.99 <l13, l14, ((1 + n^0) <= (0 + j^0))> 0.95/0.99 <l13, l12, ((0 + j^0) <= (0 + n^0))> 0.95/0.99 <l9, l13, true> 0.95/0.99 <l15, l7, ((0 + n^0) <= (0 + k^0))> 0.95/0.99 <l15, l4, ((1 + k^0) <= (0 + n^0)), par{scale^0 -> 0}> 0.95/0.99 <l16, l9, true> 0.95/0.99 <l17, l16, (undef359 = undef359) /\ (undef360 = undef360), par{sigma^0 -> (0 + (~(1) * undef360)), tmp___4^0 -> undef359, tmp___5^0 -> undef360}> 0.95/0.99 <l17, l16, (undef375 = undef375) /\ (undef376 = undef376), par{sigma^0 -> (0 + undef376), tmp___2^0 -> undef375, tmp___3^0 -> undef376}> 0.95/0.99 <l18, l15, true> 0.95/0.99 <l19, l20, (undef410 = undef410), par{tmp___1^0 -> undef410}> 0.95/0.99 <l20, l21, true, par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + tmp___1^0)}> 0.95/0.99 <l22, l19, (1 <= (0 + sqrarg^0))> 0.95/0.99 <l22, l19, ((1 + sqrarg^0) <= 0)> 0.95/0.99 <l22, l20, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___1^0 -> 0}> 0.95/0.99 <l23, l17, ((1 + n^0) <= (0 + i^0))> 0.95/0.99 <l23, l22, ((0 + i^0) <= (0 + n^0)) /\ (undef513 = undef513), par{sqrarg^0 -> undef513}> 0.95/0.99 <l21, l23, true> 0.95/0.99 <l24, l21, ((1 + n^0) <= (0 + i^0))> 0.95/0.99 <l24, l25, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> 0.95/0.99 <l25, l24, true> 0.95/0.99 <l14, l18, true, par{k^0 -> (1 + k^0)}> 0.95/0.99 <l26, l18, (2 <= (0 + n^0))> 0.95/0.99 <l2, l25, (1 <= (0 + scale^0))> 0.95/0.99 <l2, l25, ((1 + scale^0) <= 0)> 0.95/0.99 <l2, l14, ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)), par{tmp___0^0 -> 0}> 0.95/0.99 <l27, l4, true, par{i^0 -> (1 + i^0)}> 0.95/0.99 <l3, l27, ((0 + maxarg1^0) <= (0 + maxarg2^0)), par{scale^0 -> (0 + maxarg2^0)}> 0.95/0.99 <l3, l27, ((1 + maxarg2^0) <= (0 + maxarg1^0)), par{scale^0 -> (0 + maxarg1^0)}> 0.95/0.99 <l28, l26, true> 0.95/0.99 0.95/0.99 Fresh variables: 0.95/0.99 undef30, undef191, undef208, undef359, undef360, undef375, undef376, undef410, undef513, 0.95/0.99 0.95/0.99 Undef variables: 0.95/0.99 undef30, undef191, undef208, undef359, undef360, undef375, undef376, undef410, undef513, 0.95/0.99 0.95/0.99 Abstraction variables: 0.95/0.99 0.95/0.99 Exit nodes: 0.95/0.99 0.95/0.99 Accepting locations: 0.95/0.99 0.95/0.99 Asserts: 0.95/0.99 0.95/0.99 Preprocessed LLVMGraph 0.95/0.99 Init Location: 0 0.95/0.99 Transitions: 0.95/0.99 <l0, l6, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))> 0.95/0.99 <l0, l6, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))> 0.95/0.99 <l0, l6, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))> 0.95/0.99 <l0, l4, (2 <= (0 + n^0)) /\ ((1 + k^0) <= (0 + n^0)), par{scale^0 -> 0}> 0.95/0.99 <l4, l25, ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + scale^0))> 0.95/0.99 <l4, l25, ((1 + n^0) <= (0 + i^0)) /\ ((1 + scale^0) <= 0)> 0.95/0.99 <l4, l6, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 0.95/0.99 <l4, l6, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 0.95/0.99 <l4, l6, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 0.95/0.99 <l4, l4, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}> 0.95/0.99 <l4, l4, ((0 + i^0) <= (0 + n^0)) /\ (undef30 = undef30) /\ ((0 + (0 + scale^0)) <= (0 + (0 + undef30))), par{i^0 -> (1 + i^0), scale^0 -> (0 + (0 + undef30))}> 0.95/0.99 <l4, l4, ((0 + i^0) <= (0 + n^0)) /\ (undef30 = undef30) /\ ((1 + (0 + undef30)) <= (0 + (0 + scale^0))), par{i^0 -> (1 + i^0), scale^0 -> (0 + (0 + scale^0))}> 0.95/0.99 <l10, l6, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}> 0.95/0.99 <l10, l6, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}> 0.95/0.99 <l10, l6, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}> 0.95/0.99 <l10, l4, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0), scale^0 -> 0}> 0.95/0.99 <l10, l12, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0)}> 0.95/0.99 <l10, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> 0.95/0.99 <l12, l10, ((1 + n^0) <= (0 + i^0)) /\ (undef191 = undef191)> 0.95/0.99 <l12, l12, ((0 + i^0) <= (0 + n^0)) /\ (undef208 = undef208), par{i^0 -> (1 + i^0), sum^0 -> undef208}> 0.95/0.99 <l21, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef359 = undef359) /\ (undef360 = undef360) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 0.95/0.99 <l21, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef359 = undef359) /\ (undef360 = undef360) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 0.95/0.99 <l21, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef359 = undef359) /\ (undef360 = undef360) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 0.95/0.99 <l21, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef359 = undef359) /\ (undef360 = undef360) /\ ((1 + n^0) <= (0 + j^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}> 0.95/0.99 <l21, l12, ((1 + n^0) <= (0 + i^0)) /\ (undef359 = undef359) /\ (undef360 = undef360) /\ ((0 + j^0) <= (0 + n^0))> 0.95/0.99 <l21, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef375 = undef375) /\ (undef376 = undef376) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 0.95/0.99 <l21, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef375 = undef375) /\ (undef376 = undef376) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 0.95/0.99 <l21, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef375 = undef375) /\ (undef376 = undef376) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 0.95/0.99 <l21, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef375 = undef375) /\ (undef376 = undef376) /\ ((1 + n^0) <= (0 + j^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}> 0.95/0.99 <l21, l12, ((1 + n^0) <= (0 + i^0)) /\ (undef375 = undef375) /\ (undef376 = undef376) /\ ((0 + j^0) <= (0 + n^0))> 0.95/0.99 <l21, l21, ((0 + i^0) <= (0 + n^0)) /\ (undef513 = undef513) /\ (1 <= (0 + undef513)) /\ (undef410 = undef410), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef410)}> 0.95/0.99 <l21, l21, ((0 + i^0) <= (0 + n^0)) /\ (undef513 = undef513) /\ ((1 + undef513) <= 0) /\ (undef410 = undef410), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef410)}>
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