Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-2979
Executing tool marcie
Input is Philosophers-COL-000005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r089kn-ebro-146369093500205
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-0
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-1
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-10
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-11
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-12
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-13
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-14
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-15
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-2
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-3
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-4
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-5
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-6
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-7
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-8
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1464106624345


Marcie rev. 8535M (built: crohr on 2016-04-27)
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Unfolding complete |P|=25|T|=25|A|=80
Time for unfolding: 0m 1.139sec

Net: Philosophers_COL_000005
(NrP: 25 NrTr: 25 NrArc: 80)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

init dd package: 0m 7.249sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 110 (1.1e+02) #states 243



starting MCC model checker
--------------------------

checking: AG [2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]
normalized: ~ [E [true U ~ [2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]]]

abstracting: (2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 131
-> the formula is FALSE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.069sec

checking: EF [3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]
normalized: E [true U 3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]

abstracting: (3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 51
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: EF [~ [~ [~ [2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)]]]]
normalized: E [true U ~ [2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)]]

abstracting: (2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)) states: 76
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

checking: EF [sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]
normalized: E [true U sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]

abstracting: (sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 123
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

checking: EF [[2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) | 1<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)]]
normalized: E [true U [2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) | 1<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)]]

abstracting: (1<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)) states: 120
abstracting: (2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)) states: 76
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.129sec

checking: EF [~ [~ [~ [sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)]]]]
normalized: E [true U ~ [sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)]]

abstracting: (sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)) states: 188
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: EF [~ [[[3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1) & 3<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)] & ~ [2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)]]]]
normalized: E [true U ~ [[~ [2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)] & [3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1) & 3<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)]]]]

abstracting: (3<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)) states: 0
abstracting: (3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 51
abstracting: (2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)) states: 76
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.191sec

checking: EF [~ [[[1<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1) | 3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)] & sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)]]]
normalized: E [true U ~ [[sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1) & [1<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1) | 3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]]]]

abstracting: (3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 51
abstracting: (1<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)) states: 120
abstracting: (sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)) states: 243
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.193sec

checking: EF [[~ [[sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1) & sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)]] & 1<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]]
normalized: E [true U [1<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1) & ~ [[sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1) & sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)]]]]

abstracting: (sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)) states: 243
abstracting: (sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 182
abstracting: (1<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 211
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.199sec

checking: AG [[[sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1) | [1<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1) & 2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)]] & sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)]]
normalized: ~ [E [true U ~ [[sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1) & [sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1) | [1<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1) & 2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)]]]]]]

abstracting: (2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)) states: 76
abstracting: (1<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 211
abstracting: (sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)) states: 127
abstracting: (sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)) states: 87
-> the formula is FALSE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.267sec

checking: AG [[sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) | [~ [sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)] & [sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1) | 2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)]]]]
normalized: ~ [E [true U ~ [[sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) | [[sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1) | 2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)] & ~ [sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)]]]]]]

abstracting: (sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)) states: 243
abstracting: (2<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)) states: 76
abstracting: (sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)) states: 243
abstracting: (sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)) states: 77
-> the formula is FALSE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.258sec

checking: AG [[[[sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1) & 3<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)] & [sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1) & 3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]] | ~ [~ [sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]]]]
normalized: ~ [E [true U ~ [[sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1) | [[sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1) & 3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)] & [sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1) & 3<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)]]]]]]

abstracting: (3<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)) states: 26
abstracting: (sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)) states: 87
abstracting: (3<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 51
abstracting: (sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)) states: 243
abstracting: (sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 123
-> the formula is FALSE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.320sec

checking: EF [[~ [[sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) & sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]] | [~ [2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)] & [sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) & 2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]]]]
normalized: E [true U [[[sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) & 2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)] & ~ [2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]] | ~ [[sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) & sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]]]]

abstracting: (sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 182
abstracting: (sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)) states: 147
abstracting: (2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 131
abstracting: (2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 131
abstracting: (sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)) states: 188
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.333sec

checking: AG [[[~ [1<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)] & [sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) & sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)]] | [[3<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1) & sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)] & 1<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)]]]
normalized: ~ [E [true U ~ [[[1<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1) & [3<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1) & sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)]] | [[sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) & sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)] & ~ [1<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)]]]]]]

abstracting: (1<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)) states: 161
abstracting: (sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)) states: 112
abstracting: (sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)) states: 147
abstracting: (sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)) states: 127
abstracting: (3<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)) states: 86
abstracting: (1<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)) states: 120
-> the formula is FALSE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.383sec

checking: EF [[[~ [sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)] & [sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) & sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)]] | [[sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1) | sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)] | 1<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)]]]
normalized: E [true U [[1<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1) | [sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1) | sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)]] | [[sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1) & sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)] & ~ [sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)]]]]

abstracting: (sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)) states: 243
abstracting: (sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)) states: 127
abstracting: (sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)) states: 243
abstracting: (sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)) states: 32
abstracting: (sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)) states: 207
abstracting: (1<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)) states: 161
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.373sec

checking: EF [[[~ [sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)] & [2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1) | sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)]] & [[2<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1) | sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)] | [sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1) | sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)]]]]
normalized: E [true U [[~ [sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)] & [2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1) | sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)]] & [[sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1) | sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)] | [2<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1) | sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)]]]]

abstracting: (sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 243
abstracting: (2<=sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)) states: 196
abstracting: (sum(catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)) states: 147
abstracting: (sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)) states: 112
abstracting: (sum(eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)) states: 188
abstracting: (2<=sum(fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id1)) states: 131
abstracting: (sum(think_Id5, think_Id4, think_Id3, think_Id2, think_Id1)<=sum(catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id1)) states: 77
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.440sec


Total processing time: 0m15.242sec


BK_STOP 1464106639644

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:123 (4), effective:15 (0)

initing FirstDep: 0m 0.000sec


iterations count:95 (3), effective:17 (0)

iterations count:179 (7), effective:25 (1)

iterations count:151 (6), effective:20 (0)

iterations count:68 (2), effective:5 (0)

iterations count:64 (2), effective:8 (0)

iterations count:249 (9), effective:38 (1)

iterations count:25 (1), effective:0 (0)

iterations count:130 (5), effective:18 (0)

iterations count:265 (10), effective:44 (1)

iterations count:98 (3), effective:13 (0)

iterations count:176 (7), effective:27 (1)

iterations count:102 (4), effective:14 (0)

iterations count:232 (9), effective:37 (1)

iterations count:104 (4), effective:13 (0)

iterations count:72 (2), effective:11 (0)

iterations count:131 (5), effective:18 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-000005"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000005.tgz
mv Philosophers-COL-000005 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is Philosophers-COL-000005, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r089kn-ebro-146369093500205"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;