Dvořák and Kawarabayashi [European Journal of Combinatorics, 2017] asked, what is the largest chromatic number attainable by a graph of treewidth $t$ with no $K_r$ subgraph? In this paper, we consider the fractional version of this question. We prove that if $G$ has treewidth $t$ and clique number $2 \leq ω\leq t$, then $χ_f(G) \leq t + \frac{ω- 1}{t}$, and we show that this bound is tight for $ω= t$. We also show that for each value $0 < c < \frac{1}{2}$, there exists a graph $G$ of a large treewidth $t$ and clique number $ω= \lfloor (1 - c)t \rfloor$ satisfying $χ_f(G) \geq t + 1 + \frac{1}{2}\log(1-2c) + o(1)$, which is approximately equal to the upper bound for small values $c$.