About the Execution of Marcie for Kanban-PT-00050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
13820.668 | 3600000.00 | 3597771.00 | 179.80 | ?TFTTFFTTTFFTTFT | normal |
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-167856407300262.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-00050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407300262
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:58 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.5K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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-00050-ReachabilityCardinality-00
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-01
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-02
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-03
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-04
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-05
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-06
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-07
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-08
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-09
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-10
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-11
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-12
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-13
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-14
FORMULA_NAME Kanban-PT-00050-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678613827768
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-00050
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_00050
(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.899sec
RS generation: 0m 0.141sec
-> reachability set: #nodes 3216 (3.2e+03) #states 10,425,941,194,901,336 (16)
starting MCC model checker
--------------------------
checking: EF [30<=Pm4]
normalized: E [true U 30<=Pm4]
abstracting: (30<=Pm4)
states: 788,198,662,006,756 (14)
-> the formula is TRUE
FORMULA Kanban-PT-00050-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.052sec
checking: AG [Pm4<=Pm4]
normalized: ~ [E [true U ~ [Pm4<=Pm4]]]
abstracting: (Pm4<=Pm4)
states: 10,425,941,194,901,336 (16)
-> the formula is TRUE
FORMULA Kanban-PT-00050-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [Pout3<=P3]
normalized: ~ [E [true U ~ [Pout3<=P3]]]
abstracting: (Pout3<=P3)
states: 3,871,551,556,998,216 (15)
-> the formula is FALSE
FORMULA Kanban-PT-00050-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.170sec
checking: EF [[~ [Pm4<=22] & Pout4<=Pback4]]
normalized: E [true U [~ [Pm4<=22] & Pout4<=Pback4]]
abstracting: (Pout4<=Pback4)
states: 5,363,400,381,616,836 (15)
abstracting: (Pm4<=22)
states: 8,619,003,550,775,176 (15)
-> the formula is TRUE
FORMULA Kanban-PT-00050-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.667sec
checking: EF [[7<=Pback1 & ~ [[[23<=Pout4 & ~ [Pback4<=26]] & ~ [28<=Pback3]]]]]
normalized: E [true U [7<=Pback1 & ~ [[~ [28<=Pback3] & [23<=Pout4 & ~ [Pback4<=26]]]]]]
abstracting: (Pback4<=26)
states: 9,268,789,009,007,736 (15)
abstracting: (23<=Pout4)
states: 1,806,937,644,126,160 (15)
abstracting: (28<=Pback3)
states: 1,348,774,304,963,280 (15)
abstracting: (7<=Pback1)
states: 6,755,988,531,486,480 (15)
-> the formula is TRUE
FORMULA Kanban-PT-00050-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.141sec
checking: EF [[[[P1<=Pback3 & [42<=P2 | 41<=P3]] | P1<=48] & ~ [[Pout3<=14 | 35<=P1]]]]
normalized: E [true U [~ [[Pout3<=14 | 35<=P1]] & [P1<=48 | [P1<=Pback3 & [42<=P2 | 41<=P3]]]]]
abstracting: (41<=P3)
states: 4,358,390,714,392 (12)
abstracting: (42<=P2)
states: 2,698,338,849,492 (12)
abstracting: (P1<=Pback3)
states: 5,785,450,047,027,846 (15)
abstracting: (P1<=48)
states: 10,424,160,960,769,192 (16)
abstracting: (35<=P1)
states: 363,167,762,957,376 (14)
abstracting: (Pout3<=14)
states: 6,077,695,729,708,148 (15)
-> the formula is TRUE
FORMULA Kanban-PT-00050-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.193sec
checking: AG [[[[~ [[~ [P2<=0] | [~ [P2<=41] & P1<=Pout3]]] | ~ [49<=Pback2]] & ~ [18<=Pback1]] | [40<=Pout1 & ~ [P3<=Pout3]]]]
normalized: ~ [E [true U ~ [[[40<=Pout1 & ~ [P3<=Pout3]] | [~ [18<=Pback1] & [~ [49<=Pback2] | ~ [[[P1<=Pout3 & ~ [P2<=41]] | ~ [P2<=0]]]]]]]]]
abstracting: (P2<=0)
states: 964,902,265,391,376 (14)
abstracting: (P2<=41)
states: 10,423,242,856,051,844 (16)
abstracting: (P1<=Pout3)
states: 5,785,450,047,027,846 (15)
abstracting: (49<=Pback2)
states: 2,882,728,081,428 (12)
abstracting: (18<=Pback1)
states: 2,912,908,098,720,620 (15)
abstracting: (P3<=Pout3)
states: 6,909,504,091,400,196 (15)
abstracting: (40<=Pout1)
states: 127,286,740,448,296 (14)
-> the formula is FALSE
FORMULA Kanban-PT-00050-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.319sec
checking: EF [~ [[~ [[[[[[10<=P1 & Pout3<=19] | ~ [Pout1<=P1]] | ~ [Pm1<=P1]] | 39<=Pback3] & 29<=Pout4]] | Pout1<=P2]]]
normalized: E [true U ~ [[Pout1<=P2 | ~ [[29<=Pout4 & [39<=Pback3 | [[~ [Pout1<=P1] | [10<=P1 & Pout3<=19]] | ~ [Pm1<=P1]]]]]]]]
abstracting: (Pm1<=P1)
states: 5,363,400,381,616,836 (15)
abstracting: (Pout3<=19)
states: 7,470,734,974,663,064 (15)
abstracting: (10<=P1)
states: 5,492,467,356,197,276 (15)
abstracting: (Pout1<=P1)
states: 5,363,400,381,616,836 (15)
abstracting: (39<=Pback3)
states: 237,958,145,255,740 (14)
abstracting: (29<=Pout4)
states: 900,798,470,864,864 (14)
abstracting: (Pout1<=P2)
states: 4,126,144,519,495,206 (15)
-> the formula is TRUE
FORMULA Kanban-PT-00050-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.426sec
checking: AG [[~ [[[~ [Pm3<=13] & ~ [[[[15<=P2 & 7<=Pout2] | ~ [Pm1<=1]] & Pback3<=3]]] & ~ [[Pm4<=10 | 5<=Pm3]]]] | [44<=P2 & Pback4<=Pout1]]]
normalized: ~ [E [true U ~ [[[44<=P2 & Pback4<=Pout1] | ~ [[~ [[Pm4<=10 | 5<=Pm3]] & [~ [[Pback3<=3 & [~ [Pm1<=1] | [15<=P2 & 7<=Pout2]]]] & ~ [Pm3<=13]]]]]]]]
abstracting: (Pm3<=13)
states: 5,761,733,256,458,816 (15)
abstracting: (7<=Pout2)
states: 7,231,240,252,474,524 (15)
abstracting: (15<=P2)
states: 1,900,404,326,283,528 (15)
abstracting: (Pm1<=1)
states: 1,157,597,244,426,636 (15)
abstracting: (Pback3<=3)
states: 1,902,641,143,275,704 (15)
abstracting: (5<=Pm3)
states: 8,079,771,510,192,720 (15)
abstracting: (Pm4<=10)
states: 5,316,669,235,648,056 (15)
abstracting: (Pback4<=Pout1)
states: 5,393,441,832,596,766 (15)
abstracting: (44<=P2)
states: 875,848,851,696 (11)
-> the formula is TRUE
FORMULA Kanban-PT-00050-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.281sec
checking: EF [[[~ [[[~ [[36<=Pback3 | Pout3<=Pout4]] | Pback4<=Pout3] | [~ [Pm2<=Pout1] | ~ [[14<=Pout1 | [~ [P4<=46] | [45<=Pback3 & Pm1<=37]]]]]]] | 18<=Pout4] & 11<=Pback4]]
normalized: E [true U [11<=Pback4 & [18<=Pout4 | ~ [[[~ [[14<=Pout1 | [[45<=Pback3 & Pm1<=37] | ~ [P4<=46]]]] | ~ [Pm2<=Pout1]] | [Pback4<=Pout3 | ~ [[36<=Pback3 | Pout3<=Pout4]]]]]]]]
abstracting: (Pout3<=Pout4)
states: 4,979,492,122,731,516 (15)
abstracting: (36<=Pback3)
states: 431,606,899,544,288 (14)
abstracting: (Pback4<=Pout3)
states: 5,785,450,047,027,846 (15)
abstracting: (Pm2<=Pout1)
states: 4,979,492,122,731,516 (15)
abstracting: (P4<=46)
states: 10,417,040,024,240,616 (16)
abstracting: (Pm1<=37)
states: 10,223,439,562,369,956 (16)
abstracting: (45<=Pback3)
states: 38,821,616,207,192 (13)
abstracting: (14<=Pout1)
states: 4,067,389,933,416,004 (15)
abstracting: (18<=Pout4)
states: 2,912,908,098,720,620 (15)
abstracting: (11<=Pback4)
states: 5,109,271,959,253,280 (15)
-> the formula is TRUE
FORMULA Kanban-PT-00050-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.067sec
checking: EF [~ [[Pback3<=P2 | ~ [[[[Pback4<=Pm4 | 48<=P3] | [[P4<=P2 | [P3<=Pback4 & P3<=Pback3]] & ~ [[15<=Pout1 | P3<=7]]]] | [[[[Pm4<=Pm3 | P4<=Pback2] & 35<=Pout2] | 46<=Pm1] & [~ [Pback3<=P4] | Pm4<=22]]]]]]]
normalized: E [true U ~ [[Pback3<=P2 | ~ [[[[Pm4<=22 | ~ [Pback3<=P4]] & [46<=Pm1 | [35<=Pout2 & [Pm4<=Pm3 | P4<=Pback2]]]] | [[~ [[15<=Pout1 | P3<=7]] & [P4<=P2 | [P3<=Pback4 & P3<=Pback3]]] | [Pback4<=Pm4 | 48<=P3]]]]]]]
abstracting: (48<=P3)
states: 25,243,763,896 (10)
abstracting: (Pback4<=Pm4)
states: 5,363,400,381,616,836 (15)
abstracting: (P3<=Pback3)
states: 6,909,504,091,400,196 (15)
abstracting: (P3<=Pback4)
states: 6,729,415,902,932,346 (15)
abstracting: (P4<=P2)
states: 4,126,144,519,495,206 (15)
abstracting: (P3<=7)
states: 5,904,720,520,495,472 (15)
abstracting: (15<=Pout1)
states: 3,754,513,784,691,696 (15)
abstracting: (P4<=Pback2)
states: 5,785,450,047,027,846 (15)
abstracting: (Pm4<=Pm3)
states: 5,785,450,047,027,846 (15)
abstracting: (35<=Pout2)
states: 512,845,721,981,424 (14)
abstracting: (46<=Pm1)
states: 15,577,048,656,260 (13)
abstracting: (Pback3<=P4)
states: 4,979,492,122,731,516 (15)
abstracting: (Pm4<=22)
states: 8,619,003,550,775,176 (15)
abstracting: (Pback3<=P2)
states: 3,871,551,556,998,216 (15)
-> the formula is TRUE
FORMULA Kanban-PT-00050-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m38.815sec
checking: AG [[32<=P1 | [[[[[~ [Pout3<=Pm2] | [[~ [Pout4<=Pback1] | Pout2<=Pm1] | [[23<=Pout4 | 28<=P1] | [Pm2<=24 | Pback1<=Pout1]]]] | [~ [[[24<=P3 | Pback2<=Pm3] | [Pm3<=P3 | Pback2<=Pm1]]] & Pm4<=P3]] & P2<=Pm1] | Pback2<=43] | 19<=Pm2]]]
normalized: ~ [E [true U ~ [[32<=P1 | [19<=Pm2 | [Pback2<=43 | [P2<=Pm1 & [[Pm4<=P3 & ~ [[[24<=P3 | Pback2<=Pm3] | [Pm3<=P3 | Pback2<=Pm1]]]] | [[[[Pm2<=24 | Pback1<=Pout1] | [23<=Pout4 | 28<=P1]] | [Pout2<=Pm1 | ~ [Pout4<=Pback1]]] | ~ [Pout3<=Pm2]]]]]]]]]]
abstracting: (Pout3<=Pm2)
states: 5,380,094,192,436,756 (15)
abstracting: (Pout4<=Pback1)
states: 5,393,441,832,596,766 (15)
abstracting: (Pout2<=Pm1)
states: 4,979,492,122,731,516 (15)
abstracting: (28<=P1)
states: 1,023,634,625,982,800 (15)
abstracting: (23<=Pout4)
states: 1,806,937,644,126,160 (15)
abstracting: (Pback1<=Pout1)
states: 5,363,400,381,616,836 (15)
abstracting: (Pm2<=24)
states: 8,561,178,319,351,580 (15)
abstracting: (Pback2<=Pm1)
states: 4,979,492,122,731,516 (15)
abstracting: (Pm3<=P3)
states: 3,871,551,556,998,216 (15)
abstracting: (Pback2<=Pm3)
states: 5,380,094,192,436,756 (15)
abstracting: (24<=P3)
states: 471,229,730,866,440 (14)
abstracting: (Pm4<=P3)
states: 4,126,144,519,495,206 (15)
abstracting: (P2<=Pm1)
states: 6,729,415,902,932,346 (15)
abstracting: (Pback2<=43)
states: 10,368,273,462,613,352 (16)
abstracting: (19<=Pm2)
states: 3,209,176,045,911,264 (15)
abstracting: (32<=P1)
states: 591,927,848,937,880 (14)
-> the formula is FALSE
FORMULA Kanban-PT-00050-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.538sec
checking: EF [[[[[~ [Pback4<=P4] & [[~ [[7<=P1 | ~ [47<=Pout1]]] & ~ [39<=Pout3]] | Pout3<=Pback1]] | [29<=Pback4 | ~ [[Pm4<=Pout3 & P1<=30]]]] | [Pout1<=Pout4 | [[~ [46<=P1] & ~ [[~ [26<=Pm4] & [[Pout3<=Pback2 | Pback2<=P3] & [17<=P4 | Pback4<=Pback1]]]]] | [[[~ [[Pout3<=P1 & Pm4<=Pback3]] | [Pout2<=Pm2 & Pback2<=P2]] & [P1<=49 & 34<=Pout4]] | [Pback2<=21 | Pout2<=Pback1]]]]] & P3<=3]]
normalized: E [true U [P3<=3 & [[Pout1<=Pout4 | [[[[~ [[Pout3<=P1 & Pm4<=Pback3]] | [Pout2<=Pm2 & Pback2<=P2]] & [P1<=49 & 34<=Pout4]] | [Pback2<=21 | Pout2<=Pback1]] | [~ [[[[17<=P4 | Pback4<=Pback1] & [Pout3<=Pback2 | Pback2<=P3]] & ~ [26<=Pm4]]] & ~ [46<=P1]]]] | [[29<=Pback4 | ~ [[Pm4<=Pout3 & P1<=30]]] | [[Pout3<=Pback1 | [~ [39<=Pout3] & ~ [[7<=P1 | ~ [47<=Pout1]]]]] & ~ [Pback4<=P4]]]]]]
abstracting: (Pback4<=P4)
states: 5,363,400,381,616,836 (15)
abstracting: (47<=Pout1)
states: 8,901,170,660,720 (12)
abstracting: (7<=P1)
states: 6,755,988,531,486,480 (15)
abstracting: (39<=Pout3)
states: 237,958,145,255,740 (14)
abstracting: (Pout3<=Pback1)
states: 4,979,492,122,731,516 (15)
abstracting: (P1<=30)
states: 9,740,551,054,025,896 (15)
abstracting: (Pm4<=Pout3)
states: 5,785,450,047,027,846 (15)
abstracting: (29<=Pback4)
states: 900,798,470,864,864 (14)
abstracting: (46<=P1)
states: 15,577,048,656,260 (13)
abstracting: (26<=Pm4)
states: 1,301,796,209,130,300 (15)
abstracting: (Pback2<=P3)
states: 3,871,551,556,998,216 (15)
abstracting: (Pout3<=Pback2)
states: 5,380,094,192,436,756 (15)
abstracting: (Pback4<=Pback1)
states: 5,393,441,832,596,766 (15)
abstracting: (17<=P4)
states: 3,177,717,925,877,040 (15)
abstracting: (Pout2<=Pback1)
states: 4,979,492,122,731,516 (15)
abstracting: (Pback2<=21)
states: 7,942,412,507,949,920 (15)
abstracting: (34<=Pout4)
states: 431,261,718,511,884 (14)
abstracting: (P1<=49)
states: 10,425,496,136,368,300 (16)
abstracting: (Pback2<=P2)
states: 3,871,551,556,998,216 (15)
abstracting: (Pout2<=Pm2)
states: 5,338,359,665,386,956 (15)
abstracting: (Pm4<=Pback3)
states: 5,785,450,047,027,846 (15)
abstracting: (Pout3<=P1)
states: 4,979,492,122,731,516 (15)
abstracting: (Pout1<=Pout4)
states: 5,393,441,832,596,766 (15)
abstracting: (P3<=3)
states: 3,439,463,928,384,952 (15)
MC time: 15m25.318sec
checking: AG [~ [[[[[[Pout1<=P2 & P4<=7] & [[[Pback4<=Pm4 | [Pback1<=30 | Pm3<=Pback3]] | ~ [[Pout2<=Pout2 | 48<=Pm2]]] | 10<=P1]] & ~ [[[[[38<=Pout1 & 32<=Pout2] | ~ [P1<=2]] | [[Pback3<=P4 | 16<=P2] | [9<=Pback3 & 29<=Pout3]]] & [[~ [12<=Pm4] & ~ [Pout3<=Pout3]] & [~ [Pback3<=Pm2] | [P4<=Pm3 | Pback3<=Pm1]]]]]] & P1<=37] & [~ [[Pm3<=37 & ~ [[~ [[36<=Pm4 & 18<=Pback3]] & [21<=Pout3 & 43<=P2]]]]] & Pback1<=4]]]]
normalized: ~ [E [true U [[Pback1<=4 & ~ [[Pm3<=37 & ~ [[[21<=Pout3 & 43<=P2] & ~ [[36<=Pm4 & 18<=Pback3]]]]]]] & [P1<=37 & [~ [[[[[P4<=Pm3 | Pback3<=Pm1] | ~ [Pback3<=Pm2]] & [~ [Pout3<=Pout3] & ~ [12<=Pm4]]] & [[[9<=Pback3 & 29<=Pout3] | [Pback3<=P4 | 16<=P2]] | [~ [P1<=2] | [38<=Pout1 & 32<=Pout2]]]]] & [[10<=P1 | [~ [[Pout2<=Pout2 | 48<=Pm2]] | [Pback4<=Pm4 | [Pback1<=30 | Pm3<=Pback3]]]] & [Pout1<=P2 & P4<=7]]]]]]]
abstracting: (P4<=7)
states: 4,110,560,611,120,496 (15)
abstracting: (Pout1<=P2)
states: 4,126,144,519,495,206 (15)
abstracting: (Pm3<=Pback3)
states: 5,338,359,665,386,956 (15)
abstracting: (Pback1<=30)
states: 9,740,551,054,025,896 (15)
abstracting: (Pback4<=Pm4)
states: 5,363,400,381,616,836 (15)
abstracting: (48<=Pm2)
states: 7,137,399,852,856 (12)
abstracting: (Pout2<=Pout2)
states: 10,425,941,194,901,336 (16)
abstracting: (10<=P1)
states: 5,492,467,356,197,276 (15)
abstracting: (32<=Pout2)
states: 811,473,961,096,344 (14)
abstracting: (38<=Pout1)
states: 202,501,632,531,380 (14)
abstracting: (P1<=2)
states: 1,702,793,947,395,736 (15)
abstracting: (16<=P2)
states: 1,656,990,784,138,872 (15)
abstracting: (Pback3<=P4)
states: 4,979,492,122,731,516 (15)
abstracting: (29<=Pout3)
states: 1,198,750,616,129,352 (15)
abstracting: (9<=Pback3)
states: 6,434,004,871,770,476 (15)
abstracting: (12<=Pm4)
states: 4,744,323,962,163,760 (15)
abstracting: (Pout3<=Pout3)
states: 10,425,941,194,901,336 (16)
abstracting: (Pback3<=Pm2)
states: 5,380,094,192,436,756 (15)
abstracting: (Pback3<=Pm1)
states: 4,979,492,122,731,516 (15)
abstracting: (P4<=Pm3)
states: 5,785,450,047,027,846 (15)
abstracting: (P1<=37)
states: 10,223,439,562,369,956 (16)
abstracting: (18<=Pback3)
states: 3,475,375,926,414,392 (15)
abstracting: (36<=Pm4)
states: 302,639,802,464,480 (14)
abstracting: (43<=P2)
states: 1,587,064,460,592 (12)
abstracting: (21<=Pout3)
states: 2,713,362,181,674,976 (15)
abstracting: (Pm3<=37)
states: 10,131,402,445,537,568 (16)
abstracting: (Pback1<=4)
states: 2,728,208,807,510,680 (15)
-> the formula is FALSE
FORMULA Kanban-PT-00050-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m17.140sec
checking: AG [[[Pout3<=32 & 25<=Pm2] | [~ [[~ [[[~ [P4<=Pm4] | [Pm2<=14 & ~ [Pout2<=Pback1]]] | [24<=P1 | [Pout3<=Pout2 & [Pback4<=Pm1 & 31<=P1]]]]] | [~ [[~ [Pm1<=Pout4] & [[Pback2<=10 | 1<=Pback3] & [38<=P1 | 9<=P3]]]] & [[[[Pm2<=P4 | Pback4<=Pm4] | [5<=P3 | 32<=Pout2]] | [14<=P1 | [Pback2<=P2 | Pm1<=17]]] | Pm2<=10]]]] | ~ [[8<=Pback3 & ~ [[[~ [[Pback3<=6 & Pout3<=22]] | ~ [[Pback2<=Pm2 | 44<=Pback1]]] & P2<=15]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[8<=Pback3 & ~ [[P2<=15 & [~ [[Pback3<=6 & Pout3<=22]] | ~ [[Pback2<=Pm2 | 44<=Pback1]]]]]]] | ~ [[[[Pm2<=10 | [[14<=P1 | [Pback2<=P2 | Pm1<=17]] | [[5<=P3 | 32<=Pout2] | [Pm2<=P4 | Pback4<=Pm4]]]] & ~ [[[[38<=P1 | 9<=P3] & [Pback2<=10 | 1<=Pback3]] & ~ [Pm1<=Pout4]]]] | ~ [[[24<=P1 | [Pout3<=Pout2 & [Pback4<=Pm1 & 31<=P1]]] | [[Pm2<=14 & ~ [Pout2<=Pback1]] | ~ [P4<=Pm4]]]]]]] | [Pout3<=32 & 25<=Pm2]]]]]
abstracting: (25<=Pm2)
states: 1,864,762,875,549,756 (15)
abstracting: (Pout3<=32)
states: 9,723,479,135,525,012 (15)
abstracting: (P4<=Pm4)
states: 5,363,400,381,616,836 (15)
abstracting: (Pout2<=Pback1)
states: 4,979,492,122,731,516 (15)
abstracting: (Pm2<=14)
states: 6,077,695,729,708,148 (15)
abstracting: (31<=P1)
states: 685,390,140,875,440 (14)
abstracting: (Pback4<=Pm1)
states: 5,393,441,832,596,766 (15)
abstracting: (Pout3<=Pout2)
states: 5,380,094,192,436,756 (15)
abstracting: (24<=P1)
states: 1,626,243,879,713,544 (15)
abstracting: (Pm1<=Pout4)
states: 5,393,441,832,596,766 (15)
abstracting: (1<=Pback3)
states: 9,930,998,240,519,460 (15)
abstracting: (Pback2<=10)
states: 4,738,017,411,409,568 (15)
abstracting: (9<=P3)
states: 4,030,110,930,693,848 (15)
abstracting: (38<=P1)
states: 202,501,632,531,380 (14)
abstracting: (Pback4<=Pm4)
states: 5,363,400,381,616,836 (15)
abstracting: (Pm2<=P4)
states: 4,979,492,122,731,516 (15)
abstracting: (32<=Pout2)
states: 811,473,961,096,344 (14)
abstracting: (5<=P3)
states: 6,288,221,586,493,600 (15)
abstracting: (Pm1<=17)
states: 7,513,033,096,180,716 (15)
abstracting: (Pback2<=P2)
states: 3,871,551,556,998,216 (15)
abstracting: (14<=P1)
states: 4,067,389,933,416,004 (15)
abstracting: (Pm2<=10)
states: 4,738,017,411,409,568 (15)
abstracting: (44<=Pback1)
states: 37,384,916,775,024 (13)
abstracting: (Pback2<=Pm2)
states: 5,338,359,665,386,956 (15)
abstracting: (Pout3<=22)
states: 8,160,362,226,430,700 (15)
abstracting: (Pback3<=6)
states: 3,194,700,942,426,812 (15)
abstracting: (P2<=15)
states: 8,768,950,410,762,464 (15)
abstracting: (8<=Pback3)
states: 6,826,217,780,200,104 (15)
-> the formula is FALSE
FORMULA Kanban-PT-00050-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m24.425sec
checking: AG [[[~ [[[[~ [24<=Pback4] | [[[Pm4<=Pback3 & 40<=P4] & ~ [P1<=32]] | [~ [P1<=30] | [21<=Pout2 | Pback3<=29]]]] | [[[[Pout1<=Pback4 | Pm3<=Pout1] | Pback3<=Pback1] & [Pm1<=42 & [30<=P1 | Pm2<=Pm3]]] & [~ [[13<=Pback2 | Pout1<=Pback3]] & ~ [26<=Pback4]]]] | [Pout4<=Pback4 | [~ [23<=Pback4] & [~ [[45<=Pm3 & Pm2<=Pm4]] | ~ [Pback1<=47]]]]]] | [[[19<=Pm4 & [Pback2<=Pm1 | ~ [[~ [23<=Pback2] & ~ [23<=Pout1]]]]] & ~ [[~ [Pout3<=20] & 19<=P1]]] | ~ [[16<=Pback1 | [~ [Pm2<=P2] & Pout4<=Pback3]]]]] & [9<=P3 | [[[~ [P1<=31] & [[[[P3<=41 | P3<=P2] & [Pm3<=P4 & Pback3<=Pm3]] & [~ [6<=Pm1] & [36<=Pout2 & Pback2<=P2]]] & 19<=Pm3]] & ~ [Pm2<=6]] & [[[Pm2<=21 | ~ [Pm2<=P3]] | [[~ [[37<=P2 | Pm2<=Pback2]] & ~ [[P1<=Pout2 & Pm3<=P4]]] & [[[36<=Pm2 & Pm3<=Pm2] | ~ [50<=Pout2]] & [[Pout3<=Pout4 & P4<=24] & Pout4<=35]]]] & Pback2<=P1]]]]]
normalized: ~ [E [true U ~ [[[9<=P3 | [[Pback2<=P1 & [[[~ [[37<=P2 | Pm2<=Pback2]] & ~ [[P1<=Pout2 & Pm3<=P4]]] & [[Pout4<=35 & [Pout3<=Pout4 & P4<=24]] & [~ [50<=Pout2] | [36<=Pm2 & Pm3<=Pm2]]]] | [Pm2<=21 | ~ [Pm2<=P3]]]] & [~ [Pm2<=6] & [[19<=Pm3 & [[[36<=Pout2 & Pback2<=P2] & ~ [6<=Pm1]] & [[Pm3<=P4 & Pback3<=Pm3] & [P3<=41 | P3<=P2]]]] & ~ [P1<=31]]]]] & [[~ [[16<=Pback1 | [Pout4<=Pback3 & ~ [Pm2<=P2]]]] | [~ [[19<=P1 & ~ [Pout3<=20]]] & [19<=Pm4 & [Pback2<=Pm1 | ~ [[~ [23<=Pout1] & ~ [23<=Pback2]]]]]]] | ~ [[[Pout4<=Pback4 | [[~ [Pback1<=47] | ~ [[45<=Pm3 & Pm2<=Pm4]]] & ~ [23<=Pback4]]] | [[[~ [26<=Pback4] & ~ [[13<=Pback2 | Pout1<=Pback3]]] & [[Pm1<=42 & [30<=P1 | Pm2<=Pm3]] & [Pback3<=Pback1 | [Pout1<=Pback4 | Pm3<=Pout1]]]] | [[[[21<=Pout2 | Pback3<=29] | ~ [P1<=30]] | [~ [P1<=32] & [Pm4<=Pback3 & 40<=P4]]] | ~ [24<=Pback4]]]]]]]]]]
abstracting: (24<=Pback4)
states: 1,626,243,879,713,544 (15)
abstracting: (40<=P4)
states: 127,286,740,448,296 (14)
abstracting: (Pm4<=Pback3)
states: 5,785,450,047,027,846 (15)
abstracting: (P1<=32)
states: 9,918,574,467,240,296 (15)
abstracting: (P1<=30)
states: 9,740,551,054,025,896 (15)
abstracting: (Pback3<=29)
states: 9,366,586,643,005,696 (15)
abstracting: (21<=Pout2)
states: 2,713,362,181,674,976 (15)
abstracting: (Pm3<=Pout1)
states: 4,979,492,122,731,516 (15)
abstracting: (Pout1<=Pback4)
states: 5,393,441,832,596,766 (15)
abstracting: (Pback3<=Pback1)
states: 4,979,492,122,731,516 (15)
abstracting: (Pm2<=Pm3)
states: 5,380,094,192,436,756 (15)
abstracting: (30<=P1)
states: 788,198,662,006,756 (14)
abstracting: (Pm1<=42)
states: 10,372,534,170,937,016 (16)
abstracting: (Pout1<=Pback3)
states: 5,785,450,047,027,846 (15)
abstracting: (13<=Pback2)
states: 4,992,776,379,093,048 (15)
abstracting: (26<=Pback4)
states: 1,301,796,209,130,300 (15)
abstracting: (23<=Pback4)
states: 1,806,937,644,126,160 (15)
abstracting: (Pm2<=Pm4)
states: 4,979,492,122,731,516 (15)
abstracting: (45<=Pm3)
states: 38,821,616,207,192 (13)
abstracting: (Pback1<=47)
states: 10,421,490,609,570,976 (16)
abstracting: (Pout4<=Pback4)
states: 5,363,400,381,616,836 (15)
abstracting: (23<=Pback2)
states: 2,265,578,968,470,636 (15)
abstracting: (23<=Pout1)
states: 1,806,937,644,126,160 (15)
abstracting: (Pback2<=Pm1)
states: 4,979,492,122,731,516 (15)
abstracting: (19<=Pm4)
states: 2,663,230,261,687,424 (15)
abstracting: (Pout3<=20)
states: 7,712,579,013,226,360 (15)
abstracting: (19<=P1)
states: 2,663,230,261,687,424 (15)
abstracting: (Pm2<=P2)
states: 3,871,551,556,998,216 (15)
abstracting: (Pout4<=Pback3)
states: 5,785,450,047,027,846 (15)
abstracting: (16<=Pback1)
states: 3,458,104,801,689,720 (15)
abstracting: (P1<=31)
states: 9,834,013,345,963,456 (15)
abstracting: (P3<=P2)
states: 10,425,941,194,901,336 (16)
abstracting: (P3<=41)
states: 10,423,242,856,051,844 (16)
abstracting: (Pback3<=Pm3)
states: 5,338,359,665,386,956 (15)
abstracting: (Pm3<=P4)
states: 4,979,492,122,731,516 (15)
abstracting: (6<=Pm1)
states: 7,216,624,113,178,740 (15)
abstracting: (Pback2<=P2)
states: 3,871,551,556,998,216 (15)
abstracting: (36<=Pout2)
states: 431,606,899,544,288 (14)
abstracting: (19<=Pm3)
states: 3,209,176,045,911,264 (15)
abstracting: (Pm2<=6)
states: 3,194,700,942,426,812 (15)
abstracting: (Pm2<=P3)
states: 3,871,551,556,998,216 (15)
abstracting: (Pm2<=21)
states: 7,942,412,507,949,920 (15)
abstracting: (Pm3<=Pm2)
states: 5,380,094,192,436,756 (15)
abstracting: (36<=Pm2)
states: 431,606,899,544,288 (14)
abstracting: (50<=Pout2)
states: 727,678,933,176 (11)
abstracting: (P4<=24)
states: 8,967,929,440,675,400 (15)
abstracting: (Pout3<=Pout4)
states: 4,979,492,122,731,516 (15)
abstracting: (Pout4<=35)
states: 10,123,301,392,436,856 (16)
abstracting: (Pm3<=P4)
states: 4,979,492,122,731,516 (15)
abstracting: (P1<=Pout2)
states: 5,785,450,047,027,846 (15)
abstracting: (Pm2<=Pback2)
states: 5,338,359,665,386,956 (15)
abstracting: (37<=P2)
states: 20,682,325,515,488 (13)
abstracting: (Pback2<=P1)
states: 4,979,492,122,731,516 (15)
abstracting: (9<=P3)
states: 4,030,110,930,693,848 (15)
-> the formula is FALSE
FORMULA Kanban-PT-00050-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393932 kB
MemFree: 2404680 kB
After kill :
MemTotal: 16393932 kB
MemFree: 16181872 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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:3566 (222), effective:1100 (68)
initing FirstDep: 0m 0.000sec
iterations count:1903 (118), effective:532 (33)
iterations count:506 (31), effective:154 (9)
iterations count:2333 (145), effective:656 (41)
iterations count:277 (17), effective:78 (4)
iterations count:829 (51), effective:234 (14)
iterations count:1814 (113), effective:567 (35)
iterations count:1874 (117), effective:516 (32)
iterations count:866 (54), effective:258 (16)
iterations count:552 (34), effective:184 (11)
iterations count:2066 (129), effective:625 (39)
sat_reach.icc:155: Timeout: after 839 sec
iterations count:2265 (141), effective:680 (42)
iterations count:2327 (145), effective:705 (44)
iterations count:618 (38), effective:210 (13)
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-00050"
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-00050, 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-167856407300262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00050.tgz
mv Kanban-PT-00050 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 '
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 ;