I tried to find an exapmle for the question stated in the title, but to no avail:
An acyclic flow network <G,c,s,t>, where each edge has capacity 1, and where we can construct:
1) A maximum flow of size 10.
2) A blocking flow of size 2.
Just to make sure: a blocking flow means that every s-t route in G contains some edge e such that f(e) = c(e)?
Thanks in advance :)