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

About the Execution of Marcie for PermAdmissibility-PT-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8903.884 397830.00 398009.00 60.60 FFTFTFFTFTTFTTTF 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.r257-smll-167863532800505.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 PermAdmissibility-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532800505
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 01:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 150K Feb 26 01:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 550K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 484K 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 PermAdmissibility-PT-01-CTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678881480268

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=PermAdmissibility-PT-01
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: PermAdmissibility_PT_01
(NrP: 168 NrTr: 592 NrArc: 3456)

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

net check time: 0m 0.001sec

init dd package: 0m 3.889sec


RS generation: 0m20.795sec


-> reachability set: #nodes 57487 (5.7e+04) #states 52,537 (4)



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

checking: EF [1<=out1_0]
normalized: E [true U 1<=out1_0]

abstracting: (1<=out1_0)
states: 5,840 (3)
-> the formula is TRUE

FORMULA PermAdmissibility-PT-01-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.982sec

checking: E [aux6_5<=0 U EX [~ [EG [~ [EG [c17<=1]]]]]]
normalized: E [aux6_5<=0 U EX [~ [EG [~ [EG [c17<=1]]]]]]

abstracting: (c17<=1)
states: 52,537 (4)

EG iterations: 0
.
EG iterations: 1
.abstracting: (aux6_5<=0)
states: 52,391 (4)
-> the formula is TRUE

FORMULA PermAdmissibility-PT-01-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.872sec

checking: AF [AG [EF [~ [EX [sum(in2_3, in2_2)<=c13]]]]]
normalized: ~ [EG [E [true U ~ [E [true U ~ [EX [sum(in2_3, in2_2)<=c13]]]]]]]

abstracting: (sum(in2_3, in2_2)<=c13)
states: 52,512 (4)
..
EG iterations: 1
-> the formula is TRUE

FORMULA PermAdmissibility-PT-01-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m43.965sec

checking: EX [A [out8_1<=aux9_2 U ~ [EG [[1<=aux11_1 | AF [out7_1<=aux5_4]]]]]]
normalized: EX [[~ [EG [EG [[1<=aux11_1 | ~ [EG [~ [out7_1<=aux5_4]]]]]]] & ~ [E [EG [[1<=aux11_1 | ~ [EG [~ [out7_1<=aux5_4]]]]] U [~ [out8_1<=aux9_2] & EG [[1<=aux11_1 | ~ [EG [~ [out7_1<=aux5_4]]]]]]]]]]

abstracting: (out7_1<=aux5_4)
states: 50,201 (4)
.
EG iterations: 1
abstracting: (1<=aux11_1)
states: 240
..
EG iterations: 2
abstracting: (out8_1<=aux9_2)
states: 50,201 (4)
abstracting: (out7_1<=aux5_4)
states: 50,201 (4)
.
EG iterations: 1
abstracting: (1<=aux11_1)
states: 240
..
EG iterations: 2
abstracting: (out7_1<=aux5_4)
states: 50,201 (4)
.
EG iterations: 1
abstracting: (1<=aux11_1)
states: 240
..
EG iterations: 2
.
EG iterations: 1
.-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.781sec

checking: ~ [EX [~ [AX [[[~ [aux13_2<=0] | EF [1<=aux15_1]] & [[out3_6<=0 | out4_6<=1] & aux9_1<=aux12_0]]]]]]
normalized: ~ [EX [EX [~ [[[E [true U 1<=aux15_1] | ~ [aux13_2<=0]] & [aux9_1<=aux12_0 & [out3_6<=0 | out4_6<=1]]]]]]]

abstracting: (out4_6<=1)
states: 52,537 (4)
abstracting: (out3_6<=0)
states: 47,281 (4)
abstracting: (aux9_1<=aux12_0)
states: 52,353 (4)
abstracting: (aux13_2<=0)
states: 50,669 (4)
abstracting: (1<=aux15_1)
states: 1,460 (3)
..-> the formula is TRUE

FORMULA PermAdmissibility-PT-01-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.570sec

checking: [~ [EX [~ [A [EG [1<=aux6_0] U EX [out3_4<=0]]]]] & AF [EG [[A [[aux9_2<=0 | out1_4<=1] U out4_0<=aux14_0] & 1<=aux14_1]]]]
normalized: [~ [EG [~ [EG [[1<=aux14_1 & [~ [EG [~ [out4_0<=aux14_0]]] & ~ [E [~ [out4_0<=aux14_0] U [~ [[aux9_2<=0 | out1_4<=1]] & ~ [out4_0<=aux14_0]]]]]]]]]] & ~ [EX [~ [[~ [EG [~ [EX [out3_4<=0]]]] & ~ [E [~ [EX [out3_4<=0]] U [~ [EG [1<=aux6_0]] & ~ [EX [out3_4<=0]]]]]]]]]]

abstracting: (out3_4<=0)
states: 47,281 (4)
.abstracting: (1<=aux6_0)
states: 146
.......
EG iterations: 7
abstracting: (out3_4<=0)
states: 47,281 (4)
.abstracting: (out3_4<=0)
states: 47,281 (4)
..
EG iterations: 1
.abstracting: (out4_0<=aux14_0)
states: 47,281 (4)
abstracting: (out1_4<=1)
states: 52,537 (4)
abstracting: (aux9_2<=0)
states: 52,265 (4)
abstracting: (out4_0<=aux14_0)
states: 47,281 (4)
abstracting: (out4_0<=aux14_0)
states: 47,281 (4)
.
EG iterations: 1
abstracting: (1<=aux14_1)
states: 5,732 (3)
.......
EG iterations: 7

EG iterations: 0
-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.312sec

checking: EX [AF [[~ [out2_4<=1] & [[A [out5_4<=aux14_1 U 1<=aux9_5] | AG [1<=out1_6]] & A [E [1<=c12 U 1<=out5_0] U EF [aux9_3<=aux11_2]]]]]]
normalized: EX [~ [EG [~ [[[[~ [EG [~ [E [true U aux9_3<=aux11_2]]]] & ~ [E [~ [E [true U aux9_3<=aux11_2]] U [~ [E [1<=c12 U 1<=out5_0]] & ~ [E [true U aux9_3<=aux11_2]]]]]] & [~ [E [true U ~ [1<=out1_6]]] | [~ [EG [~ [1<=aux9_5]]] & ~ [E [~ [1<=aux9_5] U [~ [out5_4<=aux14_1] & ~ [1<=aux9_5]]]]]]] & ~ [out2_4<=1]]]]]]

abstracting: (out2_4<=1)
states: 52,537 (4)
abstracting: (1<=aux9_5)
states: 272
abstracting: (out5_4<=aux14_1)
states: 48,265 (4)
abstracting: (1<=aux9_5)
states: 272
abstracting: (1<=aux9_5)
states: 272
.
EG iterations: 1
abstracting: (1<=out1_6)
states: 5,840 (3)
abstracting: (aux9_3<=aux11_2)
states: 52,353 (4)
abstracting: (1<=out5_0)
states: 4,672 (3)
abstracting: (1<=c12)
states: 256
abstracting: (aux9_3<=aux11_2)
states: 52,353 (4)
abstracting: (aux9_3<=aux11_2)
states: 52,353 (4)
.
EG iterations: 1

EG iterations: 0
.-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.731sec

checking: AF [[EG [EX [E [1<=c9 U aux10_3<=1]]] | E [[AF [A [1<=c15 U c110<=c18]] | [[1<=out2_2 & AG [aux12_6<=0]] | out1_7<=1]] U A [EG [1<=out1_6] U AG [c5<=1]]]]]
normalized: ~ [EG [~ [[E [[[out1_7<=1 | [1<=out2_2 & ~ [E [true U ~ [aux12_6<=0]]]]] | ~ [EG [~ [[~ [EG [~ [c110<=c18]]] & ~ [E [~ [c110<=c18] U [~ [1<=c15] & ~ [c110<=c18]]]]]]]]] U [~ [EG [E [true U ~ [c5<=1]]]] & ~ [E [E [true U ~ [c5<=1]] U [~ [EG [1<=out1_6]] & E [true U ~ [c5<=1]]]]]]] | EG [EX [E [1<=c9 U aux10_3<=1]]]]]]]

abstracting: (aux10_3<=1)
states: 52,537 (4)
abstracting: (1<=c9)
states: 16
..................
EG iterations: 17
abstracting: (c5<=1)
states: 52,537 (4)
abstracting: (1<=out1_6)
states: 5,840 (3)
.
EG iterations: 1
abstracting: (c5<=1)
states: 52,537 (4)
abstracting: (c5<=1)
states: 52,537 (4)
.
EG iterations: 1
abstracting: (c110<=c18)
states: 52,473 (4)
abstracting: (1<=c15)
states: 736
abstracting: (c110<=c18)
states: 52,473 (4)
abstracting: (c110<=c18)
states: 52,473 (4)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (aux12_6<=0)
states: 51,773 (4)
abstracting: (1<=out2_2)
states: 5,840 (3)
abstracting: (out1_7<=1)
states: 52,537 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA PermAdmissibility-PT-01-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.165sec

checking: ~ [AG [EX [EG [[sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)<=60 | AG [sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=c110]]]]]]
normalized: E [true U ~ [EX [EG [[sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)<=60 | ~ [E [true U ~ [sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=c110]]]]]]]]

abstracting: (sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=c110)
states: 33,849 (4)
abstracting: (sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)<=60)
states: 52,537 (4)

EG iterations: 0
.-> the formula is TRUE

FORMULA PermAdmissibility-PT-01-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 6.929sec

checking: AF [[AG [c20<=86] & [E [EX [~ [56<=c11]] U [sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)<=c110 | AX [c15<=34]]] & EG [AG [~ [26<=sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)]]]]]]
normalized: ~ [EG [~ [[[EG [~ [E [true U 26<=sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)]]] & E [EX [~ [56<=c11]] U [sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)<=c110 | ~ [EX [~ [c15<=34]]]]]] & ~ [E [true U ~ [c20<=86]]]]]]]

abstracting: (c20<=86)
states: 52,537 (4)
abstracting: (c15<=34)
states: 52,537 (4)
.abstracting: (sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)<=c110)
states: 15,161 (4)
abstracting: (56<=c11)
states: 0
.abstracting: (26<=sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0))
states: 0

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

FORMULA PermAdmissibility-PT-01-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.517sec

checking: EG [[[E [~ [EX [out2_0<=out5_0]] U ~ [A [c12<=1 U aux5_0<=aux12_0]]] & [EF [[AF [1<=aux9_6] & AG [1<=aux9_3]]] & [EF [aux12_3<=out5_3] | ~ [AX [1<=out2_5]]]]] | [[~ [AX [~ [out1_0<=out8_3]]] | EG [~ [[1<=c110 | out7_6<=aux10_7]]]] | [A [1<=aux14_0 U EF [aux10_5<=out2_2]] | [~ [[[aux12_4<=c11 & 1<=out2_3] | [1<=aux13_5 & out5_0<=aux15_1]]] & 1<=c110]]]]]
normalized: EG [[[[[1<=c110 & ~ [[[1<=aux13_5 & out5_0<=aux15_1] | [aux12_4<=c11 & 1<=out2_3]]]] | [~ [EG [~ [E [true U aux10_5<=out2_2]]]] & ~ [E [~ [E [true U aux10_5<=out2_2]] U [~ [1<=aux14_0] & ~ [E [true U aux10_5<=out2_2]]]]]]] | [EG [~ [[1<=c110 | out7_6<=aux10_7]]] | EX [out1_0<=out8_3]]] | [[[EX [~ [1<=out2_5]] | E [true U aux12_3<=out5_3]] & E [true U [~ [E [true U ~ [1<=aux9_3]]] & ~ [EG [~ [1<=aux9_6]]]]]] & E [~ [EX [out2_0<=out5_0]] U ~ [[~ [EG [~ [aux5_0<=aux12_0]]] & ~ [E [~ [aux5_0<=aux12_0] U [~ [c12<=1] & ~ [aux5_0<=aux12_0]]]]]]]]]]

abstracting: (aux5_0<=aux12_0)
states: 52,501 (4)
abstracting: (c12<=1)
states: 52,537 (4)
abstracting: (aux5_0<=aux12_0)
states: 52,501 (4)
abstracting: (aux5_0<=aux12_0)
states: 52,501 (4)
......
EG iterations: 6
abstracting: (out2_0<=out5_0)
states: 46,697 (4)
.abstracting: (1<=aux9_6)
states: 272
.
EG iterations: 1
abstracting: (1<=aux9_3)
states: 272
abstracting: (aux12_3<=out5_3)
states: 51,773 (4)
abstracting: (1<=out2_5)
states: 5,840 (3)
.abstracting: (out1_0<=out8_3)
states: 46,989 (4)
.abstracting: (out7_6<=aux10_7)
states: 50,201 (4)
abstracting: (1<=c110)
states: 64
.
EG iterations: 1
abstracting: (aux10_5<=out2_2)
states: 51,693 (4)
abstracting: (1<=aux14_0)
states: 5,732 (3)
abstracting: (aux10_5<=out2_2)
states: 51,693 (4)
abstracting: (aux10_5<=out2_2)
states: 51,693 (4)
.
EG iterations: 1
abstracting: (1<=out2_3)
states: 5,840 (3)
abstracting: (aux12_4<=c11)
states: 51,773 (4)
abstracting: (out5_0<=aux15_1)
states: 47,865 (4)
abstracting: (1<=aux13_5)
states: 1,868 (3)
abstracting: (1<=c110)
states: 64

EG iterations: 0
-> the formula is TRUE

FORMULA PermAdmissibility-PT-01-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.418sec

checking: EG [[[[45<=c14 | AF [~ [86<=sum(in2_3, in2_2)]]] & AX [c18<=c9]] | ~ [[EX [AF [sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(in2_3, in2_2)]] & E [E [75<=sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0) U c110<=2] U AG [c12<=sum(aux7_2, aux7_3, aux7_6, aux7_7)]]]]]]
normalized: EG [[~ [[E [E [75<=sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0) U c110<=2] U ~ [E [true U ~ [c12<=sum(aux7_2, aux7_3, aux7_6, aux7_7)]]]] & EX [~ [EG [~ [sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(in2_3, in2_2)]]]]]] | [~ [EX [~ [c18<=c9]]] & [45<=c14 | ~ [EG [86<=sum(in2_3, in2_2)]]]]]]

abstracting: (86<=sum(in2_3, in2_2))
states: 0
.
EG iterations: 1
abstracting: (45<=c14)
states: 0
abstracting: (c18<=c9)
states: 47,865 (4)
.abstracting: (sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(in2_3, in2_2))
states: 23,337 (4)
.....
EG iterations: 5
.abstracting: (c12<=sum(aux7_2, aux7_3, aux7_6, aux7_7))
states: 52,281 (4)
abstracting: (c110<=2)
states: 52,537 (4)
abstracting: (75<=sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0))
states: 0
.............
EG iterations: 13
-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.108sec

checking: AF [[EX [[[sum(in2_3, in2_2)<=11 & [[c17<=36 & 47<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4)] & ~ [81<=c7]]] | AX [[49<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1) & c8<=35]]]] & [EX [63<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)] & EX [A [c5<=90 U EG [35<=c20]]]]]]
normalized: ~ [EG [~ [[EX [[~ [EX [~ [[49<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1) & c8<=35]]]] | [sum(in2_3, in2_2)<=11 & [~ [81<=c7] & [c17<=36 & 47<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4)]]]]] & [EX [[~ [EG [~ [EG [35<=c20]]]] & ~ [E [~ [EG [35<=c20]] U [~ [EG [35<=c20]] & ~ [c5<=90]]]]]] & EX [63<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)]]]]]]

abstracting: (63<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0))
states: 0
.abstracting: (c5<=90)
states: 52,537 (4)
abstracting: (35<=c20)
states: 0
.
EG iterations: 1
abstracting: (35<=c20)
states: 0
.
EG iterations: 1
abstracting: (35<=c20)
states: 0
.
EG iterations: 1

EG iterations: 0
.abstracting: (47<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4))
states: 0
abstracting: (c17<=36)
states: 52,537 (4)
abstracting: (81<=c7)
states: 0
abstracting: (sum(in2_3, in2_2)<=11)
states: 52,537 (4)
abstracting: (c8<=35)
states: 52,537 (4)
abstracting: (49<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1))
states: 0
..
EG iterations: 0
-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.431sec

checking: AG [A [[[c12<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0) | c19<=32] | [AG [[54<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0) | c15<=sum(aux6_4, aux6_1, aux6_5, aux6_0)]] | ~ [88<=sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5)]]] U EX [[sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0) | AF [96<=c18]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EX [[sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0) | ~ [EG [~ [96<=c18]]]]]]]] & ~ [E [~ [EX [[sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0) | ~ [EG [~ [96<=c18]]]]]] U [~ [[[~ [88<=sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5)] | ~ [E [true U ~ [[54<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0) | c15<=sum(aux6_4, aux6_1, aux6_5, aux6_0)]]]]] | [c12<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0) | c19<=32]]] & ~ [EX [[sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0) | ~ [EG [~ [96<=c18]]]]]]]]]]]]]

abstracting: (96<=c18)
states: 0

EG iterations: 0
abstracting: (sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0))
states: 42,025 (4)
.abstracting: (c19<=32)
states: 52,537 (4)
abstracting: (c12<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0))
states: 52,281 (4)
abstracting: (c15<=sum(aux6_4, aux6_1, aux6_5, aux6_0))
states: 51,801 (4)
abstracting: (54<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0))
states: 0
abstracting: (88<=sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5))
states: 0
abstracting: (96<=c18)
states: 0

EG iterations: 0
abstracting: (sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0))
states: 42,025 (4)
.abstracting: (96<=c18)
states: 0

EG iterations: 0
abstracting: (sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0))
states: 42,025 (4)
.....
EG iterations: 4
-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.645sec

checking: EF [[AG [c7<=17] & [A [[[[13<=c5 | 9<=sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)] & c8<=c19] | [~ [c7<=sum(in4_7, in4_6)] | [58<=c17 & 59<=sum(aux6_4, aux6_1, aux6_5, aux6_0)]]] U [EF [91<=c11] & [[52<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2) | 31<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)] & 45<=c7]]] & AF [E [[sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2)<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4) | 73<=c20] U AX [90<=c11]]]]]]
normalized: E [true U [[~ [EG [~ [E [[sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2)<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4) | 73<=c20] U ~ [EX [~ [90<=c11]]]]]]] & [~ [EG [~ [[[45<=c7 & [52<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2) | 31<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)]] & E [true U 91<=c11]]]]] & ~ [E [~ [[[45<=c7 & [52<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2) | 31<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)]] & E [true U 91<=c11]]] U [~ [[[[58<=c17 & 59<=sum(aux6_4, aux6_1, aux6_5, aux6_0)] | ~ [c7<=sum(in4_7, in4_6)]] | [c8<=c19 & [13<=c5 | 9<=sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)]]]] & ~ [[[45<=c7 & [52<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2) | 31<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)]] & E [true U 91<=c11]]]]]]]] & ~ [E [true U ~ [c7<=17]]]]]

abstracting: (c7<=17)
states: 52,537 (4)
abstracting: (91<=c11)
states: 0
abstracting: (31<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0))
states: 0
abstracting: (52<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2))
states: 0
abstracting: (45<=c7)
states: 0
abstracting: (9<=sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0))
states: 0
abstracting: (13<=c5)
states: 0
abstracting: (c8<=c19)
states: 52,521 (4)
abstracting: (c7<=sum(in4_7, in4_6))
states: 52,537 (4)
abstracting: (59<=sum(aux6_4, aux6_1, aux6_5, aux6_0))
states: 0
abstracting: (58<=c17)
states: 0
abstracting: (91<=c11)
states: 0
abstracting: (31<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0))
states: 0
abstracting: (52<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2))
states: 0
abstracting: (45<=c7)
states: 0
abstracting: (91<=c11)
states: 0
abstracting: (31<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0))
states: 0
abstracting: (52<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2))
states: 0
abstracting: (45<=c7)
states: 0

EG iterations: 0
abstracting: (90<=c11)
states: 0
.abstracting: (73<=c20)
states: 0
abstracting: (sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2)<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4))
states: 42,729 (4)
...............
EG iterations: 15
-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.783sec

checking: AF [[[EG [~ [[EX [sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)<=sum(in4_7, in4_6)] | [sum(aux7_2, aux7_3, aux7_6, aux7_7)<=sum(aux5_4, aux5_5, aux5_0, aux5_1) & sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1)<=44]]]] & ~ [A [36<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0) U ~ [sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0)<=80]]]] & [~ [c110<=30] | [~ [A [~ [57<=sum(in1_0, in1_1)] U A [c14<=sum(aux8_2, aux8_6, aux8_3, aux8_7) U sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)]]] | 14<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1)]]]]
normalized: ~ [EG [~ [[[~ [c110<=30] | [14<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1) | ~ [[~ [E [~ [[~ [EG [~ [sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)]]] & ~ [E [~ [sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)] U [~ [c14<=sum(aux8_2, aux8_6, aux8_3, aux8_7)] & ~ [sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)]]]]]] U [57<=sum(in1_0, in1_1) & ~ [[~ [EG [~ [sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)]]] & ~ [E [~ [sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)] U [~ [c14<=sum(aux8_2, aux8_6, aux8_3, aux8_7)] & ~ [sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)]]]]]]]]] & ~ [EG [~ [[~ [EG [~ [sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)]]] & ~ [E [~ [sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)] U [~ [c14<=sum(aux8_2, aux8_6, aux8_3, aux8_7)] & ~ [sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)]]]]]]]]]]]] & [~ [[~ [E [sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0)<=80 U [sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0)<=80 & ~ [36<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0)]]]] & ~ [EG [sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0)<=80]]]] & EG [~ [[[sum(aux7_2, aux7_3, aux7_6, aux7_7)<=sum(aux5_4, aux5_5, aux5_0, aux5_1) & sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1)<=44] | EX [sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)<=sum(in4_7, in4_6)]]]]]]]]]

abstracting: (sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)<=sum(in4_7, in4_6))
states: 10,489 (4)
.abstracting: (sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1)<=44)
states: 52,537 (4)
abstracting: (sum(aux7_2, aux7_3, aux7_6, aux7_7)<=sum(aux5_4, aux5_5, aux5_0, aux5_1))
states: 52,537 (4)
.
EG iterations: 1
abstracting: (sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0)<=80)
states: 52,537 (4)

EG iterations: 0
abstracting: (36<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0))
states: 0
abstracting: (sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0)<=80)
states: 52,537 (4)
abstracting: (sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0)<=80)
states: 52,537 (4)
abstracting: (sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6))
states: 33,849 (4)
abstracting: (c14<=sum(aux8_2, aux8_6, aux8_3, aux8_7))
states: 51,641 (4)
abstracting: (sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6))
states: 33,849 (4)
abstracting: (sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6))
states: 33,849 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6))
states: 33,849 (4)
abstracting: (c14<=sum(aux8_2, aux8_6, aux8_3, aux8_7))
states: 51,641 (4)
abstracting: (sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6))
states: 33,849 (4)
abstracting: (sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6))
states: 33,849 (4)
.
EG iterations: 1
abstracting: (57<=sum(in1_0, in1_1))
states: 0
abstracting: (sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6))
states: 33,849 (4)
abstracting: (c14<=sum(aux8_2, aux8_6, aux8_3, aux8_7))
states: 51,641 (4)
abstracting: (sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6))
states: 33,849 (4)
abstracting: (sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6))
states: 33,849 (4)
.
EG iterations: 1
abstracting: (14<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1))
states: 0
abstracting: (c110<=30)
states: 52,537 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA PermAdmissibility-PT-01-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.742sec

totally nodes used: 50334392 (5.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 201149717 696392860 897542577
used/not used/entry size/cache size: 67051824 57040 16 1024MB
basic ops cache: hits/miss/sum: 21644376 86555684 108200060
used/not used/entry size/cache size: 16734759 42457 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 204395 204395
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 37527 211788 249315
used/not used/entry size/cache size: 209260 8179348 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 32803239
1 22298815
2 8808257
3 2515558
4 563095
5 102084
6 15446
7 2078
8 263
9 27
>= 10 2

Total processing time: 6m37.723sec


BK_STOP 1678881878098

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

6024 13526 21978 25981 29790 45194
iterations count:624986 (1055), effective:3528 (5)

initing FirstDep: 0m 0.002sec

21865
iterations count:106303 (179), effective:881 (1)

iterations count:592 (1), effective:0 (0)
21354 24775 26544 30892 32919 35844 39828 41448 41246 44649 45251 47754 49200 50930 52201 53351 55157 56722 56464 58551
iterations count:2030899 (3430), effective:8306 (14)
13028 15992 19577 21710 22682
iterations count:516033 (871), effective:2239 (3)

iterations count:42352 (71), effective:424 (0)

iterations count:592 (1), effective:0 (0)
20058 23383
iterations count:219716 (371), effective:1301 (2)

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

iterations count:4079 (6), effective:25 (0)

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

iterations count:4079 (6), effective:25 (0)

iterations count:4079 (6), effective:25 (0)

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

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

iterations count:4130 (6), effective:49 (0)

iterations count:592 (1), effective:0 (0)
21354 24738 26544 30892 32919 35844 39828 41448 41246 44624 45251 47786 49200 50928 52201 53351 55157 56720 56464 58531
iterations count:2030964 (3430), effective:8315 (14)
21354 24738 26544 30892 32919 35844 39828 41448 41246 44624 45251 47786 49200 50928 52201 53351 55157 56720 56464 58531
iterations count:2030964 (3430), effective:8315 (14)

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

iterations count:5915 (9), effective:41 (0)

iterations count:17886 (30), effective:159 (0)

iterations count:18972 (32), effective:179 (0)

iterations count:18972 (32), effective:179 (0)

iterations count:18972 (32), effective:179 (0)

iterations count:4326 (7), effective:61 (0)

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

iterations count:7588 (12), effective:89 (0)

iterations count:23796 (40), effective:289 (0)
21354 24738 26544 30892 32919 35844 39828 41448 41246 44624 45251 47786 49200 50928 52201 53351 55157 56720 56464 58531
iterations count:2030964 (3430), effective:8315 (14)

iterations count:592 (1), effective:0 (0)
28317
iterations count:179416 (303), effective:476 (0)

iterations count:592 (1), effective:0 (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="PermAdmissibility-PT-01"
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 PermAdmissibility-PT-01, 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 r257-smll-167863532800505"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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