WORST_CASE(?, O(n^1)) dblS0S0SSSS0saveSxdbl0savexsave00dbl0yyS100dbl2save112.110012S000000dbl0001save002015S154S143S133S131016save107dbl1672012dbl16770170172AProVEAProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Statistics for single proof: 100.00 % (1 real / 0 unknown / 0 assumptions / 1 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe