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-167856407300238.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-00005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407300238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:56 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:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 11:57 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-00005-ReachabilityCardinality-00
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-01
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-02
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-03
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-04
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-05
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-06
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-07
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-08
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-09
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-10
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-11
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-12
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-13
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-14
FORMULA_NAME Kanban-PT-00005-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678613692657

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-00005
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_00005
(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.910sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 111 (1.1e+02) #states 2,546,432 (6)



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

checking: EF [4<=Pback2]
normalized: E [true U 4<=Pback2]

abstracting: (4<=Pback2)
states: 244,608 (5)
-> the formula is TRUE

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

MC time: 0m 0.003sec

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

abstracting: (Pout1<=1)
states: 1,636,992 (6)
-> the formula is FALSE

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

MC time: 0m 0.001sec

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

abstracting: (Pm1<=3)
states: 2,364,544 (6)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [P1<=Pback1]
normalized: E [true U P1<=Pback1]

abstracting: (P1<=Pback1)
states: 1,546,048 (6)
-> the formula is TRUE

FORMULA Kanban-PT-00005-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[2<=Pout3 & [[[[Pout3<=2 & P3<=2] | [Pout4<=5 | Pback2<=1]] | ~ [Pm1<=2]] & 1<=Pout1]]]]
normalized: ~ [E [true U [[[~ [Pm1<=2] | [[Pout4<=5 | Pback2<=1] | [Pout3<=2 & P3<=2]]] & 1<=Pout1] & 2<=Pout3]]]

abstracting: (2<=Pout3)
states: 1,053,696 (6)
abstracting: (1<=Pout1)
states: 1,591,520 (6)
abstracting: (P3<=2)
states: 2,402,176 (6)
abstracting: (Pout3<=2)
states: 1,978,816 (6)
abstracting: (Pback2<=1)
states: 1,492,736 (6)
abstracting: (Pout4<=5)
states: 2,546,432 (6)
abstracting: (Pm1<=2)
states: 2,091,712 (6)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [~ [[[[2<=Pout4 & ~ [Pout2<=Pm3]] & ~ [[Pback1<=Pm4 & ~ [P1<=4]]]] & [~ [[~ [[~ [Pback1<=Pm4] | [[Pback4<=Pout1 & Pout2<=Pout1] & [2<=Pm3 | Pback1<=Pm3]]]] | Pout1<=P1]] | 2<=Pback4]]]]
normalized: ~ [E [true U [[~ [[~ [P1<=4] & Pback1<=Pm4]] & [~ [Pout2<=Pm3] & 2<=Pout4]] & [~ [[~ [[[[2<=Pm3 | Pback1<=Pm3] & [Pback4<=Pout1 & Pout2<=Pout1]] | ~ [Pback1<=Pm4]]] | Pout1<=P1]] | 2<=Pback4]]]]

abstracting: (2<=Pback4)
states: 909,440 (5)
abstracting: (Pout1<=P1)
states: 1,546,048 (6)
abstracting: (Pback1<=Pm4)
states: 1,602,888 (6)
abstracting: (Pout2<=Pout1)
states: 1,491,000 (6)
abstracting: (Pback4<=Pout1)
states: 1,602,888 (6)
abstracting: (Pback1<=Pm3)
states: 1,676,808 (6)
abstracting: (2<=Pm3)
states: 1,053,696 (6)
abstracting: (2<=Pout4)
states: 909,440 (5)
abstracting: (Pout2<=Pm3)
states: 1,580,544 (6)
abstracting: (Pback1<=Pm4)
states: 1,602,888 (6)
abstracting: (P1<=4)
states: 2,500,960 (6)
-> the formula is FALSE

FORMULA Kanban-PT-00005-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

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

abstracting: (Pm2<=1)
states: 1,492,736 (6)
abstracting: (Pout4<=Pm2)
states: 1,676,808 (6)
abstracting: (Pm4<=2)
states: 2,091,712 (6)
abstracting: (2<=Pout4)
states: 909,440 (5)
abstracting: (P3<=Pm1)
states: 1,958,208 (6)
abstracting: (Pback1<=5)
states: 2,546,432 (6)
abstracting: (P4<=0)
states: 954,912 (5)
abstracting: (4<=Pm3)
states: 244,608 (5)
abstracting: (4<=Pout2)
states: 244,608 (5)
abstracting: (Pback2<=P1)
states: 1,491,000 (6)
abstracting: (Pback1<=0)
states: 954,912 (5)
abstracting: (P3<=Pback1)
states: 1,958,208 (6)
abstracting: (Pback4<=P1)
states: 1,602,888 (6)
abstracting: (Pout1<=0)
states: 954,912 (5)
abstracting: (P2<=P3)
states: 2,546,432 (6)
abstracting: (Pback3<=Pm2)
states: 1,580,544 (6)
abstracting: (4<=Pout3)
states: 244,608 (5)
abstracting: (3<=Pback2)
states: 567,616 (5)
-> the formula is FALSE

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

MC time: 0m 0.005sec

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

abstracting: (Pback3<=0)
states: 834,176 (5)
abstracting: (Pm1<=0)
states: 954,912 (5)
abstracting: (5<=Pm3)
states: 65,856 (4)
abstracting: (1<=P2)
states: 1,163,456 (6)
abstracting: (2<=Pout3)
states: 1,053,696 (6)
abstracting: (Pback2<=P3)
states: 1,244,992 (6)
abstracting: (1<=Pout1)
states: 1,591,520 (6)
abstracting: (5<=Pout3)
states: 65,856 (4)
abstracting: (Pm4<=4)
states: 2,500,960 (6)
abstracting: (Pback1<=1)
states: 1,636,992 (6)
abstracting: (Pback2<=0)
states: 834,176 (5)
abstracting: (2<=Pout2)
states: 1,053,696 (6)
abstracting: (Pback4<=P3)
states: 1,365,504 (6)
abstracting: (Pout2<=0)
states: 834,176 (5)
abstracting: (4<=Pm4)
states: 181,888 (5)
abstracting: (2<=Pm1)
states: 909,440 (5)
abstracting: (Pm3<=P4)
states: 1,491,000 (6)
abstracting: (5<=Pout4)
states: 45,472 (4)
abstracting: (Pback1<=P1)
states: 1,546,048 (6)
abstracting: (Pback4<=P2)
states: 1,365,504 (6)
abstracting: (P2<=1)
states: 2,088,576 (6)
abstracting: (P4<=2)
states: 2,091,712 (6)
abstracting: (1<=P4)
states: 1,591,520 (6)
-> the formula is TRUE

FORMULA Kanban-PT-00005-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (Pout1<=Pout3)
states: 1,676,808 (6)
abstracting: (5<=Pback2)
states: 65,856 (4)
abstracting: (Pback1<=P3)
states: 1,365,504 (6)
abstracting: (Pback3<=0)
states: 834,176 (5)
abstracting: (Pm3<=P3)
states: 1,244,992 (6)
abstracting: (2<=Pout3)
states: 1,053,696 (6)
abstracting: (5<=P1)
states: 45,472 (4)
abstracting: (Pback1<=4)
states: 2,500,960 (6)
abstracting: (P2<=Pm2)
states: 1,947,456 (6)
abstracting: (P1<=0)
states: 954,912 (5)
abstracting: (Pm4<=3)
states: 2,364,544 (6)
abstracting: (Pback4<=1)
states: 1,636,992 (6)
abstracting: (Pback3<=1)
states: 1,492,736 (6)
abstracting: (5<=Pback4)
states: 45,472 (4)
abstracting: (1<=Pm1)
states: 1,591,520 (6)
abstracting: (Pback1<=Pback1)
states: 2,546,432 (6)
abstracting: (P2<=4)
states: 2,543,296 (6)
abstracting: (P1<=P1)
states: 2,546,432 (6)
abstracting: (P3<=4)
states: 2,543,296 (6)
abstracting: (Pout2<=2)
states: 1,978,816 (6)
abstracting: (3<=P3)
states: 144,256 (5)
abstracting: (Pout3<=4)
states: 2,480,576 (6)
abstracting: (Pm4<=2)
states: 2,091,712 (6)
abstracting: (P2<=2)
states: 2,402,176 (6)
abstracting: (P1<=0)
states: 954,912 (5)
-> the formula is TRUE

FORMULA Kanban-PT-00005-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (Pm2<=5)
states: 2,546,432 (6)
abstracting: (4<=Pout2)
states: 244,608 (5)
abstracting: (Pout4<=Pout3)
states: 1,676,808 (6)
abstracting: (Pout1<=P4)
states: 1,602,888 (6)
abstracting: (3<=P2)
states: 144,256 (5)
abstracting: (Pback1<=1)
states: 1,636,992 (6)
abstracting: (P2<=Pback1)
states: 1,958,208 (6)
abstracting: (Pm3<=4)
states: 2,480,576 (6)
abstracting: (Pout3<=3)
states: 2,301,824 (6)
abstracting: (Pout1<=Pm2)
states: 1,676,808 (6)
abstracting: (P1<=1)
states: 1,636,992 (6)
abstracting: (P3<=0)
states: 1,382,976 (6)
abstracting: (P2<=1)
states: 2,088,576 (6)
abstracting: (2<=Pout1)
states: 909,440 (5)
abstracting: (P3<=Pout1)
states: 1,958,208 (6)
abstracting: (1<=P2)
states: 1,163,456 (6)
abstracting: (Pm1<=Pout4)
states: 1,602,888 (6)
abstracting: (Pm3<=5)
states: 2,546,432 (6)
abstracting: (Pout1<=5)
states: 2,546,432 (6)
abstracting: (1<=P4)
states: 1,591,520 (6)
abstracting: (2<=Pout4)
states: 909,440 (5)
abstracting: (Pback2<=Pback1)
states: 1,491,000 (6)
abstracting: (Pm1<=1)
states: 1,636,992 (6)
abstracting: (4<=Pback2)
states: 244,608 (5)
abstracting: (Pm4<=P3)
states: 1,365,504 (6)
abstracting: (Pout1<=4)
states: 2,500,960 (6)
abstracting: (Pback1<=4)
states: 2,500,960 (6)
abstracting: (Pback4<=1)
states: 1,636,992 (6)
-> the formula is TRUE

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

MC time: 0m 0.003sec

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

abstracting: (3<=Pm1)
states: 454,720 (5)
abstracting: (Pm4<=P3)
states: 1,365,504 (6)
abstracting: (5<=Pm4)
states: 45,472 (4)
abstracting: (P1<=5)
states: 2,546,432 (6)
abstracting: (1<=Pm2)
states: 1,712,256 (6)
abstracting: (3<=Pm2)
states: 567,616 (5)
abstracting: (4<=Pout4)
states: 181,888 (5)
abstracting: (5<=Pm2)
states: 65,856 (4)
abstracting: (P4<=5)
states: 2,546,432 (6)
abstracting: (Pback4<=P3)
states: 1,365,504 (6)
abstracting: (1<=Pback1)
states: 1,591,520 (6)
abstracting: (Pm4<=2)
states: 2,091,712 (6)
abstracting: (Pm1<=Pout3)
states: 1,676,808 (6)
abstracting: (1<=Pm1)
states: 1,591,520 (6)
abstracting: (3<=P1)
states: 454,720 (5)
abstracting: (3<=P2)
states: 144,256 (5)
abstracting: (Pm3<=5)
states: 2,546,432 (6)
abstracting: (P4<=3)
states: 2,364,544 (6)
abstracting: (3<=Pout3)
states: 567,616 (5)
abstracting: (2<=P1)
states: 909,440 (5)
abstracting: (2<=P3)
states: 457,856 (5)
abstracting: (P4<=Pback1)
states: 1,602,888 (6)
abstracting: (P2<=4)
states: 2,543,296 (6)
abstracting: (Pout1<=4)
states: 2,500,960 (6)
abstracting: (4<=P3)
states: 31,360 (4)
abstracting: (Pback4<=5)
states: 2,546,432 (6)
abstracting: (2<=Pout3)
states: 1,053,696 (6)
abstracting: (Pm2<=4)
states: 2,480,576 (6)
abstracting: (5<=P4)
states: 45,472 (4)
abstracting: (Pout2<=Pback2)
states: 1,499,008 (6)
abstracting: (Pm3<=Pout3)
states: 1,499,008 (6)
abstracting: (Pout2<=P2)
states: 1,244,992 (6)
abstracting: (Pm2<=3)
states: 2,301,824 (6)
abstracting: (3<=Pout1)
states: 454,720 (5)
-> the formula is FALSE

FORMULA Kanban-PT-00005-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

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

abstracting: (1<=Pback2)
states: 1,712,256 (6)
abstracting: (P3<=4)
states: 2,543,296 (6)
abstracting: (Pout2<=Pout2)
states: 2,546,432 (6)
abstracting: (1<=Pm3)
states: 1,712,256 (6)
abstracting: (3<=P2)
states: 144,256 (5)
abstracting: (2<=P4)
states: 909,440 (5)
abstracting: (Pout1<=0)
states: 954,912 (5)
abstracting: (P3<=0)
states: 1,382,976 (6)
abstracting: (1<=P4)
states: 1,591,520 (6)
abstracting: (P1<=Pout2)
states: 1,676,808 (6)
abstracting: (2<=P1)
states: 909,440 (5)
abstracting: (Pback1<=4)
states: 2,500,960 (6)
abstracting: (P1<=Pm2)
states: 1,676,808 (6)
abstracting: (Pm3<=2)
states: 1,978,816 (6)
abstracting: (Pback4<=2)
states: 2,091,712 (6)
abstracting: (1<=Pm4)
states: 1,591,520 (6)
abstracting: (1<=Pback1)
states: 1,591,520 (6)
abstracting: (5<=Pback3)
states: 65,856 (4)
abstracting: (1<=P3)
states: 1,163,456 (6)
abstracting: (5<=Pout2)
states: 65,856 (4)
abstracting: (Pout4<=Pm3)
states: 1,676,808 (6)
abstracting: (3<=Pm1)
states: 454,720 (5)
abstracting: (P4<=Pm3)
states: 1,676,808 (6)
abstracting: (P1<=Pout3)
states: 1,676,808 (6)
abstracting: (Pout3<=Pback4)
states: 1,491,000 (6)
abstracting: (1<=Pm1)
states: 1,591,520 (6)
abstracting: (3<=Pback4)
states: 454,720 (5)
abstracting: (Pback4<=4)
states: 2,500,960 (6)
abstracting: (1<=Pm1)
states: 1,591,520 (6)
abstracting: (Pback2<=Pm3)
states: 1,580,544 (6)
abstracting: (Pout2<=Pm1)
states: 1,491,000 (6)
abstracting: (Pm3<=4)
states: 2,480,576 (6)
-> the formula is TRUE

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

MC time: 0m 0.013sec

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

abstracting: (1<=P1)
states: 1,591,520 (6)
abstracting: (4<=Pback4)
states: 181,888 (5)
abstracting: (3<=P1)
states: 454,720 (5)
abstracting: (Pout2<=2)
states: 1,978,816 (6)
abstracting: (P3<=2)
states: 2,402,176 (6)
abstracting: (Pout1<=0)
states: 954,912 (5)
abstracting: (Pback1<=1)
states: 1,636,992 (6)
abstracting: (Pback4<=Pback1)
states: 1,602,888 (6)
abstracting: (2<=Pm3)
states: 1,053,696 (6)
abstracting: (Pout4<=4)
states: 2,500,960 (6)
abstracting: (P3<=5)
states: 2,546,432 (6)
abstracting: (2<=Pback3)
states: 1,053,696 (6)
abstracting: (3<=Pout1)
states: 454,720 (5)
abstracting: (1<=P1)
states: 1,591,520 (6)
abstracting: (P4<=2)
states: 2,091,712 (6)
abstracting: (P1<=Pback1)
states: 1,546,048 (6)
abstracting: (Pout3<=0)
states: 834,176 (5)
abstracting: (Pout4<=Pout4)
states: 2,546,432 (6)
abstracting: (P2<=Pout1)
states: 1,958,208 (6)
abstracting: (P3<=4)
states: 2,543,296 (6)
abstracting: (P1<=5)
states: 2,546,432 (6)
abstracting: (5<=Pback1)
states: 45,472 (4)
abstracting: (2<=Pout1)
states: 909,440 (5)
abstracting: (4<=Pm1)
states: 181,888 (5)
abstracting: (1<=Pm2)
states: 1,712,256 (6)
abstracting: (P1<=1)
states: 1,636,992 (6)
abstracting: (Pout1<=Pout3)
states: 1,676,808 (6)
abstracting: (Pm1<=4)
states: 2,500,960 (6)
abstracting: (P2<=Pout2)
states: 1,947,456 (6)
abstracting: (P2<=0)
states: 1,382,976 (6)
abstracting: (4<=P1)
states: 181,888 (5)
abstracting: (P4<=5)
states: 2,546,432 (6)
abstracting: (1<=P3)
states: 1,163,456 (6)
abstracting: (Pout3<=Pout4)
states: 1,491,000 (6)
abstracting: (3<=Pm3)
states: 567,616 (5)
abstracting: (Pout2<=Pm3)
states: 1,580,544 (6)
abstracting: (1<=Pout4)
states: 1,591,520 (6)
abstracting: (Pm3<=3)
states: 2,301,824 (6)
abstracting: (Pm1<=3)
states: 2,364,544 (6)
abstracting: (Pback1<=Pout4)
states: 1,602,888 (6)
abstracting: (Pback1<=5)
states: 2,546,432 (6)
-> the formula is TRUE

FORMULA Kanban-PT-00005-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

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

abstracting: (Pout1<=Pm1)
states: 1,546,048 (6)
abstracting: (2<=Pm4)
states: 909,440 (5)
abstracting: (5<=Pm1)
states: 45,472 (4)
abstracting: (Pm4<=Pm4)
states: 2,546,432 (6)
abstracting: (P2<=P1)
states: 1,958,208 (6)
abstracting: (Pm2<=Pback1)
states: 1,491,000 (6)
abstracting: (Pm3<=3)
states: 2,301,824 (6)
abstracting: (P3<=3)
states: 2,515,072 (6)
abstracting: (5<=Pout1)
states: 45,472 (4)
abstracting: (Pm4<=Pout3)
states: 1,676,808 (6)
abstracting: (5<=Pout3)
states: 65,856 (4)
abstracting: (P1<=4)
states: 2,500,960 (6)
abstracting: (Pback1<=Pm1)
states: 1,546,048 (6)
abstracting: (Pm4<=4)
states: 2,500,960 (6)
abstracting: (3<=P4)
states: 454,720 (5)
abstracting: (1<=Pm4)
states: 1,591,520 (6)
abstracting: (P2<=3)
states: 2,515,072 (6)
abstracting: (Pout1<=2)
states: 2,091,712 (6)
abstracting: (Pm3<=Pout3)
states: 1,499,008 (6)
abstracting: (3<=Pback1)
states: 454,720 (5)
abstracting: (Pout3<=Pm1)
states: 1,491,000 (6)
abstracting: (Pm4<=5)
states: 2,546,432 (6)
abstracting: (5<=P4)
states: 45,472 (4)
abstracting: (Pback3<=2)
states: 1,978,816 (6)
abstracting: (Pback2<=5)
states: 2,546,432 (6)
abstracting: (Pback4<=0)
states: 954,912 (5)
abstracting: (Pm4<=5)
states: 2,546,432 (6)
abstracting: (Pback4<=P2)
states: 1,365,504 (6)
abstracting: (Pback2<=1)
states: 1,492,736 (6)
abstracting: (Pback4<=P4)
states: 1,546,048 (6)
abstracting: (Pm1<=4)
states: 2,500,960 (6)
abstracting: (Pback2<=5)
states: 2,546,432 (6)
abstracting: (Pback1<=Pm4)
states: 1,602,888 (6)
abstracting: (Pout4<=Pback4)
states: 1,546,048 (6)
abstracting: (Pback2<=0)
states: 834,176 (5)
abstracting: (Pback1<=Pback1)
states: 2,546,432 (6)
abstracting: (P4<=Pout1)
states: 1,602,888 (6)
abstracting: (4<=P2)
states: 31,360 (4)
abstracting: (Pm1<=P4)
states: 1,602,888 (6)
abstracting: (Pm3<=3)
states: 2,301,824 (6)
-> the formula is TRUE

FORMULA Kanban-PT-00005-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

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

abstracting: (2<=Pback2)
states: 1,053,696 (6)
abstracting: (P2<=Pback2)
states: 1,947,456 (6)
abstracting: (3<=Pback2)
states: 567,616 (5)
abstracting: (Pback2<=P4)
states: 1,491,000 (6)
abstracting: (Pm2<=Pm3)
states: 1,580,544 (6)
abstracting: (Pm1<=3)
states: 2,364,544 (6)
abstracting: (Pm3<=2)
states: 1,978,816 (6)
abstracting: (Pback3<=4)
states: 2,480,576 (6)
abstracting: (P1<=3)
states: 2,364,544 (6)
abstracting: (Pm4<=2)
states: 2,091,712 (6)
abstracting: (4<=Pout1)
states: 181,888 (5)
abstracting: (P3<=5)
states: 2,546,432 (6)
abstracting: (5<=P1)
states: 45,472 (4)
abstracting: (5<=Pm2)
states: 65,856 (4)
abstracting: (Pback4<=5)
states: 2,546,432 (6)
abstracting: (P3<=Pm2)
states: 1,947,456 (6)
abstracting: (Pback3<=5)
states: 2,546,432 (6)
abstracting: (5<=Pm3)
states: 65,856 (4)
abstracting: (4<=P2)
states: 31,360 (4)
abstracting: (Pm4<=Pback1)
states: 1,602,888 (6)
abstracting: (3<=Pback4)
states: 454,720 (5)
abstracting: (5<=Pm3)
states: 65,856 (4)
abstracting: (P3<=4)
states: 2,543,296 (6)
abstracting: (1<=Pout4)
states: 1,591,520 (6)
abstracting: (Pout1<=Pout1)
states: 2,546,432 (6)
abstracting: (Pm4<=4)
states: 2,500,960 (6)
abstracting: (Pm3<=P1)
states: 1,491,000 (6)
abstracting: (2<=Pm1)
states: 909,440 (5)
abstracting: (P1<=Pout2)
states: 1,676,808 (6)
abstracting: (1<=P1)
states: 1,591,520 (6)
abstracting: (3<=Pm2)
states: 567,616 (5)
abstracting: (Pm2<=Pout2)
states: 1,499,008 (6)
abstracting: (2<=Pout2)
states: 1,053,696 (6)
abstracting: (Pout4<=4)
states: 2,500,960 (6)
abstracting: (Pm1<=Pback4)
states: 1,602,888 (6)
abstracting: (3<=Pm4)
states: 454,720 (5)
abstracting: (Pback2<=Pm3)
states: 1,580,544 (6)
abstracting: (2<=Pm4)
states: 909,440 (5)
abstracting: (Pback2<=Pback3)
states: 1,580,544 (6)
abstracting: (3<=P3)
states: 144,256 (5)
abstracting: (Pout4<=P4)
states: 1,546,048 (6)
abstracting: (Pback2<=4)
states: 2,480,576 (6)
abstracting: (5<=Pm1)
states: 45,472 (4)
abstracting: (1<=Pback2)
states: 1,712,256 (6)
abstracting: (P2<=P3)
states: 2,546,432 (6)
abstracting: (Pback1<=3)
states: 2,364,544 (6)
abstracting: (Pout3<=2)
states: 1,978,816 (6)
abstracting: (P1<=Pm4)
states: 1,602,888 (6)
abstracting: (Pm4<=3)
states: 2,364,544 (6)
abstracting: (P1<=P3)
states: 1,365,504 (6)
abstracting: (Pback4<=Pout2)
states: 1,676,808 (6)
abstracting: (P1<=Pback2)
states: 1,676,808 (6)
abstracting: (2<=Pback4)
states: 909,440 (5)
abstracting: (Pback2<=P3)
states: 1,244,992 (6)
abstracting: (3<=Pout1)
states: 454,720 (5)
abstracting: (2<=Pout2)
states: 1,053,696 (6)
abstracting: (5<=Pback3)
states: 65,856 (4)
abstracting: (5<=Pback1)
states: 45,472 (4)
abstracting: (P2<=3)
states: 2,515,072 (6)
-> the formula is FALSE

FORMULA Kanban-PT-00005-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

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

abstracting: (Pback1<=P2)
states: 1,365,504 (6)
abstracting: (Pback2<=4)
states: 2,480,576 (6)
abstracting: (P1<=Pback4)
states: 1,602,888 (6)
abstracting: (2<=P3)
states: 457,856 (5)
abstracting: (3<=Pout3)
states: 567,616 (5)
abstracting: (5<=Pout4)
states: 45,472 (4)
abstracting: (P2<=2)
states: 2,402,176 (6)
abstracting: (4<=P1)
states: 181,888 (5)
abstracting: (2<=Pm1)
states: 909,440 (5)
abstracting: (P2<=Pm1)
states: 1,958,208 (6)
abstracting: (Pout4<=Pback4)
states: 1,546,048 (6)
abstracting: (2<=Pback2)
states: 1,053,696 (6)
abstracting: (P1<=5)
states: 2,546,432 (6)
abstracting: (Pm2<=Pback4)
states: 1,491,000 (6)
abstracting: (2<=P2)
states: 457,856 (5)
abstracting: (P3<=P2)
states: 2,546,432 (6)
abstracting: (Pback3<=2)
states: 1,978,816 (6)
abstracting: (P2<=Pback3)
states: 1,947,456 (6)
abstracting: (Pm4<=Pout1)
states: 1,602,888 (6)
abstracting: (P4<=Pout3)
states: 1,676,808 (6)
abstracting: (4<=Pout2)
states: 244,608 (5)
abstracting: (Pout3<=0)
states: 834,176 (5)
abstracting: (Pout4<=Pout3)
states: 1,676,808 (6)
abstracting: (3<=P4)
states: 454,720 (5)
abstracting: (4<=P2)
states: 31,360 (4)
abstracting: (P3<=P1)
states: 1,958,208 (6)
abstracting: (P3<=Pback4)
states: 1,958,208 (6)
abstracting: (Pm3<=Pm4)
states: 1,491,000 (6)
abstracting: (P3<=5)
states: 2,546,432 (6)
abstracting: (Pback4<=Pback4)
states: 2,546,432 (6)
abstracting: (Pm3<=Pout1)
states: 1,491,000 (6)
abstracting: (3<=P3)
states: 144,256 (5)
abstracting: (Pback4<=1)
states: 1,636,992 (6)
abstracting: (2<=Pm1)
states: 909,440 (5)
abstracting: (3<=Pback3)
states: 567,616 (5)
abstracting: (Pm2<=5)
states: 2,546,432 (6)
abstracting: (4<=Pback4)
states: 181,888 (5)
abstracting: (Pout4<=0)
states: 954,912 (5)
abstracting: (1<=Pback2)
states: 1,712,256 (6)
abstracting: (Pm1<=Pm1)
states: 2,546,432 (6)
abstracting: (Pout4<=1)
states: 1,636,992 (6)
abstracting: (1<=Pout4)
states: 1,591,520 (6)
abstracting: (Pout3<=Pback4)
states: 1,491,000 (6)
abstracting: (5<=Pout3)
states: 65,856 (4)
abstracting: (Pback2<=2)
states: 1,978,816 (6)
abstracting: (Pback3<=Pout4)
states: 1,491,000 (6)
abstracting: (P4<=2)
states: 2,091,712 (6)
abstracting: (Pback4<=1)
states: 1,636,992 (6)
abstracting: (Pm1<=P3)
states: 1,365,504 (6)
abstracting: (Pback4<=P1)
states: 1,602,888 (6)
abstracting: (Pout3<=Pout1)
states: 1,491,000 (6)
abstracting: (Pm3<=Pback4)
states: 1,491,000 (6)
abstracting: (Pout4<=1)
states: 1,636,992 (6)
abstracting: (Pm4<=3)
states: 2,364,544 (6)
abstracting: (2<=Pout3)
states: 1,053,696 (6)
abstracting: (5<=Pback2)
states: 65,856 (4)
-> the formula is FALSE

FORMULA Kanban-PT-00005-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

totally nodes used: 57794 (5.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 135544 92430 227974
used/not used/entry size/cache size: 117697 66991167 16 1024MB
basic ops cache: hits/miss/sum: 121007 99839 220846
used/not used/entry size/cache size: 196487 16580729 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: 11762 7569 19331
used/not used/entry size/cache size: 7569 8381039 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 67055530
1 51440
2 1338
3 220
4 97
5 81
6 45
7 22
8 10
9 16
>= 10 65

Total processing time: 0m 4.660sec


BK_STOP 1678613697363

--------------------
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.001sec


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

initing FirstDep: 0m 0.000sec


iterations count:184 (11), effective:53 (3)

iterations count:96 (6), effective:22 (1)

iterations count:168 (10), effective:44 (2)

iterations count:181 (11), effective:45 (2)

iterations count:94 (5), effective:23 (1)

iterations count:167 (10), effective:47 (2)

iterations count:119 (7), effective:34 (2)

iterations count:291 (18), effective:83 (5)

iterations count:317 (19), effective:93 (5)

iterations count:356 (22), effective:105 (6)

iterations count:313 (19), effective:94 (5)

iterations count:289 (18), effective:83 (5)

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-00005"
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-00005, 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-167856407300238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00005.tgz
mv Kanban-PT-00005 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 ;