Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r225-tall-167856407300246.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is Kanban-PT-00010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407300246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.9K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 11:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 11:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:22 model.pnml

--------------------
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 Kanban-PT-00010-ReachabilityCardinality-00
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-01
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-02
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-03
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-04
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-05
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-06
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-07
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-08
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-09
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-10
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-11
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-12
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-13
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-14
FORMULA_NAME Kanban-PT-00010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678613806133

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-00010
Not applying reductions.
Model is PT
ReachabilityCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Kanban_PT_00010
(NrP: 16 NrTr: 16 NrArc: 40)

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

net check time: 0m 0.000sec

init dd package: 0m 2.903sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 256 (2.6e+02) #states 1,005,927,208 (9)



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

checking: AG [3<=P1]
normalized: ~ [E [true U ~ [3<=P1]]]

abstracting: (3<=P1)
states: 422,067,360 (8)
-> the formula is FALSE

FORMULA Kanban-PT-00010-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [Pm3<=6]
normalized: ~ [E [true U ~ [Pm3<=6]]]

abstracting: (Pm3<=6)
states: 910,962,052 (8)
-> the formula is FALSE

FORMULA Kanban-PT-00010-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AG [Pout1<=2]
normalized: ~ [E [true U ~ [Pout1<=2]]]

abstracting: (Pout1<=2)
states: 583,859,848 (8)
-> the formula is FALSE

FORMULA Kanban-PT-00010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [P2<=Pm2]
normalized: E [true U P2<=Pm2]

abstracting: (P2<=Pm2)
states: 721,440,720 (8)
-> the formula is TRUE

FORMULA Kanban-PT-00010-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[Pout1<=Pm1 | ~ [4<=Pm1]]]
normalized: ~ [E [true U ~ [[~ [4<=Pm1] | Pout1<=Pm1]]]]

abstracting: (Pout1<=Pm1)
states: 566,273,708 (8)
abstracting: (4<=Pm1)
states: 295,447,152 (8)
-> the formula is FALSE

FORMULA Kanban-PT-00010-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [[4<=Pout2 & ~ [[Pout3<=Pm4 | ~ [[P3<=Pout2 & Pback2<=3]]]]]]]
normalized: ~ [E [true U [~ [[~ [[P3<=Pout2 & Pback2<=3]] | Pout3<=Pm4]] & 4<=Pout2]]]

abstracting: (4<=Pout2)
states: 350,414,064 (8)
abstracting: (Pout3<=Pm4)
states: 535,886,494 (8)
abstracting: (Pback2<=3)
states: 655,513,144 (8)
abstracting: (P3<=Pout2)
states: 721,440,720 (8)
-> the formula is FALSE

FORMULA Kanban-PT-00010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[Pout1<=6 & [[3<=Pback1 & Pm2<=8] & ~ [[[[P1<=8 & [[P2<=Pm3 | [6<=P2 | Pm2<=Pm4]] & ~ [[10<=Pout3 | Pback2<=1]]]] & ~ [[Pback1<=9 | Pm2<=10]]] | Pm3<=9]]]]]
normalized: E [true U [[~ [[[~ [[Pback1<=9 | Pm2<=10]] & [[~ [[10<=Pout3 | Pback2<=1]] & [[6<=P2 | Pm2<=Pm4] | P2<=Pm3]] & P1<=8]] | Pm3<=9]] & [3<=Pback1 & Pm2<=8]] & Pout1<=6]]

abstracting: (Pout1<=6)
states: 935,582,648 (8)
abstracting: (Pm2<=8)
states: 985,232,820 (8)
abstracting: (3<=Pback1)
states: 422,067,360 (8)
abstracting: (Pm3<=9)
states: 1,000,528,672 (9)
abstracting: (P1<=8)
states: 991,858,296 (8)
abstracting: (P2<=Pm3)
states: 721,440,720 (8)
abstracting: (Pm2<=Pm4)
states: 535,886,494 (8)
abstracting: (6<=P2)
states: 30,346,316 (7)
abstracting: (Pback2<=1)
states: 374,298,496 (8)
abstracting: (10<=Pout3)
states: 5,398,536 (6)
abstracting: (Pm2<=10)
states: 1,005,927,208 (9)
abstracting: (Pback1<=9)
states: 1,002,409,980 (9)
-> the formula is TRUE

FORMULA Kanban-PT-00010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [~ [[~ [[[[Pm3<=P1 & [~ [4<=Pback4] | [Pm3<=Pm4 | P2<=4]]] & [[Pback4<=P1 & [7<=P2 & P2<=1]] | ~ [Pout3<=6]]] & ~ [[[Pm1<=Pm2 & 1<=Pm3] | [2<=Pout1 | Pout2<=8]]]]] | 1<=Pm2]]]
normalized: E [true U ~ [[~ [[~ [[[2<=Pout1 | Pout2<=8] | [Pm1<=Pm2 & 1<=Pm3]]] & [[~ [Pout3<=6] | [[7<=P2 & P2<=1] & Pback4<=P1]] & [[[Pm3<=Pm4 | P2<=4] | ~ [4<=Pback4]] & Pm3<=P1]]]] | 1<=Pm2]]]

abstracting: (1<=Pm2)
states: 807,081,132 (8)
abstracting: (Pm3<=P1)
states: 535,886,494 (8)
abstracting: (4<=Pback4)
states: 295,447,152 (8)
abstracting: (P2<=4)
states: 939,508,856 (8)
abstracting: (Pm3<=Pm4)
states: 535,886,494 (8)
abstracting: (Pback4<=P1)
states: 578,584,006 (8)
abstracting: (P2<=1)
states: 603,736,276 (8)
abstracting: (7<=P2)
states: 11,942,216 (7)
abstracting: (Pout3<=6)
states: 910,962,052 (8)
abstracting: (1<=Pm3)
states: 807,081,132 (8)
abstracting: (Pm1<=Pm2)
states: 612,243,060 (8)
abstracting: (Pout2<=8)
states: 985,232,820 (8)
abstracting: (2<=Pout1)
states: 580,342,620 (8)
-> the formula is TRUE

FORMULA Kanban-PT-00010-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [~ [[Pm2<=7 | [[[~ [Pback4<=Pout2] | ~ [Pout3<=Pout4]] & Pm1<=P4] & ~ [[~ [[[Pm2<=7 & Pm3<=P2] | [P2<=Pback4 & P2<=Pback4]]] & [[Pback2<=P2 & ~ [3<=Pback4]] & Pback4<=Pback4]]]]]]]
normalized: E [true U ~ [[[~ [[[[~ [3<=Pback4] & Pback2<=P2] & Pback4<=Pback4] & ~ [[[P2<=Pback4 & P2<=Pback4] | [Pm2<=7 & Pm3<=P2]]]]] & [Pm1<=P4 & [~ [Pout3<=Pout4] | ~ [Pback4<=Pout2]]]] | Pm2<=7]]]

abstracting: (Pm2<=7)
states: 956,358,832 (8)
abstracting: (Pback4<=Pout2)
states: 612,243,060 (8)
abstracting: (Pout3<=Pout4)
states: 535,886,494 (8)
abstracting: (Pm1<=P4)
states: 578,584,006 (8)
abstracting: (Pm3<=P2)
states: 433,437,004 (8)
abstracting: (Pm2<=7)
states: 956,358,832 (8)
abstracting: (P2<=Pback4)
states: 715,510,510 (8)
abstracting: (P2<=Pback4)
states: 715,510,510 (8)
abstracting: (Pback4<=Pback4)
states: 1,005,927,208 (9)
abstracting: (Pback2<=P2)
states: 433,437,004 (8)
abstracting: (3<=Pback4)
states: 422,067,360 (8)
-> the formula is TRUE

FORMULA Kanban-PT-00010-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: AG [[~ [[2<=P4 & ~ [[[[Pout4<=5 & Pout2<=7] | ~ [[Pout2<=Pout4 | Pm3<=Pout2]]] | [[[Pback2<=7 | 8<=Pm3] | Pm2<=Pback1] | [[6<=P3 & P4<=Pm4] | [Pm2<=Pout3 & 7<=Pm1]]]]]]] | Pout4<=P1]]
normalized: ~ [E [true U ~ [[Pout4<=P1 | ~ [[2<=P4 & ~ [[[[[Pm2<=Pout3 & 7<=Pm1] | [6<=P3 & P4<=Pm4]] | [Pm2<=Pback1 | [Pback2<=7 | 8<=Pm3]]] | [~ [[Pout2<=Pout4 | Pm3<=Pout2]] | [Pout4<=5 & Pout2<=7]]]]]]]]]]

abstracting: (Pout2<=7)
states: 956,358,832 (8)
abstracting: (Pout4<=5)
states: 882,824,228 (8)
abstracting: (Pm3<=Pout2)
states: 573,144,572 (8)
abstracting: (Pout2<=Pout4)
states: 535,886,494 (8)
abstracting: (8<=Pm3)
states: 49,568,376 (7)
abstracting: (Pback2<=7)
states: 956,358,832 (8)
abstracting: (Pm2<=Pback1)
states: 535,886,494 (8)
abstracting: (P4<=Pm4)
states: 566,273,708 (8)
abstracting: (6<=P3)
states: 30,346,316 (7)
abstracting: (7<=Pm1)
states: 70,344,560 (7)
abstracting: (Pm2<=Pout3)
states: 573,144,572 (8)
abstracting: (2<=P4)
states: 580,342,620 (8)
abstracting: (Pout4<=P1)
states: 578,584,006 (8)
-> the formula is FALSE

FORMULA Kanban-PT-00010-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: AG [~ [[~ [[[[Pout3<=Pback4 & [~ [[8<=P1 & 8<=Pm4]] | ~ [Pout3<=7]]] | ~ [P2<=5]] | [~ [Pback1<=Pback3] & [[~ [[Pback2<=Pback1 | P3<=Pm4]] & [[Pm2<=10 & Pm2<=1] & ~ [6<=Pback4]]] & [[~ [P1<=P4] & [Pm3<=Pout2 & Pout2<=7]] & [Pm4<=Pback1 & ~ [P2<=4]]]]]]] & [~ [10<=Pm2] & Pout2<=Pout1]]]]
normalized: ~ [E [true U [[Pout2<=Pout1 & ~ [10<=Pm2]] & ~ [[[[[[Pm4<=Pback1 & ~ [P2<=4]] & [[Pm3<=Pout2 & Pout2<=7] & ~ [P1<=P4]]] & [[~ [6<=Pback4] & [Pm2<=10 & Pm2<=1]] & ~ [[Pback2<=Pback1 | P3<=Pm4]]]] & ~ [Pback1<=Pback3]] | [~ [P2<=5] | [Pout3<=Pback4 & [~ [Pout3<=7] | ~ [[8<=P1 & 8<=Pm4]]]]]]]]]]

abstracting: (8<=Pm4)
states: 35,172,280 (7)
abstracting: (8<=P1)
states: 35,172,280 (7)
abstracting: (Pout3<=7)
states: 956,358,832 (8)
abstracting: (Pout3<=Pback4)
states: 535,886,494 (8)
abstracting: (P2<=5)
states: 975,580,892 (8)
abstracting: (Pback1<=Pback3)
states: 612,243,060 (8)
abstracting: (P3<=Pm4)
states: 715,510,510 (8)
abstracting: (Pback2<=Pback1)
states: 535,886,494 (8)
abstracting: (Pm2<=1)
states: 374,298,496 (8)
abstracting: (Pm2<=10)
states: 1,005,927,208 (9)
abstracting: (6<=Pback4)
states: 123,102,980 (8)
abstracting: (P1<=P4)
states: 578,584,006 (8)
abstracting: (Pout2<=7)
states: 956,358,832 (8)
abstracting: (Pm3<=Pout2)
states: 573,144,572 (8)
abstracting: (P2<=4)
states: 939,508,856 (8)
abstracting: (Pm4<=Pback1)
states: 578,584,006 (8)
abstracting: (10<=Pm2)
states: 5,398,536 (6)
abstracting: (Pout2<=Pout1)
states: 535,886,494 (8)
-> the formula is FALSE

FORMULA Kanban-PT-00010-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

checking: AG [[~ [[P1<=Pout3 | [[[~ [9<=P3] & ~ [[[P4<=Pout2 & Pback4<=P1] | Pm1<=P2]]] | [[Pback4<=9 | ~ [Pout1<=10]] | ~ [[Pout3<=2 & 1<=Pm4]]]] & [Pback3<=10 & ~ [[[[1<=P3 & Pback2<=0] | [2<=P2 & Pback3<=P1]] & 5<=P3]]]]]] | ~ [[Pout3<=4 & [[[Pback2<=6 & 4<=Pback3] | [[~ [6<=Pback2] & [~ [P3<=5] & [Pm3<=Pout1 | Pback2<=1]]] & [[~ [Pm3<=0] & ~ [8<=Pout4]] | Pout3<=8]]] & [Pback1<=2 & ~ [Pback2<=Pback3]]]]]]]
normalized: ~ [E [true U ~ [[~ [[Pout3<=4 & [[Pback1<=2 & ~ [Pback2<=Pback3]] & [[[Pout3<=8 | [~ [8<=Pout4] & ~ [Pm3<=0]]] & [[[Pm3<=Pout1 | Pback2<=1] & ~ [P3<=5]] & ~ [6<=Pback2]]] | [Pback2<=6 & 4<=Pback3]]]]] | ~ [[P1<=Pout3 | [[Pback3<=10 & ~ [[5<=P3 & [[2<=P2 & Pback3<=P1] | [1<=P3 & Pback2<=0]]]]] & [[~ [[Pout3<=2 & 1<=Pm4]] | [Pback4<=9 | ~ [Pout1<=10]]] | [~ [[Pm1<=P2 | [P4<=Pout2 & Pback4<=P1]]] & ~ [9<=P3]]]]]]]]]]

abstracting: (9<=P3)
states: 817,960 (5)
abstracting: (Pback4<=P1)
states: 578,584,006 (8)
abstracting: (P4<=Pout2)
states: 612,243,060 (8)
abstracting: (Pm1<=P2)
states: 469,877,122 (8)
abstracting: (Pout1<=10)
states: 1,005,927,208 (9)
abstracting: (Pback4<=9)
states: 1,002,409,980 (9)
abstracting: (1<=Pm4)
states: 773,790,160 (8)
abstracting: (Pout3<=2)
states: 526,439,056 (8)
abstracting: (Pback2<=0)
states: 198,846,076 (8)
abstracting: (1<=P3)
states: 649,623,832 (8)
abstracting: (Pback3<=P1)
states: 535,886,494 (8)
abstracting: (2<=P2)
states: 402,190,932 (8)
abstracting: (5<=P3)
states: 66,418,352 (7)
abstracting: (Pback3<=10)
states: 1,005,927,208 (9)
abstracting: (P1<=Pout3)
states: 612,243,060 (8)
abstracting: (4<=Pback3)
states: 350,414,064 (8)
abstracting: (Pback2<=6)
states: 910,962,052 (8)
abstracting: (6<=Pback2)
states: 159,175,016 (8)
abstracting: (P3<=5)
states: 975,580,892 (8)
abstracting: (Pback2<=1)
states: 374,298,496 (8)
abstracting: (Pm3<=Pout1)
states: 535,886,494 (8)
abstracting: (Pm3<=0)
states: 198,846,076 (8)
abstracting: (8<=Pout4)
states: 35,172,280 (7)
abstracting: (Pout3<=8)
states: 985,232,820 (8)
abstracting: (Pback2<=Pback3)
states: 573,144,572 (8)
abstracting: (Pback1<=2)
states: 583,859,848 (8)
abstracting: (Pout3<=4)
states: 762,011,536 (8)
-> the formula is FALSE

FORMULA Kanban-PT-00010-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

checking: EF [[[~ [[~ [[Pm4<=Pout1 & [[4<=Pm3 | Pback3<=5] | [P4<=4 & P4<=10]]]] | [Pm4<=Pout2 | [~ [8<=Pm2] & ~ [5<=Pm4]]]]] | [[[~ [Pm2<=Pback4] & [4<=Pback4 | ~ [Pback1<=5]]] & [[[~ [4<=P2] | [~ [P2<=9] & ~ [Pm1<=5]]] & [Pm4<=Pout3 | Pm4<=10]] & [8<=Pout1 | P3<=Pback3]]] | ~ [P2<=Pm3]]] & [[Pm1<=Pout4 & ~ [[[[Pback3<=P4 | [[Pback4<=9 | Pout1<=Pout3] & [7<=Pback1 | Pout3<=7]]] | [[P1<=4 | Pback4<=P2] | Pback3<=6]] | Pm2<=P4]]] & ~ [[Pout3<=0 & 8<=Pout2]]]]]
normalized: E [true U [[[Pm1<=Pout4 & ~ [[Pm2<=P4 | [[Pback3<=P4 | [[Pback4<=9 | Pout1<=Pout3] & [7<=Pback1 | Pout3<=7]]] | [Pback3<=6 | [P1<=4 | Pback4<=P2]]]]]] & ~ [[Pout3<=0 & 8<=Pout2]]] & [[~ [P2<=Pm3] | [[[8<=Pout1 | P3<=Pback3] & [[Pm4<=Pout3 | Pm4<=10] & [[~ [Pm1<=5] & ~ [P2<=9]] | ~ [4<=P2]]]] & [[4<=Pback4 | ~ [Pback1<=5]] & ~ [Pm2<=Pback4]]]] | ~ [[[Pm4<=Pout2 | [~ [5<=Pm4] & ~ [8<=Pm2]]] | ~ [[Pm4<=Pout1 & [[P4<=4 & P4<=10] | [4<=Pm3 | Pback3<=5]]]]]]]]]

abstracting: (Pback3<=5)
states: 846,752,192 (8)
abstracting: (4<=Pm3)
states: 350,414,064 (8)
abstracting: (P4<=10)
states: 1,005,927,208 (9)
abstracting: (P4<=4)
states: 808,962,440 (8)
abstracting: (Pm4<=Pout1)
states: 578,584,006 (8)
abstracting: (8<=Pm2)
states: 49,568,376 (7)
abstracting: (5<=Pm4)
states: 196,964,768 (8)
abstracting: (Pm4<=Pout2)
states: 612,243,060 (8)
abstracting: (Pm2<=Pback4)
states: 535,886,494 (8)
abstracting: (Pback1<=5)
states: 882,824,228 (8)
abstracting: (4<=Pback4)
states: 295,447,152 (8)
abstracting: (4<=P2)
states: 130,546,416 (8)
abstracting: (P2<=9)
states: 1,005,845,412 (9)
abstracting: (Pm1<=5)
states: 882,824,228 (8)
abstracting: (Pm4<=10)
states: 1,005,927,208 (9)
abstracting: (Pm4<=Pout3)
states: 612,243,060 (8)
abstracting: (P3<=Pback3)
states: 721,440,720 (8)
abstracting: (8<=Pout1)
states: 35,172,280 (7)
abstracting: (P2<=Pm3)
states: 721,440,720 (8)
abstracting: (8<=Pout2)
states: 49,568,376 (7)
abstracting: (Pout3<=0)
states: 198,846,076 (8)
abstracting: (Pback4<=P2)
states: 469,877,122 (8)
abstracting: (P1<=4)
states: 808,962,440 (8)
abstracting: (Pback3<=6)
states: 910,962,052 (8)
abstracting: (Pout3<=7)
states: 956,358,832 (8)
abstracting: (7<=Pback1)
states: 70,344,560 (7)
abstracting: (Pout1<=Pout3)
states: 612,243,060 (8)
abstracting: (Pback4<=9)
states: 1,002,409,980 (9)
abstracting: (Pback3<=P4)
states: 535,886,494 (8)
abstracting: (Pm2<=P4)
states: 535,886,494 (8)
abstracting: (Pm1<=Pout4)
states: 578,584,006 (8)
-> the formula is TRUE

FORMULA Kanban-PT-00010-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: EF [[~ [[[~ [[[~ [P3<=Pm1] & [P1<=P2 & 3<=Pout2]] | ~ [[P2<=6 | Pback3<=4]]]] | ~ [[[[[Pout1<=Pback2 & Pout2<=Pm2] & 7<=Pout1] | [P4<=7 & ~ [P4<=9]]] | Pout2<=1]]] | ~ [P2<=9]]] & ~ [[[~ [[~ [[4<=Pout2 | P3<=Pm2]] & [[~ [5<=Pout2] & 2<=Pm4] & ~ [[2<=P1 & 10<=Pout3]]]]] & [~ [P2<=5] & ~ [[~ [Pm4<=Pback3] | ~ [Pm1<=Pback3]]]]] & [[~ [[[[P1<=Pback2 & Pout4<=Pback1] | [Pback1<=4 & P2<=Pout4]] | [4<=Pm4 & [3<=P2 | 3<=Pout1]]]] & ~ [[6<=Pout4 | 9<=P1]]] & ~ [Pm3<=P1]]]]]]
normalized: E [true U [~ [[[~ [Pm3<=P1] & [~ [[6<=Pout4 | 9<=P1]] & ~ [[[4<=Pm4 & [3<=P2 | 3<=Pout1]] | [[Pback1<=4 & P2<=Pout4] | [P1<=Pback2 & Pout4<=Pback1]]]]]] & [[~ [[~ [Pm1<=Pback3] | ~ [Pm4<=Pback3]]] & ~ [P2<=5]] & ~ [[[~ [[2<=P1 & 10<=Pout3]] & [2<=Pm4 & ~ [5<=Pout2]]] & ~ [[4<=Pout2 | P3<=Pm2]]]]]]] & ~ [[~ [P2<=9] | [~ [[Pout2<=1 | [[P4<=7 & ~ [P4<=9]] | [7<=Pout1 & [Pout1<=Pback2 & Pout2<=Pm2]]]]] | ~ [[~ [[P2<=6 | Pback3<=4]] | [[P1<=P2 & 3<=Pout2] & ~ [P3<=Pm1]]]]]]]]]

abstracting: (P3<=Pm1)
states: 715,510,510 (8)
abstracting: (3<=Pout2)
states: 479,488,152 (8)
abstracting: (P1<=P2)
states: 469,877,122 (8)
abstracting: (Pback3<=4)
states: 762,011,536 (8)
abstracting: (P2<=6)
states: 993,984,992 (8)
abstracting: (Pout2<=Pm2)
states: 555,967,412 (8)
abstracting: (Pout1<=Pback2)
states: 612,243,060 (8)
abstracting: (7<=Pout1)
states: 70,344,560 (7)
abstracting: (P4<=9)
states: 1,002,409,980 (9)
abstracting: (P4<=7)
states: 970,754,928 (8)
abstracting: (Pout2<=1)
states: 374,298,496 (8)
abstracting: (P2<=9)
states: 1,005,845,412 (9)
abstracting: (P3<=Pm2)
states: 721,440,720 (8)
abstracting: (4<=Pout2)
states: 350,414,064 (8)
abstracting: (5<=Pout2)
states: 243,915,672 (8)
abstracting: (2<=Pm4)
states: 580,342,620 (8)
abstracting: (10<=Pout3)
states: 5,398,536 (6)
abstracting: (2<=P1)
states: 580,342,620 (8)
abstracting: (P2<=5)
states: 975,580,892 (8)
abstracting: (Pm4<=Pback3)
states: 612,243,060 (8)
abstracting: (Pm1<=Pback3)
states: 612,243,060 (8)
abstracting: (Pout4<=Pback1)
states: 578,584,006 (8)
abstracting: (P1<=Pback2)
states: 612,243,060 (8)
abstracting: (P2<=Pout4)
states: 715,510,510 (8)
abstracting: (Pback1<=4)
states: 808,962,440 (8)
abstracting: (3<=Pout1)
states: 422,067,360 (8)
abstracting: (3<=P2)
states: 236,554,032 (8)
abstracting: (4<=Pm4)
states: 295,447,152 (8)
abstracting: (9<=P1)
states: 14,068,912 (7)
abstracting: (6<=Pout4)
states: 123,102,980 (8)
abstracting: (Pm3<=P1)
states: 535,886,494 (8)
-> the formula is FALSE

FORMULA Kanban-PT-00010-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [[[~ [[P4<=1 | [~ [1<=Pback2] & [[[~ [Pback4<=Pm1] & ~ [Pback2<=0]] | ~ [[1<=Pout3 | Pback3<=2]]] | Pback4<=Pm1]]]] & [[[[~ [P1<=2] | ~ [Pback3<=10]] | [Pout4<=P1 | [[~ [P3<=Pm1] | ~ [P3<=Pback1]] & [[Pm4<=P2 | P4<=Pout2] & 8<=Pm1]]]] & [~ [9<=Pback2] | [[~ [P3<=3] | ~ [[Pm2<=0 & 5<=Pm4]]] | [Pout2<=Pout3 | [[10<=Pback2 & P3<=P2] & [8<=Pm1 | P4<=Pout3]]]]]] & [[Pm4<=Pm2 & [[[5<=P4 | [P4<=0 & Pm2<=Pback2]] | Pm2<=Pm2] | [[10<=Pm1 | [Pback2<=P3 | Pout1<=P2]] | [[Pm1<=4 | 2<=Pout4] & ~ [Pout1<=3]]]]] & [~ [[~ [P4<=2] | ~ [P4<=10]]] | [[P3<=Pm2 & Pback2<=Pback2] & Pback2<=P4]]]]] & [~ [5<=Pback1] & [P3<=10 | [[Pm4<=Pm3 | Pm4<=Pback4] | [[6<=Pout3 | [~ [[2<=Pout4 | P4<=9]] & [Pm4<=8 | [5<=Pback2 & 6<=Pout2]]]] | Pback2<=0]]]]]]
normalized: E [true U [[[P3<=10 | [[Pback2<=0 | [6<=Pout3 | [[Pm4<=8 | [5<=Pback2 & 6<=Pout2]] & ~ [[2<=Pout4 | P4<=9]]]]] | [Pm4<=Pm3 | Pm4<=Pback4]]] & ~ [5<=Pback1]] & [[[[[Pback2<=P4 & [P3<=Pm2 & Pback2<=Pback2]] | ~ [[~ [P4<=10] | ~ [P4<=2]]]] & [Pm4<=Pm2 & [[[~ [Pout1<=3] & [Pm1<=4 | 2<=Pout4]] | [10<=Pm1 | [Pback2<=P3 | Pout1<=P2]]] | [Pm2<=Pm2 | [5<=P4 | [P4<=0 & Pm2<=Pback2]]]]]] & [[[[Pout2<=Pout3 | [[8<=Pm1 | P4<=Pout3] & [10<=Pback2 & P3<=P2]]] | [~ [[Pm2<=0 & 5<=Pm4]] | ~ [P3<=3]]] | ~ [9<=Pback2]] & [[Pout4<=P1 | [[8<=Pm1 & [Pm4<=P2 | P4<=Pout2]] & [~ [P3<=Pback1] | ~ [P3<=Pm1]]]] | [~ [Pback3<=10] | ~ [P1<=2]]]]] & ~ [[P4<=1 | [[Pback4<=Pm1 | [~ [[1<=Pout3 | Pback3<=2]] | [~ [Pback2<=0] & ~ [Pback4<=Pm1]]]] & ~ [1<=Pback2]]]]]]]

abstracting: (1<=Pback2)
states: 807,081,132 (8)
abstracting: (Pback4<=Pm1)
states: 578,584,006 (8)
abstracting: (Pback2<=0)
states: 198,846,076 (8)
abstracting: (Pback3<=2)
states: 526,439,056 (8)
abstracting: (1<=Pout3)
states: 807,081,132 (8)
abstracting: (Pback4<=Pm1)
states: 578,584,006 (8)
abstracting: (P4<=1)
states: 425,584,588 (8)
abstracting: (P1<=2)
states: 583,859,848 (8)
abstracting: (Pback3<=10)
states: 1,005,927,208 (9)
abstracting: (P3<=Pm1)
states: 715,510,510 (8)
abstracting: (P3<=Pback1)
states: 715,510,510 (8)
abstracting: (P4<=Pout2)
states: 612,243,060 (8)
abstracting: (Pm4<=P2)
states: 469,877,122 (8)
abstracting: (8<=Pm1)
states: 35,172,280 (7)
abstracting: (Pout4<=P1)
states: 578,584,006 (8)
abstracting: (9<=Pback2)
states: 20,694,388 (7)
abstracting: (P3<=3)
states: 875,380,792 (8)
abstracting: (5<=Pm4)
states: 196,964,768 (8)
abstracting: (Pm2<=0)
states: 198,846,076 (8)
abstracting: (P3<=P2)
states: 1,005,927,208 (9)
abstracting: (10<=Pback2)
states: 5,398,536 (6)
abstracting: (P4<=Pout3)
states: 612,243,060 (8)
abstracting: (8<=Pm1)
states: 35,172,280 (7)
abstracting: (Pout2<=Pout3)
states: 573,144,572 (8)
abstracting: (Pm2<=Pback2)
states: 555,967,412 (8)
abstracting: (P4<=0)
states: 232,137,048 (8)
abstracting: (5<=P4)
states: 196,964,768 (8)
abstracting: (Pm2<=Pm2)
states: 1,005,927,208 (9)
abstracting: (Pout1<=P2)
states: 469,877,122 (8)
abstracting: (Pback2<=P3)
states: 433,437,004 (8)
abstracting: (10<=Pm1)
states: 3,517,228 (6)
abstracting: (2<=Pout4)
states: 580,342,620 (8)
abstracting: (Pm1<=4)
states: 808,962,440 (8)
abstracting: (Pout1<=3)
states: 710,480,056 (8)
abstracting: (Pm4<=Pm2)
states: 612,243,060 (8)
abstracting: (P4<=2)
states: 583,859,848 (8)
abstracting: (P4<=10)
states: 1,005,927,208 (9)
abstracting: (Pback2<=Pback2)
states: 1,005,927,208 (9)
abstracting: (P3<=Pm2)
states: 721,440,720 (8)
abstracting: (Pback2<=P4)
states: 535,886,494 (8)
abstracting: (5<=Pback1)
states: 196,964,768 (8)
abstracting: (Pm4<=Pback4)
states: 566,273,708 (8)
abstracting: (Pm4<=Pm3)
states: 612,243,060 (8)
abstracting: (P4<=9)
states: 1,002,409,980 (9)
abstracting: (2<=Pout4)
states: 580,342,620 (8)
abstracting: (6<=Pout2)
states: 159,175,016 (8)
abstracting: (5<=Pback2)
states: 243,915,672 (8)
abstracting: (Pm4<=8)
states: 991,858,296 (8)
abstracting: (6<=Pout3)
states: 159,175,016 (8)
abstracting: (Pback2<=0)
states: 198,846,076 (8)
abstracting: (P3<=10)
states: 1,005,927,208 (9)
-> the formula is TRUE

FORMULA Kanban-PT-00010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.322sec

checking: EF [[[[~ [Pm2<=P1] & [[[[[[1<=Pout4 | P1<=0] | [Pm4<=Pm4 | Pout2<=8]] & [Pback2<=8 & [P2<=P2 | Pback4<=Pback1]]] | [~ [[P1<=Pm4 | 9<=Pback3]] | [~ [P3<=Pm4] & [P1<=Pm4 & 7<=P3]]]] & [[~ [[Pout3<=Pback2 | Pout3<=Pm3]] | [6<=Pm1 | 9<=Pback4]] & [Pback4<=Pout1 | Pm3<=2]]] | [Pm3<=Pback2 | ~ [[[[10<=P1 & 2<=P1] | [P3<=Pout4 | Pback2<=P4]] & P4<=8]]]]] | ~ [[[[~ [P4<=Pout1] | ~ [P2<=8]] & Pout1<=5] & ~ [[[~ [[Pback4<=Pm1 & 9<=Pout4]] | [[Pout3<=9 | Pback3<=1] & Pm3<=P2]] & [[~ [Pout3<=10] | [1<=Pout4 & 10<=P4]] | Pback4<=P1]]]]]] & [~ [[9<=Pm1 & [[[[[Pm2<=Pm2 | P4<=P3] & ~ [8<=Pm2]] | ~ [Pback3<=Pback1]] & [[[9<=P3 | Pback2<=Pout3] & [9<=Pm4 | Pm2<=6]] | [[2<=Pm2 | P3<=Pout1] & ~ [Pout3<=1]]]] | [[~ [Pm3<=P1] & ~ [P2<=3]] & ~ [[Pout2<=10 & [9<=Pm3 | 1<=Pout2]]]]]]] & [10<=Pout2 & [~ [[[Pback4<=P2 & ~ [Pback1<=9]] | [10<=Pback1 | [[Pm2<=P1 & 7<=Pback3] & ~ [Pback2<=10]]]]] & ~ [Pout2<=0]]]]]]
normalized: E [true U [[[10<=Pout2 & [~ [[[Pback4<=P2 & ~ [Pback1<=9]] | [10<=Pback1 | [~ [Pback2<=10] & [Pm2<=P1 & 7<=Pback3]]]]] & ~ [Pout2<=0]]] & ~ [[9<=Pm1 & [[[~ [Pm3<=P1] & ~ [P2<=3]] & ~ [[Pout2<=10 & [9<=Pm3 | 1<=Pout2]]]] | [[[~ [Pout3<=1] & [2<=Pm2 | P3<=Pout1]] | [[9<=Pm4 | Pm2<=6] & [9<=P3 | Pback2<=Pout3]]] & [~ [Pback3<=Pback1] | [~ [8<=Pm2] & [Pm2<=Pm2 | P4<=P3]]]]]]]] & [~ [[~ [[[Pback4<=P1 | [[1<=Pout4 & 10<=P4] | ~ [Pout3<=10]]] & [[Pm3<=P2 & [Pout3<=9 | Pback3<=1]] | ~ [[Pback4<=Pm1 & 9<=Pout4]]]]] & [Pout1<=5 & [~ [P2<=8] | ~ [P4<=Pout1]]]]] | [[[Pm3<=Pback2 | ~ [[P4<=8 & [[P3<=Pout4 | Pback2<=P4] | [10<=P1 & 2<=P1]]]]] | [[[Pback4<=Pout1 | Pm3<=2] & [[6<=Pm1 | 9<=Pback4] | ~ [[Pout3<=Pback2 | Pout3<=Pm3]]]] & [[[[P1<=Pm4 & 7<=P3] & ~ [P3<=Pm4]] | ~ [[P1<=Pm4 | 9<=Pback3]]] | [[Pback2<=8 & [P2<=P2 | Pback4<=Pback1]] & [[Pm4<=Pm4 | Pout2<=8] | [1<=Pout4 | P1<=0]]]]]] & ~ [Pm2<=P1]]]]]

abstracting: (Pm2<=P1)
states: 535,886,494 (8)
abstracting: (P1<=0)
states: 232,137,048 (8)
abstracting: (1<=Pout4)
states: 773,790,160 (8)
abstracting: (Pout2<=8)
states: 985,232,820 (8)
abstracting: (Pm4<=Pm4)
states: 1,005,927,208 (9)
abstracting: (Pback4<=Pback1)
states: 578,584,006 (8)
abstracting: (P2<=P2)
states: 1,005,927,208 (9)
abstracting: (Pback2<=8)
states: 985,232,820 (8)
abstracting: (9<=Pback3)
states: 20,694,388 (7)
abstracting: (P1<=Pm4)
states: 578,584,006 (8)
abstracting: (P3<=Pm4)
states: 715,510,510 (8)
abstracting: (7<=P3)
states: 11,942,216 (7)
abstracting: (P1<=Pm4)
states: 578,584,006 (8)
abstracting: (Pout3<=Pm3)
states: 555,967,412 (8)
abstracting: (Pout3<=Pback2)
states: 573,144,572 (8)
abstracting: (9<=Pback4)
states: 14,068,912 (7)
abstracting: (6<=Pm1)
states: 123,102,980 (8)
abstracting: (Pm3<=2)
states: 526,439,056 (8)
abstracting: (Pback4<=Pout1)
states: 578,584,006 (8)
abstracting: (2<=P1)
states: 580,342,620 (8)
abstracting: (10<=P1)
states: 3,517,228 (6)
abstracting: (Pback2<=P4)
states: 535,886,494 (8)
abstracting: (P3<=Pout4)
states: 715,510,510 (8)
abstracting: (P4<=8)
states: 991,858,296 (8)
abstracting: (Pm3<=Pback2)
states: 573,144,572 (8)
abstracting: (P4<=Pout1)
states: 578,584,006 (8)
abstracting: (P2<=8)
states: 1,005,109,248 (9)
abstracting: (Pout1<=5)
states: 882,824,228 (8)
abstracting: (9<=Pout4)
states: 14,068,912 (7)
abstracting: (Pback4<=Pm1)
states: 578,584,006 (8)
abstracting: (Pback3<=1)
states: 374,298,496 (8)
abstracting: (Pout3<=9)
states: 1,000,528,672 (9)
abstracting: (Pm3<=P2)
states: 433,437,004 (8)
abstracting: (Pout3<=10)
states: 1,005,927,208 (9)
abstracting: (10<=P4)
states: 3,517,228 (6)
abstracting: (1<=Pout4)
states: 773,790,160 (8)
abstracting: (Pback4<=P1)
states: 578,584,006 (8)
abstracting: (P4<=P3)
states: 469,877,122 (8)
abstracting: (Pm2<=Pm2)
states: 1,005,927,208 (9)
abstracting: (8<=Pm2)
states: 49,568,376 (7)
abstracting: (Pback3<=Pback1)
states: 535,886,494 (8)
abstracting: (Pback2<=Pout3)
states: 573,144,572 (8)
abstracting: (9<=P3)
states: 817,960 (5)
abstracting: (Pm2<=6)
states: 910,962,052 (8)
abstracting: (9<=Pm4)
states: 14,068,912 (7)
abstracting: (P3<=Pout1)
states: 715,510,510 (8)
abstracting: (2<=Pm2)
states: 631,628,712 (8)
abstracting: (Pout3<=1)
states: 374,298,496 (8)
abstracting: (1<=Pout2)
states: 807,081,132 (8)
abstracting: (9<=Pm3)
states: 20,694,388 (7)
abstracting: (Pout2<=10)
states: 1,005,927,208 (9)
abstracting: (P2<=3)
states: 875,380,792 (8)
abstracting: (Pm3<=P1)
states: 535,886,494 (8)
abstracting: (9<=Pm1)
states: 14,068,912 (7)
abstracting: (Pout2<=0)
states: 198,846,076 (8)
abstracting: (7<=Pback3)
states: 94,965,156 (7)
abstracting: (Pm2<=P1)
states: 535,886,494 (8)
abstracting: (Pback2<=10)
states: 1,005,927,208 (9)
abstracting: (10<=Pback1)
states: 3,517,228 (6)
abstracting: (Pback1<=9)
states: 1,002,409,980 (9)
abstracting: (Pback4<=P2)
states: 469,877,122 (8)
abstracting: (10<=Pout2)
states: 5,398,536 (6)
-> the formula is TRUE

FORMULA Kanban-PT-00010-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.106sec

totally nodes used: 465994 (4.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1252829 563185 1816014
used/not used/entry size/cache size: 791294 66317570 16 1024MB
basic ops cache: hits/miss/sum: 1326745 829510 2156255
used/not used/entry size/cache size: 1502472 15274744 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 57756 26725 84481
used/not used/entry size/cache size: 26707 8361901 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66679151
1 417511
2 7257
3 1680
4 927
5 532
6 387
7 426
8 203
9 221
>= 10 569

Total processing time: 0m 5.402sec


BK_STOP 1678613811583

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

check for maximal unmarked siphon
ok
check for constant places
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:726 (45), effective:220 (13)

initing FirstDep: 0m 0.000sec


iterations count:280 (17), effective:72 (4)

iterations count:513 (32), effective:139 (8)

iterations count:136 (8), effective:33 (2)

iterations count:91 (5), effective:20 (1)

iterations count:371 (23), effective:100 (6)

iterations count:157 (9), effective:47 (2)

iterations count:791 (49), effective:221 (13)

iterations count:259 (16), effective:81 (5)

iterations count:508 (31), effective:159 (9)

iterations count:552 (34), effective:163 (10)

iterations count:399 (24), effective:122 (7)

iterations count:423 (26), effective:127 (7)

iterations count:640 (40), effective:197 (12)

iterations count:287 (17), effective:86 (5)

iterations count:267 (16), effective:73 (4)

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="Kanban-PT-00010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is Kanban-PT-00010, 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 r225-tall-167856407300246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00010.tgz
mv Kanban-PT-00010 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;