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

About the Execution of Marcie for Philosophers-PT-000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5451.180 4971.00 5080.00 0.00 100 100 100 100 100 100 100 100 1 1 1 1 1 1 1 1 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.r289-tall-167873940100221.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 Philosophers-PT-000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r289-tall-167873940100221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 98K Feb 25 13:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 597K Feb 25 13:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 326K Feb 25 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 53K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 210K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 181K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 145K Feb 25 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 860K Feb 25 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 323K Feb 25 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.2M Feb 25 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 215K 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 Philosophers-PT-000100-UpperBounds-00
FORMULA_NAME Philosophers-PT-000100-UpperBounds-01
FORMULA_NAME Philosophers-PT-000100-UpperBounds-02
FORMULA_NAME Philosophers-PT-000100-UpperBounds-03
FORMULA_NAME Philosophers-PT-000100-UpperBounds-04
FORMULA_NAME Philosophers-PT-000100-UpperBounds-05
FORMULA_NAME Philosophers-PT-000100-UpperBounds-06
FORMULA_NAME Philosophers-PT-000100-UpperBounds-07
FORMULA_NAME Philosophers-PT-000100-UpperBounds-08
FORMULA_NAME Philosophers-PT-000100-UpperBounds-09
FORMULA_NAME Philosophers-PT-000100-UpperBounds-10
FORMULA_NAME Philosophers-PT-000100-UpperBounds-11
FORMULA_NAME Philosophers-PT-000100-UpperBounds-12
FORMULA_NAME Philosophers-PT-000100-UpperBounds-13
FORMULA_NAME Philosophers-PT-000100-UpperBounds-14
FORMULA_NAME Philosophers-PT-000100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678759344239

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=Philosophers-PT-000100
Not applying reductions.
Model is PT
UpperBounds 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=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Philosophers_PT_000100
(NrP: 500 NrTr: 500 NrArc: 1600)

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

net check time: 0m 0.000sec

init dd package: 0m 2.881sec


RS generation: 0m 0.204sec


-> reachability set: #nodes 2580 (2.6e+03) #states 515,377,520,732,011,331,036,461,129,765,621,272,702,107,522,001 (47)



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

checking: place_bound(Eat_60)
normalized: place_bound(Eat_60)

-> the formula is 1

FORMULA Philosophers-PT-000100-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: place_bound(Catch2_74)
normalized: place_bound(Catch2_74)

-> the formula is 1

FORMULA Philosophers-PT-000100-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch2_85)
normalized: place_bound(Catch2_85)

-> the formula is 1

FORMULA Philosophers-PT-000100-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch2_44)
normalized: place_bound(Catch2_44)

-> the formula is 1

FORMULA Philosophers-PT-000100-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Fork_78)
normalized: place_bound(Fork_78)

-> the formula is 1

FORMULA Philosophers-PT-000100-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Fork_50)
normalized: place_bound(Fork_50)

-> the formula is 1

FORMULA Philosophers-PT-000100-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Eat_68)
normalized: place_bound(Eat_68)

-> the formula is 1

FORMULA Philosophers-PT-000100-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch1_22)
normalized: place_bound(Catch1_22)

-> the formula is 1

FORMULA Philosophers-PT-000100-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_21,Think_20,Think_23,Think_22,Think_25,Think_24,Think_27,Think_26,Think_29,Think_28,Think_32,Think_33,Think_30,Think_31,Think_36,Think_37,Think_34,Think_35,Think_40,Think_41,Think_38,Think_39,Think_44,Think_45,Think_42,Think_43,Think_49,Think_48,Think_47,Think_46,Think_53,Think_52,Think_51,Think_50,Think_57,Think_56,Think_55,Think_54,Think_61,Think_60,Think_59,Think_58,Think_66,Think_67,Think_68,Think_69,Think_62,Think_63,Think_64,Think_65,Think_74,Think_75,Think_76,Think_77,Think_70,Think_71,Think_72,Think_73,Think_83,Think_82,Think_85,Think_84,Think_79,Think_78,Think_81,Think_80,Think_91,Think_90,Think_93,Think_92,Think_87,Think_86,Think_89,Think_88,Think_100,Think_98,Think_99,Think_96,Think_97,Think_94,Think_95)
normalized: place_bound(Think_1,Think_2,Think_3,Think_4,Think_5,Think_6,Think_7,Think_8,Think_9,Think_10,Think_11,Think_12,Think_13,Think_15,Think_14,Think_17,Think_16,Think_19,Think_18,Think_21,Think_20,Think_23,Think_22,Think_25,Think_24,Think_27,Think_26,Think_29,Think_28,Think_32,Think_33,Think_30,Think_31,Think_36,Think_37,Think_34,Think_35,Think_40,Think_41,Think_38,Think_39,Think_44,Think_45,Think_42,Think_43,Think_49,Think_48,Think_47,Think_46,Think_53,Think_52,Think_51,Think_50,Think_57,Think_56,Think_55,Think_54,Think_61,Think_60,Think_59,Think_58,Think_66,Think_67,Think_68,Think_69,Think_62,Think_63,Think_64,Think_65,Think_74,Think_75,Think_76,Think_77,Think_70,Think_71,Think_72,Think_73,Think_83,Think_82,Think_85,Think_84,Think_79,Think_78,Think_81,Think_80,Think_91,Think_90,Think_93,Think_92,Think_87,Think_86,Think_89,Think_88,Think_100,Think_98,Think_99,Think_96,Think_97,Think_94,Think_95)

-> the formula is 100

FORMULA Philosophers-PT-000100-UpperBounds-00 100 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Fork_1,Fork_8,Fork_9,Fork_6,Fork_7,Fork_4,Fork_5,Fork_2,Fork_3,Fork_17,Fork_16,Fork_15,Fork_14,Fork_13,Fork_12,Fork_11,Fork_10,Fork_25,Fork_24,Fork_23,Fork_22,Fork_21,Fork_20,Fork_19,Fork_18,Fork_35,Fork_34,Fork_37,Fork_36,Fork_39,Fork_38,Fork_41,Fork_40,Fork_27,Fork_26,Fork_29,Fork_28,Fork_31,Fork_30,Fork_33,Fork_32,Fork_50,Fork_51,Fork_52,Fork_53,Fork_54,Fork_55,Fork_56,Fork_57,Fork_42,Fork_43,Fork_44,Fork_45,Fork_46,Fork_47,Fork_48,Fork_49,Fork_69,Fork_68,Fork_67,Fork_66,Fork_73,Fork_72,Fork_71,Fork_70,Fork_61,Fork_60,Fork_59,Fork_58,Fork_65,Fork_64,Fork_63,Fork_62,Fork_84,Fork_85,Fork_82,Fork_83,Fork_88,Fork_89,Fork_86,Fork_87,Fork_76,Fork_77,Fork_74,Fork_75,Fork_80,Fork_81,Fork_78,Fork_79,Fork_99,Fork_98,Fork_100,Fork_95,Fork_94,Fork_97,Fork_96,Fork_91,Fork_90,Fork_93,Fork_92)
normalized: place_bound(Fork_1,Fork_8,Fork_9,Fork_6,Fork_7,Fork_4,Fork_5,Fork_2,Fork_3,Fork_17,Fork_16,Fork_15,Fork_14,Fork_13,Fork_12,Fork_11,Fork_10,Fork_25,Fork_24,Fork_23,Fork_22,Fork_21,Fork_20,Fork_19,Fork_18,Fork_35,Fork_34,Fork_37,Fork_36,Fork_39,Fork_38,Fork_41,Fork_40,Fork_27,Fork_26,Fork_29,Fork_28,Fork_31,Fork_30,Fork_33,Fork_32,Fork_50,Fork_51,Fork_52,Fork_53,Fork_54,Fork_55,Fork_56,Fork_57,Fork_42,Fork_43,Fork_44,Fork_45,Fork_46,Fork_47,Fork_48,Fork_49,Fork_69,Fork_68,Fork_67,Fork_66,Fork_73,Fork_72,Fork_71,Fork_70,Fork_61,Fork_60,Fork_59,Fork_58,Fork_65,Fork_64,Fork_63,Fork_62,Fork_84,Fork_85,Fork_82,Fork_83,Fork_88,Fork_89,Fork_86,Fork_87,Fork_76,Fork_77,Fork_74,Fork_75,Fork_80,Fork_81,Fork_78,Fork_79,Fork_99,Fork_98,Fork_100,Fork_95,Fork_94,Fork_97,Fork_96,Fork_91,Fork_90,Fork_93,Fork_92)

-> the formula is 100

FORMULA Philosophers-PT-000100-UpperBounds-01 100 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch1_3,Catch1_2,Catch1_5,Catch1_4,Catch1_1,Catch1_18,Catch1_19,Catch1_20,Catch1_21,Catch1_14,Catch1_15,Catch1_16,Catch1_17,Catch1_10,Catch1_11,Catch1_12,Catch1_13,Catch1_6,Catch1_7,Catch1_8,Catch1_9,Catch1_37,Catch1_36,Catch1_35,Catch1_34,Catch1_33,Catch1_32,Catch1_31,Catch1_30,Catch1_29,Catch1_28,Catch1_27,Catch1_26,Catch1_25,Catch1_24,Catch1_23,Catch1_22,Catch1_52,Catch1_53,Catch1_50,Catch1_51,Catch1_48,Catch1_49,Catch1_46,Catch1_47,Catch1_44,Catch1_45,Catch1_42,Catch1_43,Catch1_40,Catch1_41,Catch1_38,Catch1_39,Catch1_73,Catch1_72,Catch1_71,Catch1_70,Catch1_77,Catch1_76,Catch1_75,Catch1_74,Catch1_81,Catch1_80,Catch1_79,Catch1_78,Catch1_85,Catch1_84,Catch1_83,Catch1_82,Catch1_56,Catch1_57,Catch1_54,Catch1_55,Catch1_60,Catch1_61,Catch1_58,Catch1_59,Catch1_64,Catch1_65,Catch1_62,Catch1_63,Catch1_68,Catch1_69,Catch1_66,Catch1_67,Catch1_86,Catch1_87,Catch1_88,Catch1_89,Catch1_90,Catch1_91,Catch1_92,Catch1_93,Catch1_94,Catch1_95,Catch1_96,Catch1_97,Catch1_98,Catch1_99,Catch1_100)
normalized: place_bound(Catch1_3,Catch1_2,Catch1_5,Catch1_4,Catch1_1,Catch1_18,Catch1_19,Catch1_20,Catch1_21,Catch1_14,Catch1_15,Catch1_16,Catch1_17,Catch1_10,Catch1_11,Catch1_12,Catch1_13,Catch1_6,Catch1_7,Catch1_8,Catch1_9,Catch1_37,Catch1_36,Catch1_35,Catch1_34,Catch1_33,Catch1_32,Catch1_31,Catch1_30,Catch1_29,Catch1_28,Catch1_27,Catch1_26,Catch1_25,Catch1_24,Catch1_23,Catch1_22,Catch1_52,Catch1_53,Catch1_50,Catch1_51,Catch1_48,Catch1_49,Catch1_46,Catch1_47,Catch1_44,Catch1_45,Catch1_42,Catch1_43,Catch1_40,Catch1_41,Catch1_38,Catch1_39,Catch1_73,Catch1_72,Catch1_71,Catch1_70,Catch1_77,Catch1_76,Catch1_75,Catch1_74,Catch1_81,Catch1_80,Catch1_79,Catch1_78,Catch1_85,Catch1_84,Catch1_83,Catch1_82,Catch1_56,Catch1_57,Catch1_54,Catch1_55,Catch1_60,Catch1_61,Catch1_58,Catch1_59,Catch1_64,Catch1_65,Catch1_62,Catch1_63,Catch1_68,Catch1_69,Catch1_66,Catch1_67,Catch1_86,Catch1_87,Catch1_88,Catch1_89,Catch1_90,Catch1_91,Catch1_92,Catch1_93,Catch1_94,Catch1_95,Catch1_96,Catch1_97,Catch1_98,Catch1_99,Catch1_100)

-> the formula is 100

FORMULA Philosophers-PT-000100-UpperBounds-02 100 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch1_3,Catch1_2,Catch1_5,Catch1_4,Catch1_1,Catch1_18,Catch1_19,Catch1_20,Catch1_21,Catch1_14,Catch1_15,Catch1_16,Catch1_17,Catch1_10,Catch1_11,Catch1_12,Catch1_13,Catch1_6,Catch1_7,Catch1_8,Catch1_9,Catch1_37,Catch1_36,Catch1_35,Catch1_34,Catch1_33,Catch1_32,Catch1_31,Catch1_30,Catch1_29,Catch1_28,Catch1_27,Catch1_26,Catch1_25,Catch1_24,Catch1_23,Catch1_22,Catch1_52,Catch1_53,Catch1_50,Catch1_51,Catch1_48,Catch1_49,Catch1_46,Catch1_47,Catch1_44,Catch1_45,Catch1_42,Catch1_43,Catch1_40,Catch1_41,Catch1_38,Catch1_39,Catch1_73,Catch1_72,Catch1_71,Catch1_70,Catch1_77,Catch1_76,Catch1_75,Catch1_74,Catch1_81,Catch1_80,Catch1_79,Catch1_78,Catch1_85,Catch1_84,Catch1_83,Catch1_82,Catch1_56,Catch1_57,Catch1_54,Catch1_55,Catch1_60,Catch1_61,Catch1_58,Catch1_59,Catch1_64,Catch1_65,Catch1_62,Catch1_63,Catch1_68,Catch1_69,Catch1_66,Catch1_67,Catch1_86,Catch1_87,Catch1_88,Catch1_89,Catch1_90,Catch1_91,Catch1_92,Catch1_93,Catch1_94,Catch1_95,Catch1_96,Catch1_97,Catch1_98,Catch1_99,Catch1_100)
normalized: place_bound(Catch1_3,Catch1_2,Catch1_5,Catch1_4,Catch1_1,Catch1_18,Catch1_19,Catch1_20,Catch1_21,Catch1_14,Catch1_15,Catch1_16,Catch1_17,Catch1_10,Catch1_11,Catch1_12,Catch1_13,Catch1_6,Catch1_7,Catch1_8,Catch1_9,Catch1_37,Catch1_36,Catch1_35,Catch1_34,Catch1_33,Catch1_32,Catch1_31,Catch1_30,Catch1_29,Catch1_28,Catch1_27,Catch1_26,Catch1_25,Catch1_24,Catch1_23,Catch1_22,Catch1_52,Catch1_53,Catch1_50,Catch1_51,Catch1_48,Catch1_49,Catch1_46,Catch1_47,Catch1_44,Catch1_45,Catch1_42,Catch1_43,Catch1_40,Catch1_41,Catch1_38,Catch1_39,Catch1_73,Catch1_72,Catch1_71,Catch1_70,Catch1_77,Catch1_76,Catch1_75,Catch1_74,Catch1_81,Catch1_80,Catch1_79,Catch1_78,Catch1_85,Catch1_84,Catch1_83,Catch1_82,Catch1_56,Catch1_57,Catch1_54,Catch1_55,Catch1_60,Catch1_61,Catch1_58,Catch1_59,Catch1_64,Catch1_65,Catch1_62,Catch1_63,Catch1_68,Catch1_69,Catch1_66,Catch1_67,Catch1_86,Catch1_87,Catch1_88,Catch1_89,Catch1_90,Catch1_91,Catch1_92,Catch1_93,Catch1_94,Catch1_95,Catch1_96,Catch1_97,Catch1_98,Catch1_99,Catch1_100)

-> the formula is 100

FORMULA Philosophers-PT-000100-UpperBounds-03 100 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Fork_1,Fork_8,Fork_9,Fork_6,Fork_7,Fork_4,Fork_5,Fork_2,Fork_3,Fork_17,Fork_16,Fork_15,Fork_14,Fork_13,Fork_12,Fork_11,Fork_10,Fork_25,Fork_24,Fork_23,Fork_22,Fork_21,Fork_20,Fork_19,Fork_18,Fork_35,Fork_34,Fork_37,Fork_36,Fork_39,Fork_38,Fork_41,Fork_40,Fork_27,Fork_26,Fork_29,Fork_28,Fork_31,Fork_30,Fork_33,Fork_32,Fork_50,Fork_51,Fork_52,Fork_53,Fork_54,Fork_55,Fork_56,Fork_57,Fork_42,Fork_43,Fork_44,Fork_45,Fork_46,Fork_47,Fork_48,Fork_49,Fork_69,Fork_68,Fork_67,Fork_66,Fork_73,Fork_72,Fork_71,Fork_70,Fork_61,Fork_60,Fork_59,Fork_58,Fork_65,Fork_64,Fork_63,Fork_62,Fork_84,Fork_85,Fork_82,Fork_83,Fork_88,Fork_89,Fork_86,Fork_87,Fork_76,Fork_77,Fork_74,Fork_75,Fork_80,Fork_81,Fork_78,Fork_79,Fork_99,Fork_98,Fork_100,Fork_95,Fork_94,Fork_97,Fork_96,Fork_91,Fork_90,Fork_93,Fork_92)
normalized: place_bound(Fork_1,Fork_8,Fork_9,Fork_6,Fork_7,Fork_4,Fork_5,Fork_2,Fork_3,Fork_17,Fork_16,Fork_15,Fork_14,Fork_13,Fork_12,Fork_11,Fork_10,Fork_25,Fork_24,Fork_23,Fork_22,Fork_21,Fork_20,Fork_19,Fork_18,Fork_35,Fork_34,Fork_37,Fork_36,Fork_39,Fork_38,Fork_41,Fork_40,Fork_27,Fork_26,Fork_29,Fork_28,Fork_31,Fork_30,Fork_33,Fork_32,Fork_50,Fork_51,Fork_52,Fork_53,Fork_54,Fork_55,Fork_56,Fork_57,Fork_42,Fork_43,Fork_44,Fork_45,Fork_46,Fork_47,Fork_48,Fork_49,Fork_69,Fork_68,Fork_67,Fork_66,Fork_73,Fork_72,Fork_71,Fork_70,Fork_61,Fork_60,Fork_59,Fork_58,Fork_65,Fork_64,Fork_63,Fork_62,Fork_84,Fork_85,Fork_82,Fork_83,Fork_88,Fork_89,Fork_86,Fork_87,Fork_76,Fork_77,Fork_74,Fork_75,Fork_80,Fork_81,Fork_78,Fork_79,Fork_99,Fork_98,Fork_100,Fork_95,Fork_94,Fork_97,Fork_96,Fork_91,Fork_90,Fork_93,Fork_92)

-> the formula is 100

FORMULA Philosophers-PT-000100-UpperBounds-04 100 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch2_3,Catch2_2,Catch2_5,Catch2_4,Catch2_7,Catch2_6,Catch2_9,Catch2_8,Catch2_11,Catch2_10,Catch2_13,Catch2_12,Catch2_15,Catch2_14,Catch2_17,Catch2_16,Catch2_1,Catch2_41,Catch2_40,Catch2_39,Catch2_38,Catch2_37,Catch2_36,Catch2_35,Catch2_34,Catch2_49,Catch2_48,Catch2_47,Catch2_46,Catch2_45,Catch2_44,Catch2_43,Catch2_42,Catch2_24,Catch2_25,Catch2_22,Catch2_23,Catch2_20,Catch2_21,Catch2_18,Catch2_19,Catch2_32,Catch2_33,Catch2_30,Catch2_31,Catch2_28,Catch2_29,Catch2_26,Catch2_27,Catch2_71,Catch2_70,Catch2_73,Catch2_72,Catch2_67,Catch2_66,Catch2_69,Catch2_68,Catch2_79,Catch2_78,Catch2_81,Catch2_80,Catch2_75,Catch2_74,Catch2_77,Catch2_76,Catch2_54,Catch2_55,Catch2_56,Catch2_57,Catch2_50,Catch2_51,Catch2_52,Catch2_53,Catch2_62,Catch2_63,Catch2_64,Catch2_65,Catch2_58,Catch2_59,Catch2_60,Catch2_61,Catch2_100,Catch2_98,Catch2_99,Catch2_93,Catch2_92,Catch2_91,Catch2_90,Catch2_97,Catch2_96,Catch2_95,Catch2_94,Catch2_85,Catch2_84,Catch2_83,Catch2_82,Catch2_89,Catch2_88,Catch2_87,Catch2_86)
normalized: place_bound(Catch2_3,Catch2_2,Catch2_5,Catch2_4,Catch2_7,Catch2_6,Catch2_9,Catch2_8,Catch2_11,Catch2_10,Catch2_13,Catch2_12,Catch2_15,Catch2_14,Catch2_17,Catch2_16,Catch2_1,Catch2_41,Catch2_40,Catch2_39,Catch2_38,Catch2_37,Catch2_36,Catch2_35,Catch2_34,Catch2_49,Catch2_48,Catch2_47,Catch2_46,Catch2_45,Catch2_44,Catch2_43,Catch2_42,Catch2_24,Catch2_25,Catch2_22,Catch2_23,Catch2_20,Catch2_21,Catch2_18,Catch2_19,Catch2_32,Catch2_33,Catch2_30,Catch2_31,Catch2_28,Catch2_29,Catch2_26,Catch2_27,Catch2_71,Catch2_70,Catch2_73,Catch2_72,Catch2_67,Catch2_66,Catch2_69,Catch2_68,Catch2_79,Catch2_78,Catch2_81,Catch2_80,Catch2_75,Catch2_74,Catch2_77,Catch2_76,Catch2_54,Catch2_55,Catch2_56,Catch2_57,Catch2_50,Catch2_51,Catch2_52,Catch2_53,Catch2_62,Catch2_63,Catch2_64,Catch2_65,Catch2_58,Catch2_59,Catch2_60,Catch2_61,Catch2_100,Catch2_98,Catch2_99,Catch2_93,Catch2_92,Catch2_91,Catch2_90,Catch2_97,Catch2_96,Catch2_95,Catch2_94,Catch2_85,Catch2_84,Catch2_83,Catch2_82,Catch2_89,Catch2_88,Catch2_87,Catch2_86)

-> the formula is 100

FORMULA Philosophers-PT-000100-UpperBounds-05 100 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Fork_1,Fork_8,Fork_9,Fork_6,Fork_7,Fork_4,Fork_5,Fork_2,Fork_3,Fork_17,Fork_16,Fork_15,Fork_14,Fork_13,Fork_12,Fork_11,Fork_10,Fork_25,Fork_24,Fork_23,Fork_22,Fork_21,Fork_20,Fork_19,Fork_18,Fork_35,Fork_34,Fork_37,Fork_36,Fork_39,Fork_38,Fork_41,Fork_40,Fork_27,Fork_26,Fork_29,Fork_28,Fork_31,Fork_30,Fork_33,Fork_32,Fork_50,Fork_51,Fork_52,Fork_53,Fork_54,Fork_55,Fork_56,Fork_57,Fork_42,Fork_43,Fork_44,Fork_45,Fork_46,Fork_47,Fork_48,Fork_49,Fork_69,Fork_68,Fork_67,Fork_66,Fork_73,Fork_72,Fork_71,Fork_70,Fork_61,Fork_60,Fork_59,Fork_58,Fork_65,Fork_64,Fork_63,Fork_62,Fork_84,Fork_85,Fork_82,Fork_83,Fork_88,Fork_89,Fork_86,Fork_87,Fork_76,Fork_77,Fork_74,Fork_75,Fork_80,Fork_81,Fork_78,Fork_79,Fork_99,Fork_98,Fork_100,Fork_95,Fork_94,Fork_97,Fork_96,Fork_91,Fork_90,Fork_93,Fork_92)
normalized: place_bound(Fork_1,Fork_8,Fork_9,Fork_6,Fork_7,Fork_4,Fork_5,Fork_2,Fork_3,Fork_17,Fork_16,Fork_15,Fork_14,Fork_13,Fork_12,Fork_11,Fork_10,Fork_25,Fork_24,Fork_23,Fork_22,Fork_21,Fork_20,Fork_19,Fork_18,Fork_35,Fork_34,Fork_37,Fork_36,Fork_39,Fork_38,Fork_41,Fork_40,Fork_27,Fork_26,Fork_29,Fork_28,Fork_31,Fork_30,Fork_33,Fork_32,Fork_50,Fork_51,Fork_52,Fork_53,Fork_54,Fork_55,Fork_56,Fork_57,Fork_42,Fork_43,Fork_44,Fork_45,Fork_46,Fork_47,Fork_48,Fork_49,Fork_69,Fork_68,Fork_67,Fork_66,Fork_73,Fork_72,Fork_71,Fork_70,Fork_61,Fork_60,Fork_59,Fork_58,Fork_65,Fork_64,Fork_63,Fork_62,Fork_84,Fork_85,Fork_82,Fork_83,Fork_88,Fork_89,Fork_86,Fork_87,Fork_76,Fork_77,Fork_74,Fork_75,Fork_80,Fork_81,Fork_78,Fork_79,Fork_99,Fork_98,Fork_100,Fork_95,Fork_94,Fork_97,Fork_96,Fork_91,Fork_90,Fork_93,Fork_92)

-> the formula is 100

FORMULA Philosophers-PT-000100-UpperBounds-06 100 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Catch2_3,Catch2_2,Catch2_5,Catch2_4,Catch2_7,Catch2_6,Catch2_9,Catch2_8,Catch2_11,Catch2_10,Catch2_13,Catch2_12,Catch2_15,Catch2_14,Catch2_17,Catch2_16,Catch2_1,Catch2_41,Catch2_40,Catch2_39,Catch2_38,Catch2_37,Catch2_36,Catch2_35,Catch2_34,Catch2_49,Catch2_48,Catch2_47,Catch2_46,Catch2_45,Catch2_44,Catch2_43,Catch2_42,Catch2_24,Catch2_25,Catch2_22,Catch2_23,Catch2_20,Catch2_21,Catch2_18,Catch2_19,Catch2_32,Catch2_33,Catch2_30,Catch2_31,Catch2_28,Catch2_29,Catch2_26,Catch2_27,Catch2_71,Catch2_70,Catch2_73,Catch2_72,Catch2_67,Catch2_66,Catch2_69,Catch2_68,Catch2_79,Catch2_78,Catch2_81,Catch2_80,Catch2_75,Catch2_74,Catch2_77,Catch2_76,Catch2_54,Catch2_55,Catch2_56,Catch2_57,Catch2_50,Catch2_51,Catch2_52,Catch2_53,Catch2_62,Catch2_63,Catch2_64,Catch2_65,Catch2_58,Catch2_59,Catch2_60,Catch2_61,Catch2_100,Catch2_98,Catch2_99,Catch2_93,Catch2_92,Catch2_91,Catch2_90,Catch2_97,Catch2_96,Catch2_95,Catch2_94,Catch2_85,Catch2_84,Catch2_83,Catch2_82,Catch2_89,Catch2_88,Catch2_87,Catch2_86)
normalized: place_bound(Catch2_3,Catch2_2,Catch2_5,Catch2_4,Catch2_7,Catch2_6,Catch2_9,Catch2_8,Catch2_11,Catch2_10,Catch2_13,Catch2_12,Catch2_15,Catch2_14,Catch2_17,Catch2_16,Catch2_1,Catch2_41,Catch2_40,Catch2_39,Catch2_38,Catch2_37,Catch2_36,Catch2_35,Catch2_34,Catch2_49,Catch2_48,Catch2_47,Catch2_46,Catch2_45,Catch2_44,Catch2_43,Catch2_42,Catch2_24,Catch2_25,Catch2_22,Catch2_23,Catch2_20,Catch2_21,Catch2_18,Catch2_19,Catch2_32,Catch2_33,Catch2_30,Catch2_31,Catch2_28,Catch2_29,Catch2_26,Catch2_27,Catch2_71,Catch2_70,Catch2_73,Catch2_72,Catch2_67,Catch2_66,Catch2_69,Catch2_68,Catch2_79,Catch2_78,Catch2_81,Catch2_80,Catch2_75,Catch2_74,Catch2_77,Catch2_76,Catch2_54,Catch2_55,Catch2_56,Catch2_57,Catch2_50,Catch2_51,Catch2_52,Catch2_53,Catch2_62,Catch2_63,Catch2_64,Catch2_65,Catch2_58,Catch2_59,Catch2_60,Catch2_61,Catch2_100,Catch2_98,Catch2_99,Catch2_93,Catch2_92,Catch2_91,Catch2_90,Catch2_97,Catch2_96,Catch2_95,Catch2_94,Catch2_85,Catch2_84,Catch2_83,Catch2_82,Catch2_89,Catch2_88,Catch2_87,Catch2_86)

-> the formula is 100

FORMULA Philosophers-PT-000100-UpperBounds-07 100 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 201883 (2.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 94413 903824 998237
used/not used/entry size/cache size: 969485 66139379 16 1024MB
basic ops cache: hits/miss/sum: 0 124750 124750
used/not used/entry size/cache size: 364430 16412786 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: 594 2580 3174
used/not used/entry size/cache size: 2580 8386028 32 256MB
max state cache: hits/miss/sum: 2376 10320 12696
used/not used/entry size/cache size: 2580 8386028 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66908735
1 198376
2 1752
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.925sec


BK_STOP 1678759349210

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


iterations count:2293 (4), effective:300 (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="Philosophers-PT-000100"
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 Philosophers-PT-000100, 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 r289-tall-167873940100221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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