$BENCH_HOME/bin/storm-pomdp --prism $BENCH_HOME/models/obstcl/obstcl.prism --prop $BENCH_HOME/models/obstcl/obstcl.props rbrmax2 -const B1=25,B2=7 --timemem --statistics --revised --reward-aware --unfold-reward-bound --belief-exploration discretize --resolution 14 --triangulationmode static
Storm-pomdp. Unfolds cost bounds, cost aware, with discretization and resolution 14
Storm-POMDP 1.9.1 (dev)
Date: Mon Feb 10 14:16:43 2025
Command line arguments: --prism $BENCH_HOME/models/obstcl/obstcl.prism --prop $BENCH_HOME/models/obstcl/obstcl.props rbrmax2 -const 'B1=25,B2=7' --timemem --statistics --revised --reward-aware --unfold-reward-bound --belief-exploration discretize --resolution 14 --triangulationmode static
Current working directory: $BENCH_HOME/experiments64gb
Time for model input parsing: 0.002s.
Time for model construction: 0.008s.
--------------------------------------------------------------
Model type: POMDP (sparse)
States: 25
Transitions: 115
Choices: 80
Observations: 10
Reward Models: steps, energy
State Labels: 3 labels
* deadlock -> 0 item(s)
* init -> 1 item(s)
* goal -> 1 item(s)
Choice Labels: 4 labels
* north -> 20 item(s)
* east -> 20 item(s)
* south -> 20 item(s)
* west -> 20 item(s)
--------------------------------------------------------------
Analyzing property 'Pmax=? [true U^{rew{"energy"}<=25 , rew{"steps"}<=7 }"goal"]'
Perform explicit unfolding of reward bounds.
Extend observation function to become reward aware.
bounded reachability processing done. POMDP Information:
--------------------------------------------------------------
Model type: POMDP (sparse)
States: 1081
Transitions: 5358
Choices: 3597
Observations: 23
Reward Models: energy, steps
State Labels: 5 labels
* goal -> 30 item(s)
* dim0_active -> 1039 item(s)
* dim1_active -> 1039 item(s)
* deadlock -> 0 item(s)
* init -> 1 item(s)
Choice Labels: 4 labels
* west -> 836 item(s)
* south -> 895 item(s)
* north -> 895 item(s)
* east -> 971 item(s)
--------------------------------------------------------------
Transformed formula: Pmax=? [((true & "dim0_active") & "dim1_active") U (("goal" & "dim0_active") & "dim1_active")]
Time for pre-processing: 0.001s.
Exploring the belief MDP...
Exploring the belief space...
Constructing the belief MDP...
--------------------------------------------------------------
Model type: MDP (sparse)
States: 32738
Transitions: 470015
Choices: 126916
Reward Models: none
State Labels: 3 labels
* target -> 1 item(s)
* init -> 1 item(s)
* bottom -> 1 item(s)
Choice Labels: none
--------------------------------------------------------------
Time for exploring beliefs: 0.217s.
Time for building the belief MDP: 0.013s.
Time for analyzing the belief MDP: 0.005s.
##### POMDP Approximation Statistics ######
# Input model:
--------------------------------------------------------------
Model type: POMDP (sparse)
States: 1081
Transitions: 5296
Choices: 3597
Observations: 25
Reward Models: energy, steps
State Labels: 5 labels
* goal -> 30 item(s)
* dim0_active -> 1039 item(s)
* dim1_active -> 1039 item(s)
* deadlock -> 0 item(s)
* init -> 1 item(s)
Choice Labels: 4 labels
* west -> 836 item(s)
* south -> 895 item(s)
* north -> 895 item(s)
* east -> 971 item(s)
--------------------------------------------------------------
# Max. Number of states with same observation: 299
# Pre-computations detected that the belief MDP is finite.
# Total check time: 0.251s
##########################################
Result: ≤ 0.8701171875
Time for POMDP analysis: 0.251s.
Performance statistics:
* peak memory usage: 71MB
* CPU time: 0.258s
* wallclock time: 0.266s
############################## Notes ##############################
Storm-pomdp. Unfolds cost bounds, cost aware, with discretization and resolution 14