fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r353-smll-167891801200557
Last Updated
May 14, 2023

About the Execution of Marcie for SharedMemory-COL-000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5471.695 5901.00 6030.00 39.20 1 10 10 1 10 10 10 1 10 1 10 1 10 1 10 10 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.r353-smll-167891801200557.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 SharedMemory-COL-000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r353-smll-167891801200557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.9K Feb 25 14:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 14:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 14:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 14:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-00
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-01
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-02
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-03
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-04
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-05
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-06
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-07
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-08
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-09
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-10
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-11
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-12
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-13
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-14
FORMULA_NAME SharedMemory-COL-000010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680010933894

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-000010
Not applying reductions.
Model is COL
UpperBounds COL
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=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Unfolding complete |P|=141|T|=220|A|=840
Time for unfolding: 0m 0.445sec

Net: SharedMemory_COL_000010
(NrP: 141 NrTr: 220 NrArc: 840)

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

net check time: 0m 0.000sec

init dd package: 0m 3.326sec


RS generation: 0m 0.321sec


-> reachability set: #nodes 3161 (3.2e+03) #states 1,830,519 (6)



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

checking: place_bound(Ext_Bus_dot)
normalized: place_bound(Ext_Bus_dot)

-> the formula is 1

FORMULA SharedMemory-COL-000010-UpperBounds-03 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Ext_Bus_dot)
normalized: place_bound(Ext_Bus_dot)

-> the formula is 1

FORMULA SharedMemory-COL-000010-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Ext_Bus_dot)
normalized: place_bound(Ext_Bus_dot)

-> the formula is 1

FORMULA SharedMemory-COL-000010-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Ext_Bus_dot)
normalized: place_bound(Ext_Bus_dot)

-> the formula is 1

FORMULA SharedMemory-COL-000010-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Ext_Bus_dot)
normalized: place_bound(Ext_Bus_dot)

-> the formula is 1

FORMULA SharedMemory-COL-000010-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Queue_pId1,Queue_pId10,Queue_pId2,Queue_pId3,Queue_pId4,Queue_pId5,Queue_pId6,Queue_pId7,Queue_pId8,Queue_pId9)
normalized: place_bound(Queue_pId1,Queue_pId10,Queue_pId2,Queue_pId3,Queue_pId4,Queue_pId5,Queue_pId6,Queue_pId7,Queue_pId8,Queue_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-01 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(OwnMemAcc_pId1,OwnMemAcc_pId10,OwnMemAcc_pId2,OwnMemAcc_pId3,OwnMemAcc_pId4,OwnMemAcc_pId5,OwnMemAcc_pId6,OwnMemAcc_pId7,OwnMemAcc_pId8,OwnMemAcc_pId9)
normalized: place_bound(OwnMemAcc_pId1,OwnMemAcc_pId10,OwnMemAcc_pId2,OwnMemAcc_pId3,OwnMemAcc_pId4,OwnMemAcc_pId5,OwnMemAcc_pId6,OwnMemAcc_pId7,OwnMemAcc_pId8,OwnMemAcc_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-02 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(OwnMemAcc_pId1,OwnMemAcc_pId10,OwnMemAcc_pId2,OwnMemAcc_pId3,OwnMemAcc_pId4,OwnMemAcc_pId5,OwnMemAcc_pId6,OwnMemAcc_pId7,OwnMemAcc_pId8,OwnMemAcc_pId9)
normalized: place_bound(OwnMemAcc_pId1,OwnMemAcc_pId10,OwnMemAcc_pId2,OwnMemAcc_pId3,OwnMemAcc_pId4,OwnMemAcc_pId5,OwnMemAcc_pId6,OwnMemAcc_pId7,OwnMemAcc_pId8,OwnMemAcc_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-04 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Queue_pId1,Queue_pId10,Queue_pId2,Queue_pId3,Queue_pId4,Queue_pId5,Queue_pId6,Queue_pId7,Queue_pId8,Queue_pId9)
normalized: place_bound(Queue_pId1,Queue_pId10,Queue_pId2,Queue_pId3,Queue_pId4,Queue_pId5,Queue_pId6,Queue_pId7,Queue_pId8,Queue_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-05 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Queue_pId1,Queue_pId10,Queue_pId2,Queue_pId3,Queue_pId4,Queue_pId5,Queue_pId6,Queue_pId7,Queue_pId8,Queue_pId9)
normalized: place_bound(Queue_pId1,Queue_pId10,Queue_pId2,Queue_pId3,Queue_pId4,Queue_pId5,Queue_pId6,Queue_pId7,Queue_pId8,Queue_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-06 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Queue_pId1,Queue_pId10,Queue_pId2,Queue_pId3,Queue_pId4,Queue_pId5,Queue_pId6,Queue_pId7,Queue_pId8,Queue_pId9)
normalized: place_bound(Queue_pId1,Queue_pId10,Queue_pId2,Queue_pId3,Queue_pId4,Queue_pId5,Queue_pId6,Queue_pId7,Queue_pId8,Queue_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-08 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Active_pId1,Active_pId10,Active_pId2,Active_pId3,Active_pId4,Active_pId5,Active_pId6,Active_pId7,Active_pId8,Active_pId9)
normalized: place_bound(Active_pId1,Active_pId10,Active_pId2,Active_pId3,Active_pId4,Active_pId5,Active_pId6,Active_pId7,Active_pId8,Active_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-10 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(OwnMemAcc_pId1,OwnMemAcc_pId10,OwnMemAcc_pId2,OwnMemAcc_pId3,OwnMemAcc_pId4,OwnMemAcc_pId5,OwnMemAcc_pId6,OwnMemAcc_pId7,OwnMemAcc_pId8,OwnMemAcc_pId9)
normalized: place_bound(OwnMemAcc_pId1,OwnMemAcc_pId10,OwnMemAcc_pId2,OwnMemAcc_pId3,OwnMemAcc_pId4,OwnMemAcc_pId5,OwnMemAcc_pId6,OwnMemAcc_pId7,OwnMemAcc_pId8,OwnMemAcc_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-12 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Active_pId1,Active_pId10,Active_pId2,Active_pId3,Active_pId4,Active_pId5,Active_pId6,Active_pId7,Active_pId8,Active_pId9)
normalized: place_bound(Active_pId1,Active_pId10,Active_pId2,Active_pId3,Active_pId4,Active_pId5,Active_pId6,Active_pId7,Active_pId8,Active_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-14 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Queue_pId1,Queue_pId10,Queue_pId2,Queue_pId3,Queue_pId4,Queue_pId5,Queue_pId6,Queue_pId7,Queue_pId8,Queue_pId9)
normalized: place_bound(Queue_pId1,Queue_pId10,Queue_pId2,Queue_pId3,Queue_pId4,Queue_pId5,Queue_pId6,Queue_pId7,Queue_pId8,Queue_pId9)

-> the formula is 10

FORMULA SharedMemory-COL-000010-UpperBounds-15 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Ext_Mem_Acc_pId10_pId1,Ext_Mem_Acc_pId10_pId10,Ext_Mem_Acc_pId10_pId2,Ext_Mem_Acc_pId10_pId3,Ext_Mem_Acc_pId10_pId4,Ext_Mem_Acc_pId10_pId5,Ext_Mem_Acc_pId10_pId6,Ext_Mem_Acc_pId10_pId7,Ext_Mem_Acc_pId10_pId8,Ext_Mem_Acc_pId10_pId9,Ext_Mem_Acc_pId1_pId1,Ext_Mem_Acc_pId1_pId10,Ext_Mem_Acc_pId1_pId2,Ext_Mem_Acc_pId1_pId3,Ext_Mem_Acc_pId1_pId4,Ext_Mem_Acc_pId1_pId5,Ext_Mem_Acc_pId1_pId6,Ext_Mem_Acc_pId1_pId7,Ext_Mem_Acc_pId1_pId8,Ext_Mem_Acc_pId1_pId9,Ext_Mem_Acc_pId2_pId1,Ext_Mem_Acc_pId2_pId10,Ext_Mem_Acc_pId2_pId2,Ext_Mem_Acc_pId2_pId3,Ext_Mem_Acc_pId2_pId4,Ext_Mem_Acc_pId2_pId5,Ext_Mem_Acc_pId2_pId6,Ext_Mem_Acc_pId2_pId7,Ext_Mem_Acc_pId2_pId8,Ext_Mem_Acc_pId2_pId9,Ext_Mem_Acc_pId3_pId1,Ext_Mem_Acc_pId3_pId10,Ext_Mem_Acc_pId3_pId2,Ext_Mem_Acc_pId3_pId3,Ext_Mem_Acc_pId3_pId4,Ext_Mem_Acc_pId3_pId5,Ext_Mem_Acc_pId3_pId6,Ext_Mem_Acc_pId3_pId7,Ext_Mem_Acc_pId3_pId8,Ext_Mem_Acc_pId3_pId9,Ext_Mem_Acc_pId4_pId1,Ext_Mem_Acc_pId4_pId10,Ext_Mem_Acc_pId4_pId2,Ext_Mem_Acc_pId4_pId3,Ext_Mem_Acc_pId4_pId4,Ext_Mem_Acc_pId4_pId5,Ext_Mem_Acc_pId4_pId6,Ext_Mem_Acc_pId4_pId7,Ext_Mem_Acc_pId4_pId8,Ext_Mem_Acc_pId4_pId9,Ext_Mem_Acc_pId5_pId1,Ext_Mem_Acc_pId5_pId10,Ext_Mem_Acc_pId5_pId2,Ext_Mem_Acc_pId5_pId3,Ext_Mem_Acc_pId5_pId4,Ext_Mem_Acc_pId5_pId5,Ext_Mem_Acc_pId5_pId6,Ext_Mem_Acc_pId5_pId7,Ext_Mem_Acc_pId5_pId8,Ext_Mem_Acc_pId5_pId9,Ext_Mem_Acc_pId6_pId1,Ext_Mem_Acc_pId6_pId10,Ext_Mem_Acc_pId6_pId2,Ext_Mem_Acc_pId6_pId3,Ext_Mem_Acc_pId6_pId4,Ext_Mem_Acc_pId6_pId5,Ext_Mem_Acc_pId6_pId6,Ext_Mem_Acc_pId6_pId7,Ext_Mem_Acc_pId6_pId8,Ext_Mem_Acc_pId6_pId9,Ext_Mem_Acc_pId7_pId1,Ext_Mem_Acc_pId7_pId10,Ext_Mem_Acc_pId7_pId2,Ext_Mem_Acc_pId7_pId3,Ext_Mem_Acc_pId7_pId4,Ext_Mem_Acc_pId7_pId5,Ext_Mem_Acc_pId7_pId6,Ext_Mem_Acc_pId7_pId7,Ext_Mem_Acc_pId7_pId8,Ext_Mem_Acc_pId7_pId9,Ext_Mem_Acc_pId8_pId1,Ext_Mem_Acc_pId8_pId10,Ext_Mem_Acc_pId8_pId2,Ext_Mem_Acc_pId8_pId3,Ext_Mem_Acc_pId8_pId4,Ext_Mem_Acc_pId8_pId5,Ext_Mem_Acc_pId8_pId6,Ext_Mem_Acc_pId8_pId7,Ext_Mem_Acc_pId8_pId8,Ext_Mem_Acc_pId8_pId9,Ext_Mem_Acc_pId9_pId1,Ext_Mem_Acc_pId9_pId10,Ext_Mem_Acc_pId9_pId2,Ext_Mem_Acc_pId9_pId3,Ext_Mem_Acc_pId9_pId4,Ext_Mem_Acc_pId9_pId5,Ext_Mem_Acc_pId9_pId6,Ext_Mem_Acc_pId9_pId7,Ext_Mem_Acc_pId9_pId8,Ext_Mem_Acc_pId9_pId9)
normalized: place_bound(Ext_Mem_Acc_pId10_pId1,Ext_Mem_Acc_pId10_pId10,Ext_Mem_Acc_pId10_pId2,Ext_Mem_Acc_pId10_pId3,Ext_Mem_Acc_pId10_pId4,Ext_Mem_Acc_pId10_pId5,Ext_Mem_Acc_pId10_pId6,Ext_Mem_Acc_pId10_pId7,Ext_Mem_Acc_pId10_pId8,Ext_Mem_Acc_pId10_pId9,Ext_Mem_Acc_pId1_pId1,Ext_Mem_Acc_pId1_pId10,Ext_Mem_Acc_pId1_pId2,Ext_Mem_Acc_pId1_pId3,Ext_Mem_Acc_pId1_pId4,Ext_Mem_Acc_pId1_pId5,Ext_Mem_Acc_pId1_pId6,Ext_Mem_Acc_pId1_pId7,Ext_Mem_Acc_pId1_pId8,Ext_Mem_Acc_pId1_pId9,Ext_Mem_Acc_pId2_pId1,Ext_Mem_Acc_pId2_pId10,Ext_Mem_Acc_pId2_pId2,Ext_Mem_Acc_pId2_pId3,Ext_Mem_Acc_pId2_pId4,Ext_Mem_Acc_pId2_pId5,Ext_Mem_Acc_pId2_pId6,Ext_Mem_Acc_pId2_pId7,Ext_Mem_Acc_pId2_pId8,Ext_Mem_Acc_pId2_pId9,Ext_Mem_Acc_pId3_pId1,Ext_Mem_Acc_pId3_pId10,Ext_Mem_Acc_pId3_pId2,Ext_Mem_Acc_pId3_pId3,Ext_Mem_Acc_pId3_pId4,Ext_Mem_Acc_pId3_pId5,Ext_Mem_Acc_pId3_pId6,Ext_Mem_Acc_pId3_pId7,Ext_Mem_Acc_pId3_pId8,Ext_Mem_Acc_pId3_pId9,Ext_Mem_Acc_pId4_pId1,Ext_Mem_Acc_pId4_pId10,Ext_Mem_Acc_pId4_pId2,Ext_Mem_Acc_pId4_pId3,Ext_Mem_Acc_pId4_pId4,Ext_Mem_Acc_pId4_pId5,Ext_Mem_Acc_pId4_pId6,Ext_Mem_Acc_pId4_pId7,Ext_Mem_Acc_pId4_pId8,Ext_Mem_Acc_pId4_pId9,Ext_Mem_Acc_pId5_pId1,Ext_Mem_Acc_pId5_pId10,Ext_Mem_Acc_pId5_pId2,Ext_Mem_Acc_pId5_pId3,Ext_Mem_Acc_pId5_pId4,Ext_Mem_Acc_pId5_pId5,Ext_Mem_Acc_pId5_pId6,Ext_Mem_Acc_pId5_pId7,Ext_Mem_Acc_pId5_pId8,Ext_Mem_Acc_pId5_pId9,Ext_Mem_Acc_pId6_pId1,Ext_Mem_Acc_pId6_pId10,Ext_Mem_Acc_pId6_pId2,Ext_Mem_Acc_pId6_pId3,Ext_Mem_Acc_pId6_pId4,Ext_Mem_Acc_pId6_pId5,Ext_Mem_Acc_pId6_pId6,Ext_Mem_Acc_pId6_pId7,Ext_Mem_Acc_pId6_pId8,Ext_Mem_Acc_pId6_pId9,Ext_Mem_Acc_pId7_pId1,Ext_Mem_Acc_pId7_pId10,Ext_Mem_Acc_pId7_pId2,Ext_Mem_Acc_pId7_pId3,Ext_Mem_Acc_pId7_pId4,Ext_Mem_Acc_pId7_pId5,Ext_Mem_Acc_pId7_pId6,Ext_Mem_Acc_pId7_pId7,Ext_Mem_Acc_pId7_pId8,Ext_Mem_Acc_pId7_pId9,Ext_Mem_Acc_pId8_pId1,Ext_Mem_Acc_pId8_pId10,Ext_Mem_Acc_pId8_pId2,Ext_Mem_Acc_pId8_pId3,Ext_Mem_Acc_pId8_pId4,Ext_Mem_Acc_pId8_pId5,Ext_Mem_Acc_pId8_pId6,Ext_Mem_Acc_pId8_pId7,Ext_Mem_Acc_pId8_pId8,Ext_Mem_Acc_pId8_pId9,Ext_Mem_Acc_pId9_pId1,Ext_Mem_Acc_pId9_pId10,Ext_Mem_Acc_pId9_pId2,Ext_Mem_Acc_pId9_pId3,Ext_Mem_Acc_pId9_pId4,Ext_Mem_Acc_pId9_pId5,Ext_Mem_Acc_pId9_pId6,Ext_Mem_Acc_pId9_pId7,Ext_Mem_Acc_pId9_pId8,Ext_Mem_Acc_pId9_pId9)

-> the formula is 1

FORMULA SharedMemory-COL-000010-UpperBounds-00 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 20626 (2.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 129163 1047376 1176539
used/not used/entry size/cache size: 1041695 66067169 16 1024MB
basic ops cache: hits/miss/sum: 0 9870 9870
used/not used/entry size/cache size: 29481 16747735 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: 474 3161 3635
used/not used/entry size/cache size: 3161 8385447 32 256MB
max state cache: hits/miss/sum: 1896 12644 14540
used/not used/entry size/cache size: 3161 8385447 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67088481
1 20194
2 189
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.834sec


BK_STOP 1680010939795

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
Ext_Mem_Acc_pId3_pId3
Ext_Mem_Acc_pId2_pId2
Ext_Mem_Acc_pId1_pId1
Ext_Mem_Acc_pId6_pId6
Ext_Mem_Acc_pId4_pId4
Ext_Mem_Acc_pId5_pId5
Ext_Mem_Acc_pId7_pId7
Ext_Mem_Acc_pId8_pId8
Ext_Mem_Acc_pId9_pId9
Ext_Mem_Acc_pId10_pId10

The net has transition(s) that can never fire:
End_Ext_Acc_0_0
End_Ext_Acc_1_1
End_Ext_Acc_2_2
End_Ext_Acc_3_3
End_Ext_Acc_6_6
End_Ext_Acc_4_4
End_Ext_Acc_5_5
End_Ext_Acc_7_7
End_Ext_Acc_8_8
End_Ext_Acc_9_9

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:10392 (47), effective:110 (0)

initing FirstDep: 0m 0.003sec

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="SharedMemory-COL-000010"
export BK_EXAMINATION="UpperBounds"
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 SharedMemory-COL-000010, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r353-smll-167891801200557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000010.tgz
mv SharedMemory-COL-000010 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;