From 48fd9e7bdd823aabc85cb6da95eb7721b05c9d0f Mon Sep 17 00:00:00 2001 From: Dave Parker Date: Thu, 13 Jun 2013 00:03:20 +0000 Subject: [PATCH] Log output tweaks. git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@6917 bbc10eb1-c90d-0410-af57-cb519fbb1720 --- prism/src/explicit/CTMCModelChecker.java | 8 ++++---- prism/src/explicit/DTMCModelChecker.java | 10 +++++----- prism/src/explicit/MDPModelChecker.java | 6 +++--- prism/src/explicit/STPGModelChecker.java | 6 +++--- 4 files changed, 15 insertions(+), 15 deletions(-) diff --git a/prism/src/explicit/CTMCModelChecker.java b/prism/src/explicit/CTMCModelChecker.java index 6436d1e2..40c2724c 100644 --- a/prism/src/explicit/CTMCModelChecker.java +++ b/prism/src/explicit/CTMCModelChecker.java @@ -305,7 +305,7 @@ public class CTMCModelChecker extends DTMCModelChecker // Start backwards transient computation timer = System.currentTimeMillis(); - mainLog.println("Starting backwards transient probability computation..."); + mainLog.println("\nStarting backwards transient probability computation..."); // Store num states n = ctmc.getNumStates(); @@ -413,7 +413,7 @@ public class CTMCModelChecker extends DTMCModelChecker // Start backwards transient computation timer = System.currentTimeMillis(); - mainLog.println("Starting backwards cumulative rewards computation..."); + mainLog.println("\nStarting backwards cumulative rewards computation..."); CTMC ctmc = (CTMC) dtmc; @@ -538,7 +538,7 @@ public class CTMCModelChecker extends DTMCModelChecker // Start backwards transient computation timer = System.currentTimeMillis(); - mainLog.println("Starting backwards instantaneous rewards computation..."); + mainLog.println("\nStarting backwards instantaneous rewards computation..."); CTMC ctmc = (CTMC) dtmc; @@ -656,7 +656,7 @@ public class CTMCModelChecker extends DTMCModelChecker // Start bounded probabilistic reachability timer = System.currentTimeMillis(); - mainLog.println("Starting transient probability computation..."); + mainLog.println("\nStarting transient probability computation..."); // Store num states n = ctmc.getNumStates(); diff --git a/prism/src/explicit/DTMCModelChecker.java b/prism/src/explicit/DTMCModelChecker.java index 04117d72..4fc257e7 100644 --- a/prism/src/explicit/DTMCModelChecker.java +++ b/prism/src/explicit/DTMCModelChecker.java @@ -290,7 +290,7 @@ public class DTMCModelChecker extends ProbModelChecker // Start backwards transient computation timer = System.currentTimeMillis(); - mainLog.println("Starting backwards instantaneous rewards computation..."); + mainLog.println("\nStarting backwards instantaneous rewards computation..."); // Create solution vector(s) soln = new double[n]; @@ -338,7 +338,7 @@ public class DTMCModelChecker extends ProbModelChecker // Start backwards transient computation timer = System.currentTimeMillis(); - mainLog.println("Starting backwards cumulative rewards computation..."); + mainLog.println("\nStarting backwards cumulative rewards computation..."); // Create solution vector(s) soln = new double[n]; @@ -573,7 +573,7 @@ public class DTMCModelChecker extends ProbModelChecker // Start probabilistic reachability timer = System.currentTimeMillis(); - mainLog.println("Starting probabilistic reachability..."); + mainLog.println("\nStarting probabilistic reachability..."); // Check for deadlocks in non-target state (because breaks e.g. prob1) dtmc.checkForDeadlocks(target); @@ -997,7 +997,7 @@ public class DTMCModelChecker extends ProbModelChecker // Start bounded probabilistic reachability timer = System.currentTimeMillis(); - mainLog.println("Starting bounded probabilistic reachability..."); + mainLog.println("\nStarting bounded probabilistic reachability..."); // Store num states n = dtmc.getNumStates(); @@ -1099,7 +1099,7 @@ public class DTMCModelChecker extends ProbModelChecker // Start expected reachability timer = System.currentTimeMillis(); - mainLog.println("Starting expected reachability..."); + mainLog.println("\nStarting expected reachability..."); // Check for deadlocks in non-target state (because breaks e.g. prob1) dtmc.checkForDeadlocks(target); diff --git a/prism/src/explicit/MDPModelChecker.java b/prism/src/explicit/MDPModelChecker.java index af3f9415..6baaae68 100644 --- a/prism/src/explicit/MDPModelChecker.java +++ b/prism/src/explicit/MDPModelChecker.java @@ -345,7 +345,7 @@ public class MDPModelChecker extends ProbModelChecker // Start probabilistic reachability timer = System.currentTimeMillis(); - mainLog.println("Starting probabilistic reachability (" + (min ? "min" : "max") + ")..."); + mainLog.println("\nStarting probabilistic reachability (" + (min ? "min" : "max") + ")..."); // Check for deadlocks in non-target state (because breaks e.g. prob1) mdp.checkForDeadlocks(target); @@ -1065,7 +1065,7 @@ public class MDPModelChecker extends ProbModelChecker // Start bounded probabilistic reachability timer = System.currentTimeMillis(); - mainLog.println("Starting bounded probabilistic reachability (" + (min ? "min" : "max") + ")..."); + mainLog.println("\nStarting bounded probabilistic reachability (" + (min ? "min" : "max") + ")..."); // Store num states n = mdp.getNumStates(); @@ -1170,7 +1170,7 @@ public class MDPModelChecker extends ProbModelChecker // Start expected reachability timer = System.currentTimeMillis(); - mainLog.println("Starting expected reachability (" + (min ? "min" : "max") + ")..."); + mainLog.println("\nStarting expected reachability (" + (min ? "min" : "max") + ")..."); // Check for deadlocks in non-target state (because breaks e.g. prob1) mdp.checkForDeadlocks(target); diff --git a/prism/src/explicit/STPGModelChecker.java b/prism/src/explicit/STPGModelChecker.java index 3431743a..7e8d799c 100644 --- a/prism/src/explicit/STPGModelChecker.java +++ b/prism/src/explicit/STPGModelChecker.java @@ -307,7 +307,7 @@ public class STPGModelChecker extends ProbModelChecker // Start probabilistic reachability timer = System.currentTimeMillis(); if (verbosity >= 1) - mainLog.println("Starting probabilistic reachability..."); + mainLog.println("\nStarting probabilistic reachability..."); // Check for deadlocks in non-target state (because breaks e.g. prob1) stpg.checkForDeadlocks(target); @@ -803,7 +803,7 @@ public class STPGModelChecker extends ProbModelChecker // Start bounded probabilistic reachability timer = System.currentTimeMillis(); if (verbosity >= 1) - mainLog.println("Starting bounded probabilistic reachability..."); + mainLog.println("\nStarting bounded probabilistic reachability..."); // Store num states n = stpg.getNumStates(); @@ -898,7 +898,7 @@ public class STPGModelChecker extends ProbModelChecker // Start expected reachability timer = System.currentTimeMillis(); if (verbosity >= 1) - mainLog.println("Starting expected reachability..."); + mainLog.println("\nStarting expected reachability..."); // Check for deadlocks in non-target state (because breaks e.g. prob1) stpg.checkForDeadlocks(target);