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

About the Execution of Marcie for ResAllocation-PT-R003C050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9951.380 341498.00 341070.00 0.00 FFTFTFFTTTTTFFFT 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.r321-tall-167889192500713.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 ResAllocation-PT-R003C050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192500713
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 8.3K Feb 25 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 360K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678940867610

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=ResAllocation-PT-R003C050
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: ResAllocation_PT_R003C050
(NrP: 300 NrTr: 200 NrArc: 894)

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

net check time: 0m 0.000sec

init dd package: 0m 2.873sec


RS generation: 0m 0.058sec


-> reachability set: #nodes 2056 (2.1e+03) #states 48,717,538,008,124,384,423,924,727,808 (28)



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

checking: AF [AG [AF [p_46_2<=r_37_1]]]
normalized: ~ [EG [E [true U EG [~ [p_46_2<=r_37_1]]]]]

abstracting: (p_46_2<=r_37_1)
states: 45,855,242,192,512,137,082,299,219,968 (28)
...........................................................................
EG iterations: 75
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.940sec

checking: EG [~ [[A [AG [1<=r_5_2] U 1<=p_12_2] & ~ [r_46_2<=1]]]]
normalized: EG [~ [[~ [r_46_2<=1] & [~ [EG [~ [1<=p_12_2]]] & ~ [E [~ [1<=p_12_2] U [E [true U ~ [1<=r_5_2]] & ~ [1<=p_12_2]]]]]]]]

abstracting: (1<=p_12_2)
states: 6,387,670,303,033,443,864,088,150,016 (27)
abstracting: (1<=r_5_2)
states: 23,537,106,469,748,707,308,678,938,624 (28)
abstracting: (1<=p_12_2)
states: 6,387,670,303,033,443,864,088,150,016 (27)
abstracting: (1<=p_12_2)
states: 6,387,670,303,033,443,864,088,150,016 (27)
.
EG iterations: 1
abstracting: (r_46_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.200sec

checking: [EF [AX [AG [[[1<=r_20_0 | p_49_1<=p_1_1] & AF [r_36_0<=1]]]]] & AX [EG [AF [AX [r_36_1<=1]]]]]
normalized: [~ [EX [~ [EG [~ [EG [EX [~ [r_36_1<=1]]]]]]]] & E [true U ~ [EX [E [true U ~ [[~ [EG [~ [r_36_0<=1]]] & [1<=r_20_0 | p_49_1<=p_1_1]]]]]]]]

abstracting: (p_49_1<=p_1_1)
states: 32,853,532,807,526,886,561,418,313,728 (28)
abstracting: (1<=r_20_0)
states: 23,430,730,421,637,462,927,083,569,152 (28)
abstracting: (r_36_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.
EG iterations: 1
.abstracting: (r_36_1<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
..
EG iterations: 1

EG iterations: 0
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.703sec

checking: A [EF [~ [EG [r_39_0<=1]]] U E [[1<=r_4_1 & ~ [1<=r_32_1]] U AG [[r_13_2<=0 & p_39_0<=1]]]]
normalized: [~ [EG [~ [E [[1<=r_4_1 & ~ [1<=r_32_1]] U ~ [E [true U ~ [[r_13_2<=0 & p_39_0<=1]]]]]]]] & ~ [E [~ [E [[1<=r_4_1 & ~ [1<=r_32_1]] U ~ [E [true U ~ [[r_13_2<=0 & p_39_0<=1]]]]]] U [~ [E [true U ~ [EG [r_39_0<=1]]]] & ~ [E [[1<=r_4_1 & ~ [1<=r_32_1]] U ~ [E [true U ~ [[r_13_2<=0 & p_39_0<=1]]]]]]]]]]

abstracting: (p_39_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (r_13_2<=0)
states: 25,286,081,470,450,211,626,239,918,080 (28)
abstracting: (1<=r_32_1)
states: 23,680,750,968,668,893,784,290,885,632 (28)
abstracting: (1<=r_4_1)
states: 23,388,566,475,975,928,476,495,511,552 (28)
abstracting: (r_39_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)

EG iterations: 0
abstracting: (p_39_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (r_13_2<=0)
states: 25,286,081,470,450,211,626,239,918,080 (28)
abstracting: (1<=r_32_1)
states: 23,680,750,968,668,893,784,290,885,632 (28)
abstracting: (1<=r_4_1)
states: 23,388,566,475,975,928,476,495,511,552 (28)
abstracting: (p_39_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (r_13_2<=0)
states: 25,286,081,470,450,211,626,239,918,080 (28)
abstracting: (1<=r_32_1)
states: 23,680,750,968,668,893,784,290,885,632 (28)
abstracting: (1<=r_4_1)
states: 23,388,566,475,975,928,476,495,511,552 (28)
...........................................................................
EG iterations: 75
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.636sec

checking: EF [EG [[~ [p_39_1<=r_43_0] | AF [[EX [r_22_1<=1] | AF [p_37_2<=p_11_0]]]]]]
normalized: E [true U EG [[~ [p_39_1<=r_43_0] | ~ [EG [~ [[~ [EG [~ [p_37_2<=p_11_0]]] | EX [r_22_1<=1]]]]]]]]

abstracting: (r_22_1<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.abstracting: (p_37_2<=p_11_0)
states: 32,286,881,328,422,225,828,944,805,888 (28)
.........................................................................
EG iterations: 73
.
EG iterations: 1
abstracting: (p_39_1<=r_43_0)
states: 42,095,961,713,595,353,416,945,631,232 (28)
..........................................................................
EG iterations: 74
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.081sec

checking: [~ [[~ [A [A [1<=p_2_0 U AG [r_5_0<=0]] U [~ [p_33_1<=p_29_2] | r_12_0<=0]]] & EG [AF [E [p_7_2<=0 U r_6_2<=1]]]]] | EX [EX [~ [AF [[1<=p_38_2 & 1<=r_18_1]]]]]]
normalized: [~ [[~ [[~ [EG [~ [[~ [p_33_1<=p_29_2] | r_12_0<=0]]]] & ~ [E [~ [[~ [p_33_1<=p_29_2] | r_12_0<=0]] U [~ [[~ [EG [E [true U ~ [r_5_0<=0]]]] & ~ [E [E [true U ~ [r_5_0<=0]] U [~ [1<=p_2_0] & E [true U ~ [r_5_0<=0]]]]]]] & ~ [[~ [p_33_1<=p_29_2] | r_12_0<=0]]]]]]] & EG [~ [EG [~ [E [p_7_2<=0 U r_6_2<=1]]]]]]] | EX [EX [EG [~ [[1<=p_38_2 & 1<=r_18_1]]]]]]

abstracting: (1<=r_18_1)
states: 23,680,878,950,552,651,458,460,778,496 (28)
abstracting: (1<=p_38_2)
states: 6,377,909,922,095,274,607,140,405,248 (27)
.
EG iterations: 1
..abstracting: (r_6_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_7_2<=0)
states: 29,885,422,170,510,611,250,004,623,360 (28)
.
EG iterations: 1

EG iterations: 0
abstracting: (r_12_0<=0)
states: 25,288,123,655,664,266,088,615,510,016 (28)
abstracting: (p_33_1<=p_29_2)
states: 41,324,794,549,177,483,530,388,635,648 (28)
abstracting: (r_5_0<=0)
states: 25,161,166,811,520,581,189,576,425,472 (28)
abstracting: (1<=p_2_0)
states: 20,229,394,645,900,285,530,230,226,944 (28)
abstracting: (r_5_0<=0)
states: 25,161,166,811,520,581,189,576,425,472 (28)
abstracting: (r_5_0<=0)
states: 25,161,166,811,520,581,189,576,425,472 (28)
............................................
before gc: list nodes free: 679492

after gc: idd nodes used:157877, unused:63842123; list nodes free:288683487
...............................
EG iterations: 75
abstracting: (r_12_0<=0)
states: 25,288,123,655,664,266,088,615,510,016 (28)
abstracting: (p_33_1<=p_29_2)
states: 41,324,794,549,177,483,530,388,635,648 (28)
abstracting: (r_12_0<=0)
states: 25,288,123,655,664,266,088,615,510,016 (28)
abstracting: (p_33_1<=p_29_2)
states: 41,324,794,549,177,483,530,388,635,648 (28)
................................................................................
EG iterations: 80
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.501sec

checking: EF [E [1<=r_41_0 U [[r_43_1<=0 & ~ [[[p_11_2<=1 | p_27_2<=0] | p_13_1<=1]]] & [[p_17_1<=0 & E [r_45_0<=r_47_0 U r_38_0<=0]] & EG [~ [r_42_0<=1]]]]]]
normalized: E [true U E [1<=r_41_0 U [[EG [~ [r_42_0<=1]] & [E [r_45_0<=r_47_0 U r_38_0<=0] & p_17_1<=0]] & [~ [[[p_11_2<=1 | p_27_2<=0] | p_13_1<=1]] & r_43_1<=0]]]]

abstracting: (r_43_1<=0)
states: 24,874,342,337,370,464,387,613,065,216 (28)
abstracting: (p_13_1<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_27_2<=0)
states: 29,814,981,073,806,550,203,201,748,992 (28)
abstracting: (p_11_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_17_1<=0)
states: 36,199,445,887,908,426,360,620,580,864 (28)
abstracting: (r_38_0<=0)
states: 25,292,693,846,790,993,041,063,673,856 (28)
abstracting: (r_45_0<=r_47_0)
states: 36,090,329,443,613,984,172,177,096,704 (28)
abstracting: (r_42_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.
EG iterations: 1
abstracting: (1<=r_41_0)
states: 23,460,494,110,927,206,045,343,285,248 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.096sec

checking: EG [[[EX [p_43_1<=1] & E [[~ [[r_23_0<=1 | 1<=p_39_1]] | [[p_12_0<=1 | p_43_2<=0] | [1<=p_1_1 | r_25_2<=1]]] U E [EG [1<=p_27_0] U [r_17_1<=0 | 1<=p_46_2]]]] | p_19_1<=1]]
normalized: EG [[[E [[[[1<=p_1_1 | r_25_2<=1] | [p_12_0<=1 | p_43_2<=0]] | ~ [[r_23_0<=1 | 1<=p_39_1]]] U E [EG [1<=p_27_0] U [r_17_1<=0 | 1<=p_46_2]]] & EX [p_43_1<=1]] | p_19_1<=1]]

abstracting: (p_19_1<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_43_1<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.abstracting: (1<=p_46_2)
states: 5,550,472,393,754,008,468,901,068,800 (27)
abstracting: (r_17_1<=0)
states: 25,036,509,225,125,477,001,149,284,352 (28)
abstracting: (1<=p_27_0)
states: 6,384,254,148,875,795,016,515,059,712 (27)
...........................................................................
EG iterations: 75
abstracting: (1<=p_39_1)
states: 12,534,237,727,104,481,512,579,399,680 (28)
abstracting: (r_23_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_43_2<=0)
states: 29,688,275,744,801,655,458,556,280,832 (28)
abstracting: (p_12_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (r_25_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (1<=p_1_1)
states: 8,435,832,524,550,714,777,078,333,440 (27)

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.091sec

checking: [~ [EG [~ [[~ [E [p_17_2<=r_43_0 U p_10_2<=1]] & ~ [[1<=p_46_2 | [1<=p_46_2 | r_1_2<=1]]]]]]] & EX [[[[AX [1<=r_31_2] & EX [[p_15_1<=1 | 1<=p_30_2]]] & p_49_1<=1] | AF [~ [E [r_23_0<=1 U p_11_0<=1]]]]]]
normalized: [EX [[~ [EG [E [r_23_0<=1 U p_11_0<=1]]] | [[EX [[p_15_1<=1 | 1<=p_30_2]] & ~ [EX [~ [1<=r_31_2]]]] & p_49_1<=1]]] & ~ [EG [~ [[~ [[[1<=p_46_2 | r_1_2<=1] | 1<=p_46_2]] & ~ [E [p_17_2<=r_43_0 U p_10_2<=1]]]]]]]

abstracting: (p_10_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_17_2<=r_43_0)
states: 38,947,529,749,443,930,419,055,558,656 (28)
abstracting: (1<=p_46_2)
states: 5,550,472,393,754,008,468,901,068,800 (27)
abstracting: (r_1_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (1<=p_46_2)
states: 5,550,472,393,754,008,468,901,068,800 (27)

EG iterations: 0
abstracting: (p_49_1<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (1<=r_31_2)
states: 23,430,817,945,313,873,196,354,633,728 (28)
.abstracting: (1<=p_30_2)
states: 6,384,202,098,212,014,520,698,667,008 (27)
abstracting: (p_15_1<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.abstracting: (p_11_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (r_23_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)

EG iterations: 0
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.160sec

checking: [AG [[EF [r_7_2<=1] & 1<=p_6_0]] | EG [[A [[~ [1<=p_23_2] | A [p_15_1<=0 U 1<=r_36_2]] U A [[1<=p_48_2 | p_5_1<=p_36_0] U ~ [r_21_2<=0]]] & [~ [EG [AF [r_30_0<=r_26_2]]] | r_8_2<=0]]]]
normalized: [EG [[[~ [EG [~ [EG [~ [r_30_0<=r_26_2]]]]] | r_8_2<=0] & [~ [EG [~ [[~ [EG [r_21_2<=0]] & ~ [E [r_21_2<=0 U [~ [[1<=p_48_2 | p_5_1<=p_36_0]] & r_21_2<=0]]]]]]] & ~ [E [~ [[~ [EG [r_21_2<=0]] & ~ [E [r_21_2<=0 U [~ [[1<=p_48_2 | p_5_1<=p_36_0]] & r_21_2<=0]]]]] U [~ [[[~ [EG [~ [1<=r_36_2]]] & ~ [E [~ [1<=r_36_2] U [~ [p_15_1<=0] & ~ [1<=r_36_2]]]]] | ~ [1<=p_23_2]]] & ~ [[~ [EG [r_21_2<=0]] & ~ [E [r_21_2<=0 U [~ [[1<=p_48_2 | p_5_1<=p_36_0]] & r_21_2<=0]]]]]]]]]]] | ~ [E [true U ~ [[E [true U r_7_2<=1] & 1<=p_6_0]]]]]

abstracting: (1<=p_6_0)
states: 19,029,262,263,322,728,965,368,446,976 (28)
abstracting: (r_7_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (r_21_2<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (p_5_1<=p_36_0)
states: 41,270,348,300,635,844,586,107,830,272 (28)
abstracting: (1<=p_48_2)
states: 3,818,370,801,320,606,588,343,418,880 (27)
abstracting: (r_21_2<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (r_21_2<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
...........................................................................
EG iterations: 75
abstracting: (1<=p_23_2)
states: 18,902,547,651,157,204,466,231,410,688 (28)
abstracting: (1<=r_36_2)
states: 23,429,414,352,460,118,335,309,217,792 (28)
abstracting: (p_15_1<=0)
states: 36,199,961,117,825,197,001,525,952,512 (28)
abstracting: (1<=r_36_2)
states: 23,429,414,352,460,118,335,309,217,792 (28)
abstracting: (1<=r_36_2)
states: 23,429,414,352,460,118,335,309,217,792 (28)
............................................................................
EG iterations: 76
abstracting: (r_21_2<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (p_5_1<=p_36_0)
states: 41,270,348,300,635,844,586,107,830,272 (28)
abstracting: (1<=p_48_2)
states: 3,818,370,801,320,606,588,343,418,880 (27)
abstracting: (r_21_2<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (r_21_2<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
...........................................................................
EG iterations: 75
abstracting: (r_21_2<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (p_5_1<=p_36_0)
states: 41,270,348,300,635,844,586,107,830,272 (28)
abstracting: (1<=p_48_2)
states: 3,818,370,801,320,606,588,343,418,880 (27)
abstracting: (r_21_2<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (r_21_2<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
...........................................................................
EG iterations: 75
...................
before gc: list nodes free: 658912

after gc: idd nodes used:147481, unused:63852519; list nodes free:288727187
.....................................................
EG iterations: 72
abstracting: (r_8_2<=0)
states: 25,307,157,979,480,481,730,599,583,744 (28)
abstracting: (r_30_0<=r_26_2)
states: 36,542,561,654,307,142,620,460,089,344 (28)
..............................................................................
EG iterations: 78
.
EG iterations: 1
...............................................................................
EG iterations: 79
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m56.647sec

checking: ~ [E [[[~ [AX [E [p_4_0<=p_43_0 U 1<=r_28_2]]] | r_7_2<=0] & 1<=r_23_2] U A [[p_49_2<=1 | [AF [1<=r_4_2] | [~ [r_40_1<=r_11_2] & EF [p_4_2<=r_24_2]]]] U EX [~ [[p_31_2<=1 | r_28_1<=1]]]]]]
normalized: ~ [E [[[EX [~ [E [p_4_0<=p_43_0 U 1<=r_28_2]]] | r_7_2<=0] & 1<=r_23_2] U [~ [EG [~ [EX [~ [[p_31_2<=1 | r_28_1<=1]]]]]] & ~ [E [~ [EX [~ [[p_31_2<=1 | r_28_1<=1]]]] U [~ [[[[E [true U p_4_2<=r_24_2] & ~ [r_40_1<=r_11_2]] | ~ [EG [~ [1<=r_4_2]]]] | p_49_2<=1]] & ~ [EX [~ [[p_31_2<=1 | r_28_1<=1]]]]]]]]]]

abstracting: (r_28_1<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_31_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.abstracting: (p_49_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (1<=r_4_2)
states: 23,179,277,376,933,238,857,351,036,928 (28)
.......................
before gc: list nodes free: 540600

after gc: idd nodes used:172593, unused:63827407; list nodes free:288610057
.....................................................
EG iterations: 76
abstracting: (r_40_1<=r_11_2)
states: 36,440,252,308,450,469,210,031,652,864 (28)
abstracting: (p_4_2<=r_24_2)
states: 45,144,744,253,424,034,601,605,529,600 (28)
abstracting: (r_28_1<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_31_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.abstracting: (r_28_1<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_31_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.
EG iterations: 0
abstracting: (1<=r_23_2)
states: 23,430,742,036,977,445,083,478,491,136 (28)
abstracting: (r_7_2<=0)
states: 25,257,043,897,197,178,378,581,442,560 (28)
abstracting: (1<=r_28_2)
states: 23,430,730,421,637,462,927,083,569,152 (28)
abstracting: (p_4_0<=p_43_0)
states: 31,981,548,758,856,123,088,573,038,592 (28)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.585sec

checking: AF [[r_33_1<=0 & [[A [[~ [r_28_0<=r_38_2] | [1<=p_3_2 & p_40_1<=1]] U ~ [[p_20_2<=0 & p_21_0<=1]]] | AF [EG [p_7_1<=0]]] & EX [[[~ [1<=p_20_2] | ~ [1<=p_45_0]] | [r_28_0<=r_21_2 & [r_28_0<=r_45_2 | r_8_2<=0]]]]]]]
normalized: ~ [EG [~ [[[EX [[[[r_28_0<=r_45_2 | r_8_2<=0] & r_28_0<=r_21_2] | [~ [1<=p_45_0] | ~ [1<=p_20_2]]]] & [~ [EG [~ [EG [p_7_1<=0]]]] | [~ [EG [[p_20_2<=0 & p_21_0<=1]]] & ~ [E [[p_20_2<=0 & p_21_0<=1] U [~ [[[1<=p_3_2 & p_40_1<=1] | ~ [r_28_0<=r_38_2]]] & [p_20_2<=0 & p_21_0<=1]]]]]]] & r_33_1<=0]]]]

abstracting: (r_33_1<=0)
states: 25,036,271,809,538,719,998,728,470,528 (28)
abstracting: (p_21_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_20_2<=0)
states: 42,333,266,296,911,926,253,833,945,088 (28)
abstracting: (r_28_0<=r_38_2)
states: 36,551,222,626,480,568,591,452,209,152 (28)
abstracting: (p_40_1<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (1<=p_3_2)
states: 17,996,558,192,222,903,448,587,206,656 (28)
abstracting: (p_21_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_20_2<=0)
states: 42,333,266,296,911,926,253,833,945,088 (28)
abstracting: (p_21_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_20_2<=0)
states: 42,333,266,296,911,926,253,833,945,088 (28)
.
EG iterations: 1
abstracting: (p_7_1<=0)
states: 36,301,000,963,694,155,347,687,112,704 (28)
.........................................................................
EG iterations: 73
.
EG iterations: 1
abstracting: (1<=p_20_2)
states: 6,384,271,711,212,458,170,090,782,720 (27)
abstracting: (1<=p_45_0)
states: 6,883,331,793,171,245,379,245,572,096 (27)
abstracting: (r_28_0<=r_21_2)
states: 36,566,752,174,411,740,148,012,154,880 (28)
abstracting: (r_8_2<=0)
states: 25,307,157,979,480,481,730,599,583,744 (28)
abstracting: (r_28_0<=r_45_2)
states: 36,753,976,432,513,429,610,050,879,488 (28)
...........................................................................
EG iterations: 74
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.574sec

checking: AG [[AG [A [EF [r_2_1<=r_11_1] U [[1<=p_17_1 | 1<=p_43_1] | A [p_23_2<=1 U p_9_0<=r_44_2]]]] & EF [[[EF [p_11_0<=p_46_2] | E [p_14_2<=0 U p_12_0<=r_1_1]] | [r_26_1<=r_10_2 | ~ [[p_45_2<=1 | p_18_0<=p_28_0]]]]]]]
normalized: ~ [E [true U ~ [[E [true U [[r_26_1<=r_10_2 | ~ [[p_45_2<=1 | p_18_0<=p_28_0]]] | [E [p_14_2<=0 U p_12_0<=r_1_1] | E [true U p_11_0<=p_46_2]]]] & ~ [E [true U ~ [[~ [EG [~ [[[~ [EG [~ [p_9_0<=r_44_2]]] & ~ [E [~ [p_9_0<=r_44_2] U [~ [p_23_2<=1] & ~ [p_9_0<=r_44_2]]]]] | [1<=p_17_1 | 1<=p_43_1]]]]] & ~ [E [~ [[[~ [EG [~ [p_9_0<=r_44_2]]] & ~ [E [~ [p_9_0<=r_44_2] U [~ [p_23_2<=1] & ~ [p_9_0<=r_44_2]]]]] | [1<=p_17_1 | 1<=p_43_1]]] U [~ [E [true U r_2_1<=r_11_1]] & ~ [[[~ [EG [~ [p_9_0<=r_44_2]]] & ~ [E [~ [p_9_0<=r_44_2] U [~ [p_23_2<=1] & ~ [p_9_0<=r_44_2]]]]] | [1<=p_17_1 | 1<=p_43_1]]]]]]]]]]]]]]

abstracting: (1<=p_43_1)
states: 12,706,370,574,551,152,760,734,089,216 (28)
abstracting: (1<=p_17_1)
states: 12,518,092,120,215,958,063,304,146,944 (28)
abstracting: (p_9_0<=r_44_2)
states: 45,392,953,942,067,109,752,997,937,152 (28)
abstracting: (p_23_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_9_0<=r_44_2)
states: 45,392,953,942,067,109,752,997,937,152 (28)
abstracting: (p_9_0<=r_44_2)
states: 45,392,953,942,067,109,752,997,937,152 (28)
.............................................................................
EG iterations: 77
abstracting: (r_2_1<=r_11_1)
states: 37,044,847,570,936,676,144,054,796,288 (28)
abstracting: (1<=p_43_1)
states: 12,706,370,574,551,152,760,734,089,216 (28)
abstracting: (1<=p_17_1)
states: 12,518,092,120,215,958,063,304,146,944 (28)
abstracting: (p_9_0<=r_44_2)
states: 45,392,953,942,067,109,752,997,937,152 (28)
abstracting: (p_23_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_9_0<=r_44_2)
states: 45,392,953,942,067,109,752,997,937,152 (28)
abstracting: (p_9_0<=r_44_2)
states: 45,392,953,942,067,109,752,997,937,152 (28)
.............................................................................
EG iterations: 77
abstracting: (1<=p_43_1)
states: 12,706,370,574,551,152,760,734,089,216 (28)
abstracting: (1<=p_17_1)
states: 12,518,092,120,215,958,063,304,146,944 (28)
abstracting: (p_9_0<=r_44_2)
states: 45,392,953,942,067,109,752,997,937,152 (28)
abstracting: (p_23_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_9_0<=r_44_2)
states: 45,392,953,942,067,109,752,997,937,152 (28)
abstracting: (p_9_0<=r_44_2)
states: 45,392,953,942,067,109,752,997,937,152 (28)
.............................................................................
EG iterations: 77
...............
before gc: list nodes free: 532027

after gc: idd nodes used:223429, unused:63776571; list nodes free:288395241
.............................................................
EG iterations: 76
abstracting: (p_11_0<=p_46_2)
states: 43,066,274,266,310,154,918,538,772,480 (28)
abstracting: (p_12_0<=r_1_1)
states: 39,744,935,754,621,683,105,615,839,232 (28)
abstracting: (p_14_2<=0)
states: 42,332,295,924,722,554,534,851,772,416 (28)
abstracting: (p_18_0<=p_28_0)
states: 37,153,786,104,569,221,326,005,338,112 (28)
abstracting: (p_45_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (r_26_1<=r_10_2)
states: 36,423,048,167,992,530,702,929,231,872 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m40.308sec

checking: EG [[[AX [[EF [r_45_1<=r_16_1] | EF [p_44_1<=r_32_1]]] & E [[[p_48_1<=r_32_2 | A [1<=p_34_0 U p_7_2<=p_42_0]] & E [r_0_0<=0 U r_13_0<=r_11_1]] U EG [p_0_0<=p_47_1]]] | ~ [[[[~ [r_15_2<=1] & ~ [p_7_1<=p_45_2]] | EX [1<=p_40_0]] | p_27_0<=p_43_1]]]]
normalized: EG [[~ [[[EX [1<=p_40_0] | [~ [r_15_2<=1] & ~ [p_7_1<=p_45_2]]] | p_27_0<=p_43_1]] | [E [[[[~ [EG [~ [p_7_2<=p_42_0]]] & ~ [E [~ [p_7_2<=p_42_0] U [~ [1<=p_34_0] & ~ [p_7_2<=p_42_0]]]]] | p_48_1<=r_32_2] & E [r_0_0<=0 U r_13_0<=r_11_1]] U EG [p_0_0<=p_47_1]] & ~ [EX [~ [[E [true U p_44_1<=r_32_1] | E [true U r_45_1<=r_16_1]]]]]]]]

abstracting: (r_45_1<=r_16_1)
states: 36,258,771,311,462,585,566,872,207,360 (28)
abstracting: (p_44_1<=r_32_1)
states: 42,466,597,738,085,895,644,272,132,096 (28)
.abstracting: (p_0_0<=p_47_1)
states: 33,030,326,644,264,884,628,877,213,696 (28)
............................................................................
EG iterations: 76
abstracting: (r_13_0<=r_11_1)
states: 36,308,831,512,284,778,258,516,410,368 (28)
abstracting: (r_0_0<=0)
states: 26,267,954,404,722,495,506,134,073,344 (28)
abstracting: (p_48_1<=r_32_2)
states: 44,339,010,222,583,055,314,111,692,800 (28)
abstracting: (p_7_2<=p_42_0)
states: 37,165,112,429,452,707,092,745,945,088 (28)
abstracting: (1<=p_34_0)
states: 18,902,053,313,150,653,501,240,508,416 (28)
abstracting: (p_7_2<=p_42_0)
states: 37,165,112,429,452,707,092,745,945,088 (28)
abstracting: (p_7_2<=p_42_0)
states: 37,165,112,429,452,707,092,745,945,088 (28)
.................................................................................
EG iterations: 81
abstracting: (p_27_0<=p_43_1)
states: 43,998,584,510,117,139,598,198,964,224 (28)
abstracting: (p_7_1<=p_45_2)
states: 41,226,172,953,629,586,598,639,173,632 (28)
abstracting: (r_15_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (1<=p_40_0)
states: 18,882,229,919,897,076,525,938,245,632 (28)
....
before gc: list nodes free: 666610

after gc: idd nodes used:155172, unused:63844828; list nodes free:288699490
...........................................
before gc: list nodes free: 453565

after gc: idd nodes used:646471, unused:63353529; list nodes free:286486234
..........................
EG iterations: 72
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m42.341sec

checking: EG [E [[[[~ [E [1<=p_47_0 U 1<=r_24_2]] | [E [r_42_0<=r_29_1 U p_27_0<=1] & p_13_0<=p_4_1]] | [[A [r_20_0<=1 U 1<=r_41_2] & [r_30_0<=r_0_0 | 1<=p_20_2]] & ~ [E [p_1_0<=p_39_1 U 1<=r_10_1]]]] | AG [EF [1<=r_44_1]]] U ~ [E [AF [1<=r_25_1] U [A [1<=p_25_1 U p_42_2<=1] | [r_42_2<=p_20_0 | 1<=r_22_2]]]]]]
normalized: EG [E [[~ [E [true U ~ [E [true U 1<=r_44_1]]]] | [[~ [E [p_1_0<=p_39_1 U 1<=r_10_1]] & [[r_30_0<=r_0_0 | 1<=p_20_2] & [~ [EG [~ [1<=r_41_2]]] & ~ [E [~ [1<=r_41_2] U [~ [r_20_0<=1] & ~ [1<=r_41_2]]]]]]] | [[p_13_0<=p_4_1 & E [r_42_0<=r_29_1 U p_27_0<=1]] | ~ [E [1<=p_47_0 U 1<=r_24_2]]]]] U ~ [E [~ [EG [~ [1<=r_25_1]]] U [[r_42_2<=p_20_0 | 1<=r_22_2] | [~ [EG [~ [p_42_2<=1]]] & ~ [E [~ [p_42_2<=1] U [~ [1<=p_25_1] & ~ [p_42_2<=1]]]]]]]]]]

abstracting: (p_42_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (1<=p_25_1)
states: 12,518,304,567,628,894,998,280,273,920 (28)
abstracting: (p_42_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_42_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.
EG iterations: 1
abstracting: (1<=r_22_2)
states: 23,430,736,208,091,384,941,178,257,408 (28)
abstracting: (r_42_2<=p_20_0)
states: 34,409,993,092,910,718,412,918,882,304 (28)
abstracting: (1<=r_25_1)
states: 23,680,934,537,846,386,532,485,693,440 (28)
.
EG iterations: 1
abstracting: (1<=r_24_2)
states: 23,430,738,159,002,948,847,129,329,664 (28)
abstracting: (1<=p_47_0)
states: 8,235,292,193,349,504,453,329,289,216 (27)
abstracting: (p_27_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (r_42_0<=r_29_1)
states: 36,712,939,658,333,994,415,621,668,864 (28)
abstracting: (p_13_0<=p_4_1)
states: 44,045,759,169,177,458,686,809,866,240 (28)
abstracting: (1<=r_41_2)
states: 23,467,903,882,101,572,486,756,827,136 (28)
abstracting: (r_20_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (1<=r_41_2)
states: 23,467,903,882,101,572,486,756,827,136 (28)
abstracting: (1<=r_41_2)
states: 23,467,903,882,101,572,486,756,827,136 (28)
...........................................................................
EG iterations: 75
abstracting: (1<=p_20_2)
states: 6,384,271,711,212,458,170,090,782,720 (27)
abstracting: (r_30_0<=r_0_0)
states: 36,083,966,388,453,100,600,321,638,400 (28)
abstracting: (1<=r_10_1)
states: 23,673,592,271,656,633,446,028,017,664 (28)
abstracting: (p_1_0<=p_39_1)
states: 45,881,572,503,095,041,470,834,409,472 (28)
abstracting: (1<=r_44_1)
states: 23,388,566,475,975,928,476,495,511,552 (28)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.360sec

checking: [E [E [E [EG [r_10_0<=r_13_0] U [~ [r_43_0<=p_48_0] & [p_45_1<=0 | r_3_2<=0]]] U 1<=r_41_0] U [~ [AF [AX [p_24_1<=p_16_0]]] & ~ [[[[1<=p_49_2 & EF [r_20_1<=r_39_2]] & [r_12_0<=r_28_0 | ~ [1<=r_13_1]]] | [A [r_17_1<=p_38_1 U p_29_0<=1] & EF [p_46_2<=r_35_0]]]]]] | ~ [AF [[E [r_49_1<=r_4_1 U ~ [[r_28_2<=1 | p_26_1<=r_48_0]]] | AF [~ [[p_3_2<=0 | 1<=r_3_2]]]]]]]
normalized: [EG [~ [[~ [EG [[p_3_2<=0 | 1<=r_3_2]]] | E [r_49_1<=r_4_1 U ~ [[r_28_2<=1 | p_26_1<=r_48_0]]]]]] | E [E [E [EG [r_10_0<=r_13_0] U [[p_45_1<=0 | r_3_2<=0] & ~ [r_43_0<=p_48_0]]] U 1<=r_41_0] U [~ [[[E [true U p_46_2<=r_35_0] & [~ [EG [~ [p_29_0<=1]]] & ~ [E [~ [p_29_0<=1] U [~ [r_17_1<=p_38_1] & ~ [p_29_0<=1]]]]]] | [[r_12_0<=r_28_0 | ~ [1<=r_13_1]] & [1<=p_49_2 & E [true U r_20_1<=r_39_2]]]]] & EG [EX [~ [p_24_1<=p_16_0]]]]]]

abstracting: (p_24_1<=p_16_0)
states: 41,079,391,052,664,864,988,150,628,352 (28)
...........................................................................
EG iterations: 74
abstracting: (r_20_1<=r_39_2)
states: 36,431,272,207,080,420,210,726,928,384 (28)
abstracting: (1<=p_49_2)
states: 22,449,583,603,401,888,917,790,654,464 (28)
abstracting: (1<=r_13_1)
states: 23,682,082,968,374,647,969,948,893,184 (28)
abstracting: (r_12_0<=r_28_0)
states: 36,556,466,913,168,281,210,145,734,656 (28)
abstracting: (p_29_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (r_17_1<=p_38_1)
states: 31,117,323,524,926,692,575,429,001,216 (28)
abstracting: (p_29_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p_29_0<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.
EG iterations: 1
abstracting: (p_46_2<=r_35_0)
states: 45,834,801,481,216,838,337,233,420,288 (28)
abstracting: (1<=r_41_0)
states: 23,460,494,110,927,206,045,343,285,248 (28)
abstracting: (r_43_0<=p_48_0)
states: 32,416,222,235,100,846,242,958,147,584 (28)
abstracting: (r_3_2<=0)
states: 24,879,889,985,394,148,827,832,778,752 (28)
abstracting: (p_45_1<=0)
states: 35,556,538,238,795,240,103,374,487,552 (28)
abstracting: (r_10_0<=r_13_0)
states: 36,842,719,025,596,724,280,127,651,840 (28)
..............
before gc: list nodes free: 310369

after gc: idd nodes used:183791, unused:63816209; list nodes free:288564913
............................................................
EG iterations: 74
abstracting: (p_26_1<=r_48_0)
states: 41,167,727,470,361,749,419,903,156,224 (28)
abstracting: (r_28_2<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (r_49_1<=r_4_1)
states: 33,363,788,013,598,951,404,524,797,952 (28)
abstracting: (1<=r_3_2)
states: 23,837,648,022,730,235,596,091,949,056 (28)
abstracting: (p_3_2<=0)
states: 30,720,979,815,901,480,975,337,521,152 (28)
..............................................................................
EG iterations: 78
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31.870sec

totally nodes used: 474486121 (4.7e+08)
number of garbage collections: 7
fire ops cache: hits/miss/sum: 152010067 518579802 670589869
used/not used/entry size/cache size: 38517938 28590926 16 1024MB
basic ops cache: hits/miss/sum: 15814668 49119704 64934372
used/not used/entry size/cache size: 3076303 13700913 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: 24016 140201 164217
used/not used/entry size/cache size: 8556 8380052 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 45318651
1 16618249
2 4153643
3 851869
4 143454
5 20319
6 2400
7 252
8 25
9 2
>= 10 0

Total processing time: 5m41.423sec


BK_STOP 1678941209108

--------------------
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:1526 (7), effective:300 (1)

initing FirstDep: 0m 0.000sec


iterations count:485 (2), effective:43 (0)

iterations count:211 (1), effective:2 (0)

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

iterations count:255 (1), effective:9 (0)

iterations count:2120 (10), effective:336 (1)

iterations count:228 (1), effective:4 (0)

iterations count:274 (1), effective:13 (0)

iterations count:228 (1), effective:4 (0)

iterations count:274 (1), effective:13 (0)

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

iterations count:228 (1), effective:4 (0)

iterations count:274 (1), effective:13 (0)

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

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

iterations count:227 (1), effective:4 (0)

iterations count:227 (1), effective:4 (0)

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

iterations count:227 (1), effective:4 (0)

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

iterations count:210 (1), effective:2 (0)

iterations count:400 (2), effective:31 (0)

iterations count:462 (2), effective:40 (0)

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

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

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

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

iterations count:282 (1), effective:12 (0)

iterations count:254 (1), effective:8 (0)

iterations count:282 (1), effective:12 (0)

iterations count:400 (2), effective:31 (0)

iterations count:282 (1), effective:12 (0)

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

iterations count:228 (1), effective:4 (0)

iterations count:230 (1), effective:5 (0)

iterations count:285 (1), effective:14 (0)

iterations count:409 (2), effective:35 (0)

iterations count:525 (2), effective:48 (0)

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

iterations count:249 (1), effective:7 (0)

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

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

iterations count:291 (1), effective:14 (0)

iterations count:245 (1), effective:6 (0)

iterations count:256 (1), effective:9 (0)

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

iterations count:261 (1), effective:11 (0)

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

iterations count:228 (1), effective:4 (0)

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

iterations count:230 (1), effective:4 (0)

iterations count:230 (1), effective:4 (0)

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

iterations count:289 (1), effective:14 (0)

iterations count:235 (1), effective:5 (0)

iterations count:260 (1), effective:9 (0)

iterations count:227 (1), effective:4 (0)

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="ResAllocation-PT-R003C050"
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 ResAllocation-PT-R003C050, 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 r321-tall-167889192500713"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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