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-000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r089kn-ebro-146369093500214
=====================================================================

--------------------
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-000010-ReachabilityCardinality-0
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-1
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-10
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-11
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-12
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-13
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-14
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-15
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-2
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-3
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-4
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-5
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-6
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-7
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-8
FORMULA_NAME Philosophers-COL-000010-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1464106694491


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|=50|T|=50|A|=160
Time for unfolding: 0m 0.983sec

Net: Philosophers_COL_000010
(NrP: 50 NrTr: 50 NrArc: 160)

net check time: 0m 0.000sec

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

init dd package: 0m 7.082sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 240 (2.4e+02) #states 59,049 (4)



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

checking: AG [3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)]
normalized: ~ [E [true U ~ [3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)]]]

abstracting: (3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)) states: 41,385 (4)
-> the formula is FALSE

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

MC time: 0m 0.113sec

checking: EF [sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]
normalized: E [true U sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]

abstracting: (sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)) states: 12,599 (4)
-> the formula is TRUE

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

MC time: 0m 1.165sec

checking: EF [sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]
normalized: E [true U sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]

abstracting: (sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)) states: 22,606 (4)
-> the formula is TRUE

FORMULA Philosophers-COL-000010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.187sec

checking: AG [sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]
normalized: ~ [E [true U ~ [sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]]]

abstracting: (sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)) states: 59,049 (4)
-> the formula is TRUE

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

MC time: 0m 0.060sec

checking: EF [sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)]
normalized: E [true U sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)]

abstracting: (sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)) states: 12,519 (4)
-> the formula is TRUE

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

MC time: 0m 1.256sec

checking: AG [[2<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1) | ~ [[sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) | 2<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)]]]]
normalized: ~ [E [true U ~ [[2<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1) | ~ [[sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) | 2<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)]]]]]]

abstracting: (2<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)) states: 38,393 (4)
abstracting: (sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)) states: 23,441 (4)
abstracting: (2<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)) states: 58,857 (4)
-> the formula is FALSE

FORMULA Philosophers-COL-000010-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.298sec

checking: AG [[[2<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1) & [3<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1) & 1<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)]] | 2<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)]]
normalized: ~ [E [true U ~ [[2<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1) | [2<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1) & [3<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1) & 1<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)]]]]]]

abstracting: (1<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)) states: 43,922 (4)
abstracting: (3<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)) states: 56,412 (4)
abstracting: (2<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)) states: 52,905 (4)
abstracting: (2<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)) states: 58,857 (4)
-> the formula is FALSE

FORMULA Philosophers-COL-000010-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.256sec

checking: AG [[sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1) | sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)]]
normalized: ~ [E [true U ~ [[sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1) | sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)]]]]

abstracting: (sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)) states: 23,441 (4)
abstracting: (sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)) states: 59,049 (4)
-> the formula is TRUE

FORMULA Philosophers-COL-000010-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.254sec

checking: AG [[~ [3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)] | [~ [3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)] & ~ [sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)]]]]
normalized: ~ [E [true U ~ [[[~ [sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)] & ~ [3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)]] | ~ [3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)]]]]]

abstracting: (3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)) states: 3,387 (3)
abstracting: (3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)) states: 41,385 (4)
abstracting: (sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)) states: 45,448 (4)
-> the formula is FALSE

FORMULA Philosophers-COL-000010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.478sec

checking: AG [[sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1) | [~ [sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)] & 3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)]]]
normalized: ~ [E [true U ~ [[sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1) | [3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1) & ~ [sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)]]]]]]

abstracting: (sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)) states: 12,599 (4)
abstracting: (3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)) states: 41,385 (4)
abstracting: (sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)) states: 15,127 (4)
-> the formula is FALSE

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

MC time: 0m 2.533sec

checking: EF [[~ [~ [3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)]] & ~ [[sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1) | sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]]]]
normalized: E [true U [3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1) & ~ [[sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1) | sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]]]]

abstracting: (sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)) states: 12,599 (4)
abstracting: (sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)) states: 59,049 (4)
abstracting: (3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)) states: 41,385 (4)
-> the formula is FALSE

FORMULA Philosophers-COL-000010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.239sec

checking: EF [~ [[~ [sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)] | [sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) | sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]]]]
normalized: E [true U ~ [[~ [sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)] | [sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) | sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]]]]

abstracting: (sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)) states: 34,001 (4)
abstracting: (sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)) states: 1,024 (3)
abstracting: (sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)) states: 22,606 (4)
-> the formula is TRUE

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

MC time: 0m 3.827sec

checking: EF [[3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) & [[3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) | 3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)] | [3<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1) & sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)]]]]
normalized: E [true U [3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) & [[3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) | 3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)] | [3<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1) & sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)]]]]

abstracting: (sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)) states: 23,441 (4)
abstracting: (3<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)) states: 22,948 (4)
abstracting: (3<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)) states: 41,385 (4)
abstracting: (3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)) states: 3,387 (3)
abstracting: (3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)) states: 3,387 (3)
-> the formula is TRUE

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

MC time: 0m 1.434sec

checking: AG [[[[sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1) | 1<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)] & sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)] | 2<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)]]
normalized: ~ [E [true U ~ [[2<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1) | [sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1) & [sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1) | 1<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)]]]]]]

abstracting: (1<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)) states: 58,025 (4)
abstracting: (sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)) states: 22,606 (4)
abstracting: (sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)) states: 59,049 (4)
abstracting: (2<=sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)) states: 52,905 (4)
-> the formula is TRUE

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

MC time: 0m 1.316sec

checking: AG [[[[3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) | sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)] | sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)] | sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)]]
normalized: ~ [E [true U ~ [[sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1) | [sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1) | [3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) | sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)]]]]]]

abstracting: (sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)) states: 59,049 (4)
abstracting: (3<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)) states: 3,387 (3)
abstracting: (sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)) states: 59,049 (4)
abstracting: (sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)) states: 46,892 (4)
-> the formula is TRUE

FORMULA Philosophers-COL-000010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.439sec

checking: AG [[[sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1) & [sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) | sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]] | sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)]]
normalized: ~ [E [true U ~ [[sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1) | [sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1) & [sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1) | sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)]]]]]]

abstracting: (sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)<=sum(catch2_Id9, catch2_Id8, catch2_Id7, catch2_Id6, catch2_Id5, catch2_Id4, catch2_Id3, catch2_Id2, catch2_Id10, catch2_Id1)) states: 34,001 (4)
abstracting: (sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(eat_Id9, eat_Id8, eat_Id7, eat_Id6, eat_Id5, eat_Id4, eat_Id3, eat_Id2, eat_Id10, eat_Id1)) states: 1,024 (3)
abstracting: (sum(fork_Id9, fork_Id8, fork_Id7, fork_Id6, fork_Id5, fork_Id4, fork_Id3, fork_Id2, fork_Id10, fork_Id1)<=sum(catch1_Id9, catch1_Id8, catch1_Id7, catch1_Id6, catch1_Id5, catch1_Id4, catch1_Id3, catch1_Id2, catch1_Id10, catch1_Id1)) states: 22,606 (4)
abstracting: (sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)<=sum(think_Id9, think_Id8, think_Id7, think_Id6, think_Id5, think_Id4, think_Id3, think_Id2, think_Id10, think_Id1)) states: 59,049 (4)
-> the formula is TRUE

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

MC time: 0m 3.553sec


Total processing time: 0m34.667sec


BK_STOP 1464106729204

--------------------
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:263 (5), effective:30 (0)

initing FirstDep: 0m 0.000sec


iterations count:370 (7), effective:65 (1)

iterations count:250 (5), effective:33 (0)

iterations count:201 (4), effective:32 (0)

iterations count:697 (13), effective:128 (2)

iterations count:810 (16), effective:135 (2)

iterations count:589 (11), effective:103 (2)
349
iterations count:1151 (23), effective:190 (3)

iterations count:783 (15), effective:135 (2)
867
iterations count:1591 (31), effective:279 (5)
366
iterations count:1124 (22), effective:184 (3)

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-000010"
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-000010.tgz
mv Philosophers-COL-000010 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-000010, 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-146369093500214"
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 ;