From 4e2ed9523f19d4f2c5ebac966913a261bc9be3d7 Mon Sep 17 00:00:00 2001
From: Christian Dietrich <christian.dietrich@informatik.uni-erlangen.de>
Date: Mon, 26 Sep 2016 10:27:24 +0200
Subject: [PATCH] pml: more verbose info about PML
---
generator/transform/GeneratePML.py | 9 +++++++--
1 file changed, 7 insertions(+), 2 deletions(-)
diff --git a/generator/transform/GeneratePML.py b/generator/transform/GeneratePML.py
index c38ec49..1723048 100644
--- a/generator/transform/GeneratePML.py
+++ b/generator/transform/GeneratePML.py
@@ -309,10 +309,12 @@ class GeneratePML(Analysis, GraphObject):
gcfg['exit-nodes'].append(idx(state))
+ transition_count = 0
# Add all state records to the gcfg
for state in all_states.values():
successors = [x for x in state.get_outgoing_nodes(SavedStateTransition)
if id(x) in all_states]
+ transition_count += len(successors)
local_successors = [idx(x) for x in successors if x.current_subtask == state.current_subtask]
global_successors = [idx(x) for x in successors if x.current_subtask != state.current_subtask]
@@ -447,9 +449,12 @@ class GeneratePML(Analysis, GraphObject):
'lhs': lhs
, })
- logging.info(" %s: %d states, %d loops", gcfg['name'],
+ logging.info(" %s: %d states, (->s: %d, s-> %d), %d loops, %d transitions", gcfg['name'],
len(gcfg['nodes']),
- len(loops))
+ len(start_states),
+ len(end_states),
+ len(loops),
+ transition_count)
return state_to_idx
def find_loops(self, all_states):
--
GitLab