# storm.unfd28

Benchmark

id: | main_walk_rbrmax1_N120-B180 (POMDP)

Invocation (unfd28)

    $BENCH_HOME/bin/storm-pomdp --prism $BENCH_HOME/models/walk/walk.prism --prop $BENCH_HOME/models/walk/walk.props rbrmax1 -const N=120,B1=80 --timemem --statistics --revised --unfold-reward-bound --belief-exploration discretize --resolution 28 --triangulationmode static

Storm-pomdp. Unfolds cost bounds, not cost aware, with discretization and resolution 28
Execution

Walltime: | 1316.7468719482422s
Return code: | -9
Note(s): | Storm-pomdp. Unfolds cost bounds, not cost aware, with discretization and resolution 28

Log

    Storm-POMDP 1.9.1 (dev)

    Date: Mon Feb 10 15:04:02 2025
    Command line arguments: --prism $BENCH_HOME/models/walk/walk.prism --prop $BENCH_HOME/models/walk/walk.props rbrmax1 -const 'N=120,B1=80' --timemem --statistics --revised --unfold-reward-bound --belief-exploration discretize --resolution 28 --triangulationmode static
    Current working directory: $BENCH_HOME/experiments64gb

    Time for model input parsing: 0.001s.

    Time for model construction: 0.008s.

    --------------------------------------------------------------
    Model type: 	POMDP (sparse)
    States: 	244
    Transitions: 	968
    Choices: 	607
    Observations: 	124
    Reward Models:  obsCost
    State Labels: 	3 labels
       * deadlock -> 0 item(s)
       * init -> 1 item(s)
       * goal -> 1 item(s)
    Choice Labels: 	3 labels
       * observe -> 121 item(s)
       * move -> 242 item(s)
       * stop -> 244 item(s)
    --------------------------------------------------------------
    Analyzing property 'Pmax=? [true Urew{"obsCost"}<=80 "goal"]'
    Perform explicit unfolding of reward bounds.
    bounded reachability processing done. POMDP Information:
    --------------------------------------------------------------
    Model type: 	POMDP (sparse)
    States: 	19887
    Transitions: 	79014
    Choices: 	49532
    Observations: 	124
    Reward Models:  none
    State Labels: 	4 labels
       * dim0_active -> 19643 item(s)
       * goal -> 82 item(s)
       * deadlock -> 0 item(s)
       * init -> 1 item(s)
    Choice Labels: 	3 labels
       * observe -> 9922 item(s)
       * stop -> 19887 item(s)
       * move -> 19723 item(s)
    --------------------------------------------------------------
    Transformed formula: Pmax=? [(true & "dim0_active") U ("goal" & "dim0_active")]
    Time for pre-processing: 0.014s.
    Exploring the belief MDP...
    Exploring the belief space...
    Constructing the belief MDP...

    ############################## Notes ##############################
    Storm-pomdp. Unfolds cost bounds, not cost aware, with discretization and resolution 28