1 /* Copyright (c) 2007-2015. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #ifndef SIMGRID_MC_LIVENESS_CHECKER_HPP
8 #define SIMGRID_MC_LIVENESS_CHECKER_HPP
17 #include <simgrid_config.h>
19 #include <xbt/automaton.h>
20 #include "src/mc/mc_state.h"
21 #include "src/mc/checker/Checker.hpp"
30 struct XBT_PRIVATE Pair {
32 bool search_cycle = false;
33 std::shared_ptr<simgrid::mc::State> graph_state = nullptr; /* System state included */
34 xbt_automaton_state_t automaton_state = nullptr;
35 std::shared_ptr<const std::vector<int>> atomic_propositions;
38 bool exploration_started = false;
40 explicit Pair(unsigned long expanded_pairs);
43 Pair(Pair const&) = delete;
44 Pair& operator=(Pair const&) = delete;
47 struct XBT_PRIVATE VisitedPair {
49 int other_num = 0; /* Dot output for */
50 std::shared_ptr<simgrid::mc::State> graph_state = nullptr; /* System state included */
51 xbt_automaton_state_t automaton_state;
52 std::shared_ptr<const std::vector<int>> atomic_propositions;
53 std::size_t heap_bytes_used = 0;
57 int pair_num, xbt_automaton_state_t automaton_state,
58 std::shared_ptr<const std::vector<int>> atomic_propositions,
59 std::shared_ptr<simgrid::mc::State> graph_state);
60 ~VisitedPair() = default;
63 class XBT_PRIVATE LivenessChecker : public Checker {
65 explicit LivenessChecker(Session& session);
66 ~LivenessChecker() = default;
68 RecordTrace getRecordTrace() override;
69 std::vector<std::string> getTextualTrace() override;
70 void logState() override;
72 int compare(simgrid::mc::VisitedPair* state1, simgrid::mc::VisitedPair* state2);
73 std::shared_ptr<const std::vector<int>> getPropositionValues();
74 std::shared_ptr<VisitedPair> insertAcceptancePair(simgrid::mc::Pair* pair);
75 int insertVisitedPair(std::shared_ptr<VisitedPair> visited_pair, simgrid::mc::Pair* pair);
76 void showAcceptanceCycle(std::size_t depth);
78 void removeAcceptancePair(int pair_num);
79 void purgeVisitedPairs();
81 std::shared_ptr<Pair> newPair(Pair* pair, xbt_automaton_state_t state, std::shared_ptr<const std::vector<int>> propositions);
83 // A stack of (application_state, automaton_state) pairs for DFS exploration:
84 std::list<std::shared_ptr<Pair>> explorationStack_;
85 std::list<std::shared_ptr<VisitedPair>> acceptancePairs_;
86 std::list<std::shared_ptr<VisitedPair>> visitedPairs_;
87 unsigned long visitedPairsCount_ = 0;
88 unsigned long expandedPairsCount_ = 0;
89 unsigned long expandedStatesCount_ = 0;
90 int previousPair_ = 0;
91 std::string previousRequest_;