If it's going to try every combination, I wonder if there's a way to try all the quickest/shortest travel combinations first.
Brute force attack but it doesn't have to try EVERY combination. For example, for some padlocks there are certain restrictions due to the mechanical implementation that do cause some limits to the range of the 2nd digit (based on the 1st) and 3rd (based on the 1st and/or 2nd).
There is also a tolerance level which means that if you are "close" you may be able to round. So you may not need to try 1, 2, 3, 4, 5, ... you may be able to effectively do 1, 3, 5, etc... or 2, 4, 6, depending on the mechanical design.
I don't know with these ultra-expensive high-end combination safes, maybe there are no restrictions and every possible combination is possible (earlier digits don't predetermine or restrict allowable subsequent digits) and tolerance may be very high so that it has to be EXACTLY on the tick.
NOTE also that if you have physical access to a safe like this for such a long time to use this device, then you could probably cut your way into it faster... i.e. REAL Brute Force.
This is not something you sneak into the corporate boss office at night and expect to open in a few hours before morning staff shows up.