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.r065-smll-167814393000121.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 CircadianClock-PT-001000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814393000121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.0K Feb 26 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 10:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 10:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 10:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 137K Feb 26 10:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 11K 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 CircadianClock-PT-001000-CTLCardinality-00
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-01
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-02
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-03
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-04
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-05
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-06
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-07
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-08
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-09
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-10
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-11
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-12
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-13
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-14
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678266435875

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircadianClock-PT-001000
Not applying reductions.
Model is PT
CTLCardinality 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: CircadianClock_PT_001000
(NrP: 14 NrTr: 16 NrArc: 58)

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

net check time: 0m 0.000sec

init dd package: 0m 4.418sec


RS generation: 0m 3.514sec


-> reachability set: #nodes 5016 (5.0e+03) #states 4,020,040,040,020,004 (15)



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

checking: EF [115<=da]
normalized: E [true U 115<=da]

abstracting: (115<=da)
states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [975<=mr]
normalized: E [true U 975<=mr]

abstracting: (975<=mr)
states: 104,416,624,416,104 (14)
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.976sec

checking: EX [AF [EG [[272<=da_a | EF [ma_cap<=383]]]]]
normalized: EX [~ [EG [~ [EG [[272<=da_a | E [true U ma_cap<=383]]]]]]]

abstracting: (ma_cap<=383)
states: 1,542,153,222,145,536 (15)
abstracting: (272<=da_a)
states: 0

EG iterations: 0
.
EG iterations: 1
.-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.100sec

checking: ~ [EF [EG [EG [[566<=c | 263<=a]]]]]
normalized: ~ [E [true U EG [EG [[566<=c | 263<=a]]]]]

abstracting: (263<=a)
states: 2,963,825,723,810,952 (15)
abstracting: (566<=c)
states: 1,746,970,446,961,740 (15)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.356sec

checking: EF [[AG [mr<=dr] & EX [AG [[~ [904<=c] & [508<=mr | dr_a<=410]]]]]]
normalized: E [true U [EX [~ [E [true U ~ [[[508<=mr | dr_a<=410] & ~ [904<=c]]]]]] & ~ [E [true U ~ [mr<=dr]]]]]

abstracting: (mr<=dr)
states: 6,024,036,024,006 (12)
abstracting: (904<=c)
states: 389,554,329,552,388 (14)
abstracting: (dr_a<=410)
states: 4,020,040,040,020,004 (15)
abstracting: (508<=mr)
states: 1,979,899,839,889,972 (15)
.-> the formula is FALSE

FORMULA CircadianClock-PT-001000-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.732sec

checking: EF [EF [EX [~ [[A [661<=dr U ma<=r_cap] | E [dr_a<=67 U 410<=da]]]]]]
normalized: E [true U E [true U EX [~ [[E [dr_a<=67 U 410<=da] | [~ [EG [~ [ma<=r_cap]]] & ~ [E [~ [ma<=r_cap] U [~ [661<=dr] & ~ [ma<=r_cap]]]]]]]]]]

abstracting: (ma<=r_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (661<=dr)
states: 0
abstracting: (ma<=r_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (ma<=r_cap)
states: 2,012,028,032,018,004 (15)
.
EG iterations: 1
abstracting: (410<=da)
states: 0
abstracting: (dr_a<=67)
states: 4,020,040,040,020,004 (15)
.-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m52.508sec

checking: AG [AX [[[~ [AG [21<=mr_cap]] | A [[da<=664 & 207<=a] U [166<=c_cap | 30<=mr]]] | AG [c<=736]]]]
normalized: ~ [E [true U EX [~ [[~ [E [true U ~ [c<=736]]] | [[~ [EG [~ [[166<=c_cap | 30<=mr]]]] & ~ [E [~ [[166<=c_cap | 30<=mr]] U [~ [[da<=664 & 207<=a]] & ~ [[166<=c_cap | 30<=mr]]]]]] | E [true U ~ [21<=mr_cap]]]]]]]]

abstracting: (21<=mr_cap)
states: 3,935,703,535,683,920 (15)
abstracting: (30<=mr)
states: 3,899,559,319,539,884 (15)
abstracting: (166<=c_cap)
states: 3,353,380,053,363,340 (15)
abstracting: (207<=a)
states: 3,188,723,068,707,176 (15)
abstracting: (da<=664)
states: 4,020,040,040,020,004 (15)
abstracting: (30<=mr)
states: 3,899,559,319,539,884 (15)
abstracting: (166<=c_cap)
states: 3,353,380,053,363,340 (15)
abstracting: (30<=mr)
states: 3,899,559,319,539,884 (15)
abstracting: (166<=c_cap)
states: 3,353,380,053,363,340 (15)
.
EG iterations: 1
abstracting: (c<=736)
states: 2,959,809,699,794,948 (15)
.-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.952sec

checking: ~ [EF [[[EX [[ma_cap<=786 & dr_a<=288]] & EX [E [442<=ma U 983<=dr_a]]] | [~ [EF [da<=r_cap]] & AF [[827<=c_cap & 25<=r]]]]]]
normalized: ~ [E [true U [[~ [EG [~ [[827<=c_cap & 25<=r]]]] & ~ [E [true U da<=r_cap]]] | [EX [E [442<=ma U 983<=dr_a]] & EX [[ma_cap<=786 & dr_a<=288]]]]]]

abstracting: (dr_a<=288)
states: 4,020,040,040,020,004 (15)
abstracting: (ma_cap<=786)
states: 3,160,610,900,595,148 (15)
.abstracting: (983<=dr_a)
states: 0
abstracting: (442<=ma)
states: 2,244,957,424,946,236 (15)
.abstracting: (da<=r_cap)
states: 4,018,032,028,012,002 (15)
abstracting: (25<=r)
states: 3,919,639,439,619,904 (15)
abstracting: (827<=c_cap)
states: 698,788,178,784,696 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.815sec

checking: AG [E [da_a<=mr_cap U A [E [~ [a<=7] U [480<=r | da<=c_cap]] U A [EF [da<=c] U AX [da<=ma_cap]]]]]
normalized: ~ [E [true U ~ [E [da_a<=mr_cap U [~ [EG [~ [[~ [EG [EX [~ [da<=ma_cap]]]] & ~ [E [EX [~ [da<=ma_cap]] U [~ [E [true U da<=c]] & EX [~ [da<=ma_cap]]]]]]]]] & ~ [E [~ [[~ [EG [EX [~ [da<=ma_cap]]]] & ~ [E [EX [~ [da<=ma_cap]] U [~ [E [true U da<=c]] & EX [~ [da<=ma_cap]]]]]]] U [~ [E [~ [a<=7] U [480<=r | da<=c_cap]]] & ~ [[~ [EG [EX [~ [da<=ma_cap]]]] & ~ [E [EX [~ [da<=ma_cap]] U [~ [E [true U da<=c]] & EX [~ [da<=ma_cap]]]]]]]]]]]]]]]

abstracting: (da<=ma_cap)
states: 4,018,032,028,012,002 (15)
.abstracting: (da<=c)
states: 4,018,032,028,012,002 (15)
abstracting: (da<=ma_cap)
states: 4,018,032,028,012,002 (15)
.abstracting: (da<=ma_cap)
states: 4,018,032,028,012,002 (15)
..
EG iterations: 1
abstracting: (da<=c_cap)
states: 4,018,032,028,012,002 (15)
abstracting: (480<=r)
states: 2,092,348,512,338,084 (15)
abstracting: (a<=7)
states: 32,128,192,128,032 (13)
abstracting: (da<=ma_cap)
states: 4,018,032,028,012,002 (15)
.abstracting: (da<=c)
states: 4,018,032,028,012,002 (15)
abstracting: (da<=ma_cap)
states: 4,018,032,028,012,002 (15)
.abstracting: (da<=ma_cap)
states: 4,018,032,028,012,002 (15)
..
EG iterations: 1
abstracting: (da<=ma_cap)
states: 4,018,032,028,012,002 (15)
.abstracting: (da<=c)
states: 4,018,032,028,012,002 (15)
abstracting: (da<=ma_cap)
states: 4,018,032,028,012,002 (15)
.abstracting: (da<=ma_cap)
states: 4,018,032,028,012,002 (15)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (da_a<=mr_cap)
states: 4,018,032,028,012,002 (15)
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.537sec

checking: [~ [[EX [EX [A [253<=r_cap U mr<=mr_cap]]] | ~ [A [[326<=ma_cap & EX [373<=mr_cap]] U 431<=dr]]]] | EF [[EG [AX [871<=mr]] & EX [EX [[da<=r_cap & 88<=ma_cap]]]]]]
normalized: [E [true U [EX [EX [[da<=r_cap & 88<=ma_cap]]] & EG [~ [EX [~ [871<=mr]]]]]] | ~ [[~ [[~ [EG [~ [431<=dr]]] & ~ [E [~ [431<=dr] U [~ [[326<=ma_cap & EX [373<=mr_cap]]] & ~ [431<=dr]]]]]] | EX [EX [[~ [EG [~ [mr<=mr_cap]]] & ~ [E [~ [mr<=mr_cap] U [~ [253<=r_cap] & ~ [mr<=mr_cap]]]]]]]]]]

abstracting: (mr<=mr_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (253<=r_cap)
states: 3,003,985,963,970,992 (15)
abstracting: (mr<=mr_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (mr<=mr_cap)
states: 2,012,028,032,018,004 (15)
.
EG iterations: 1
..abstracting: (431<=dr)
states: 0
abstracting: (373<=mr_cap)
states: 2,522,063,082,050,512 (15)
.abstracting: (326<=ma_cap)
states: 2,710,816,210,802,700 (15)
abstracting: (431<=dr)
states: 0
abstracting: (431<=dr)
states: 0

EG iterations: 0
abstracting: (871<=mr)
states: 522,083,122,080,520 (14)
..
EG iterations: 1
abstracting: (88<=ma_cap)
states: 3,666,629,926,611,652 (15)
abstracting: (da<=r_cap)
states: 4,018,032,028,012,002 (15)
..-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.151sec

checking: ~ [[EF [[~ [EG [[a_cap<=214 & 288<=da_a]]] & [A [E [mr<=602 U ma<=757] U A [502<=da U 561<=dr_a]] & EG [[c_cap<=da | 825<=a]]]]] & AF [dr_a<=ma_cap]]]
normalized: ~ [[~ [EG [~ [dr_a<=ma_cap]]] & E [true U [[EG [[c_cap<=da | 825<=a]] & [~ [EG [~ [[~ [EG [~ [561<=dr_a]]] & ~ [E [~ [561<=dr_a] U [~ [502<=da] & ~ [561<=dr_a]]]]]]]] & ~ [E [~ [[~ [EG [~ [561<=dr_a]]] & ~ [E [~ [561<=dr_a] U [~ [502<=da] & ~ [561<=dr_a]]]]]] U [~ [E [mr<=602 U ma<=757]] & ~ [[~ [EG [~ [561<=dr_a]]] & ~ [E [~ [561<=dr_a] U [~ [502<=da] & ~ [561<=dr_a]]]]]]]]]]] & ~ [EG [[a_cap<=214 & 288<=da_a]]]]]]]

abstracting: (288<=da_a)
states: 0
abstracting: (a_cap<=214)
states: 863,445,163,440,860 (14)
.
EG iterations: 1
abstracting: (561<=dr_a)
states: 0
abstracting: (502<=da)
states: 0
abstracting: (561<=dr_a)
states: 0
abstracting: (561<=dr_a)
states: 0

EG iterations: 0
abstracting: (ma<=757)
states: 3,044,146,204,131,032 (15)
abstracting: (mr<=602)
states: 2,421,662,481,650,412 (15)
abstracting: (561<=dr_a)
states: 0
abstracting: (502<=da)
states: 0
abstracting: (561<=dr_a)
states: 0
abstracting: (561<=dr_a)
states: 0

EG iterations: 0
abstracting: (561<=dr_a)
states: 0
abstracting: (502<=da)
states: 0
abstracting: (561<=dr_a)
states: 0
abstracting: (561<=dr_a)
states: 0

EG iterations: 0

EG iterations: 0
abstracting: (825<=a)
states: 706,820,226,816,704 (14)
abstracting: (c_cap<=da)
states: 6,024,036,024,006 (12)
.
EG iterations: 1
abstracting: (dr_a<=ma_cap)
states: 4,018,032,028,012,002 (15)
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.028sec

checking: EF [E [EX [~ [631<=da]] U [EX [[AX [a_cap<=mr_cap] & [899<=mr & mr<=205]]] & [~ [[AG [c_cap<=mr] & [893<=a_cap | da_a<=c_cap]]] | c_cap<=mr_cap]]]]
normalized: E [true U E [EX [~ [631<=da]] U [[c_cap<=mr_cap | ~ [[[893<=a_cap | da_a<=c_cap] & ~ [E [true U ~ [c_cap<=mr]]]]]] & EX [[[899<=mr & mr<=205] & ~ [EX [~ [a_cap<=mr_cap]]]]]]]]

abstracting: (a_cap<=mr_cap)
states: 2,012,028,032,018,004 (15)
.abstracting: (mr<=205)
states: 827,300,947,296,824 (14)
abstracting: (899<=mr)
states: 409,634,449,632,408 (14)
.abstracting: (c_cap<=mr)
states: 2,012,028,032,018,004 (15)
abstracting: (da_a<=c_cap)
states: 4,018,032,028,012,002 (15)
abstracting: (893<=a_cap)
states: 433,730,593,728,432 (14)
abstracting: (c_cap<=mr_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (631<=da)
states: 0
.-> the formula is FALSE

FORMULA CircadianClock-PT-001000-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m23.939sec

checking: E [EX [[~ [128<=c] | r<=474]] U [AF [AG [AG [mr<=ma_cap]]] & [E [[[mr_cap<=450 & 50<=dr] & [EX [a<=ma] & [a_cap<=72 | c<=91]]] U mr_cap<=395] & [ma_cap<=817 | EG [~ [EX [c<=536]]]]]]]
normalized: E [EX [[r<=474 | ~ [128<=c]]] U [[[ma_cap<=817 | EG [~ [EX [c<=536]]]] & E [[[[a_cap<=72 | c<=91] & EX [a<=ma]] & [mr_cap<=450 & 50<=dr]] U mr_cap<=395]] & ~ [EG [E [true U E [true U ~ [mr<=ma_cap]]]]]]]

abstracting: (mr<=ma_cap)
states: 2,012,028,032,018,004 (15)

before gc: list nodes free: 1873771

after gc: idd nodes used:7112222, unused:56887778; list nodes free:407307236

before gc: list nodes free: 66487822

after gc: idd nodes used:7112222, unused:56887778; list nodes free:407307236

before gc: list nodes free: 66484822

after gc: idd nodes used:7112222, unused:56887778; list nodes free:407307236

before gc: list nodes free: 66479822

after gc: idd nodes used:7112222, unused:56887778; list nodes free:407307236

before gc: list nodes free: 66473822

after gc: idd nodes used:7112222, unused:56887778; list nodes free:407307236

before gc: list nodes free: 66464825

after gc: idd nodes used:7112222, unused:56887778; list nodes free:407307236

before gc: list nodes free: 66453825

after gc: idd nodes used:7112222, unused:56887778; list nodes free:407307236
MC time: 13m28.291sec

checking: [[EG [EF [AF [c_cap<=79]]] & ~ [EG [[~ [[r<=r_cap | E [mr_cap<=ma_cap U r_cap<=614]]] & ~ [[c_cap<=a_cap & ~ [312<=dr_a]]]]]]] & [AG [da_a<=82] & [AG [[dr<=r | ~ [[AX [c_cap<=535] & EF [r_cap<=dr]]]]] | AF [[~ [[ma<=909 & [ma_cap<=622 | c<=209]]] | EF [497<=ma]]]]]]
normalized: [[[~ [EG [~ [[E [true U 497<=ma] | ~ [[ma<=909 & [ma_cap<=622 | c<=209]]]]]]] | ~ [E [true U ~ [[dr<=r | ~ [[E [true U r_cap<=dr] & ~ [EX [~ [c_cap<=535]]]]]]]]]] & ~ [E [true U ~ [da_a<=82]]]] & [~ [EG [[~ [[c_cap<=a_cap & ~ [312<=dr_a]]] & ~ [[r<=r_cap | E [mr_cap<=ma_cap U r_cap<=614]]]]]] & EG [E [true U ~ [EG [~ [c_cap<=79]]]]]]]

abstracting: (c_cap<=79)
states: 321,281,921,280,320 (14)
.
EG iterations: 1

EG iterations: 0
abstracting: (r_cap<=614)
states: 2,469,854,769,842,460 (15)
abstracting: (mr_cap<=ma_cap)
states: 2,012,028,032,018,004 (15)

before gc: list nodes free: 57788895

after gc: idd nodes used:7115577, unused:56884423; list nodes free:407280221
abstracting: (r<=r_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (312<=dr_a)
states: 0
abstracting: (c_cap<=a_cap)
states: 2,012,028,032,018,004 (15)
.
EG iterations: 1
abstracting: (da_a<=82)
states: 4,020,040,040,020,004 (15)
abstracting: (c_cap<=535)
states: 2,152,588,872,578,144 (15)
.abstracting: (r_cap<=dr)
states: 6,024,036,024,006 (12)
abstracting: (dr<=r)
states: 4,018,032,028,012,002 (15)
abstracting: (c<=209)
states: 843,365,043,360,840 (14)
abstracting: (ma_cap<=622)
states: 2,501,982,961,970,492 (15)
abstracting: (ma<=909)
states: 3,654,581,854,563,640 (15)
abstracting: (497<=ma)
states: 2,024,076,104,066,016 (15)
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m45.186sec

checking: [E [A [[[~ [[ma<=mr | mr<=829]] | dr_a<=855] & ~ [EF [729<=da]]] U [c<=919 | ~ [EG [858<=c]]]] U [AG [[c<=a | ~ [[mr<=c & a<=825]]]] & a<=da]] & ~ [A [[[[976<=ma_cap | 856<=da] & dr<=dr_a] & ~ [A [ma_cap<=ma U mr<=280]]] U r_cap<=897]]]
normalized: [~ [[~ [EG [~ [r_cap<=897]]] & ~ [E [~ [r_cap<=897] U [~ [[~ [[~ [EG [~ [mr<=280]]] & ~ [E [~ [mr<=280] U [~ [ma_cap<=ma] & ~ [mr<=280]]]]]] & [dr<=dr_a & [976<=ma_cap | 856<=da]]]] & ~ [r_cap<=897]]]]]] & E [[~ [EG [~ [[c<=919 | ~ [EG [858<=c]]]]]] & ~ [E [~ [[c<=919 | ~ [EG [858<=c]]]] U [~ [[~ [E [true U 729<=da]] & [dr_a<=855 | ~ [[ma<=mr | mr<=829]]]]] & ~ [[c<=919 | ~ [EG [858<=c]]]]]]]] U [a<=da & ~ [E [true U ~ [[c<=a | ~ [[mr<=c & a<=825]]]]]]]]]

abstracting: (a<=825)
states: 3,317,235,837,219,304 (15)
abstracting: (mr<=c)
states: 2,012,028,032,018,004 (15)
abstracting: (c<=a)
states: 2,012,028,032,018,004 (15)

before gc: list nodes free: 40444446

after gc: idd nodes used:13787776, unused:50212224; list nodes free:363989333

before gc: list nodes free: 52691222

after gc: idd nodes used:13787746, unused:50212254; list nodes free:364007721

before gc: list nodes free: 52706144

after gc: idd nodes used:13787716, unused:50212284; list nodes free:364022793

before gc: list nodes free: 52715342

after gc: idd nodes used:13787686, unused:50212314; list nodes free:364033720

before gc: list nodes free: 52720976

after gc: idd nodes used:13787656, unused:50212344; list nodes free:364040502

before gc: list nodes free: 52723543

after gc: idd nodes used:13787626, unused:50212374; list nodes free:364044797

before gc: list nodes free: 52923805

after gc: idd nodes used:13733407, unused:50266593; list nodes free:364415289
MC time: 12m52.224sec

checking: EX [[[EX [A [[a<=845 & 836<=ma_cap] U dr<=a]] | ~ [mr_cap<=455]] & A [[[[[ma_cap<=112 | 318<=c_cap] | AX [r_cap<=850]] | [E [998<=c_cap U ma_cap<=dr] & [ma_cap<=352 | a_cap<=r_cap]]] | a<=da] U [[[[95<=da_a | da_a<=785] & EF [ma_cap<=530]] | [EG [da_a<=r] & EX [289<=a]]] & E [[ma<=mr_cap | mr<=da_a] U EG [r<=823]]]]]]
normalized: EX [[[~ [EG [~ [[E [[ma<=mr_cap | mr<=da_a] U EG [r<=823]] & [[EX [289<=a] & EG [da_a<=r]] | [E [true U ma_cap<=530] & [95<=da_a | da_a<=785]]]]]]] & ~ [E [~ [[E [[ma<=mr_cap | mr<=da_a] U EG [r<=823]] & [[EX [289<=a] & EG [da_a<=r]] | [E [true U ma_cap<=530] & [95<=da_a | da_a<=785]]]]] U [~ [[a<=da | [[[ma_cap<=352 | a_cap<=r_cap] & E [998<=c_cap U ma_cap<=dr]] | [~ [EX [~ [r_cap<=850]]] | [ma_cap<=112 | 318<=c_cap]]]]] & ~ [[E [[ma<=mr_cap | mr<=da_a] U EG [r<=823]] & [[EX [289<=a] & EG [da_a<=r]] | [E [true U ma_cap<=530] & [95<=da_a | da_a<=785]]]]]]]]] & [~ [mr_cap<=455] | EX [[~ [EG [~ [dr<=a]]] & ~ [E [~ [dr<=a] U [~ [[a<=845 & 836<=ma_cap]] & ~ [dr<=a]]]]]]]]]

abstracting: (dr<=a)
states: 4,018,032,028,012,002 (15)
abstracting: (836<=ma_cap)
states: 662,643,962,640,660 (14)
abstracting: (a<=845)
states: 3,397,556,317,539,384 (15)
abstracting: (dr<=a)
states: 4,018,032,028,012,002 (15)
abstracting: (dr<=a)
states: 4,018,032,028,012,002 (15)
.
EG iterations: 1
.abstracting: (mr_cap<=455)
states: 1,831,306,951,297,824 (15)
abstracting: (da_a<=785)
states: 4,020,040,040,020,004 (15)
abstracting: (95<=da_a)
states: 0
abstracting: (ma_cap<=530)
states: 2,132,508,752,498,124 (15)
abstracting: (da_a<=r)
states: 4,018,032,028,012,002 (15)
.
EG iterations: 1
abstracting: (289<=a)
states: 2,859,409,099,394,848 (15)
.abstracting: (r<=823)
states: 3,309,203,789,187,296 (15)
.
EG iterations: 1
abstracting: (mr<=da_a)
states: 6,024,036,024,006 (12)
abstracting: (ma<=mr_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (318<=c_cap)
states: 2,742,944,402,930,732 (15)
abstracting: (ma_cap<=112)
states: 453,810,713,808,452 (14)
abstracting: (r_cap<=850)
states: 3,417,636,437,619,404 (15)
.abstracting: (ma_cap<=dr)
states: 6,024,036,024,006 (12)
abstracting: (998<=c_cap)
states: 12,048,072,048,012 (13)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 3524380 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16181412 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:85028 (5314), effective:15003 (937)

initing FirstDep: 0m 0.000sec


iterations count:4891 (305), effective:1950 (121)

iterations count:9271 (579), effective:2468 (154)

iterations count:1612 (100), effective:267 (16)

iterations count:23 (1), effective:3 (0)

iterations count:44312 (2769), effective:7232 (452)

iterations count:16 (1), effective:0 (0)

iterations count:15021 (938), effective:4002 (250)

iterations count:16 (1), effective:0 (0)

iterations count:4916 (307), effective:1960 (122)

iterations count:2401 (150), effective:795 (49)

iterations count:36129 (2258), effective:5896 (368)

iterations count:34 (2), effective:4 (0)

iterations count:34 (2), effective:4 (0)

iterations count:20 (1), effective:1 (0)

iterations count:34 (2), effective:4 (0)

iterations count:49045 (3065), effective:8516 (532)

iterations count:34 (2), effective:4 (0)

iterations count:6041 (377), effective:1006 (62)

iterations count:20036 (1252), effective:6005 (375)

iterations count:9740 (608), effective:748 (46)

iterations count:3161 (197), effective:1258 (78)

iterations count:4734 (295), effective:1833 (114)

iterations count:16 (1), effective:0 (0)

iterations count:988 (61), effective:243 (15)

iterations count:16 (1), effective:0 (0)

iterations count:14401 (900), effective:4238 (264)

iterations count:16 (1), effective:0 (0)

iterations count:1022 (63), effective:1002 (62)

sat_reach.icc:155: Timeout: after 807 sec


iterations count:45145 (2821), effective:7368 (460)

iterations count:6964 (435), effective:1158 (72)

iterations count:18005 (1125), effective:2999 (187)

iterations count:24857 (1553), effective:4730 (295)

iterations count:7471 (466), effective:1988 (124)

sat_reach.icc:155: Timeout: after 771 sec


iterations count:1501 (93), effective:330 (20)

iterations count:7066 (441), effective:1880 (117)

iterations count:370 (23), effective:177 (11)

sat_reach.icc:155: Timeout: after 514 sec

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="CircadianClock-PT-001000"
export BK_EXAMINATION="CTLCardinality"
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 CircadianClock-PT-001000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r065-smll-167814393000121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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