diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus2_3_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus2_3_2.storm.output deleted file mode 100644 index 6e5b60082..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus2_3_2.storm.output +++ /dev/null @@ -1,93 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s consensus/consensus2_3_2.nm -prop consensus/consensus2_3_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 691 -Transitions: 1190 -Choices: 1190 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 363 state(s) - * one_proc_err -> 76 state(s) -choice labels: no -Size in memory: 48 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.8916673903 [G "one_coin_ok"]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F "one_proc_err"], P>=0.8916673903 [G "one_coin_ok"]) - -Objectives: --------------------------------------------------------------- - Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.891667 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.1083326097, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 691 -Transitions: 1190 -Choices: 1190 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 363 state(s) - * one_proc_err -> 76 state(s) -choice labels: no -Size in memory: 48 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 691 -Transitions: 1190 -Choices: 1190 -Reward Models: objective2, objective1 -Labels: 4 - * one_proc_err -> 76 state(s) - * one_coin_ok -> 363 state(s) - * prob1 -> 0 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 47 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.001 - Value Iterations: 0.008 - Postprocessing: 0 - Combined: 0.01 - -Performed Refinement Steps: 3 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.1083326097] -===== Statistics ============================== -peak memory usage: 190MB -CPU time: 0.068 seconds -=============================================== -OVERALL_TIME; 0.145 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus2_4_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus2_4_2.storm.output deleted file mode 100644 index 0b2c0fa45..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus2_4_2.storm.output +++ /dev/null @@ -1,93 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s consensus/consensus2_4_2.nm -prop consensus/consensus2_4_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 1517 -Transitions: 2616 -Choices: 2616 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 861 state(s) - * one_proc_err -> 152 state(s) -choice labels: no -Size in memory: 96 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.9882640457 [G "one_coin_ok"]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F "one_proc_err"], P>=0.9882640457 [G "one_coin_ok"]) - -Objectives: --------------------------------------------------------------- - Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.988264 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.0117359543, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 1517 -Transitions: 2616 -Choices: 2616 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 861 state(s) - * one_proc_err -> 152 state(s) -choice labels: no -Size in memory: 96 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 1517 -Transitions: 2616 -Choices: 2616 -Reward Models: objective2, objective1 -Labels: 4 - * one_proc_err -> 152 state(s) - * one_coin_ok -> 861 state(s) - * prob1 -> 0 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 103 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.001 - Value Iterations: 0.01 - Postprocessing: 0 - Combined: 0.012 - -Performed Refinement Steps: 3 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.0117359543] -===== Statistics ============================== -peak memory usage: 191MB -CPU time: 0.089 seconds -=============================================== -OVERALL_TIME; 0.159 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus2_5_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus2_5_2.storm.output deleted file mode 100644 index e10f7114b..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus2_5_2.storm.output +++ /dev/null @@ -1,94 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s consensus/consensus2_5_2.nm -prop consensus/consensus2_5_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 3169 -Transitions: 5468 -Choices: 5468 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 1857 state(s) - * one_proc_err -> 304 state(s) -choice labels: no -Size in memory: 193 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.9987286134 [G "one_coin_ok"]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F "one_proc_err"], P>=0.9987286134 [G "one_coin_ok"]) - -Objectives: --------------------------------------------------------------- - Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.998729 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.0012713866, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 3169 -Transitions: 5468 -Choices: 5468 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 1857 state(s) - * one_proc_err -> 304 state(s) -choice labels: no -Size in memory: 193 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 3169 -Transitions: 5468 -Choices: 5468 -Reward Models: objective2, objective1 -Labels: 4 - * one_proc_err -> 304 state(s) - * one_coin_ok -> 1857 state(s) - * prob1 -> 0 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 215 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- -WARN (SparseMultiObjectiveHelper.cpp:238): Numerical issues: The overapproximation would not contain the underapproximation. Hence, a halfspace is shifted by 2.51215e-15. - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.003 - Value Iterations: 0.018 - Postprocessing: 0 - Combined: 0.022 - -Performed Refinement Steps: 3 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.0012713866] -===== Statistics ============================== -peak memory usage: 192MB -CPU time: 0.128 seconds -=============================================== -OVERALL_TIME; 0.2 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus3_3_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus3_3_2.storm.output deleted file mode 100644 index 60568354e..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus3_3_2.storm.output +++ /dev/null @@ -1,93 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s consensus/consensus3_3_2.nm -prop consensus/consensus3_3_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 17455 -Transitions: 46702 -Choices: 46702 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 5523 state(s) - * one_proc_err -> 3360 state(s) -choice labels: no -Size in memory: 1542 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.7709112445 [G "one_coin_ok"]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F "one_proc_err"], P>=0.7709112445 [G "one_coin_ok"]) - -Objectives: --------------------------------------------------------------- - Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.770911 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.2290887555, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 17455 -Transitions: 46702 -Choices: 46702 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 5523 state(s) - * one_proc_err -> 3360 state(s) -choice labels: no -Size in memory: 1542 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 17455 -Transitions: 46702 -Choices: 46702 -Reward Models: objective2, objective1 -Labels: 4 - * one_proc_err -> 3360 state(s) - * one_coin_ok -> 5523 state(s) - * prob1 -> 0 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 1833 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.018 - Value Iterations: 0.093 - Postprocessing: 0 - Combined: 0.112 - -Performed Refinement Steps: 3 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.2290887555] -===== Statistics ============================== -peak memory usage: 200MB -CPU time: 0.508 seconds -=============================================== -OVERALL_TIME; 0.604 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus3_4_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus3_4_2.storm.output deleted file mode 100644 index 3fa3e3b08..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus3_4_2.storm.output +++ /dev/null @@ -1,93 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s consensus/consensus3_4_2.nm -prop consensus/consensus3_4_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 61017 -Transitions: 164012 -Choices: 164012 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 24361 state(s) - * one_proc_err -> 9648 state(s) -choice labels: no -Size in memory: 6166 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.9475183421 [G "one_coin_ok"]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F "one_proc_err"], P>=0.9475183421 [G "one_coin_ok"]) - -Objectives: --------------------------------------------------------------- - Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.947518 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.0524816579, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 61017 -Transitions: 164012 -Choices: 164012 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 24361 state(s) - * one_proc_err -> 9648 state(s) -choice labels: no -Size in memory: 6166 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 61017 -Transitions: 164012 -Choices: 164012 -Reward Models: objective2, objective1 -Labels: 4 - * one_proc_err -> 9648 state(s) - * one_coin_ok -> 24361 state(s) - * prob1 -> 0 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 6436 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.074 - Value Iterations: 0.301 - Postprocessing: 0 - Combined: 0.376 - -Performed Refinement Steps: 3 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.0524816579] -===== Statistics ============================== -peak memory usage: 226MB -CPU time: 1.795 seconds -=============================================== -OVERALL_TIME; 1.93 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus3_5_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus3_5_2.storm.output deleted file mode 100644 index 57eda7677..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/1_consensus3_5_2.storm.output +++ /dev/null @@ -1,93 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s consensus/consensus3_5_2.nm -prop consensus/consensus3_5_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 181129 -Transitions: 487456 -Choices: 487456 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 82233 state(s) - * one_proc_err -> 25152 state(s) -choice labels: no -Size in memory: 12354 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.9879770423 [G "one_coin_ok"]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F "one_proc_err"], P>=0.9879770423 [G "one_coin_ok"]) - -Objectives: --------------------------------------------------------------- - Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.987977 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.0120229577, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 181129 -Transitions: 487456 -Choices: 487456 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * one_coin_ok -> 82233 state(s) - * one_proc_err -> 25152 state(s) -choice labels: no -Size in memory: 12354 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 181129 -Transitions: 487456 -Choices: 487456 -Reward Models: objective2, objective1 -Labels: 4 - * one_proc_err -> 25152 state(s) - * one_coin_ok -> 82233 state(s) - * prob1 -> 0 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 19129 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.228 - Value Iterations: 0.92 - Postprocessing: 0 - Combined: 1.151 - -Performed Refinement Steps: 3 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.0120229577] -===== Statistics ============================== -peak memory usage: 269MB -CPU time: 5.659 seconds -=============================================== -OVERALL_TIME; 5.914 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/2_zeroconf4.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/2_zeroconf4.storm.output deleted file mode 100644 index ff900a57f..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/2_zeroconf4.storm.output +++ /dev/null @@ -1,93 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s zeroconf/zeroconf4.nm -prop zeroconf/zeroconf4_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 5449 -Transitions: 17152 -Choices: 16487 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 4998 state(s) - * ((l = 4) & (ip = 1)) -> 24 state(s) -choice labels: no -Size in memory: 770 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.993141 [G (error = 0)]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.993141 [G (error = 0)]) - -Objectives: --------------------------------------------------------------- -Pmax=? [F ((l = 4) & (ip = 1))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.993141 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.006859, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 5449 -Transitions: 17152 -Choices: 16487 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 4998 state(s) - * ((l = 4) & (ip = 1)) -> 24 state(s) -choice labels: no -Size in memory: 770 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 5449 -Transitions: 17152 -Choices: 16487 -Reward Models: objective2, objective1 -Labels: 4 - * prob1 -> 0 state(s) - * init -> 1 state(s) - * (error = 0) -> 4998 state(s) - * ((l = 4) & (ip = 1)) -> 24 state(s) -choice labels: no -Size in memory: 657 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.006 - Value Iterations: 0.051 - Postprocessing: 0 - Combined: 0.058 - -Performed Refinement Steps: 2 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.0003075787402] -===== Statistics ============================== -peak memory usage: 194MB -CPU time: 0.210 seconds -=============================================== -OVERALL_TIME; 0.28 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/2_zeroconf6.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/2_zeroconf6.storm.output deleted file mode 100644 index 6d23481a9..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/2_zeroconf6.storm.output +++ /dev/null @@ -1,93 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s zeroconf/zeroconf6.nm -prop zeroconf/zeroconf6_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 10543 -Transitions: 32003 -Choices: 31008 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 9960 state(s) - * ((l = 4) & (ip = 1)) -> 36 state(s) -choice labels: no -Size in memory: 772 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.9997523901 [G (error = 0)]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.9997523901 [G (error = 0)]) - -Objectives: --------------------------------------------------------------- -Pmax=? [F ((l = 4) & (ip = 1))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.999752 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.0002476099, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 10543 -Transitions: 32003 -Choices: 31008 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 9960 state(s) - * ((l = 4) & (ip = 1)) -> 36 state(s) -choice labels: no -Size in memory: 772 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 10543 -Transitions: 32003 -Choices: 31008 -Reward Models: objective2, objective1 -Labels: 4 - * prob1 -> 0 state(s) - * init -> 1 state(s) - * (error = 0) -> 9960 state(s) - * ((l = 4) & (ip = 1)) -> 36 state(s) -choice labels: no -Size in memory: 1232 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.011 - Value Iterations: 0.121 - Postprocessing: 0 - Combined: 0.132 - -Performed Refinement Steps: 2 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.0002476099] -===== Statistics ============================== -peak memory usage: 201MB -CPU time: 0.373 seconds -=============================================== -OVERALL_TIME; 0.491 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/2_zeroconf8.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/2_zeroconf8.storm.output deleted file mode 100644 index 1c519a79d..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/2_zeroconf8.storm.output +++ /dev/null @@ -1,93 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s zeroconf/zeroconf8.nm -prop zeroconf/zeroconf8_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 17221 -Transitions: 52163 -Choices: 50838 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 16506 state(s) - * ((l = 4) & (ip = 1)) -> 48 state(s) -choice labels: no -Size in memory: 1542 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.9999910613 [G (error = 0)]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.9999910613 [G (error = 0)]) - -Objectives: --------------------------------------------------------------- -Pmax=? [F ((l = 4) & (ip = 1))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.999991 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-8.9387e-06, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 17221 -Transitions: 52163 -Choices: 50838 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 16506 state(s) - * ((l = 4) & (ip = 1)) -> 48 state(s) -choice labels: no -Size in memory: 1542 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 17221 -Transitions: 52163 -Choices: 50838 -Reward Models: objective2, objective1 -Labels: 4 - * prob1 -> 0 state(s) - * init -> 1 state(s) - * (error = 0) -> 16506 state(s) - * ((l = 4) & (ip = 1)) -> 48 state(s) -choice labels: no -Size in memory: 2015 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.018 - Value Iterations: 0.538 - Postprocessing: 0 - Combined: 0.556 - -Performed Refinement Steps: 3 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [9.030555281e-06] -===== Statistics ============================== -peak memory usage: 201MB -CPU time: 0.906 seconds -=============================================== -OVERALL_TIME; 1.017 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/3_zeroconf-tb2_14.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/3_zeroconf-tb2_14.storm.output deleted file mode 100644 index b360f5e67..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/3_zeroconf-tb2_14.storm.output +++ /dev/null @@ -1,93 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s zeroconf-tb/zeroconf-tb2_14.nm -prop zeroconf-tb/zeroconf-tb2_14_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 29572 -Transitions: 92605 -Choices: 86585 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 24820 state(s) - * (time_error = 1) -> 1914 state(s) -choice labels: no -Size in memory: 3083 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F (time_error = 1)], P>=0.81 [G (error = 0)]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F (time_error = 1)], P>=0.81 [G (error = 0)]) - -Objectives: --------------------------------------------------------------- - Pmax=? [F (time_error = 1)] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.81 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.19, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 29572 -Transitions: 92605 -Choices: 86585 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 24820 state(s) - * (time_error = 1) -> 1914 state(s) -choice labels: no -Size in memory: 3083 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 29572 -Transitions: 92605 -Choices: 86585 -Reward Models: objective2, objective1 -Labels: 4 - * prob1 -> 0 state(s) - * init -> 1 state(s) - * (time_error = 1) -> 1914 state(s) - * (error = 0) -> 24820 state(s) -choice labels: no -Size in memory: 3491 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.031 - Value Iterations: 0.393 - Postprocessing: 0 - Combined: 0.425 - -Performed Refinement Steps: 2 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [8.059350372e-08] -===== Statistics ============================== -peak memory usage: 208MB -CPU time: 1.043 seconds -=============================================== -OVERALL_TIME; 1.145 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/3_zeroconf-tb4_10.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/3_zeroconf-tb4_10.storm.output deleted file mode 100644 index 3ed925c02..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/3_zeroconf-tb4_10.storm.output +++ /dev/null @@ -1,93 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s zeroconf-tb/zeroconf-tb4_10.nm -prop zeroconf-tb/zeroconf-tb4_10_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 19670 -Transitions: 63353 -Choices: 59358 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 18112 state(s) - * (time_error = 1) -> 5420 state(s) -choice labels: no -Size in memory: 1543 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F (time_error = 1)], P>=0.993141 [G (error = 0)]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F (time_error = 1)], P>=0.993141 [G (error = 0)]) - -Objectives: --------------------------------------------------------------- - Pmax=? [F (time_error = 1)] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.993141 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.006859, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 19670 -Transitions: 63353 -Choices: 59358 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 18112 state(s) - * (time_error = 1) -> 5420 state(s) -choice labels: no -Size in memory: 1543 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 19670 -Transitions: 63353 -Choices: 59358 -Reward Models: objective2, objective1 -Labels: 4 - * prob1 -> 0 state(s) - * init -> 1 state(s) - * (time_error = 1) -> 5420 state(s) - * (error = 0) -> 18112 state(s) -choice labels: no -Size in memory: 2390 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.022 - Value Iterations: 0.344 - Postprocessing: 0 - Combined: 0.367 - -Performed Refinement Steps: 2 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.3335383858] -===== Statistics ============================== -peak memory usage: 203MB -CPU time: 0.776 seconds -=============================================== -OVERALL_TIME; 0.881 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/3_zeroconf-tb4_14.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/3_zeroconf-tb4_14.storm.output deleted file mode 100644 index a63673227..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/3_zeroconf-tb4_14.storm.output +++ /dev/null @@ -1,93 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s zeroconf-tb/zeroconf-tb4_14.nm -prop zeroconf-tb/zeroconf-tb4_14_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 42968 -Transitions: 138025 -Choices: 130735 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 40236 state(s) - * (time_error = 1) -> 5412 state(s) -choice labels: no -Size in memory: 5135 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F (time_error = 1)], P>=0.993141 [G (error = 0)]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F (time_error = 1)], P>=0.993141 [G (error = 0)]) - -Objectives: --------------------------------------------------------------- - Pmax=? [F (time_error = 1)] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) - P>=0.993141 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.006859, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 42968 -Transitions: 138025 -Choices: 130735 -Reward Models: none -Labels: 3 - * init -> 1 state(s) - * (error = 0) -> 40236 state(s) - * (time_error = 1) -> 5412 state(s) -choice labels: no -Size in memory: 5135 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 42968 -Transitions: 138025 -Choices: 130735 -Reward Models: objective2, objective1 -Labels: 4 - * prob1 -> 0 state(s) - * init -> 1 state(s) - * (time_error = 1) -> 5412 state(s) - * (error = 0) -> 40236 state(s) -choice labels: no -Size in memory: 5242 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.055 - Value Iterations: 1.341 - Postprocessing: 0 - Combined: 1.397 - -Performed Refinement Steps: 2 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.0003075787402] -===== Statistics ============================== -peak memory usage: 219MB -CPU time: 2.239 seconds -=============================================== -OVERALL_TIME; 2.378 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/4_team2obj_3.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/4_team2obj_3.storm.output deleted file mode 100644 index 4d67911ac..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/4_team2obj_3.storm.output +++ /dev/null @@ -1,90 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s team/team2obj_3.nm -prop team/team2obj_3_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 12475 -Transitions: 15228 -Choices: 14935 -Reward Models: w_1_total -Labels: 2 - * init -> 1 state(s) - * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) -choice labels: no -Size in memory: 503 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))], R[exp]{"w_1_total"}>=2.210204082 [C]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))], R[exp]{"w_1_total"}>=2.210204082 [C]) - -Objectives: --------------------------------------------------------------- -Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) -R[exp]{"w_1_total"}>=2.2102 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.210204082, intern reward model: objective2 (positive), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 12475 -Transitions: 15228 -Choices: 14935 -Reward Models: w_1_total -Labels: 2 - * init -> 1 state(s) - * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) -choice labels: no -Size in memory: 503 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 12475 -Transitions: 15228 -Choices: 14935 -Reward Models: objective1, objective2 -Labels: 3 - * prob1 -> 0 state(s) - * init -> 1 state(s) - * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) -choice labels: no -Size in memory: 592 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.057 - Value Iterations: 0.089 - Postprocessing: 0 - Combined: 0.147 - -Performed Refinement Steps: 5 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.8714285711] -===== Statistics ============================== -peak memory usage: 201MB -CPU time: 0.355 seconds -=============================================== -OVERALL_TIME; 0.435 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/4_team2obj_4.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/4_team2obj_4.storm.output deleted file mode 100644 index dd74109b4..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/4_team2obj_4.storm.output +++ /dev/null @@ -1,90 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s team/team2obj_4.nm -prop team/team2obj_4_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 96665 -Transitions: 116464 -Choices: 115289 -Reward Models: w_1_total -Labels: 2 - * init -> 1 state(s) - * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) -choice labels: no -Size in memory: 3996 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))], R[exp]{"w_1_total"}>=2.423469388 [C]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))], R[exp]{"w_1_total"}>=2.423469388 [C]) - -Objectives: --------------------------------------------------------------- -Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) -R[exp]{"w_1_total"}>=2.42347 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.423469388, intern reward model: objective2 (positive), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 96665 -Transitions: 116464 -Choices: 115289 -Reward Models: w_1_total -Labels: 2 - * init -> 1 state(s) - * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) -choice labels: no -Size in memory: 3996 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 96665 -Transitions: 116464 -Choices: 115289 -Reward Models: objective1, objective2 -Labels: 3 - * prob1 -> 0 state(s) - * init -> 1 state(s) - * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) -choice labels: no -Size in memory: 4557 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 9.398 - Value Iterations: 0.094 - Postprocessing: 0 - Combined: 9.493 - -Performed Refinement Steps: 1 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [false] -===== Statistics ============================== -peak memory usage: 228MB -CPU time: 5.227 seconds -=============================================== -OVERALL_TIME; 10.955 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/4_team2obj_5.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/4_team2obj_5.storm.output deleted file mode 100644 index e28bb213c..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/4_team2obj_5.storm.output +++ /dev/null @@ -1,90 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s team/team2obj_5.nm -prop team/team2obj_5_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 907993 -Transitions: 1084752 -Choices: 1078873 -Reward Models: w_1_total -Labels: 2 - * init -> 1 state(s) - * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) -choice labels: no -Size in memory: 57802 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))], R[exp]{"w_1_total"}>=2.753061224 [C]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))], R[exp]{"w_1_total"}>=2.753061224 [C]) - -Objectives: --------------------------------------------------------------- -Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) -R[exp]{"w_1_total"}>=2.75306 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.753061224, intern reward model: objective2 (positive), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 907993 -Transitions: 1084752 -Choices: 1078873 -Reward Models: w_1_total -Labels: 2 - * init -> 1 state(s) - * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) -choice labels: no -Size in memory: 57802 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 907993 -Transitions: 1084752 -Choices: 1078873 -Reward Models: objective1, objective2 -Labels: 3 - * prob1 -> 0 state(s) - * init -> 1 state(s) - * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) -choice labels: no -Size in memory: 42568 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 1249.116 - Value Iterations: 0.788 - Postprocessing: 0 - Combined: 1249.918 - -Performed Refinement Steps: 1 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [false] -===== Statistics ============================== -peak memory usage: 451MB -CPU time: 516.276 seconds -=============================================== -OVERALL_TIME; 1265.216 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/5_team3obj_3.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/5_team3obj_3.storm.output deleted file mode 100644 index fabeb18cf..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/5_team3obj_3.storm.output +++ /dev/null @@ -1,94 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s team/team3obj_3.nm -prop team/team3obj_3_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 12475 -Transitions: 15228 -Choices: 14935 -Reward Models: w_1_total -Labels: 3 - * ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))))) -> 546 state(s) - * init -> 1 state(s) - * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) -choice labels: no -Size in memory: 505 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))], R[exp]{"w_1_total"}>=2.210204082 [C], P>=0.5 [F ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3)))))]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))], R[exp]{"w_1_total"}>=2.210204082 [C], P>=0.5 [F ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3)))))]) - -Objectives: --------------------------------------------------------------- -Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) -R[exp]{"w_1_total"}>=2.2102 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.210204082, intern reward model: objective2 (positive), step bound: none) -P>=0.5 [F ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3)))))] (toOrigVal: 1*x + 0, intern threshold:>= 0.5, intern reward model: objective3 (positive), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 12475 -Transitions: 15228 -Choices: 14935 -Reward Models: w_1_total -Labels: 3 - * ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))))) -> 546 state(s) - * init -> 1 state(s) - * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) -choice labels: no -Size in memory: 505 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 12475 -Transitions: 15228 -Choices: 14935 -Reward Models: objective3, objective2, objective1 -Labels: 4 - * ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))))) -> 546 state(s) - * prob1 -> 0 state(s) - * init -> 1 state(s) - * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) -choice labels: no -Size in memory: 711 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.065 - Value Iterations: 0.062 - Postprocessing: 0 - Combined: 0.128 - -Performed Refinement Steps: 3 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [0.7448979592] -===== Statistics ============================== -peak memory usage: 201MB -CPU time: 0.337 seconds -=============================================== -OVERALL_TIME; 0.415 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/5_team3obj_4.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/5_team3obj_4.storm.output deleted file mode 100644 index 926470044..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/5_team3obj_4.storm.output +++ /dev/null @@ -1,94 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s team/team3obj_4.nm -prop team/team3obj_4_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 96665 -Transitions: 116464 -Choices: 115289 -Reward Models: w_1_total -Labels: 3 - * init -> 1 state(s) - * ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))))) -> 4872 state(s) - * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) -choice labels: no -Size in memory: 4008 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))], R[exp]{"w_1_total"}>=2.423469388 [C], P>=0.5 [F ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3)))))]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))], R[exp]{"w_1_total"}>=2.423469388 [C], P>=0.5 [F ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3)))))]) - -Objectives: --------------------------------------------------------------- -Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) -R[exp]{"w_1_total"}>=2.42347 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.423469388, intern reward model: objective2 (positive), step bound: none) -P>=0.5 [F ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3)))))] (toOrigVal: 1*x + 0, intern threshold:>= 0.5, intern reward model: objective3 (positive), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 96665 -Transitions: 116464 -Choices: 115289 -Reward Models: w_1_total -Labels: 3 - * init -> 1 state(s) - * ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))))) -> 4872 state(s) - * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) -choice labels: no -Size in memory: 4008 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 96665 -Transitions: 116464 -Choices: 115289 -Reward Models: objective3, objective2, objective1 -Labels: 4 - * prob1 -> 0 state(s) - * init -> 1 state(s) - * ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))))) -> 4872 state(s) - * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) -choice labels: no -Size in memory: 5470 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 9.569 - Value Iterations: 0.101 - Postprocessing: 0 - Combined: 9.672 - -Performed Refinement Steps: 1 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [false] -===== Statistics ============================== -peak memory usage: 219MB -CPU time: 5.300 seconds -=============================================== -OVERALL_TIME; 11.147 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/5_team3obj_5.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/5_team3obj_5.storm.output deleted file mode 100644 index 2c004f728..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/5_team3obj_5.storm.output +++ /dev/null @@ -1,94 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s team/team3obj_5.nm -prop team/team3obj_5_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 907993 -Transitions: 1084752 -Choices: 1078873 -Reward Models: w_1_total -Labels: 3 - * init -> 1 state(s) - * ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3))))) -> 52200 state(s) - * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) -choice labels: no -Size in memory: 57913 kbytes --------------------------------------------------------------- - -Model checking property: multi(Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))], R[exp]{"w_1_total"}>=2.753061224 [C], P>=0.5 [F ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3)))))]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))], R[exp]{"w_1_total"}>=2.753061224 [C], P>=0.5 [F ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3)))))]) - -Objectives: --------------------------------------------------------------- -Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), step bound: none) -R[exp]{"w_1_total"}>=2.75306 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.753061224, intern reward model: objective2 (positive), step bound: none) -P>=0.5 [F ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3)))))] (toOrigVal: 1*x + 0, intern threshold:>= 0.5, intern reward model: objective3 (positive), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 907993 -Transitions: 1084752 -Choices: 1078873 -Reward Models: w_1_total -Labels: 3 - * init -> 1 state(s) - * ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3))))) -> 52200 state(s) - * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) -choice labels: no -Size in memory: 57913 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 907993 -Transitions: 1084752 -Choices: 1078873 -Reward Models: objective3, objective2, objective1 -Labels: 4 - * prob1 -> 0 state(s) - * init -> 1 state(s) - * ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3))))) -> 52200 state(s) - * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) -choice labels: no -Size in memory: 51107 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 1330.372 - Value Iterations: 1.032 - Postprocessing: 0 - Combined: 1331.422 - -Performed Refinement Steps: 1 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [false] -===== Statistics ============================== -peak memory usage: 420MB -CPU time: 521.419 seconds -=============================================== -OVERALL_TIME; 1347.627 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/6_scheduler05.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/6_scheduler05.storm.output deleted file mode 100644 index 93c61df6b..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/6_scheduler05.storm.output +++ /dev/null @@ -1,90 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s scheduler/scheduler05.nm -prop scheduler/scheduler05_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 31965 -Transitions: 60434 -Choices: 57965 -Reward Models: energy, time -Labels: 2 - * init -> 1 state(s) - * tasks_complete -> 390 state(s) -choice labels: no -Size in memory: 2449 kbytes --------------------------------------------------------------- - -Model checking property: multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) - -Objectives: --------------------------------------------------------------- -R[exp]{"time"}min=? [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), step bound: none) -R[exp]{"energy"}<=1.45 [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold:>=-1.45, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 31965 -Transitions: 60434 -Choices: 57965 -Reward Models: energy, time -Labels: 2 - * init -> 1 state(s) - * tasks_complete -> 390 state(s) -choice labels: no -Size in memory: 2449 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 31965 -Transitions: 60434 -Choices: 57965 -Reward Models: objective2, objective1 -Labels: 3 - * tasks_complete -> 390 state(s) - * prob1 -> 390 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 2314 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0.038 - Value Iterations: 0.443 - Postprocessing: 0 - Combined: 0.481 - -Performed Refinement Steps: 2 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [11.77777778] -===== Statistics ============================== -peak memory usage: 217MB -CPU time: 1.082 seconds -=============================================== -OVERALL_TIME; 1.194 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/6_scheduler25.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/6_scheduler25.storm.output deleted file mode 100644 index 008e0e276..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/6_scheduler25.storm.output +++ /dev/null @@ -1,90 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s scheduler/scheduler25.nm -prop scheduler/scheduler25_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 633735 -Transitions: 1179444 -Choices: 1168375 -Reward Models: energy, time -Labels: 2 - * init -> 1 state(s) - * tasks_complete -> 7930 state(s) -choice labels: no -Size in memory: 67562 kbytes --------------------------------------------------------------- - -Model checking property: multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) - -Objectives: --------------------------------------------------------------- -R[exp]{"time"}min=? [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), step bound: none) -R[exp]{"energy"}<=1.45 [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold:>=-1.45, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 633735 -Transitions: 1179444 -Choices: 1168375 -Reward Models: energy, time -Labels: 2 - * init -> 1 state(s) - * tasks_complete -> 7930 state(s) -choice labels: no -Size in memory: 67562 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 633735 -Transitions: 1179444 -Choices: 1168375 -Reward Models: objective2, objective1 -Labels: 3 - * tasks_complete -> 7930 state(s) - * prob1 -> 7930 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 46044 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 1.159 - Value Iterations: 26.03 - Postprocessing: 0 - Combined: 27.204 - -Performed Refinement Steps: 2 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [11.65925926] -===== Statistics ============================== -peak memory usage: 614MB -CPU time: 38.596 seconds -=============================================== -OVERALL_TIME; 39.67 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/6_scheduler50.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/6_scheduler50.storm.output deleted file mode 100644 index 28d5af620..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/6_scheduler50.storm.output +++ /dev/null @@ -1,90 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s scheduler/scheduler50.nm -prop scheduler/scheduler50_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 2457510 -Transitions: 4564394 -Choices: 4542575 -Reward Models: energy, time -Labels: 2 - * init -> 1 state(s) - * tasks_complete -> 30855 state(s) -choice labels: no -Size in memory: 268185 kbytes --------------------------------------------------------------- - -Model checking property: multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) - -Objectives: --------------------------------------------------------------- -R[exp]{"time"}min=? [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), step bound: none) -R[exp]{"energy"}<=1.45 [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold:>=-1.45, intern reward model: objective2 (negative), step bound: none) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 2457510 -Transitions: 4564394 -Choices: 4542575 -Reward Models: energy, time -Labels: 2 - * init -> 1 state(s) - * tasks_complete -> 30855 state(s) -choice labels: no -Size in memory: 268185 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 2457510 -Transitions: 4564394 -Choices: 4542575 -Reward Models: objective2, objective1 -Labels: 3 - * tasks_complete -> 30855 state(s) - * prob1 -> 30855 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 178685 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 6.056 - Value Iterations: 196.347 - Postprocessing: 0 - Combined: 202.461 - -Performed Refinement Steps: 2 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [11.64444444] -===== Statistics ============================== -peak memory usage: 1804MB -CPU time: 243.503 seconds -=============================================== -OVERALL_TIME; 249.802 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/7_dpm100.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/7_dpm100.storm.output deleted file mode 100644 index d935002d4..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/7_dpm100.storm.output +++ /dev/null @@ -1,87 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s dpm/dpm100.nm -prop dpm/dpm100_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 636 -Transitions: 2550 -Choices: 1860 -Reward Models: queue, power -Labels: 1 - * init -> 1 state(s) -choice labels: no -Size in memory: 109 kbytes --------------------------------------------------------------- - -Model checking property: multi(R[exp]{"power"}min=? [C<=100], R[exp]{"queue"}<=70 [C<=100]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(R[exp]{"power"}min=? [C<=100], R[exp]{"queue"}<=70 [C<=100]) - -Objectives: --------------------------------------------------------------- - R[exp]{"power"}min=? [C<=100] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), step bound: 100) - R[exp]{"queue"}<=70 [C<=100] (toOrigVal: -1*x + 0, intern threshold:>= -70, intern reward model: objective2 (negative), step bound: 100) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 636 -Transitions: 2550 -Choices: 1860 -Reward Models: queue, power -Labels: 1 - * init -> 1 state(s) -choice labels: no -Size in memory: 109 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 636 -Transitions: 2550 -Choices: 1860 -Reward Models: objective2, objective1 -Labels: 2 - * prob1 -> 0 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 83 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0 - Value Iterations: 0.059 - Postprocessing: 0 - Combined: 0.06 - -Performed Refinement Steps: 6 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [121.6128842] -===== Statistics ============================== -peak memory usage: 190MB -CPU time: 0.124 seconds -=============================================== -OVERALL_TIME; 0.19 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/7_dpm200.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/7_dpm200.storm.output deleted file mode 100644 index aa54c31c3..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/7_dpm200.storm.output +++ /dev/null @@ -1,87 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s dpm/dpm200.nm -prop dpm/dpm200_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 636 -Transitions: 2550 -Choices: 1860 -Reward Models: queue, power -Labels: 1 - * init -> 1 state(s) -choice labels: no -Size in memory: 109 kbytes --------------------------------------------------------------- - -Model checking property: multi(R[exp]{"power"}min=? [C<=200], R[exp]{"queue"}<=170 [C<=200]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(R[exp]{"power"}min=? [C<=200], R[exp]{"queue"}<=170 [C<=200]) - -Objectives: --------------------------------------------------------------- - R[exp]{"power"}min=? [C<=200] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), step bound: 200) - R[exp]{"queue"}<=170 [C<=200] (toOrigVal: -1*x + 0, intern threshold:>= -170, intern reward model: objective2 (negative), step bound: 200) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 636 -Transitions: 2550 -Choices: 1860 -Reward Models: queue, power -Labels: 1 - * init -> 1 state(s) -choice labels: no -Size in memory: 109 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 636 -Transitions: 2550 -Choices: 1860 -Reward Models: objective2, objective1 -Labels: 2 - * prob1 -> 0 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 83 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0 - Value Iterations: 0.081 - Postprocessing: 0 - Combined: 0.081 - -Performed Refinement Steps: 5 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [57.46361957] -===== Statistics ============================== -peak memory usage: 190MB -CPU time: 0.151 seconds -=============================================== -OVERALL_TIME; 0.214 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/7_dpm300.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/7_dpm300.storm.output deleted file mode 100644 index ce0ce78a9..000000000 --- a/examples/multiobjective/mdp/benchmarks_numerical/2016-06-20/storm/7_dpm300.storm.output +++ /dev/null @@ -1,87 +0,0 @@ -SToRM ---------------- - -Version: 0.9.1 (+1781 commits) build from revision g5578a73 (DIRTY). - -Linked with GNU Linear Programming Kit v4.57. -Linked with SMT-RAT 2.1.0. -Linked with CARL. -Command line arguments: -s dpm/dpm300.nm -prop dpm/dpm300_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 -Current working directory: /Users/tim/storm/examples/multi-objective/mdp - --------------------------------------------------------------- -Model type: MDP (sparse) -States: 636 -Transitions: 2550 -Choices: 1860 -Reward Models: queue, power -Labels: 1 - * init -> 1 state(s) -choice labels: no -Size in memory: 109 kbytes --------------------------------------------------------------- - -Model checking property: multi(R[exp]{"power"}min=? [C<=300], R[exp]{"queue"}<=270 [C<=300]) ... ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Preprocessor Data ---------------------------------------------------------------------------------------------------------------------------------------- - -Original Formula: --------------------------------------------------------------- - multi(R[exp]{"power"}min=? [C<=300], R[exp]{"queue"}<=270 [C<=300]) - -Objectives: --------------------------------------------------------------- - R[exp]{"power"}min=? [C<=300] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), step bound: 300) - R[exp]{"queue"}<=270 [C<=300] (toOrigVal: -1*x + 0, intern threshold:>= -270, intern reward model: objective2 (negative), step bound: 300) --------------------------------------------------------------- - -Original Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 636 -Transitions: 2550 -Choices: 1860 -Reward Models: queue, power -Labels: 1 - * init -> 1 state(s) -choice labels: no -Size in memory: 109 kbytes --------------------------------------------------------------- - -Preprocessed Model Information: --------------------------------------------------------------- -Model type: MDP (sparse) -States: 636 -Transitions: 2550 -Choices: 1860 -Reward Models: objective2, objective1 -Labels: 2 - * prob1 -> 0 state(s) - * init -> 1 state(s) -choice labels: no -Size in memory: 83 kbytes --------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - ---------------------------------------------------------------------------------------------------------------------------------------- - Multi-objective Model Checking Statistics: ---------------------------------------------------------------------------------------------------------------------------------------- - -Runtimes (in seconds): - Preprocessing: 0 - Value Iterations: 0.11 - Postprocessing: 0 - Combined: 0.11 - -Performed Refinement Steps: 5 - ---------------------------------------------------------------------------------------------------------------------------------------- - done. -Result (initial states): [46.48477804] -===== Statistics ============================== -peak memory usage: 190MB -CPU time: 0.178 seconds -=============================================== -OVERALL_TIME; 0.252 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/grepStormResults b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/grepStormResults new file mode 100755 index 000000000..15762e795 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/grepStormResults @@ -0,0 +1,11 @@ +#!/bin/sh +echo " " >> results.csv +cat *.output | grep 'Original Model Information' -A3 | grep States >> results.csv +echo " " >> results.csv +cat *.output | grep "Steps:" >> results.csv +echo " " >> results.csv +cat *.output | grep "Value Iterations" >> results.csv +echo " " >> results.csv +cat *.output | grep "Combined" >> results.csv +echo " " >> results.csv +cat *.output | grep "Result (initial state)" >> results.csv diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/results.ods b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/results.ods new file mode 100644 index 000000000..82df6941c Binary files /dev/null and b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/results.ods differ diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus2_3_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus2_3_2.storm.output new file mode 100644 index 000000000..219df9d6e --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus2_3_2.storm.output @@ -0,0 +1,269 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s consensus/consensus2_3_2.nm -prop consensus/consensus2_3_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 691 +Transitions: 1190 +Choices: 1190 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 76 state(s) + * one_coin_ok -> 363 state(s) +choice labels: no +Size in memory: 48 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.8916673903 [G "one_coin_ok"]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F "one_proc_err"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 691 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 691 states, where 615 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.891667 [G "one_coin_ok"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 691 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 691 states, where 363 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.891667 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.891667 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.108333, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 691 +Transitions: 1190 +Choices: 1190 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 76 state(s) + * one_coin_ok -> 363 state(s) +choice labels: no +Size in memory: 48 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 691 +Transitions: 1190 +Choices: 1190 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 76 state(s) + * one_coin_ok -> 363 state(s) + * prob1 -> 691 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 47 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.108333 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 691 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 77 of 691 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 77 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 120 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 571 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 120 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 208 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 691 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.108333 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 691 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 205 of 691 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 205 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 340 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 15 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 486 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 205 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 374 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 618 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 73 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 140 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= 1 + ( 0, 1) * x <= 0 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.108333. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.891667 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.108333, -0.108333 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 1 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.5, 0.5 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 691 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 213 of 691 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 213 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 352 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 7 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 555 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 136 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 236 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 691 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 0.5, 0.5) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= 1 + ( 0, 1) * x <= 0 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.108333. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.891667 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.891667 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.108333, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 691 +Transitions: 1190 +Choices: 1190 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 76 state(s) + * one_coin_ok -> 363 state(s) +choice labels: no +Size in memory: 48 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 691 +Transitions: 1190 +Choices: 1190 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 76 state(s) + * one_coin_ok -> 363 state(s) + * prob1 -> 691 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 47 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.108333] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.002 + Value Iterations: 0.031 + Postprocessing: 0 + Combined: 0.034 + +Performed Refinement Steps: 3 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.1083326097] +===== Statistics ============================== +peak memory usage: 196MB +CPU time: 0.089 seconds +=============================================== +OVERALL_TIME; 0.262 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus2_4_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus2_4_2.storm.output new file mode 100644 index 000000000..922d2163d --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus2_4_2.storm.output @@ -0,0 +1,273 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s consensus/consensus2_4_2.nm -prop consensus/consensus2_4_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 1517 +Transitions: 2616 +Choices: 2616 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 152 state(s) + * one_coin_ok -> 861 state(s) +choice labels: no +Size in memory: 97 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.9882640457 [G "one_coin_ok"]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F "one_proc_err"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 1517 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 1517 states, where 1365 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.988264 [G "one_coin_ok"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 1517 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 1517 states, where 861 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.988264 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.988264 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.011736, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 1517 +Transitions: 2616 +Choices: 2616 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 152 state(s) + * one_coin_ok -> 861 state(s) +choice labels: no +Size in memory: 97 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 1517 +Transitions: 2616 +Choices: 2616 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 152 state(s) + * one_coin_ok -> 861 state(s) + * prob1 -> 1517 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 103 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.011736 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 1517 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 189 of 1517 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 189 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 300 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 1277 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 240 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 416 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 1517 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.011736 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 1517 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 445 of 1517 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 445 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 740 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 23 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 1072 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 445 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 818 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 1336 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 181 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 350 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.011736. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.988264 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.011736, -0.011736 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 1 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.5, 0.5 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 1517 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 461 of 1517 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 461 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 764 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 23 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 1072 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 445 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 818 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 1344 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 173 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 338 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 0.5, 0.5) * x <= 5.77316e-15 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= 1 + ( 0, 1) * x <= 0 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.011736. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 1.14108e-14 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.988264 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.988264 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.011736, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 1517 +Transitions: 2616 +Choices: 2616 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 152 state(s) + * one_coin_ok -> 861 state(s) +choice labels: no +Size in memory: 97 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 1517 +Transitions: 2616 +Choices: 2616 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 152 state(s) + * one_coin_ok -> 861 state(s) + * prob1 -> 1517 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 103 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.011736] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.002 + Value Iterations: 0.012 + Postprocessing: 0 + Combined: 0.014 + +Performed Refinement Steps: 3 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 1.14108e-14 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.0117359543] +===== Statistics ============================== +peak memory usage: 196MB +CPU time: 0.099 seconds +=============================================== +OVERALL_TIME; 0.168 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus2_5_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus2_5_2.storm.output new file mode 100644 index 000000000..dc1757894 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus2_5_2.storm.output @@ -0,0 +1,274 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s consensus/consensus2_5_2.nm -prop consensus/consensus2_5_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 3169 +Transitions: 5468 +Choices: 5468 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 304 state(s) + * one_coin_ok -> 1857 state(s) +choice labels: no +Size in memory: 193 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.9987286134 [G "one_coin_ok"]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F "one_proc_err"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 3169 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 3169 states, where 2865 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.998729 [G "one_coin_ok"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 3169 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 3169 states, where 1857 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.998729 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.998729 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.00127139, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 3169 +Transitions: 5468 +Choices: 5468 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 304 state(s) + * one_coin_ok -> 1857 state(s) +choice labels: no +Size in memory: 193 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 3169 +Transitions: 5468 +Choices: 5468 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 304 state(s) + * one_coin_ok -> 1857 state(s) + * prob1 -> 3169 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 215 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.00127139 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 3169 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 413 of 3169 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 413 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 660 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 2689 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 480 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 832 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 3169 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.00127139 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 3169 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 925 of 3169 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 925 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 1540 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 31 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 2244 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 925 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 1706 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 2772 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 397 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 770 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.00127139. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.998729 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.00127139, -0.00127139 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 1 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.5, 0.5 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 3169 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 957 of 3169 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 957 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 1588 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 31 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 2244 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 925 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 1706 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 2788 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 381 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 746 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, -1 ] + WARN (SparseMultiObjectiveHelper.cpp:299): Numerical issues: The overapproximation would not contain the underapproximation. Hence, a halfspace is shifted by 2.51215e-15. +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 0.5, 0.5) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.00127139. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.998729 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.998729 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.00127139, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 3169 +Transitions: 5468 +Choices: 5468 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 304 state(s) + * one_coin_ok -> 1857 state(s) +choice labels: no +Size in memory: 193 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 3169 +Transitions: 5468 +Choices: 5468 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 304 state(s) + * one_coin_ok -> 1857 state(s) + * prob1 -> 3169 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 215 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.00127139] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.003 + Value Iterations: 0.017 + Postprocessing: 0 + Combined: 0.02 + +Performed Refinement Steps: 3 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.0012713866] +===== Statistics ============================== +peak memory usage: 197MB +CPU time: 0.135 seconds +=============================================== +OVERALL_TIME; 0.21 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus3_3_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus3_3_2.storm.output new file mode 100644 index 000000000..7d042b7bb --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus3_3_2.storm.output @@ -0,0 +1,273 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s consensus/consensus3_3_2.nm -prop consensus/consensus3_3_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 17455 +Transitions: 46702 +Choices: 46702 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 3360 state(s) + * one_coin_ok -> 5523 state(s) +choice labels: no +Size in memory: 1544 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.7709112445 [G "one_coin_ok"]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F "one_proc_err"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 17455 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 17455 states, where 14095 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.770911 [G "one_coin_ok"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 17455 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 17455 states, where 5523 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.770911 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.770911 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.229089, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 17455 +Transitions: 46702 +Choices: 46702 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 3360 state(s) + * one_coin_ok -> 5523 state(s) +choice labels: no +Size in memory: 1544 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 17455 +Transitions: 46702 +Choices: 46702 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 3360 state(s) + * one_coin_ok -> 5523 state(s) + * prob1 -> 17455 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 1835 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.229089 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 17455 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 1377 of 17455 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 1377 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 3480 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 12955 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 4500 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 8036 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 17455 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.229089 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 17455 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 7033 of 17455 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 7033 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 18936 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 15 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 10422 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 7033 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 13036 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 16102 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 1353 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 2628 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 2 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.229089. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.770911 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.229089, -0.229089 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 1 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.5, 0.5 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 17455 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 7081 of 17455 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 7081 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 19080 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 15 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 10422 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 7033 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 13036 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 16126 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 1329 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 2592 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 2 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 0.5, 0.5) * x <= 4.56302e-14 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= 1 + ( 0, 1) * x <= 0 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.229089. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 7.03536e-14 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.770911 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.770911 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.229089, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 17455 +Transitions: 46702 +Choices: 46702 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 3360 state(s) + * one_coin_ok -> 5523 state(s) +choice labels: no +Size in memory: 1544 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 17455 +Transitions: 46702 +Choices: 46702 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 3360 state(s) + * one_coin_ok -> 5523 state(s) + * prob1 -> 17455 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 1835 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.229089] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.018 + Value Iterations: 0.094 + Postprocessing: 0 + Combined: 0.112 + +Performed Refinement Steps: 3 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 7.03536e-14 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.2290887555] +===== Statistics ============================== +peak memory usage: 206MB +CPU time: 0.531 seconds +=============================================== +OVERALL_TIME; 0.636 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus3_4_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus3_4_2.storm.output new file mode 100644 index 000000000..293f0b806 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus3_4_2.storm.output @@ -0,0 +1,273 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s consensus/consensus3_4_2.nm -prop consensus/consensus3_4_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 61017 +Transitions: 164012 +Choices: 164012 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 9648 state(s) + * one_coin_ok -> 24361 state(s) +choice labels: no +Size in memory: 6174 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.9475183421 [G "one_coin_ok"]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F "one_proc_err"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 61017 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 61017 states, where 51369 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.947518 [G "one_coin_ok"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 61017 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 61017 states, where 24361 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.947518 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.947518 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.0524817, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 61017 +Transitions: 164012 +Choices: 164012 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 9648 state(s) + * one_coin_ok -> 24361 state(s) +choice labels: no +Size in memory: 6174 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 61017 +Transitions: 164012 +Choices: 164012 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 9648 state(s) + * one_coin_ok -> 24361 state(s) + * prob1 -> 61017 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 6444 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.0524817 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 61017 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 5929 of 61017 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 5929 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 15468 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 47425 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 13592 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 24400 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 61017 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.0524817 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 61017 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 22473 of 61017 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 22473 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 61044 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 23 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 38544 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 22473 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 41938 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 55160 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 5857 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 11450 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 3 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.0524817. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.947518 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.0524817, -0.0524817 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 1 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.5, 0.5 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 61017 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 22617 of 61017 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 22617 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 61500 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 23 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 38544 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 22473 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 41938 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 55232 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 5785 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 11342 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 3 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 0.5, 0.5) * x <= 1.17462e-13 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= 1 + ( 0, 1) * x <= 0 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.0524817. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 2.22594e-13 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.947518 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.947518 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.0524817, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 61017 +Transitions: 164012 +Choices: 164012 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 9648 state(s) + * one_coin_ok -> 24361 state(s) +choice labels: no +Size in memory: 6174 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 61017 +Transitions: 164012 +Choices: 164012 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 9648 state(s) + * one_coin_ok -> 24361 state(s) + * prob1 -> 61017 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 6444 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.0524817] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.093 + Value Iterations: 0.308 + Postprocessing: 0.001 + Combined: 0.402 + +Performed Refinement Steps: 3 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 2.22594e-13 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.0524816579] +===== Statistics ============================== +peak memory usage: 235MB +CPU time: 1.835 seconds +=============================================== +OVERALL_TIME; 2.013 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus3_5_2.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus3_5_2.storm.output new file mode 100644 index 000000000..8e161e1a1 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/1_consensus3_5_2.storm.output @@ -0,0 +1,273 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s consensus/consensus3_5_2.nm -prop consensus/consensus3_5_2_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 181129 +Transitions: 487456 +Choices: 487456 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 25152 state(s) + * one_coin_ok -> 82233 state(s) +choice labels: no +Size in memory: 12376 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F "one_proc_err"], P>=0.9879770423 [G "one_coin_ok"]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F "one_proc_err"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 181129 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 181129 states, where 155977 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.987977 [G "one_coin_ok"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 181129 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 181129 states, where 82233 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.987977 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.987977 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.012023, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 181129 +Transitions: 487456 +Choices: 487456 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 25152 state(s) + * one_coin_ok -> 82233 state(s) +choice labels: no +Size in memory: 12376 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 181129 +Transitions: 487456 +Choices: 487456 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 25152 state(s) + * one_coin_ok -> 82233 state(s) + * prob1 -> 181129 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 19152 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.012023 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 181129 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 19209 of 181129 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 19209 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 50796 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 144761 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 36368 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 65456 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 181129 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.012023 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 181129 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 62761 of 181129 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 62761 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 171276 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 31 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 118368 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 62761 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 117610 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 162112 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 19017 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 37290 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 4 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.012023. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.987977 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.012023, -0.012023 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 1 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.5, 0.5 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 181129 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 63145 of 181129 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 63145 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 172524 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 31 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 118368 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 62761 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 117610 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 162304 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 18825 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 37002 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 4 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, -1 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 1 + ( 0.5, 0.5) * x <= 1.80189e-13 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= 1 + ( 0, 1) * x <= 0 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.012023. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 3.56046e-13 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F "one_proc_err"], P>=0.987977 [G "one_coin_ok"]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F "one_proc_err"] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.987977 [G "one_coin_ok"] (toOrigVal: 1*x + 1, intern threshold:>=-0.012023, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 181129 +Transitions: 487456 +Choices: 487456 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * one_proc_err -> 25152 state(s) + * one_coin_ok -> 82233 state(s) +choice labels: no +Size in memory: 12376 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 181129 +Transitions: 487456 +Choices: 487456 +Reward Models: objective2, objective1 +Labels: 5 + * one_proc_err -> 25152 state(s) + * one_coin_ok -> 82233 state(s) + * prob1 -> 181129 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 19152 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.012023] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.217 + Value Iterations: 1.037 + Postprocessing: 0.003 + Combined: 1.257 + +Performed Refinement Steps: 3 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 3.56046e-13 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.0120229577] +===== Statistics ============================== +peak memory usage: 285MB +CPU time: 5.803 seconds +=============================================== +OVERALL_TIME; 6.035 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/2_zeroconf4.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/2_zeroconf4.storm.output new file mode 100644 index 000000000..4fb01beba --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/2_zeroconf4.storm.output @@ -0,0 +1,231 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s zeroconf/zeroconf4.nm -prop zeroconf/zeroconf4_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 5449 +Transitions: 17152 +Choices: 16487 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (error = 0) -> 4998 state(s) + * ((l = 4) & (ip = 1)) -> 24 state(s) +choice labels: no +Size in memory: 770 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.993141 [G (error = 0)]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F ((l = 4) & (ip = 1))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 5449 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 5449 states, where 5425 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.993141 [G (error = 0)]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 5449 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 5449 states, where 4998 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.993141 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((l = 4) & (ip = 1))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.993141 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.006859, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 5449 +Transitions: 17152 +Choices: 16487 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (error = 0) -> 4998 state(s) + * ((l = 4) & (ip = 1)) -> 24 state(s) +choice labels: no +Size in memory: 770 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 5449 +Transitions: 17152 +Choices: 16487 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 5449 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (error = 0) -> 4998 state(s) + * ((l = 4) & (ip = 1)) -> 24 state(s) +choice labels: no +Size in memory: 658 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.006859 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 5449 row groups. +DEBUG (EndComponentEliminator.h:50): Found 15 end components to eliminate. Keeping 0 of 5449 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 15 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 16 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 5449 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 5449 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.006859 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 5449 row groups. +DEBUG (EndComponentEliminator.h:50): Found 3135 end components to eliminate. Keeping 204 of 5449 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 3339 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 5884 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 84 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 2110 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 3339 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 6884 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 5434 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 15 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 31 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.000307579, -0.000307579 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.000307579, -0.000307579 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.000307579 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.000307579 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.000307579. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.993141 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((l = 4) & (ip = 1))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.993141 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.006859, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 5449 +Transitions: 17152 +Choices: 16487 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (error = 0) -> 4998 state(s) + * ((l = 4) & (ip = 1)) -> 24 state(s) +choice labels: no +Size in memory: 770 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 5449 +Transitions: 17152 +Choices: 16487 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 5449 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (error = 0) -> 4998 state(s) + * ((l = 4) & (ip = 1)) -> 24 state(s) +choice labels: no +Size in memory: 658 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.000307579] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.006 + Value Iterations: 0.05 + Postprocessing: 0 + Combined: 0.057 + +Performed Refinement Steps: 2 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.0003075787402] +===== Statistics ============================== +peak memory usage: 199MB +CPU time: 0.220 seconds +=============================================== +OVERALL_TIME; 0.288 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/2_zeroconf6.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/2_zeroconf6.storm.output new file mode 100644 index 000000000..b23e242b6 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/2_zeroconf6.storm.output @@ -0,0 +1,231 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s zeroconf/zeroconf6.nm -prop zeroconf/zeroconf6_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 10543 +Transitions: 32003 +Choices: 31008 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (error = 0) -> 9960 state(s) + * ((l = 4) & (ip = 1)) -> 36 state(s) +choice labels: no +Size in memory: 773 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.9997523901 [G (error = 0)]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F ((l = 4) & (ip = 1))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 10543 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 10543 states, where 10507 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.999752 [G (error = 0)]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 10543 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 10543 states, where 9960 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.999752 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((l = 4) & (ip = 1))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.999752 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.00024761, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 10543 +Transitions: 32003 +Choices: 31008 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (error = 0) -> 9960 state(s) + * ((l = 4) & (ip = 1)) -> 36 state(s) +choice labels: no +Size in memory: 773 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 10543 +Transitions: 32003 +Choices: 31008 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 10543 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (error = 0) -> 9960 state(s) + * ((l = 4) & (ip = 1)) -> 36 state(s) +choice labels: no +Size in memory: 1233 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.00024761 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 10543 row groups. +DEBUG (EndComponentEliminator.h:50): Found 21 end components to eliminate. Keeping 0 of 10543 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 21 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 22 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 10543 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 10543 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.00024761 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 10543 row groups. +DEBUG (EndComponentEliminator.h:50): Found 5889 end components to eliminate. Keeping 306 of 10543 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 6195 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 11200 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 90 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 4348 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 6195 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 12698 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 10522 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 21 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 43 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.000307579, -0.000307579 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.000307579, -0.000307579 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.000307579 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.000307579 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.00024761. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 5.99688e-05 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.999752 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((l = 4) & (ip = 1))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.999752 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.00024761, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 10543 +Transitions: 32003 +Choices: 31008 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (error = 0) -> 9960 state(s) + * ((l = 4) & (ip = 1)) -> 36 state(s) +choice labels: no +Size in memory: 773 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 10543 +Transitions: 32003 +Choices: 31008 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 10543 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (error = 0) -> 9960 state(s) + * ((l = 4) & (ip = 1)) -> 36 state(s) +choice labels: no +Size in memory: 1233 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.00024761] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.011 + Value Iterations: 0.117 + Postprocessing: 0 + Combined: 0.128 + +Performed Refinement Steps: 2 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 5.99688e-05 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.0002476099] +===== Statistics ============================== +peak memory usage: 205MB +CPU time: 0.392 seconds +=============================================== +OVERALL_TIME; 0.499 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/2_zeroconf8.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/2_zeroconf8.storm.output new file mode 100644 index 000000000..3e769607d --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/2_zeroconf8.storm.output @@ -0,0 +1,265 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s zeroconf/zeroconf8.nm -prop zeroconf/zeroconf8_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 17221 +Transitions: 52163 +Choices: 50838 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (error = 0) -> 16506 state(s) + * ((l = 4) & (ip = 1)) -> 48 state(s) +choice labels: no +Size in memory: 1544 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.9999910613 [G (error = 0)]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F ((l = 4) & (ip = 1))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 17221 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 17221 states, where 17173 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.999991 [G (error = 0)]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 17221 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 17221 states, where 16506 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.999991 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((l = 4) & (ip = 1))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.999991 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-8.9387e-06, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 17221 +Transitions: 52163 +Choices: 50838 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (error = 0) -> 16506 state(s) + * ((l = 4) & (ip = 1)) -> 48 state(s) +choice labels: no +Size in memory: 1544 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 17221 +Transitions: 52163 +Choices: 50838 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 17221 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (error = 0) -> 16506 state(s) + * ((l = 4) & (ip = 1)) -> 48 state(s) +choice labels: no +Size in memory: 2017 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -8.9387e-06 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 17221 row groups. +DEBUG (EndComponentEliminator.h:50): Found 27 end components to eliminate. Keeping 0 of 17221 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 27 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 28 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 17221 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 17221 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -8.9387e-06 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 17221 row groups. +DEBUG (EndComponentEliminator.h:50): Found 9435 end components to eliminate. Keeping 408 of 17221 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 9843 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 18100 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 96 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 7378 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 9843 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 20096 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 17194 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 27 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 55 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.000307579, -0.000307579 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.000307579, -0.000307579 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.000307579 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.000307579 + ( 1, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 8.9387e-06. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.00029864 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 8.9387e-06, -8.9387e-06 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 1 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.5, 0.5 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 17221 row groups. +DEBUG (EndComponentEliminator.h:50): Found 9435 end components to eliminate. Keeping 408 of 17221 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 9843 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 18100 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 96 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 7378 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 9843 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 20096 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 17221 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 9.46046e-08, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 9.46046e-08, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.000307579 + ( 0.5, 0.5) * x <= 4.73023e-08 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.000307579 + ( 1, 0.999692) * x <= 9.46046e-08 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 9.03056e-06. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 2.74935e-09 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((l = 4) & (ip = 1))], P>=0.999991 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((l = 4) & (ip = 1))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.999991 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-8.9387e-06, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 17221 +Transitions: 52163 +Choices: 50838 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (error = 0) -> 16506 state(s) + * ((l = 4) & (ip = 1)) -> 48 state(s) +choice labels: no +Size in memory: 1544 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 17221 +Transitions: 52163 +Choices: 50838 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 17221 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (error = 0) -> 16506 state(s) + * ((l = 4) & (ip = 1)) -> 48 state(s) +choice labels: no +Size in memory: 2017 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[9.03056e-06] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.018 + Value Iterations: 0.523 + Postprocessing: 0 + Combined: 0.542 + +Performed Refinement Steps: 3 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 2.74935e-09 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [9.030555281e-06] +===== Statistics ============================== +peak memory usage: 207MB +CPU time: 0.906 seconds +=============================================== +OVERALL_TIME; 1.01 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/3_zeroconf-tb2_14.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/3_zeroconf-tb2_14.storm.output new file mode 100644 index 000000000..378b8adee --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/3_zeroconf-tb2_14.storm.output @@ -0,0 +1,231 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s zeroconf-tb/zeroconf-tb2_14.nm -prop zeroconf-tb/zeroconf-tb2_14_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 29572 +Transitions: 92605 +Choices: 86585 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (time_error = 1) -> 1914 state(s) + * (error = 0) -> 24820 state(s) +choice labels: no +Size in memory: 3086 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F (time_error = 1)], P>=0.81 [G (error = 0)]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F (time_error = 1)]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 29572 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 29572 states, where 27658 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.81 [G (error = 0)]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 29572 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 29572 states, where 24820 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F (time_error = 1)], P>=0.81 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F (time_error = 1)] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.81 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.19, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 29572 +Transitions: 92605 +Choices: 86585 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (time_error = 1) -> 1914 state(s) + * (error = 0) -> 24820 state(s) +choice labels: no +Size in memory: 3086 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 29572 +Transitions: 92605 +Choices: 86585 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 29572 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (time_error = 1) -> 1914 state(s) + * (error = 0) -> 24820 state(s) +choice labels: no +Size in memory: 3494 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.19 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 29572 row groups. +DEBUG (EndComponentEliminator.h:50): Found 22 end components to eliminate. Keeping 0 of 29572 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 22 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 21 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 29572 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 29572 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.19 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 29572 row groups. +DEBUG (EndComponentEliminator.h:50): Found 7132 end components to eliminate. Keeping 648 of 29572 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 7780 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 13401 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 33 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 21792 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 7780 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 16805 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 3 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 29550 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 22 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 43 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 8.05935e-08, -0.000307579 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 8.05935e-08, -0.000307579 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 8.05935e-08 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 8.05935e-08 + ( 1, 0.000262026) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 8.05935e-08. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F (time_error = 1)], P>=0.81 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F (time_error = 1)] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.81 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.19, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 29572 +Transitions: 92605 +Choices: 86585 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (time_error = 1) -> 1914 state(s) + * (error = 0) -> 24820 state(s) +choice labels: no +Size in memory: 3086 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 29572 +Transitions: 92605 +Choices: 86585 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 29572 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (time_error = 1) -> 1914 state(s) + * (error = 0) -> 24820 state(s) +choice labels: no +Size in memory: 3494 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[8.05935e-08] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.032 + Value Iterations: 0.419 + Postprocessing: 0.001 + Combined: 0.452 + +Performed Refinement Steps: 2 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [8.059350372e-08] +===== Statistics ============================== +peak memory usage: 215MB +CPU time: 1.049 seconds +=============================================== +OVERALL_TIME; 1.145 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/3_zeroconf-tb4_10.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/3_zeroconf-tb4_10.storm.output new file mode 100644 index 000000000..af0cb8e3e --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/3_zeroconf-tb4_10.storm.output @@ -0,0 +1,231 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s zeroconf-tb/zeroconf-tb4_10.nm -prop zeroconf-tb/zeroconf-tb4_10_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 19670 +Transitions: 63353 +Choices: 59358 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (time_error = 1) -> 5420 state(s) + * (error = 0) -> 18112 state(s) +choice labels: no +Size in memory: 1545 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F (time_error = 1)], P>=0.993141 [G (error = 0)]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F (time_error = 1)]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 19670 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 19670 states, where 14250 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.993141 [G (error = 0)]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 19670 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 19670 states, where 18112 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F (time_error = 1)], P>=0.993141 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F (time_error = 1)] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.993141 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.006859, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 19670 +Transitions: 63353 +Choices: 59358 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (time_error = 1) -> 5420 state(s) + * (error = 0) -> 18112 state(s) +choice labels: no +Size in memory: 1545 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 19670 +Transitions: 63353 +Choices: 59358 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 19670 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (time_error = 1) -> 5420 state(s) + * (error = 0) -> 18112 state(s) +choice labels: no +Size in memory: 2393 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.006859 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 19670 row groups. +DEBUG (EndComponentEliminator.h:50): Found 40 end components to eliminate. Keeping 0 of 19670 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 40 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 39 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 19670 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 19670 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.006859 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 19670 row groups. +DEBUG (EndComponentEliminator.h:50): Found 10911 end components to eliminate. Keeping 683 of 19670 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 11594 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 19406 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 21 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 8076 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 11594 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 24629 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 19655 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 15 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 29 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.333538, -0.000102526 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.333538, -0.000102526 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.333538 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.333538 + ( 1, 3253.2) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.333538. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F (time_error = 1)], P>=0.993141 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F (time_error = 1)] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.993141 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.006859, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 19670 +Transitions: 63353 +Choices: 59358 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (time_error = 1) -> 5420 state(s) + * (error = 0) -> 18112 state(s) +choice labels: no +Size in memory: 1545 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 19670 +Transitions: 63353 +Choices: 59358 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 19670 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (time_error = 1) -> 5420 state(s) + * (error = 0) -> 18112 state(s) +choice labels: no +Size in memory: 2393 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.333538] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.023 + Value Iterations: 0.354 + Postprocessing: 0 + Combined: 0.377 + +Performed Refinement Steps: 2 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.3335383858] +===== Statistics ============================== +peak memory usage: 210MB +CPU time: 0.802 seconds +=============================================== +OVERALL_TIME; 0.898 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/3_zeroconf-tb4_14.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/3_zeroconf-tb4_14.storm.output new file mode 100644 index 000000000..014bb6d06 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/3_zeroconf-tb4_14.storm.output @@ -0,0 +1,226 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s zeroconf-tb/zeroconf-tb4_14.nm -prop zeroconf-tb/zeroconf-tb4_14_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 42968 +Transitions: 138025 +Choices: 130735 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (time_error = 1) -> 5412 state(s) + * (error = 0) -> 40236 state(s) +choice labels: no +Size in memory: 5141 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F (time_error = 1)], P>=0.993141 [G (error = 0)]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F (time_error = 1)]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 42968 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 42968 states, where 37556 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.993141 [G (error = 0)]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 42968 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 42968 states, where 40236 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F (time_error = 1)], P>=0.993141 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F (time_error = 1)] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.993141 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.006859, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 42968 +Transitions: 138025 +Choices: 130735 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (time_error = 1) -> 5412 state(s) + * (error = 0) -> 40236 state(s) +choice labels: no +Size in memory: 5141 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 42968 +Transitions: 138025 +Choices: 130735 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 42968 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (time_error = 1) -> 5412 state(s) + * (error = 0) -> 40236 state(s) +choice labels: no +Size in memory: 5247 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.006859 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 42968 row groups. +DEBUG (EndComponentEliminator.h:50): Found 40 end components to eliminate. Keeping 0 of 42968 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 40 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 39 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 42968 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 42968 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0 + ( 0, 1) * x <= 0 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -0.006859 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 42968 row groups. +DEBUG (EndComponentEliminator.h:50): Found 19425 end components to eliminate. Keeping 1115 of 42968 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 20540 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 35230 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 27 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 22428 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 20540 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 43605 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 42968 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 0 'maybe' states. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.000307579, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.000307579, 0 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.000307579 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 0 + ( 1, 0) * x <= 0.000307579 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.000307579. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F (time_error = 1)], P>=0.993141 [G (error = 0)]) + +Objectives: +-------------------------------------------------------------- + Pmax=? [F (time_error = 1)] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) + P>=0.993141 [G (error = 0)] (toOrigVal: 1*x + 1, intern threshold:>=-0.006859, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 42968 +Transitions: 138025 +Choices: 130735 +Reward Models: none +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * (time_error = 1) -> 5412 state(s) + * (error = 0) -> 40236 state(s) +choice labels: no +Size in memory: 5141 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 42968 +Transitions: 138025 +Choices: 130735 +Reward Models: objective2, objective1 +Labels: 5 + * prob1 -> 42968 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * (time_error = 1) -> 5412 state(s) + * (error = 0) -> 40236 state(s) +choice labels: no +Size in memory: 5247 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.000307579] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.053 + Value Iterations: 1.354 + Postprocessing: 0.001 + Combined: 1.408 + +Performed Refinement Steps: 2 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.0003075787402] +===== Statistics ============================== +peak memory usage: 226MB +CPU time: 2.293 seconds +=============================================== +OVERALL_TIME; 2.416 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/4_team2obj_3.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/4_team2obj_3.storm.output new file mode 100644 index 000000000..8a10d3f78 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/4_team2obj_3.storm.output @@ -0,0 +1,353 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s team/team2obj_3.nm -prop team/team2obj_3_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 12475 +Transitions: 15228 +Choices: 14935 +Reward Models: w_1_total +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) +choice labels: no +Size in memory: 505 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))], R[exp]{"w_1_total"}>=2.210204082 [C]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 12475 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 12475 states, where 11383 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"w_1_total"}>=2.2102 [C]. +DEBUG (SparseMultiObjectivePreprocessor.cpp:468): Maximal end component decomposition for ensuring positive reward finiteness took 0.043 seconds. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))], R[exp]{"w_1_total"}>=2.2102 [C]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.2102 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.2102, intern reward model: objective2 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 12475 +Transitions: 15228 +Choices: 14935 +Reward Models: w_1_total +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) +choice labels: no +Size in memory: 505 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 12475 +Transitions: 15228 +Choices: 14935 +Reward Models: objective1, objective2 +Labels: 4 + * deadlock -> 0 state(s) + * prob1 -> 12475 state(s) + * init -> 1 state(s) + * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) +choice labels: no +Size in memory: 594 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, 2.2102 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 12475 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 5755 of 12475 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 5755 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 5754 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 13 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 9672 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 2803 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 5371 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 6720 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 5755 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 10783 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.734694, 2.32653 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.734694, 2.32653 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 2.32653 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0.734694 + ( 0, 1) * x <= 2.32653 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.734694. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.734694, 2.2102 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 12475 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 3139 of 12475 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 3139 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 3138 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 12 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 9336 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 3139 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 6121 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 7134 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 5341 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 9955 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, 2.02041 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, 2.02041 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 2.32653 + ( 1, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 2.32653 + ( 1, 0) * x <= 1 + ( 1, 0.866667) * x <= 2.75102 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.83551. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.16449 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.83551, 2.2102 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0.866667 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.535714, 0.464286 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 12475 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 5755 of 12475 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 5755 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 5754 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 13 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 9426 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 3049 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 5923 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 6720 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 5755 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 10783 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.938776, 2.14286 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.938776, 2.14286 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 2.32653 + ( 1, 0) * x <= 1 + ( 0.535714, 0.464286) * x <= 1.49781 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= 2.32653 + ( 1, 0) * x <= 1 + ( 1, 1.11111) * x <= 3.31973 + ( 1, 0.5) * x <= 2.0102 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.863946. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.0164626 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.863946, 2.2102 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 1.11111 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.473684, 0.526316 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 12475 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 5755 of 12475 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 5755 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 5754 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 13 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 9642 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 2833 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 5437 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 6720 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 5755 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 10783 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.755102, 2.32653 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.755102, 2.32653 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= 2.32653 + ( 1, 0) * x <= 1 + ( 0.535714, 0.464286) * x <= 1.49781 + ( 0.473684, 0.526316) * x <= 1.58217 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= 2.32653 + ( 1, 0) * x <= 1 + ( 1, 0.5) * x <= 2.0102 + ( 1, 1) * x <= 3.08163 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.871429. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.00897959 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.871429, 2.2102 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 1 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.5, 0.5 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 12475 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 5755 of 12475 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 5755 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 5754 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 13 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 9642 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 2833 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 5437 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 6720 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 5755 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 10783 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.755102, 2.32653 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.755102, 2.32653 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 5 Halfspaces: + ( 0, 1) * x <= 2.32653 + ( 1, 0) * x <= 1 + ( 0.535714, 0.464286) * x <= 1.49781 + ( 0.473684, 0.526316) * x <= 1.58217 + ( 0.5, 0.5) * x <= 1.54082 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= 2.32653 + ( 1, 0) * x <= 1 + ( 1, 0.5) * x <= 2.0102 + ( 1, 1) * x <= 3.08163 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.871429. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))], R[exp]{"w_1_total"}>=2.2102 [C]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.2102 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.2102, intern reward model: objective2 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 12475 +Transitions: 15228 +Choices: 14935 +Reward Models: w_1_total +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) +choice labels: no +Size in memory: 505 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 12475 +Transitions: 15228 +Choices: 14935 +Reward Models: objective1, objective2 +Labels: 4 + * deadlock -> 0 state(s) + * prob1 -> 12475 state(s) + * init -> 1 state(s) + * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) +choice labels: no +Size in memory: 594 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.871429] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.049 + Value Iterations: 0.083 + Postprocessing: 0 + Combined: 0.133 + +Performed Refinement Steps: 5 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.8714285711] +===== Statistics ============================== +peak memory usage: 205MB +CPU time: 0.356 seconds +=============================================== +OVERALL_TIME; 0.424 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/4_team2obj_4.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/4_team2obj_4.storm.output new file mode 100644 index 000000000..d77bd9bf9 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/4_team2obj_4.storm.output @@ -0,0 +1,353 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s team/team2obj_4.nm -prop team/team2obj_4_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 96665 +Transitions: 116464 +Choices: 115289 +Reward Models: w_1_total +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) +choice labels: no +Size in memory: 4008 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))], R[exp]{"w_1_total"}>=2.423469388 [C]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 96665 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 96665 states, where 86921 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"w_1_total"}>=2.42347 [C]. +DEBUG (SparseMultiObjectivePreprocessor.cpp:468): Maximal end component decomposition for ensuring positive reward finiteness took 9.286 seconds. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))], R[exp]{"w_1_total"}>=2.42347 [C]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.42347 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.42347, intern reward model: objective2 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 96665 +Transitions: 116464 +Choices: 115289 +Reward Models: w_1_total +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) +choice labels: no +Size in memory: 4008 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 96665 +Transitions: 116464 +Choices: 115289 +Reward Models: objective1, objective2 +Labels: 4 + * prob1 -> 96665 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) +choice labels: no +Size in memory: 4569 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, 2.42347 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 96665 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 50057 of 96665 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 50057 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 50056 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 16 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 70864 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 25801 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 48597 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 46608 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 50057 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 92505 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.782313, 2.55102 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.782313, 2.55102 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 2.55102 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0.782313 + ( 0, 1) * x <= 2.55102 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.782313. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.782313, 2.42347 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 96665 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 28197 of 96665 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 28197 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 28196 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 14 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 68468 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 28197 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 53645 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 48956 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 47709 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 87809 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, 2.32653 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, 2.32653 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 2.55102 + ( 1, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 2.55102 + ( 1, 0) * x <= 1 + ( 1, 0.969697) * x <= 3.25603 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.905999. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.0940012 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.905999, 2.42347 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0.969697 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.507692, 0.492308 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 96665 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 50057 of 96665 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 50057 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 50056 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 16 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 69008 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 27657 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 52517 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 46608 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 50057 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 92505 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.959184, 2.40816 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.959184, 2.40816 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 2.55102 + ( 1, 0) * x <= 1 + ( 0.507692, 0.492308) * x <= 1.67253 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= 2.55102 + ( 1, 0) * x <= 1 + ( 1, 1.2381) * x <= 3.94072 + ( 1, 0.5) * x <= 2.16327 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.940233. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.00410814 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.940233, 2.42347 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 1.2381 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.446809, 0.553191 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 96665 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 50057 of 96665 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 50057 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 50056 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 16 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 70564 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 26101 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 49237 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 46608 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 50057 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 92505 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.816327, 2.55102 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.816327, 2.55102 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= 2.55102 + ( 1, 0) * x <= 1 + ( 0.507692, 0.492308) * x <= 1.67253 + ( 0.446809, 0.553191) * x <= 1.77594 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= 2.55102 + ( 1, 0) * x <= 1 + ( 1, 0.5) * x <= 2.16327 + ( 1, 1) * x <= 3.36735 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.943878. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.000463822 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.943878, 2.42347 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 1 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.5, 0.5 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 96665 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 50057 of 96665 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 50057 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 50056 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 16 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 70564 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 26101 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 49237 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 46608 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 50057 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 92505 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.816327, 2.55102 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.816327, 2.55102 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 5 Halfspaces: + ( 0, 1) * x <= 2.55102 + ( 1, 0) * x <= 1 + ( 0.507692, 0.492308) * x <= 1.67253 + ( 0.446809, 0.553191) * x <= 1.77594 + ( 0.5, 0.5) * x <= 1.68367 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= 2.55102 + ( 1, 0) * x <= 1 + ( 1, 0.5) * x <= 2.16327 + ( 1, 1) * x <= 3.36735 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.943878. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))], R[exp]{"w_1_total"}>=2.42347 [C]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.42347 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.42347, intern reward model: objective2 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 96665 +Transitions: 116464 +Choices: 115289 +Reward Models: w_1_total +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) +choice labels: no +Size in memory: 4008 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 96665 +Transitions: 116464 +Choices: 115289 +Reward Models: objective1, objective2 +Labels: 4 + * prob1 -> 96665 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) +choice labels: no +Size in memory: 4569 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.943878] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 9.334 + Value Iterations: 0.743 + Postprocessing: 0.001 + Combined: 10.078 + +Performed Refinement Steps: 5 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.9438775508] +===== Statistics ============================== +peak memory usage: 225MB +CPU time: 5.922 seconds +=============================================== +OVERALL_TIME; 11.703 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/4_team2obj_5.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/4_team2obj_5.storm.output new file mode 100644 index 000000000..289b7066f --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/4_team2obj_5.storm.output @@ -0,0 +1,233 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s team/team2obj_5.nm -prop team/team2obj_5_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 907993 +Transitions: 1084752 +Choices: 1078873 +Reward Models: w_1_total +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) +choice labels: no +Size in memory: 57913 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))], R[exp]{"w_1_total"}>=2.753061224 [C]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 907993 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 907993 states, where 803593 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"w_1_total"}>=2.75306 [C]. +DEBUG (SparseMultiObjectivePreprocessor.cpp:468): Maximal end component decomposition for ensuring positive reward finiteness took 1232.84 seconds. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))], R[exp]{"w_1_total"}>=2.75306 [C]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.75306 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.75306, intern reward model: objective2 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 907993 +Transitions: 1084752 +Choices: 1078873 +Reward Models: w_1_total +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) +choice labels: no +Size in memory: 57913 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 907993 +Transitions: 1084752 +Choices: 1078873 +Reward Models: objective1, objective2 +Labels: 4 + * prob1 -> 907993 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) +choice labels: no +Size in memory: 42678 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, 2.75306 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 907993 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 521897 of 907993 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 521897 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 521896 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 19 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 621328 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 286665 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 536737 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 386096 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 521897 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 958713 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 0.87483, 2.89796 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 0.87483, 2.89796 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= 2.89796 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= 0.87483 + ( 0, 1) * x <= 2.89796 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.87483. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0.87483, 2.75306 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 907993 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 305769 of 907993 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 305769 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 305768 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 16 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 602224 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 305769 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 575681 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 402568 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 505425 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 925769 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ 1, 2.77551 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ 1, 2.77551 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= 2.89796 + ( 1, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= 2.89796 + ( 1, 0) * x <= 1 + ( 1, 1.02222) * x <= 3.83719 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 1. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))], R[exp]{"w_1_total"}>=2.75306 [C]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.75306 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.75306, intern reward model: objective2 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 907993 +Transitions: 1084752 +Choices: 1078873 +Reward Models: w_1_total +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) +choice labels: no +Size in memory: 57913 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 907993 +Transitions: 1084752 +Choices: 1078873 +Reward Models: objective1, objective2 +Labels: 4 + * prob1 -> 907993 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) +choice labels: no +Size in memory: 42678 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[1] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 1233.33 + Value Iterations: 5.671 + Postprocessing: 0.012 + Combined: 1239.02 + +Performed Refinement Steps: 2 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [1] +===== Statistics ============================== +peak memory usage: 670MB +CPU time: 518.407 seconds +=============================================== +OVERALL_TIME; 1256.069 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/5_team3obj_3.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/5_team3obj_3.storm.output new file mode 100644 index 000000000..2402d945a --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/5_team3obj_3.storm.output @@ -0,0 +1,307 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s team/team3obj_3.nm -prop team/team3obj_3_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 12475 +Transitions: 15228 +Choices: 14935 +Reward Models: w_1_total +Labels: 4 + * deadlock -> 0 state(s) + * ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))))) -> 546 state(s) + * init -> 1 state(s) + * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) +choice labels: no +Size in memory: 507 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))], R[exp]{"w_1_total"}>=2.210204082 [C], P>=0.5 [F ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3)))))]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 12475 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 12475 states, where 11383 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"w_1_total"}>=2.2102 [C]. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.5 [F ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3)))))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 12475 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 12475 states, where 11383 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:468): Maximal end component decomposition for ensuring positive reward finiteness took 0.042 seconds. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))], R[exp]{"w_1_total"}>=2.2102 [C], P>=0.5 [F ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3)))))]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.2102 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.2102, intern reward model: objective2 (positive), time bounds: none) +P>=0.5 [F ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3)))))] (toOrigVal: 1*x + 0, intern threshold:>= 0.5, intern reward model: objective3 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 12475 +Transitions: 15228 +Choices: 14935 +Reward Models: w_1_total +Labels: 4 + * deadlock -> 0 state(s) + * ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))))) -> 546 state(s) + * init -> 1 state(s) + * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) +choice labels: no +Size in memory: 507 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 12475 +Transitions: 15228 +Choices: 14935 +Reward Models: objective3, objective2, objective1 +Labels: 5 + * deadlock -> 0 state(s) + * ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))))) -> 546 state(s) + * prob1 -> 12475 state(s) + * init -> 1 state(s) + * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) +choice labels: no +Size in memory: 712 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (3) [ 0, 2.2102, 0.5 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (3) [ 0, 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 12475 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 5755 of 12475 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 5755 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 5754 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 13 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 9672 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 2803 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 5371 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 6720 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 5755 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 10783 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 9924 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 2551 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 4801 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (3) [ 0.734694, 2.32653, 0.510204 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (3) [ 0.734694, 2.32653, 0.510204 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1, 0) * x <= 2.32653 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0, 0) * x <= 0.734694 + ( 0, 1, 0) * x <= 2.32653 + ( 0, 0, 1) * x <= 0.510204 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.734694. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (3) [ 0.734694, 2.2102, 0.5 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (3) [ 1, 0, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (3) [ 1, 0, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 12475 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 3139 of 12475 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 3139 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 3138 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 12 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 9336 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 3139 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 6121 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 7134 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 5341 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 9955 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 10674 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 1801 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 3223 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (3) [ 1, 2.02041, 0.244898 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (3) [ 1, 2.02041, 0.244898 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1, 0) * x <= 2.32653 + ( 1, 0, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 5 Halfspaces: + ( 0, 1, 0) * x <= 2.32653 + ( 1, 0.866667, 0) * x <= 2.75102 + ( 0, 0, 1) * x <= 0.510204 + ( 1, 0, 1) * x <= 1.2449 + ( 1, 0, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.744898. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.255102 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (3) [ 0.744898, 2.2102, 0.5 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (3) [ 1, 0, 1 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (3) [ 0.5, 0, 0.5 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 12475 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 4735 of 12475 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 4735 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 4734 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 12 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 9336 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 3139 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 6121 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 6720 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 5755 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 10783 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 10260 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 2215 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 4051 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (3) [ 1, 2.02041, 0.244898 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (3) [ 1, 2.02041, 0.244898 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1, 0) * x <= 2.32653 + ( 1, 0, 0) * x <= 1 + ( 0.5, 0, 0.5) * x <= 0.622449 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 5 Halfspaces: + ( 0, 1, 0) * x <= 2.32653 + ( 1, 0.866667, 0) * x <= 2.75102 + ( 1, 0, 0) * x <= 1 + ( 0, 0, 1) * x <= 0.510204 + ( 1, 0, 1) * x <= 1.2449 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.744898. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))], R[exp]{"w_1_total"}>=2.2102 [C], P>=0.5 [F ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3)))))]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.2102 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.2102, intern reward model: objective2 (positive), time bounds: none) +P>=0.5 [F ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3)))))] (toOrigVal: 1*x + 0, intern threshold:>= 0.5, intern reward model: objective3 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 12475 +Transitions: 15228 +Choices: 14935 +Reward Models: w_1_total +Labels: 4 + * deadlock -> 0 state(s) + * ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))))) -> 546 state(s) + * init -> 1 state(s) + * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) +choice labels: no +Size in memory: 507 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 12475 +Transitions: 15228 +Choices: 14935 +Reward Models: objective3, objective2, objective1 +Labels: 5 + * deadlock -> 0 state(s) + * ((((status = 5) & ((t2_r1 = 1) => ((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))))) & ((t2_r2 = 1) => ((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))))) & ((t2_r3 = 1) => ((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))))) -> 546 state(s) + * prob1 -> 12475 state(s) + * init -> 1 state(s) + * ((((status = 5) & ((t1_r1 = 1) => ((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))))) & ((t1_r2 = 1) => ((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))))) & ((t1_r3 = 1) => ((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))))) -> 546 state(s) +choice labels: no +Size in memory: 712 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.744898] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.052 + Value Iterations: 0.059 + Postprocessing: 0 + Combined: 0.111 + +Performed Refinement Steps: 3 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.7448979592] +===== Statistics ============================== +peak memory usage: 205MB +CPU time: 0.348 seconds +=============================================== +OVERALL_TIME; 0.414 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/5_team3obj_4.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/5_team3obj_4.storm.output new file mode 100644 index 000000000..8ee65042a --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/5_team3obj_4.storm.output @@ -0,0 +1,360 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s team/team3obj_4.nm -prop team/team3obj_4_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 96665 +Transitions: 116464 +Choices: 115289 +Reward Models: w_1_total +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))))) -> 4872 state(s) + * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) +choice labels: no +Size in memory: 4020 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))], R[exp]{"w_1_total"}>=2.423469388 [C], P>=0.5 [F ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3)))))]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 96665 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 96665 states, where 86921 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"w_1_total"}>=2.42347 [C]. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.5 [F ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3)))))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 96665 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 96665 states, where 86921 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:468): Maximal end component decomposition for ensuring positive reward finiteness took 9.356 seconds. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))], R[exp]{"w_1_total"}>=2.42347 [C], P>=0.5 [F ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3)))))]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.42347 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.42347, intern reward model: objective2 (positive), time bounds: none) +P>=0.5 [F ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3)))))] (toOrigVal: 1*x + 0, intern threshold:>= 0.5, intern reward model: objective3 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 96665 +Transitions: 116464 +Choices: 115289 +Reward Models: w_1_total +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))))) -> 4872 state(s) + * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) +choice labels: no +Size in memory: 4020 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 96665 +Transitions: 116464 +Choices: 115289 +Reward Models: objective3, objective2, objective1 +Labels: 5 + * deadlock -> 0 state(s) + * prob1 -> 96665 state(s) + * init -> 1 state(s) + * ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))))) -> 4872 state(s) + * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) +choice labels: no +Size in memory: 5481 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (3) [ 0, 2.42347, 0.5 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (3) [ 0, 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 96665 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 50057 of 96665 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 50057 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 50056 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 16 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 70864 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 25801 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 48597 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 46608 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 50057 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 92505 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 72448 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 24217 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 45269 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (3) [ 0.782313, 2.55102, 0.646259 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (3) [ 0.782313, 2.55102, 0.646259 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1, 0) * x <= 2.55102 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0, 0) * x <= 0.782313 + ( 0, 1, 0) * x <= 2.55102 + ( 0, 0, 1) * x <= 0.646259 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.782313. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (3) [ 0.782313, 2.42347, 0.5 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (3) [ 1, 0, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (3) [ 1, 0, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 96665 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 28197 of 96665 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 28197 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 28196 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 14 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 68468 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 28197 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 53645 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 48956 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 47709 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 87809 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 77192 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 19473 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 35525 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (3) [ 1, 2.32653, 0.428571 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (3) [ 1, 2.32653, 0.428571 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1, 0) * x <= 2.55102 + ( 1, 0, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 5 Halfspaces: + ( 0, 1, 0) * x <= 2.55102 + ( 1, 0.969697, 0) * x <= 3.25603 + ( 0, 0, 1) * x <= 0.646259 + ( 1, 0, 1) * x <= 1.42857 + ( 1, 0, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.905999. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.0940012 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (3) [ 0.905999, 2.42347, 0.5 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (3) [ 1, 0.969697, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (3) [ 0.507692, 0.492308, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 96665 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 50057 of 96665 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 50057 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 50056 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 16 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 69008 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 27657 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 52517 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 46608 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 50057 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 92505 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 74304 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 22361 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 41349 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (3) [ 0.959184, 2.40816, 0.469388 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (3) [ 0.959184, 2.40816, 0.469388 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1, 0) * x <= 2.55102 + ( 1, 0, 0) * x <= 1 + ( 0.507692, 0.492308, 0) * x <= 1.67253 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 7 Halfspaces: + ( 0, 1, 0) * x <= 2.55102 + ( 0, 0, 1) * x <= 0.646259 + ( 1, 0, 1) * x <= 1.42857 + ( 1, 0, 0) * x <= 1 + ( 1, 0, 1) * x <= 1.42857 + ( 1, 1.2381, 0) * x <= 3.94072 + ( 1, 0.5, 0) * x <= 2.16327 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.928571. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.0157699 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (3) [ 0.928571, 2.42347, 0.5 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (3) [ 1, 0, 1 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (3) [ 0.5, 0, 0.5 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 96665 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 41273 of 96665 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 41273 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 41272 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 15 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 68468 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 28197 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 53645 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 46608 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 50057 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 92505 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 74844 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 21821 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 40221 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (3) [ 1, 2.32653, 0.428571 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (3) [ 1, 2.32653, 0.428571 ] + WARN (SparseMultiObjectiveHelper.cpp:299): Numerical issues: The overapproximation would not contain the underapproximation. Hence, a halfspace is shifted by 3.74407e-16. +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 4 Halfspaces: + ( 0, 1, 0) * x <= 2.55102 + ( 1, 0, 0) * x <= 1 + ( 0.507692, 0.492308, 0) * x <= 1.67253 + ( 0.5, 0, 0.5) * x <= 0.714286 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 7 Halfspaces: + ( 0, 0, 1) * x <= 0.646259 + ( 1, 0, 0) * x <= 1 + ( 0, 1, 0) * x <= 2.55102 + ( 1, 0, 1) * x <= 1.42857 + ( 1, 0, 1) * x <= 1.42857 + ( 1, 0.5, 0) * x <= 2.16327 + ( 1, 1.2381, 0) * x <= 3.94072 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.928571. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))], R[exp]{"w_1_total"}>=2.42347 [C], P>=0.5 [F ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3)))))]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.42347 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.42347, intern reward model: objective2 (positive), time bounds: none) +P>=0.5 [F ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3)))))] (toOrigVal: 1*x + 0, intern threshold:>= 0.5, intern reward model: objective3 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 96665 +Transitions: 116464 +Choices: 115289 +Reward Models: w_1_total +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))))) -> 4872 state(s) + * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) +choice labels: no +Size in memory: 4020 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 96665 +Transitions: 116464 +Choices: 115289 +Reward Models: objective3, objective2, objective1 +Labels: 5 + * deadlock -> 0 state(s) + * prob1 -> 96665 state(s) + * init -> 1 state(s) + * ((((status = 6) & ((t2_r1 = 1) => (((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))))) & ((t2_r2 = 1) => (((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))))) & ((t2_r3 = 1) => (((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))))) -> 4872 state(s) + * ((((status = 6) & ((t1_r1 = 1) => (((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))))) & ((t1_r2 = 1) => (((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))))) & ((t1_r3 = 1) => (((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))))) -> 4872 state(s) +choice labels: no +Size in memory: 5481 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[0.928571] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 9.445 + Value Iterations: 0.69 + Postprocessing: 0.001 + Combined: 10.137 + +Performed Refinement Steps: 4 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [0.9285714286] +===== Statistics ============================== +peak memory usage: 223MB +CPU time: 5.952 seconds +=============================================== +OVERALL_TIME; 11.815 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/5_team3obj_5.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/5_team3obj_5.storm.output new file mode 100644 index 000000000..aa8619ab4 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/5_team3obj_5.storm.output @@ -0,0 +1,260 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s team/team3obj_5.nm -prop team/team3obj_5_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 907993 +Transitions: 1084752 +Choices: 1078873 +Reward Models: w_1_total +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3))))) -> 52200 state(s) + * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) +choice labels: no +Size in memory: 58024 kbytes +-------------------------------------------------------------- + +Model checking property: multi(Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))], R[exp]{"w_1_total"}>=2.753061224 [C], P>=0.5 [F ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3)))))]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 907993 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 907993 states, where 803593 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"w_1_total"}>=2.75306 [C]. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective P>=0.5 [F ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3)))))]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 907993 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 907993 states, where 803593 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:468): Maximal end component decomposition for ensuring positive reward finiteness took 1306.54 seconds. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))], R[exp]{"w_1_total"}>=2.75306 [C], P>=0.5 [F ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3)))))]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.75306 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.75306, intern reward model: objective2 (positive), time bounds: none) +P>=0.5 [F ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3)))))] (toOrigVal: 1*x + 0, intern threshold:>= 0.5, intern reward model: objective3 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 907993 +Transitions: 1084752 +Choices: 1078873 +Reward Models: w_1_total +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3))))) -> 52200 state(s) + * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) +choice labels: no +Size in memory: 58024 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 907993 +Transitions: 1084752 +Choices: 1078873 +Reward Models: objective3, objective2, objective1 +Labels: 5 + * prob1 -> 907993 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3))))) -> 52200 state(s) + * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) +choice labels: no +Size in memory: 51218 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (3) [ 0, 2.75306, 0.5 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (3) [ 0, 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 907993 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 521897 of 907993 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 521897 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 521896 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 19 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 621328 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 286665 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 536737 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 386096 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 521897 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 958713 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 634992 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 273001 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 508961 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (3) [ 0.87483, 2.89796, 0.798639 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (3) [ 0.87483, 2.89796, 0.798639 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1, 0) * x <= 2.89796 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0, 0) * x <= 0.87483 + ( 0, 1, 0) * x <= 2.89796 + ( 0, 0, 1) * x <= 0.798639 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 0.87483. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (3) [ 0.87483, 2.75306, 0.5 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (3) [ 1, 0, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (3) [ 1, 0, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 907993 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 305769 of 907993 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 305769 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 305768 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 16 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 602224 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 305769 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 575681 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 0 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 402568 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 505425 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 925769 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 670568 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 237425 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 437073 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 1 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (3) [ 1, 2.77551, 0.673469 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (3) [ 1, 2.77551, 0.673469 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1, 0) * x <= 2.89796 + ( 1, 0, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 5 Halfspaces: + ( 0, 1, 0) * x <= 2.89796 + ( 1, 1.02222, 0) * x <= 3.83719 + ( 0, 0, 1) * x <= 0.798639 + ( 1, 0, 1) * x <= 1.67347 + ( 1, 0, 0) * x <= 1 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is 1. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))], R[exp]{"w_1_total"}>=2.75306 [C], P>=0.5 [F ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3)))))]) + +Objectives: +-------------------------------------------------------------- +Pmax=? [F ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3)))))] (toOrigVal: 1*x + 0, intern threshold: none, intern reward model: objective1 (positive), time bounds: none) +R[exp]{"w_1_total"}>=2.75306 [C] (toOrigVal: 1*x + 0, intern threshold:>=2.75306, intern reward model: objective2 (positive), time bounds: none) +P>=0.5 [F ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3)))))] (toOrigVal: 1*x + 0, intern threshold:>= 0.5, intern reward model: objective3 (positive), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 907993 +Transitions: 1084752 +Choices: 1078873 +Reward Models: w_1_total +Labels: 4 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3))))) -> 52200 state(s) + * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) +choice labels: no +Size in memory: 58024 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 907993 +Transitions: 1084752 +Choices: 1078873 +Reward Models: objective3, objective2, objective1 +Labels: 5 + * prob1 -> 907993 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) + * ((((status = 7) & ((t2_r1 = 1) => ((((((m1_t2 = 1) & (1 = 1)) | ((m2_t2 = 1) & (2 = 1))) | ((m3_t2 = 1) & (3 = 1))) | ((m4_t2 = 1) & (1 = 1))) | ((m5_t2 = 1) & (2 = 1))))) & ((t2_r2 = 1) => ((((((m1_t2 = 1) & (1 = 2)) | ((m2_t2 = 1) & (2 = 2))) | ((m3_t2 = 1) & (3 = 2))) | ((m4_t2 = 1) & (1 = 2))) | ((m5_t2 = 1) & (2 = 2))))) & ((t2_r3 = 1) => ((((((m1_t2 = 1) & (1 = 3)) | ((m2_t2 = 1) & (2 = 3))) | ((m3_t2 = 1) & (3 = 3))) | ((m4_t2 = 1) & (1 = 3))) | ((m5_t2 = 1) & (2 = 3))))) -> 52200 state(s) + * ((((status = 7) & ((t1_r1 = 1) => ((((((m1_t1 = 1) & (1 = 1)) | ((m2_t1 = 1) & (2 = 1))) | ((m3_t1 = 1) & (3 = 1))) | ((m4_t1 = 1) & (1 = 1))) | ((m5_t1 = 1) & (2 = 1))))) & ((t1_r2 = 1) => ((((((m1_t1 = 1) & (1 = 2)) | ((m2_t1 = 1) & (2 = 2))) | ((m3_t1 = 1) & (3 = 2))) | ((m4_t1 = 1) & (1 = 2))) | ((m5_t1 = 1) & (2 = 2))))) & ((t1_r3 = 1) => ((((((m1_t1 = 1) & (1 = 3)) | ((m2_t1 = 1) & (2 = 3))) | ((m3_t1 = 1) & (3 = 3))) | ((m4_t1 = 1) & (1 = 3))) | ((m5_t1 = 1) & (2 = 3))))) -> 52200 state(s) +choice labels: no +Size in memory: 51218 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[1] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 1307.41 + Value Iterations: 6.224 + Postprocessing: 0.014 + Combined: 1313.65 + +Performed Refinement Steps: 2 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [1] +===== Statistics ============================== +peak memory usage: 692MB +CPU time: 522.833 seconds +=============================================== +OVERALL_TIME; 1330.854 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/6_scheduler05.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/6_scheduler05.storm.output new file mode 100644 index 000000000..f3cdfbed5 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/6_scheduler05.storm.output @@ -0,0 +1,234 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s scheduler/scheduler05.nm -prop scheduler/scheduler05_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 31965 +Transitions: 60434 +Choices: 57965 +Reward Models: time, energy +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * tasks_complete -> 390 state(s) +choice labels: no +Size in memory: 2453 kbytes +-------------------------------------------------------------- + +Model checking property: multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"time"}min=? [F "tasks_complete"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 31965 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 31965 states, where 31575 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"energy"}<=1.45 [F "tasks_complete"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 31965 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 31965 states, where 31575 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) + +Objectives: +-------------------------------------------------------------- +R[exp]{"time"}min=? [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds: none) +R[exp]{"energy"}<=1.45 [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold:>=-1.45, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 31965 +Transitions: 60434 +Choices: 57965 +Reward Models: time, energy +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * tasks_complete -> 390 state(s) +choice labels: no +Size in memory: 2453 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 31965 +Transitions: 60434 +Choices: 57965 +Reward Models: objective2, objective1 +Labels: 4 + * tasks_complete -> 390 state(s) + * prob1 -> 390 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 2318 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -1.45 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 31965 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 31528 of 31965 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 31528 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 59926 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 208 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 437 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 31528 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 65414 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 17 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 437 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 31528 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 65414 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 18 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -14.6222, -1.22467 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -14.6222, -1.22467 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= -1.22467 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= -14.6222 + ( 0, 1) * x <= -1.22467 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -14.6222. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -14.6222, -1.45 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 31965 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 31528 of 31965 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 31528 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 59926 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 109 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 437 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 31528 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 65414 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 10 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 437 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 31528 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 65414 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 10 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -11.7778, -1.336 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -11.7778, -1.336 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= -1.22467 + ( 1, 0) * x <= -11.7778 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= -11.7778 + ( 0, 1) * x <= -1.22467 + ( 1, 25.5489) * x <= -45.9111 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -11.7778. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) + +Objectives: +-------------------------------------------------------------- +R[exp]{"time"}min=? [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds: none) +R[exp]{"energy"}<=1.45 [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold:>=-1.45, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 31965 +Transitions: 60434 +Choices: 57965 +Reward Models: time, energy +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * tasks_complete -> 390 state(s) +choice labels: no +Size in memory: 2453 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 31965 +Transitions: 60434 +Choices: 57965 +Reward Models: objective2, objective1 +Labels: 4 + * tasks_complete -> 390 state(s) + * prob1 -> 390 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 2318 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[11.7778] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0.036 + Value Iterations: 0.415 + Postprocessing: 0 + Combined: 0.451 + +Performed Refinement Steps: 2 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [11.77777778] +===== Statistics ============================== +peak memory usage: 223MB +CPU time: 1.049 seconds +=============================================== +OVERALL_TIME; 1.153 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/6_scheduler25.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/6_scheduler25.storm.output new file mode 100644 index 000000000..8cd540e97 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/6_scheduler25.storm.output @@ -0,0 +1,234 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s scheduler/scheduler25.nm -prop scheduler/scheduler25_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 633735 +Transitions: 1179444 +Choices: 1168375 +Reward Models: time, energy +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * tasks_complete -> 7930 state(s) +choice labels: no +Size in memory: 67640 kbytes +-------------------------------------------------------------- + +Model checking property: multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"time"}min=? [F "tasks_complete"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 633735 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 633735 states, where 625805 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"energy"}<=1.45 [F "tasks_complete"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 633735 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 633735 states, where 625805 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) + +Objectives: +-------------------------------------------------------------- +R[exp]{"time"}min=? [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds: none) +R[exp]{"energy"}<=1.45 [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold:>=-1.45, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 633735 +Transitions: 1179444 +Choices: 1168375 +Reward Models: time, energy +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * tasks_complete -> 7930 state(s) +choice labels: no +Size in memory: 67640 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 633735 +Transitions: 1179444 +Choices: 1168375 +Reward Models: objective2, objective1 +Labels: 4 + * tasks_complete -> 7930 state(s) + * prob1 -> 7930 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 46122 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -1.45 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 633735 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 625598 of 633735 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 625598 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 1170996 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 1008 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 8137 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 625598 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 1261914 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 16 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 8137 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 625598 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 1261914 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 18 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -15.2356, -1.20498 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -15.2356, -1.20498 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= -1.20498 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= -15.2356 + ( 0, 1) * x <= -1.20498 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -15.2356. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -15.2356, -1.45 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 633735 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 625598 of 633735 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 625598 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 1170996 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 449 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 8137 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 625598 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 1261914 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 10 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 8137 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 625598 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 1261914 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 10 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -11.6593, -1.33031 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -11.6593, -1.33031 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= -1.20498 + ( 1, 0) * x <= -11.6593 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= -11.6593 + ( 0, 1) * x <= -1.20498 + ( 1, 28.5343) * x <= -49.6187 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -11.6593. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) + +Objectives: +-------------------------------------------------------------- +R[exp]{"time"}min=? [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds: none) +R[exp]{"energy"}<=1.45 [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold:>=-1.45, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 633735 +Transitions: 1179444 +Choices: 1168375 +Reward Models: time, energy +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * tasks_complete -> 7930 state(s) +choice labels: no +Size in memory: 67640 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 633735 +Transitions: 1179444 +Choices: 1168375 +Reward Models: objective2, objective1 +Labels: 4 + * tasks_complete -> 7930 state(s) + * prob1 -> 7930 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 46122 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[11.6593] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 1.079 + Value Iterations: 23.947 + Postprocessing: 0.014 + Combined: 25.04 + +Performed Refinement Steps: 2 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [11.65925926] +===== Statistics ============================== +peak memory usage: 634MB +CPU time: 36.020 seconds +=============================================== +OVERALL_TIME; 37.011 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/6_scheduler50.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/6_scheduler50.storm.output new file mode 100644 index 000000000..53cacbf77 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/6_scheduler50.storm.output @@ -0,0 +1,234 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s scheduler/scheduler50.nm -prop scheduler/scheduler50_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 2457510 +Transitions: 4564394 +Choices: 4542575 +Reward Models: time, energy +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * tasks_complete -> 30855 state(s) +choice labels: no +Size in memory: 268485 kbytes +-------------------------------------------------------------- + +Model checking property: multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"time"}min=? [F "tasks_complete"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 2457510 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 2457510 states, where 2426655 are in the first copy. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"energy"}<=1.45 [F "tasks_complete"]. +DEBUG (StateDuplicator.h:54): Invoked state duplicator on model with 2457510 states. +DEBUG (StateDuplicator.h:80): State duplicator is done. Resulting model has 2457510 states, where 2426655 are in the first copy. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) + +Objectives: +-------------------------------------------------------------- +R[exp]{"time"}min=? [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds: none) +R[exp]{"energy"}<=1.45 [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold:>=-1.45, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 2457510 +Transitions: 4564394 +Choices: 4542575 +Reward Models: time, energy +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * tasks_complete -> 30855 state(s) +choice labels: no +Size in memory: 268485 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 2457510 +Transitions: 4564394 +Choices: 4542575 +Reward Models: objective2, objective1 +Labels: 4 + * tasks_complete -> 30855 state(s) + * prob1 -> 30855 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 178985 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -1.45 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 2457510 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 2426248 of 2457510 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 2426248 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 4532521 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 2008 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 31262 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 2426248 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 4873664 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 16 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 31262 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 2426248 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 4873664 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 18 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -14.7289, -1.20249 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -14.7289, -1.20249 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= -1.20249 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= -14.7289 + ( 0, 1) * x <= -1.20249 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -14.7289. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -14.7289, -1.45 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (EndComponentEliminator.h:39): Invoked EndComponentEliminator on matrix with 2457510 row groups. +DEBUG (EndComponentEliminator.h:50): Found 0 end components to eliminate. Keeping 2426248 of 2457510 original states. +DEBUG (EndComponentEliminator.h:86): EndComponentEliminator is done. Resulting matrix has 2426248 row groups. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 4532521 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (StandardMinMaxLinearEquationSolver.cpp:279): Iterative solver converged after 874 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 31262 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 2426248 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 4873664 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 10 iterations. + INFO (SparseDtmcPrctlHelper.cpp:182): Found 0 'infinity' states. + INFO (SparseDtmcPrctlHelper.cpp:183): Found 31262 'target' states. + INFO (SparseDtmcPrctlHelper.cpp:184): Found 2426248 'maybe' states. +DEBUG (GmmxxAdapter.h:26): Converting matrix with 4873664 non-zeros to gmm++ format. +DEBUG (GmmxxAdapter.h:50): Done converting matrix to gmm++ format. + INFO (GmmxxLinearEquationSolver.cpp:141): Using method 'GMRES' with preconditioner 'ilu' (max. 20000 iterations). + INFO (GmmxxLinearEquationSolver.cpp:178): Iterative solver converged after 10 iterations. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -11.6444, -1.3296 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -11.6444, -1.3296 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= -1.20249 + ( 1, 0) * x <= -11.6444 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= -11.6444 + ( 0, 1) * x <= -1.20249 + ( 1, 24.2657) * x <= -43.9082 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -11.6444. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"time"}min=? [F "tasks_complete"], R[exp]{"energy"}<=1.45 [F "tasks_complete"]) + +Objectives: +-------------------------------------------------------------- +R[exp]{"time"}min=? [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds: none) +R[exp]{"energy"}<=1.45 [F "tasks_complete"] (toOrigVal: -1*x + 0, intern threshold:>=-1.45, intern reward model: objective2 (negative), time bounds: none) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 2457510 +Transitions: 4564394 +Choices: 4542575 +Reward Models: time, energy +Labels: 3 + * deadlock -> 0 state(s) + * init -> 1 state(s) + * tasks_complete -> 30855 state(s) +choice labels: no +Size in memory: 268485 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 2457510 +Transitions: 4564394 +Choices: 4542575 +Reward Models: objective2, objective1 +Labels: 4 + * tasks_complete -> 30855 state(s) + * prob1 -> 30855 state(s) + * init -> 1 state(s) + * deadlock -> 0 state(s) +choice labels: no +Size in memory: 178985 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[11.6444] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 5.662 + Value Iterations: 177.144 + Postprocessing: 0.055 + Combined: 182.861 + +Performed Refinement Steps: 2 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [11.64444444] +===== Statistics ============================== +peak memory usage: 2105MB +CPU time: 223.708 seconds +=============================================== +OVERALL_TIME; 228.263 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/7_dpm100.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/7_dpm100.storm.output new file mode 100644 index 000000000..b53013d8b --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/7_dpm100.storm.output @@ -0,0 +1,269 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s dpm/dpm100.nm -prop dpm/dpm100_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: queue, power +Labels: 2 + * deadlock -> 0 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 109 kbytes +-------------------------------------------------------------- + +Model checking property: multi(R[exp]{"power"}min=? [C<=100], R[exp]{"queue"}<=70 [C<=100]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"power"}min=? [C<=100]. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"queue"}<=70 [C<=100]. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"power"}min=? [C<=100], R[exp]{"queue"}<=70 [C<=100]) + +Objectives: +-------------------------------------------------------------- + R[exp]{"power"}min=? [C<=100] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds:<= 100) + R[exp]{"queue"}<=70 [C<=100] (toOrigVal: -1*x + 0, intern threshold:>= -70, intern reward model: objective2 (negative), time bounds:<= 100) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: queue, power +Labels: 2 + * deadlock -> 0 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 109 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: objective2, objective1 +Labels: 3 + * deadlock -> 0 state(s) + * prob1 -> 636 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 83 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -70 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -122.6, -69.9753 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -122.6, -69.9753 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= -69.9753 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= -122.6 + ( 0, 1) * x <= -69.9753 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -122.6. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -122.6, -70 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -5, -73.2118 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -5, -73.2118 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= -69.9753 + ( 1, 0) * x <= -5 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= -5 + ( 0, 1) * x <= -69.9753 + ( 1, 36.336) * x <= -2665.22 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -121.704. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 116.704 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -121.704, -70 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 36.336 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.0267838, 0.973216 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -36.1428, -72.3171 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -36.1428, -72.3171 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= -69.9753 + ( 1, 0) * x <= -5 + ( 0.0267838, 0.973216) * x <= -71.3482 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 1, 0) * x <= -5 + ( 1, 34.8095) * x <= -2553.47 + ( 0, 1) * x <= -69.9753 + ( 1, 36.9192) * x <= -2706.03 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -121.69. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 1.35135 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -121.69, -70 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 36.9192 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.0263719, 0.973628 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -122.523, -69.9753 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -122.523, -69.9753 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= -69.9753 + ( 1, 0) * x <= -5 + ( 0.0267838, 0.973216) * x <= -71.3482 + ( 0.0263719, 0.973628) * x <= -71.3611 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= -69.9753 + ( 1, 0) * x <= -5 + ( 1, 34.8095) * x <= -2553.47 + ( 1, 36.8864) * x <= -2703.66 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -121.614. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.000809282 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -121.614, -70 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 36.8864 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.0263947, 0.973605 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -44.1149, -72.0995 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -44.1149, -72.0995 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 5 Halfspaces: + ( 0, 1) * x <= -69.9753 + ( 1, 0) * x <= -5 + ( 0.0267838, 0.973216) * x <= -71.3482 + ( 0.0263719, 0.973628) * x <= -71.3611 + ( 0.0263947, 0.973605) * x <= -71.3608 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 5 Halfspaces: + ( 0, 1) * x <= -69.9753 + ( 1, 0) * x <= -5 + ( 1, 34.8095) * x <= -2553.47 + ( 1, 36.622) * x <= -2684.54 + ( 1, 36.9135) * x <= -2705.56 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -121.613. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.000141228 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -121.613, -70 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 36.9135 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.0263758, 0.973624 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -44.1149, -72.0995 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -44.1149, -72.0995 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 6 Halfspaces: + ( 0, 1) * x <= -69.9753 + ( 1, 0) * x <= -5 + ( 0.0267838, 0.973216) * x <= -71.3482 + ( 0.0263719, 0.973628) * x <= -71.3611 + ( 0.0263947, 0.973605) * x <= -71.3608 + ( 0.0263758, 0.973624) * x <= -71.3613 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 5 Halfspaces: + ( 0, 1) * x <= -69.9753 + ( 1, 0) * x <= -5 + ( 1, 34.8095) * x <= -2553.47 + ( 1, 36.622) * x <= -2684.54 + ( 1, 36.9135) * x <= -2705.56 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -121.613. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"power"}min=? [C<=100], R[exp]{"queue"}<=70 [C<=100]) + +Objectives: +-------------------------------------------------------------- + R[exp]{"power"}min=? [C<=100] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds:<= 100) + R[exp]{"queue"}<=70 [C<=100] (toOrigVal: -1*x + 0, intern threshold:>= -70, intern reward model: objective2 (negative), time bounds:<= 100) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: queue, power +Labels: 2 + * deadlock -> 0 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 109 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: objective2, objective1 +Labels: 3 + * deadlock -> 0 state(s) + * prob1 -> 636 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 83 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[121.613] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0 + Value Iterations: 0.058 + Postprocessing: 0 + Combined: 0.059 + +Performed Refinement Steps: 6 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [121.6128842] +===== Statistics ============================== +peak memory usage: 195MB +CPU time: 0.133 seconds +=============================================== +OVERALL_TIME; 0.192 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/7_dpm200.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/7_dpm200.storm.output new file mode 100644 index 000000000..58d76d5c9 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/7_dpm200.storm.output @@ -0,0 +1,245 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s dpm/dpm200.nm -prop dpm/dpm200_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: queue, power +Labels: 2 + * deadlock -> 0 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 109 kbytes +-------------------------------------------------------------- + +Model checking property: multi(R[exp]{"power"}min=? [C<=200], R[exp]{"queue"}<=170 [C<=200]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"power"}min=? [C<=200]. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"queue"}<=170 [C<=200]. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"power"}min=? [C<=200], R[exp]{"queue"}<=170 [C<=200]) + +Objectives: +-------------------------------------------------------------- + R[exp]{"power"}min=? [C<=200] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds:<= 200) + R[exp]{"queue"}<=170 [C<=200] (toOrigVal: -1*x + 0, intern threshold:>= -170, intern reward model: objective2 (negative), time bounds:<= 200) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: queue, power +Labels: 2 + * deadlock -> 0 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 109 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: objective2, objective1 +Labels: 3 + * deadlock -> 0 state(s) + * prob1 -> 636 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 83 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -170 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -247.6, -158.306 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -247.6, -158.306 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= -158.306 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= -247.6 + ( 0, 1) * x <= -158.306 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -247.6. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -247.6, -170 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -10, -172.943 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -10, -172.943 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= -158.306 + ( 1, 0) * x <= -10 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= -10 + ( 0, 1) * x <= -158.306 + ( 1, 16.2326) * x <= -2817.32 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -57.7741. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 47.7741 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -57.7741, -170 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 16.2326 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.0580294, 0.941971 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -55.2849, -170.134 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -55.2849, -170.134 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= -158.306 + ( 1, 0) * x <= -10 + ( 0.0580294, 0.941971) * x <= -163.469 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 1, 0) * x <= -10 + ( 0, 1) * x <= -158.306 + ( 1, 16.1214) * x <= -2798.09 + ( 1, 16.259) * x <= -2821.5 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -57.4653. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.003541 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -57.4653, -170 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 16.259 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.0579407, 0.942059 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -247.448, -158.306 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -247.448, -158.306 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= -158.306 + ( 1, 0) * x <= -10 + ( 0.0580294, 0.941971) * x <= -163.469 + ( 0.0579407, 0.942059) * x <= -163.471 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= -158.306 + ( 1, 0) * x <= -10 + ( 1, 16.1214) * x <= -2798.09 + ( 1, 16.2462) * x <= -2819.31 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -57.4636. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.00181605 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -57.4636, -170 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 16.2462 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.0579839, 0.942016 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -55.2849, -170.134 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -55.2849, -170.134 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 5 Halfspaces: + ( 0, 1) * x <= -158.306 + ( 1, 0) * x <= -10 + ( 0.0580294, 0.941971) * x <= -163.469 + ( 0.0579407, 0.942059) * x <= -163.471 + ( 0.0579839, 0.942016) * x <= -163.475 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= -158.306 + ( 1, 0) * x <= -10 + ( 1, 16.1214) * x <= -2798.09 + ( 1, 16.2462) * x <= -2819.31 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -57.4636. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"power"}min=? [C<=200], R[exp]{"queue"}<=170 [C<=200]) + +Objectives: +-------------------------------------------------------------- + R[exp]{"power"}min=? [C<=200] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds:<= 200) + R[exp]{"queue"}<=170 [C<=200] (toOrigVal: -1*x + 0, intern threshold:>= -170, intern reward model: objective2 (negative), time bounds:<= 200) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: queue, power +Labels: 2 + * deadlock -> 0 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 109 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: objective2, objective1 +Labels: 3 + * deadlock -> 0 state(s) + * prob1 -> 636 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 83 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[57.4636] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0 + Value Iterations: 0.075 + Postprocessing: 0 + Combined: 0.075 + +Performed Refinement Steps: 5 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [57.46361957] +===== Statistics ============================== +peak memory usage: 195MB +CPU time: 0.149 seconds +=============================================== +OVERALL_TIME; 0.206 diff --git a/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/7_dpm300.storm.output b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/7_dpm300.storm.output new file mode 100644 index 000000000..216c9f6a7 --- /dev/null +++ b/examples/multiobjective/mdp/benchmarks_numerical/2016-07-10/storm/7_dpm300.storm.output @@ -0,0 +1,244 @@ +Storm +--------------- + +Version: 0.9.1 (+1985 commits) build from revision g7b2bf30. + +Linked with GNU Linear Programming Kit v4.57. +Linked with Microsoft Z3 Optimizer v4.4 Build 1 Rev 0. +Linked with SMT-RAT 2.1.0. +Linked with CARL. +Command line arguments: -s dpm/dpm300.nm -prop dpm/dpm300_numerical.pctl --precision 0.000001 --multiobjective:precision 0.0001 --debug +Current working directory: /Users/tim/storm/examples/multiobjective/mdp + +DEBUG (PrismParser.cpp:51): First pass of parsing PRISM input finished. +DEBUG (FormulaParser.cpp:243): Parsed formula successfully. +DEBUG (ExplicitModelBuilder.cpp:123): Exploration order is: breadth-first +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: queue, power +Labels: 2 + * deadlock -> 0 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 109 kbytes +-------------------------------------------------------------- + +Model checking property: multi(R[exp]{"power"}min=? [C<=300], R[exp]{"queue"}<=270 [C<=300]) ...DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"power"}min=? [C<=300]. +DEBUG (SparseMultiObjectivePreprocessor.cpp:30): Preprocessing objective R[exp]{"queue"}<=270 [C<=300]. +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:47): Preprocessing done. Data: +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"power"}min=? [C<=300], R[exp]{"queue"}<=270 [C<=300]) + +Objectives: +-------------------------------------------------------------- + R[exp]{"power"}min=? [C<=300] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds:<= 300) + R[exp]{"queue"}<=270 [C<=300] (toOrigVal: -1*x + 0, intern threshold:>= -270, intern reward model: objective2 (negative), time bounds:<= 300) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: queue, power +Labels: 2 + * deadlock -> 0 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 109 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: objective2, objective1 +Labels: 3 + * deadlock -> 0 state(s) + * prob1 -> 636 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 83 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ 0, -270 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0, 1 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -372.6, -239.656 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -372.6, -239.656 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 1 Halfspaces: + ( 0, 1) * x <= -239.656 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 2 Halfspaces: + ( 1, 0) * x <= -372.6 + ( 0, 1) * x <= -239.656 + +DEBUG (SparseMultiObjectiveHelper.cpp:128): Found a solution that satisfies the objective thresholds. +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -372.6. +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -372.6, -270 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 0 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 1, 0 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -15, -272.941 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -15, -272.941 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 2 Halfspaces: + ( 0, 1) * x <= -239.656 + ( 1, 0) * x <= -15 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 1, 0) * x <= -15 + ( 0, 1) * x <= -239.656 + ( 1, 10.7434) * x <= -2947.31 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -46.5983. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 31.5983 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -46.5983, -270 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 10.7434 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.0851543, 0.914846 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -372.379, -239.656 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -372.379, -239.656 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= -239.656 + ( 1, 0) * x <= -15 + ( 0.0851543, 0.914846) * x <= -250.958 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 3 Halfspaces: + ( 0, 1) * x <= -239.656 + ( 1, 0) * x <= -15 + ( 1, 10.7367) * x <= -2945.5 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -46.5788. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.201734 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -46.5788, -270 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 10.7367 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.0852025, 0.914797 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -51.208, -269.559 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -51.208, -269.559 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= -239.656 + ( 1, 0) * x <= -15 + ( 0.0851543, 0.914846) * x <= -250.958 + ( 0.0852025, 0.914797) * x <= -250.955 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= -239.656 + ( 1, 0) * x <= -15 + ( 1, 10.7048) * x <= -2936.78 + ( 1, 10.7404) * x <= -2946.37 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -46.4848. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0.0141013 +DEBUG (SparseMultiObjectiveHelper.cpp:204): Searching a weight vector to seperate the point given by vector (2) [ -46.4848, -270 ]. +DEBUG (SparseMultiObjectiveHelper.cpp:241): Found separating weight vector: vector (2) [ 1, 10.7048 ]. +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:39): Invoked WeightVectorChecker with weights + vector (2) [ 0.0854352, 0.914565 ] +DEBUG (SparseMultiObjectiveWeightVectorChecker.cpp:53): Weight vector check done. Lower bounds for results in initial state: vector (2) [ -15, -272.941 ] +DEBUG (SparseMultiObjectiveHelper.cpp:270): weighted objectives checker result (lower bounds) is vector (2) [ -15, -272.941 ] +DEBUG (SparseMultiObjectiveHelper.cpp:302): Updated OverApproximation to Polytope with 5 Halfspaces: + ( 0, 1) * x <= -239.656 + ( 1, 0) * x <= -15 + ( 0.0851543, 0.914846) * x <= -250.958 + ( 0.0852025, 0.914797) * x <= -250.955 + ( 0.0854352, 0.914565) * x <= -250.904 + +DEBUG (SparseMultiObjectiveHelper.cpp:313): Updated UnderApproximation to Polytope with 4 Halfspaces: + ( 0, 1) * x <= -239.656 + ( 1, 0) * x <= -15 + ( 1, 10.7048) * x <= -2936.78 + ( 1, 10.7404) * x <= -2946.37 + +DEBUG (SparseMultiObjectiveHelper.cpp:144): Best solution found so far is -46.4848. +DEBUG (SparseMultiObjectiveHelper.cpp:149): Solution can be improved by at most 0 +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:53): Modelchecking done. + INFO (SparseMultiObjectivePostprocessor.cpp:43): +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Preprocessor Data +--------------------------------------------------------------------------------------------------------------------------------------- + +Original Formula: +-------------------------------------------------------------- + multi(R[exp]{"power"}min=? [C<=300], R[exp]{"queue"}<=270 [C<=300]) + +Objectives: +-------------------------------------------------------------- + R[exp]{"power"}min=? [C<=300] (toOrigVal: -1*x + 0, intern threshold: none, intern reward model: objective1 (negative), time bounds:<= 300) + R[exp]{"queue"}<=270 [C<=300] (toOrigVal: -1*x + 0, intern threshold:>= -270, intern reward model: objective2 (negative), time bounds:<= 300) +-------------------------------------------------------------- + +Original Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: queue, power +Labels: 2 + * deadlock -> 0 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 109 kbytes +-------------------------------------------------------------- + +Preprocessed Model Information: +-------------------------------------------------------------- +Model type: MDP (sparse) +States: 636 +Transitions: 2550 +Choices: 1860 +Reward Models: objective2, objective1 +Labels: 3 + * deadlock -> 0 state(s) + * prob1 -> 636 state(s) + * init -> 1 state(s) +choice labels: no +Size in memory: 83 kbytes +-------------------------------------------------------------- + +--------------------------------------------------------------------------------------------------------------------------------------- + + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Result +--------------------------------------------------------------------------------------------------------------------------------------- + +[46.4848] + +--------------------------------------------------------------------------------------------------------------------------------------- + Multi-objective Model Checking Statistics +--------------------------------------------------------------------------------------------------------------------------------------- + +Recorded Runtimes (in seconds): + Preprocessing: 0 + Value Iterations: 0.103 + Postprocessing: 0 + Combined: 0.103 + +Performed Refinement Steps: 5 +Precision (Approximation): Goal precision: 0.0001 Achieved precision: 0 +Convergence precision for iterative solvers: 1e-06 + +--------------------------------------------------------------------------------------------------------------------------------------- + +DEBUG (SparseMdpMultiObjectiveModelChecker.cpp:57): Postprocessing done. + done. +Result (initial states): [46.48477804] +===== Statistics ============================== +peak memory usage: 195MB +CPU time: 0.177 seconds +=============================================== +OVERALL_TIME; 0.236