Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r033-tajo-167813685700201.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is BridgeAndVehicles-PT-V20P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r033-tajo-167813685700201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 11K Feb 25 12:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K Feb 25 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 51K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 12:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 12:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 194K Feb 25 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 798K Feb 25 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 434K 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 BridgeAndVehicles-PT-V20P20N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678297339217

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=BridgeAndVehicles-PT-V20P20N10
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: BridgeAndVehicles_PT_V20P20N10
(NrP: 68 NrTr: 548 NrArc: 4070)

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

net check time: 0m 0.000sec

init dd package: 0m 3.431sec


RS generation: 0m27.541sec


-> reachability set: #nodes 1360582 (1.4e+06) #states 6,732,570 (6)



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

checking: ~ [EG [SUR_PONT_B<=42]]
normalized: ~ [EG [SUR_PONT_B<=42]]

abstracting: (SUR_PONT_B<=42)
states: 6,732,570 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.091sec

checking: EG [E [~ [NB_ATTENTE_A_19<=17] U AF [EG [AX [2<=COMPTEUR_0]]]]]
normalized: EG [E [~ [NB_ATTENTE_A_19<=17] U ~ [EG [~ [EG [~ [EX [~ [2<=COMPTEUR_0]]]]]]]]]

abstracting: (2<=COMPTEUR_0)
states: 0
..
EG iterations: 1
..............................................................................................MC time: 3m58.873sec

checking: EF [~ [sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_B]]
normalized: E [true U ~ [sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_B]]

abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_B)
states: 6,420,953 (6)

before gc: list nodes free: 1911662

after gc: idd nodes used:1783416, unused:62216584; list nodes free:435671882
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m39.063sec

checking: AF [~ [[~ [A [AG [NB_ATTENTE_B_4<=COMPTEUR_6] U AG [NB_ATTENTE_A_5<=4]]] | EF [NB_ATTENTE_B_19<=11]]]]
normalized: ~ [EG [[E [true U NB_ATTENTE_B_19<=11] | ~ [[~ [EG [E [true U ~ [NB_ATTENTE_A_5<=4]]]] & ~ [E [E [true U ~ [NB_ATTENTE_A_5<=4]] U [E [true U ~ [NB_ATTENTE_B_4<=COMPTEUR_6]] & E [true U ~ [NB_ATTENTE_A_5<=4]]]]]]]]]]

abstracting: (NB_ATTENTE_A_5<=4)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_B_4<=COMPTEUR_6)
states: 6,233,138 (6)
abstracting: (NB_ATTENTE_A_5<=4)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_A_5<=4)
states: 6,732,570 (6)
.
EG iterations: 1
abstracting: (NB_ATTENTE_B_19<=11)
states: 6,732,570 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m47.203sec

checking: AG [[[5<=COMPTEUR_9 | NB_ATTENTE_B_8<=10] | EG [AG [[EF [ATTENTE_B<=1] & A [18<=CHOIX_1 U CHOIX_1<=COMPTEUR_5]]]]]]
normalized: ~ [E [true U ~ [[EG [~ [E [true U ~ [[[~ [EG [~ [CHOIX_1<=COMPTEUR_5]]] & ~ [E [~ [CHOIX_1<=COMPTEUR_5] U [~ [18<=CHOIX_1] & ~ [CHOIX_1<=COMPTEUR_5]]]]] & E [true U ATTENTE_B<=1]]]]]] | [5<=COMPTEUR_9 | NB_ATTENTE_B_8<=10]]]]]

abstracting: (NB_ATTENTE_B_8<=10)
states: 6,732,570 (6)
abstracting: (5<=COMPTEUR_9)
states: 0
abstracting: (ATTENTE_B<=1)
states: 1,400,982 (6)
abstracting: (CHOIX_1<=COMPTEUR_5)
states: 5,310,819 (6)
abstracting: (18<=CHOIX_1)
states: 0
abstracting: (CHOIX_1<=COMPTEUR_5)
states: 5,310,819 (6)
abstracting: (CHOIX_1<=COMPTEUR_5)
states: 5,310,819 (6)
..........................................
EG iterations: 42

before gc: list nodes free: 117396045

after gc: idd nodes used:1583937, unused:62416063; list nodes free:436827735
.
EG iterations: 1
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m33.711sec

checking: ~ [EF [EF [[COMPTEUR_4<=20 & [~ [E [NB_ATTENTE_A_8<=COMPTEUR_2 U NB_ATTENTE_A_11<=COMPTEUR_9]] & A [NB_ATTENTE_A_7<=15 U ROUTE_A<=NB_ATTENTE_B_20]]]]]]
normalized: ~ [E [true U E [true U [COMPTEUR_4<=20 & [[~ [EG [~ [ROUTE_A<=NB_ATTENTE_B_20]]] & ~ [E [~ [ROUTE_A<=NB_ATTENTE_B_20] U [~ [NB_ATTENTE_A_7<=15] & ~ [ROUTE_A<=NB_ATTENTE_B_20]]]]] & ~ [E [NB_ATTENTE_A_8<=COMPTEUR_2 U NB_ATTENTE_A_11<=COMPTEUR_9]]]]]]]

abstracting: (NB_ATTENTE_A_11<=COMPTEUR_9)
states: 6,502,220 (6)
abstracting: (NB_ATTENTE_A_8<=COMPTEUR_2)
states: 6,374,121 (6)
abstracting: (ROUTE_A<=NB_ATTENTE_B_20)
states: 733,487 (5)
abstracting: (NB_ATTENTE_A_7<=15)
states: 6,732,570 (6)
abstracting: (ROUTE_A<=NB_ATTENTE_B_20)
states: 733,487 (5)
abstracting: (ROUTE_A<=NB_ATTENTE_B_20)
states: 733,487 (5)
.......................................................................................MC time: 4m13.748sec

checking: E [EG [ATTENTE_A<=SUR_PONT_B] U ~ [[[EG [sum(VIDANGE_2, VIDANGE_1)<=24] & ~ [E [~ [ATTENTE_B<=SUR_PONT_A] U AX [ROUTE_A<=sum(VIDANGE_2, VIDANGE_1)]]]] | 95<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]
normalized: E [EG [ATTENTE_A<=SUR_PONT_B] U ~ [[95<=sum(CONTROLEUR_2, CONTROLEUR_1) | [~ [E [~ [ATTENTE_B<=SUR_PONT_A] U ~ [EX [~ [ROUTE_A<=sum(VIDANGE_2, VIDANGE_1)]]]]] & EG [sum(VIDANGE_2, VIDANGE_1)<=24]]]]]

abstracting: (sum(VIDANGE_2, VIDANGE_1)<=24)
states: 6,732,570 (6)

EG iterations: 0
abstracting: (ROUTE_A<=sum(VIDANGE_2, VIDANGE_1))
states: 798,363 (5)
.abstracting: (ATTENTE_B<=SUR_PONT_A)
states: 1,481,838 (6)
abstracting: (95<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 0
abstracting: (ATTENTE_A<=SUR_PONT_B)
states: 1,481,898 (6)
......................................................................................................
EG iterations: 102
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m24.704sec

checking: ~ [E [[EG [19<=COMPTEUR_9] | E [NB_ATTENTE_B_12<=9 U 9<=NB_ATTENTE_B_11]] U [~ [[~ [[[6<=NB_ATTENTE_B_18 & NB_ATTENTE_B_13<=12] & ~ [COMPTEUR_10<=NB_ATTENTE_B_8]]] & [E [ROUTE_A<=9 U 12<=NB_ATTENTE_B_11] | AF [NB_ATTENTE_B_9<=15]]]] | EF [15<=NB_ATTENTE_B_0]]]]
normalized: ~ [E [[E [NB_ATTENTE_B_12<=9 U 9<=NB_ATTENTE_B_11] | EG [19<=COMPTEUR_9]] U [E [true U 15<=NB_ATTENTE_B_0] | ~ [[[~ [EG [~ [NB_ATTENTE_B_9<=15]]] | E [ROUTE_A<=9 U 12<=NB_ATTENTE_B_11]] & ~ [[~ [COMPTEUR_10<=NB_ATTENTE_B_8] & [6<=NB_ATTENTE_B_18 & NB_ATTENTE_B_13<=12]]]]]]]]

abstracting: (NB_ATTENTE_B_13<=12)
states: 6,732,570 (6)
abstracting: (6<=NB_ATTENTE_B_18)
states: 0
abstracting: (COMPTEUR_10<=NB_ATTENTE_B_8)
states: 6,122,741 (6)
abstracting: (12<=NB_ATTENTE_B_11)
states: 0
abstracting: (ROUTE_A<=9)
states: 5,351,982 (6)
abstracting: (NB_ATTENTE_B_9<=15)
states: 6,732,570 (6)
.
EG iterations: 1
abstracting: (15<=NB_ATTENTE_B_0)
states: 0
abstracting: (19<=COMPTEUR_9)
states: 0
.
EG iterations: 1
abstracting: (9<=NB_ATTENTE_B_11)
states: 0
abstracting: (NB_ATTENTE_B_12<=9)
states: 6,732,570 (6)
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.002sec

checking: [AG [AF [[[COMPTEUR_2<=NB_ATTENTE_B_8 & EX [19<=NB_ATTENTE_B_0]] & A [AF [CHOIX_1<=NB_ATTENTE_A_17] U [NB_ATTENTE_B_12<=ROUTE_A & ROUTE_B<=4]]]]] | EF [[AF [~ [A [6<=COMPTEUR_3 U 5<=NB_ATTENTE_A_13]]] & AG [~ [[~ [3<=NB_ATTENTE_B_0] & [12<=NB_ATTENTE_A_14 | 16<=NB_ATTENTE_B_19]]]]]]]
normalized: [E [true U [~ [E [true U [[12<=NB_ATTENTE_A_14 | 16<=NB_ATTENTE_B_19] & ~ [3<=NB_ATTENTE_B_0]]]] & ~ [EG [[~ [EG [~ [5<=NB_ATTENTE_A_13]]] & ~ [E [~ [5<=NB_ATTENTE_A_13] U [~ [6<=COMPTEUR_3] & ~ [5<=NB_ATTENTE_A_13]]]]]]]]] | ~ [E [true U EG [~ [[[~ [EG [~ [[NB_ATTENTE_B_12<=ROUTE_A & ROUTE_B<=4]]]] & ~ [E [~ [[NB_ATTENTE_B_12<=ROUTE_A & ROUTE_B<=4]] U [EG [~ [CHOIX_1<=NB_ATTENTE_A_17]] & ~ [[NB_ATTENTE_B_12<=ROUTE_A & ROUTE_B<=4]]]]]] & [COMPTEUR_2<=NB_ATTENTE_B_8 & EX [19<=NB_ATTENTE_B_0]]]]]]]]

abstracting: (19<=NB_ATTENTE_B_0)
states: 0
.abstracting: (COMPTEUR_2<=NB_ATTENTE_B_8)
states: 6,334,926 (6)
abstracting: (ROUTE_B<=4)
states: 3,225,122 (6)
abstracting: (NB_ATTENTE_B_12<=ROUTE_A)
states: 6,709,074 (6)
abstracting: (CHOIX_1<=NB_ATTENTE_A_17)
states: 5,141,097 (6)
.....
before gc: list nodes free: 28332407

after gc: idd nodes used:2788390, unused:61211610; list nodes free:428325048
.....................................
EG iterations: 42
abstracting: (ROUTE_B<=4)
states: 3,225,122 (6)
abstracting: (NB_ATTENTE_B_12<=ROUTE_A)
states: 6,709,074 (6)
abstracting: (ROUTE_B<=4)
states: 3,225,122 (6)
abstracting: (NB_ATTENTE_B_12<=ROUTE_A)
states: 6,709,074 (6)
..............................................................................MC time: 4m29.008sec

checking: A [A [~ [SORTI_B<=NB_ATTENTE_A_1] U ~ [[EX [AG [2<=NB_ATTENTE_B_11]] | 11<=NB_ATTENTE_B_4]]] U [~ [AG [E [NB_ATTENTE_A_14<=5 U VIDANGE_1<=3]]] & [A [A [[NB_ATTENTE_A_9<=NB_ATTENTE_B_12 | ATTENTE_B<=19] U [CONTROLEUR_1<=2 & NB_ATTENTE_B_4<=NB_ATTENTE_A_10]] U [AG [13<=SUR_PONT_B] | AX [14<=NB_ATTENTE_B_19]]] & EG [COMPTEUR_1<=NB_ATTENTE_B_10]]]]
normalized: [~ [EG [~ [[[EG [COMPTEUR_1<=NB_ATTENTE_B_10] & [~ [EG [~ [[~ [EX [~ [14<=NB_ATTENTE_B_19]]] | ~ [E [true U ~ [13<=SUR_PONT_B]]]]]]] & ~ [E [~ [[~ [EX [~ [14<=NB_ATTENTE_B_19]]] | ~ [E [true U ~ [13<=SUR_PONT_B]]]]] U [~ [[~ [EG [~ [[CONTROLEUR_1<=2 & NB_ATTENTE_B_4<=NB_ATTENTE_A_10]]]] & ~ [E [~ [[CONTROLEUR_1<=2 & NB_ATTENTE_B_4<=NB_ATTENTE_A_10]] U [~ [[NB_ATTENTE_A_9<=NB_ATTENTE_B_12 | ATTENTE_B<=19]] & ~ [[CONTROLEUR_1<=2 & NB_ATTENTE_B_4<=NB_ATTENTE_A_10]]]]]]] & ~ [[~ [EX [~ [14<=NB_ATTENTE_B_19]]] | ~ [E [true U ~ [13<=SUR_PONT_B]]]]]]]]]] & E [true U ~ [E [NB_ATTENTE_A_14<=5 U VIDANGE_1<=3]]]]]]] & ~ [E [~ [[[EG [COMPTEUR_1<=NB_ATTENTE_B_10] & [~ [EG [~ [[~ [EX [~ [14<=NB_ATTENTE_B_19]]] | ~ [E [true U ~ [13<=SUR_PONT_B]]]]]]] & ~ [E [~ [[~ [EX [~ [14<=NB_ATTENTE_B_19]]] | ~ [E [true U ~ [13<=SUR_PONT_B]]]]] U [~ [[~ [EG [~ [[CONTROLEUR_1<=2 & NB_ATTENTE_B_4<=NB_ATTENTE_A_10]]]] & ~ [E [~ [[CONTROLEUR_1<=2 & NB_ATTENTE_B_4<=NB_ATTENTE_A_10]] U [~ [[NB_ATTENTE_A_9<=NB_ATTENTE_B_12 | ATTENTE_B<=19]] & ~ [[CONTROLEUR_1<=2 & NB_ATTENTE_B_4<=NB_ATTENTE_A_10]]]]]]] & ~ [[~ [EX [~ [14<=NB_ATTENTE_B_19]]] | ~ [E [true U ~ [13<=SUR_PONT_B]]]]]]]]]] & E [true U ~ [E [NB_ATTENTE_A_14<=5 U VIDANGE_1<=3]]]]] U [~ [[~ [EG [[11<=NB_ATTENTE_B_4 | EX [~ [E [true U ~ [2<=NB_ATTENTE_B_11]]]]]]] & ~ [E [[11<=NB_ATTENTE_B_4 | EX [~ [E [true U ~ [2<=NB_ATTENTE_B_11]]]]] U [SORTI_B<=NB_ATTENTE_A_1 & [11<=NB_ATTENTE_B_4 | EX [~ [E [true U ~ [2<=NB_ATTENTE_B_11]]]]]]]]]] & ~ [[[EG [COMPTEUR_1<=NB_ATTENTE_B_10] & [~ [EG [~ [[~ [EX [~ [14<=NB_ATTENTE_B_19]]] | ~ [E [true U ~ [13<=SUR_PONT_B]]]]]]] & ~ [E [~ [[~ [EX [~ [14<=NB_ATTENTE_B_19]]] | ~ [E [true U ~ [13<=SUR_PONT_B]]]]] U [~ [[~ [EG [~ [[CONTROLEUR_1<=2 & NB_ATTENTE_B_4<=NB_ATTENTE_A_10]]]] & ~ [E [~ [[CONTROLEUR_1<=2 & NB_ATTENTE_B_4<=NB_ATTENTE_A_10]] U [~ [[NB_ATTENTE_A_9<=NB_ATTENTE_B_12 | ATTENTE_B<=19]] & ~ [[CONTROLEUR_1<=2 & NB_ATTENTE_B_4<=NB_ATTENTE_A_10]]]]]]] & ~ [[~ [EX [~ [14<=NB_ATTENTE_B_19]]] | ~ [E [true U ~ [13<=SUR_PONT_B]]]]]]]]]] & E [true U ~ [E [NB_ATTENTE_A_14<=5 U VIDANGE_1<=3]]]]]]]]]

abstracting: (VIDANGE_1<=3)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_A_14<=5)
states: 6,732,570 (6)
abstracting: (13<=SUR_PONT_B)
states: 0
abstracting: (14<=NB_ATTENTE_B_19)
states: 0
.abstracting: (NB_ATTENTE_B_4<=NB_ATTENTE_A_10)
states: 6,199,190 (6)
abstracting: (CONTROLEUR_1<=2)
states: 6,732,570 (6)
abstracting: (ATTENTE_B<=19)
states: 6,728,547 (6)
abstracting: (NB_ATTENTE_A_9<=NB_ATTENTE_B_12)
states: 6,404,115 (6)
abstracting: (NB_ATTENTE_B_4<=NB_ATTENTE_A_10)
states: 6,199,190 (6)
abstracting: (CONTROLEUR_1<=2)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_B_4<=NB_ATTENTE_A_10)
states: 6,199,190 (6)
abstracting: (CONTROLEUR_1<=2)
states: 6,732,570 (6)
..................................................................
EG iterations: 66
abstracting: (13<=SUR_PONT_B)
states: 0
abstracting: (14<=NB_ATTENTE_B_19)
states: 0
.abstracting: (13<=SUR_PONT_B)
states: 0
abstracting: (14<=NB_ATTENTE_B_19)
states: 0
............................................................
before gc: list nodes free: 20212079

after gc: idd nodes used:3163878, unused:60836122; list nodes free:423713795
................MC time: 4m 2.323sec

checking: A [~ [AG [AG [[NB_ATTENTE_B_20<=COMPTEUR_8 | [10<=COMPTEUR_2 | NB_ATTENTE_A_17<=COMPTEUR_7]]]]] U A [[~ [[A [NB_ATTENTE_A_20<=19 U NB_ATTENTE_A_13<=NB_ATTENTE_A_13] & 9<=NB_ATTENTE_A_17]] | [~ [[[COMPTEUR_0<=NB_ATTENTE_A_14 | 14<=NB_ATTENTE_A_0] & [VIDANGE_1<=15 & NB_ATTENTE_A_18<=17]]] | COMPTEUR_8<=16]] U 5<=NB_ATTENTE_B_4]]
normalized: [~ [EG [~ [[~ [EG [~ [5<=NB_ATTENTE_B_4]]] & ~ [E [~ [5<=NB_ATTENTE_B_4] U [~ [[[COMPTEUR_8<=16 | ~ [[[VIDANGE_1<=15 & NB_ATTENTE_A_18<=17] & [COMPTEUR_0<=NB_ATTENTE_A_14 | 14<=NB_ATTENTE_A_0]]]] | ~ [[9<=NB_ATTENTE_A_17 & [~ [EG [~ [NB_ATTENTE_A_13<=NB_ATTENTE_A_13]]] & ~ [E [~ [NB_ATTENTE_A_13<=NB_ATTENTE_A_13] U [~ [NB_ATTENTE_A_20<=19] & ~ [NB_ATTENTE_A_13<=NB_ATTENTE_A_13]]]]]]]]] & ~ [5<=NB_ATTENTE_B_4]]]]]]]] & ~ [E [~ [[~ [EG [~ [5<=NB_ATTENTE_B_4]]] & ~ [E [~ [5<=NB_ATTENTE_B_4] U [~ [[[COMPTEUR_8<=16 | ~ [[[VIDANGE_1<=15 & NB_ATTENTE_A_18<=17] & [COMPTEUR_0<=NB_ATTENTE_A_14 | 14<=NB_ATTENTE_A_0]]]] | ~ [[9<=NB_ATTENTE_A_17 & [~ [EG [~ [NB_ATTENTE_A_13<=NB_ATTENTE_A_13]]] & ~ [E [~ [NB_ATTENTE_A_13<=NB_ATTENTE_A_13] U [~ [NB_ATTENTE_A_20<=19] & ~ [NB_ATTENTE_A_13<=NB_ATTENTE_A_13]]]]]]]]] & ~ [5<=NB_ATTENTE_B_4]]]]]] U [~ [E [true U E [true U ~ [[NB_ATTENTE_B_20<=COMPTEUR_8 | [10<=COMPTEUR_2 | NB_ATTENTE_A_17<=COMPTEUR_7]]]]]] & ~ [[~ [EG [~ [5<=NB_ATTENTE_B_4]]] & ~ [E [~ [5<=NB_ATTENTE_B_4] U [~ [[[COMPTEUR_8<=16 | ~ [[[VIDANGE_1<=15 & NB_ATTENTE_A_18<=17] & [COMPTEUR_0<=NB_ATTENTE_A_14 | 14<=NB_ATTENTE_A_0]]]] | ~ [[9<=NB_ATTENTE_A_17 & [~ [EG [~ [NB_ATTENTE_A_13<=NB_ATTENTE_A_13]]] & ~ [E [~ [NB_ATTENTE_A_13<=NB_ATTENTE_A_13] U [~ [NB_ATTENTE_A_20<=19] & ~ [NB_ATTENTE_A_13<=NB_ATTENTE_A_13]]]]]]]]] & ~ [5<=NB_ATTENTE_B_4]]]]]]]]]]

abstracting: (5<=NB_ATTENTE_B_4)
states: 0
abstracting: (NB_ATTENTE_A_13<=NB_ATTENTE_A_13)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_A_20<=19)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_A_13<=NB_ATTENTE_A_13)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_A_13<=NB_ATTENTE_A_13)
states: 6,732,570 (6)
.
EG iterations: 1
abstracting: (9<=NB_ATTENTE_A_17)
states: 0
abstracting: (14<=NB_ATTENTE_A_0)
states: 0
abstracting: (COMPTEUR_0<=NB_ATTENTE_A_14)
states: 5,999,742 (6)
abstracting: (NB_ATTENTE_A_18<=17)
states: 6,732,570 (6)
abstracting: (VIDANGE_1<=15)
states: 6,732,570 (6)
abstracting: (COMPTEUR_8<=16)
states: 6,732,570 (6)
abstracting: (5<=NB_ATTENTE_B_4)
states: 0
abstracting: (5<=NB_ATTENTE_B_4)
states: 0

EG iterations: 0
abstracting: (NB_ATTENTE_A_17<=COMPTEUR_7)
states: 6,676,394 (6)
abstracting: (10<=COMPTEUR_2)
states: 0
abstracting: (NB_ATTENTE_B_20<=COMPTEUR_8)
states: 6,728,835 (6)
abstracting: (5<=NB_ATTENTE_B_4)
states: 0
abstracting: (NB_ATTENTE_A_13<=NB_ATTENTE_A_13)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_A_20<=19)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_A_13<=NB_ATTENTE_A_13)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_A_13<=NB_ATTENTE_A_13)
states: 6,732,570 (6)
.
EG iterations: 1
abstracting: (9<=NB_ATTENTE_A_17)
states: 0
abstracting: (14<=NB_ATTENTE_A_0)
states: 0
abstracting: (COMPTEUR_0<=NB_ATTENTE_A_14)
states: 5,999,742 (6)
abstracting: (NB_ATTENTE_A_18<=17)
states: 6,732,570 (6)
abstracting: (VIDANGE_1<=15)
states: 6,732,570 (6)
abstracting: (COMPTEUR_8<=16)
states: 6,732,570 (6)
abstracting: (5<=NB_ATTENTE_B_4)
states: 0
abstracting: (5<=NB_ATTENTE_B_4)
states: 0

EG iterations: 0
abstracting: (5<=NB_ATTENTE_B_4)
states: 0
abstracting: (NB_ATTENTE_A_13<=NB_ATTENTE_A_13)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_A_20<=19)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_A_13<=NB_ATTENTE_A_13)
states: 6,732,570 (6)
abstracting: (NB_ATTENTE_A_13<=NB_ATTENTE_A_13)
states: 6,732,570 (6)
.
EG iterations: 1
abstracting: (9<=NB_ATTENTE_A_17)
states: 0
abstracting: (14<=NB_ATTENTE_A_0)
states: 0
abstracting: (COMPTEUR_0<=NB_ATTENTE_A_14)
states: 5,999,742 (6)
abstracting: (NB_ATTENTE_A_18<=17)
states: 6,732,570 (6)
abstracting: (VIDANGE_1<=15)
states: 6,732,570 (6)
abstracting: (COMPTEUR_8<=16)
states: 6,732,570 (6)
abstracting: (5<=NB_ATTENTE_B_4)
states: 0
abstracting: (5<=NB_ATTENTE_B_4)
states: 0

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.873sec

checking: ~ [EX [[[EG [AF [12<=CAPACITE]] & A [AX [ATTENTE_A<=ROUTE_A] U [[CAPACITE<=14 & ATTENTE_A<=8] | 26<=SORTI_B]]] | A [EF [[SORTI_B<=77 & 41<=SUR_PONT_A]] U [[EG [sum(CHOIX_2, CHOIX_1)<=42] | CAPACITE<=33] & 91<=sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]]]]
normalized: ~ [EX [[[~ [EG [~ [[91<=sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) & [CAPACITE<=33 | EG [sum(CHOIX_2, CHOIX_1)<=42]]]]]] & ~ [E [~ [[91<=sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) & [CAPACITE<=33 | EG [sum(CHOIX_2, CHOIX_1)<=42]]]] U [~ [E [true U [SORTI_B<=77 & 41<=SUR_PONT_A]]] & ~ [[91<=sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) & [CAPACITE<=33 | EG [sum(CHOIX_2, CHOIX_1)<=42]]]]]]]] | [[~ [EG [~ [[26<=SORTI_B | [CAPACITE<=14 & ATTENTE_A<=8]]]]] & ~ [E [~ [[26<=SORTI_B | [CAPACITE<=14 & ATTENTE_A<=8]]] U [EX [~ [ATTENTE_A<=ROUTE_A]] & ~ [[26<=SORTI_B | [CAPACITE<=14 & ATTENTE_A<=8]]]]]]] & EG [~ [EG [~ [12<=CAPACITE]]]]]]]]

abstracting: (12<=CAPACITE)
states: 6,547,858 (6)
.....................................
EG iterations: 37

EG iterations: 0
abstracting: (ATTENTE_A<=8)
states: 5,000,572 (6)
abstracting: (CAPACITE<=14)
states: 1,120,080 (6)
abstracting: (26<=SORTI_B)
states: 0
abstracting: (ATTENTE_A<=ROUTE_A)
states: 3,542,615 (6)
.abstracting: (ATTENTE_A<=8)
states: 5,000,572 (6)
abstracting: (CAPACITE<=14)
states: 1,120,080 (6)
abstracting: (26<=SORTI_B)
states: 0
abstracting: (ATTENTE_A<=8)
states: 5,000,572 (6)
abstracting: (CAPACITE<=14)
states: 1,120,080 (6)
abstracting: (26<=SORTI_B)
states: 0
.
EG iterations: 1
abstracting: (sum(CHOIX_2, CHOIX_1)<=42)
states: 6,732,570 (6)

EG iterations: 0
abstracting: (CAPACITE<=33)
states: 6,732,570 (6)
abstracting: (91<=sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0))
states: 0
abstracting: (41<=SUR_PONT_A)
states: 0
abstracting: (SORTI_B<=77)
states: 6,732,570 (6)
abstracting: (sum(CHOIX_2, CHOIX_1)<=42)
states: 6,732,570 (6)

EG iterations: 0
abstracting: (CAPACITE<=33)
states: 6,732,570 (6)
abstracting: (91<=sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0))
states: 0
abstracting: (sum(CHOIX_2, CHOIX_1)<=42)
states: 6,732,570 (6)

EG iterations: 0
abstracting: (CAPACITE<=33)
states: 6,732,570 (6)
abstracting: (91<=sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0))
states: 0

EG iterations: 0
.-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m54.551sec

checking: EG [EG [[[A [AF [sum(VIDANGE_2, VIDANGE_1)<=65] U [47<=SORTI_A & SORTI_A<=sum(CHOIX_2, CHOIX_1)]] | ~ [EG [95<=SUR_PONT_B]]] | [[EF [sum(VIDANGE_2, VIDANGE_1)<=sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)] & [27<=ROUTE_A | [CAPACITE<=29 & sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_B]]] | AX [~ [CAPACITE<=21]]]]]]
normalized: EG [EG [[[[~ [EG [~ [[47<=SORTI_A & SORTI_A<=sum(CHOIX_2, CHOIX_1)]]]] & ~ [E [~ [[47<=SORTI_A & SORTI_A<=sum(CHOIX_2, CHOIX_1)]] U [EG [~ [sum(VIDANGE_2, VIDANGE_1)<=65]] & ~ [[47<=SORTI_A & SORTI_A<=sum(CHOIX_2, CHOIX_1)]]]]]] | ~ [EG [95<=SUR_PONT_B]]] | [~ [EX [CAPACITE<=21]] | [[27<=ROUTE_A | [CAPACITE<=29 & sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_B]] & E [true U sum(VIDANGE_2, VIDANGE_1)<=sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]]]]]

abstracting: (sum(VIDANGE_2, VIDANGE_1)<=sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0))
states: 6,732,570 (6)
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_B)
states: 6,420,953 (6)
abstracting: (CAPACITE<=29)
states: 6,732,570 (6)
abstracting: (27<=ROUTE_A)
states: 0
abstracting: (CAPACITE<=21)
states: 6,732,570 (6)
.abstracting: (95<=SUR_PONT_B)
states: 0
.
EG iterations: 1
abstracting: (SORTI_A<=sum(CHOIX_2, CHOIX_1))
states: 404,517 (5)
abstracting: (47<=SORTI_A)
states: 0
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=65)
states: 6,732,570 (6)
.
EG iterations: 1
abstracting: (SORTI_A<=sum(CHOIX_2, CHOIX_1))
states: 404,517 (5)
abstracting: (47<=SORTI_A)
states: 0
abstracting: (SORTI_A<=sum(CHOIX_2, CHOIX_1))
states: 404,517 (5)
abstracting: (47<=SORTI_A)
states: 0

EG iterations: 0

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.794sec

checking: ~ [[[A [E [CAPACITE<=9 U ROUTE_A<=sum(COMPTEUR_10, COMPTEUR_9, COMPTEUR_8, COMPTEUR_7, COMPTEUR_6, COMPTEUR_5, COMPTEUR_4, COMPTEUR_3, COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)] U EF [sum(CONTROLEUR_2, CONTROLEUR_1)<=40]] | E [16<=SUR_PONT_A U [[SORTI_B<=sum(COMPTEUR_10, COMPTEUR_9, COMPTEUR_8, COMPTEUR_7, COMPTEUR_6, COMPTEUR_5, COMPTEUR_4, COMPTEUR_3, COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) | 54<=sum(COMPTEUR_10, COMPTEUR_9, COMPTEUR_8, COMPTEUR_7, COMPTEUR_6, COMPTEUR_5, COMPTEUR_4, COMPTEUR_3, COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)] | ~ [SORTI_B<=97]]]] & A [EX [E [ROUTE_A<=25 U 27<=ATTENTE_A]] U EX [[CAPACITE<=84 & 61<=SORTI_B]]]]]
normalized: ~ [[[~ [EG [~ [EX [[CAPACITE<=84 & 61<=SORTI_B]]]]] & ~ [E [~ [EX [[CAPACITE<=84 & 61<=SORTI_B]]] U [~ [EX [E [ROUTE_A<=25 U 27<=ATTENTE_A]]] & ~ [EX [[CAPACITE<=84 & 61<=SORTI_B]]]]]]] & [E [16<=SUR_PONT_A U [~ [SORTI_B<=97] | [SORTI_B<=sum(COMPTEUR_10, COMPTEUR_9, COMPTEUR_8, COMPTEUR_7, COMPTEUR_6, COMPTEUR_5, COMPTEUR_4, COMPTEUR_3, COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) | 54<=sum(COMPTEUR_10, COMPTEUR_9, COMPTEUR_8, COMPTEUR_7, COMPTEUR_6, COMPTEUR_5, COMPTEUR_4, COMPTEUR_3, COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]] | [~ [EG [~ [E [true U sum(CONTROLEUR_2, CONTROLEUR_1)<=40]]]] & ~ [E [~ [E [true U sum(CONTROLEUR_2, CONTROLEUR_1)<=40]] U [~ [E [CAPACITE<=9 U ROUTE_A<=sum(COMPTEUR_10, COMPTEUR_9, COMPTEUR_8, COMPTEUR_7, COMPTEUR_6, COMPTEUR_5, COMPTEUR_4, COMPTEUR_3, COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]] & ~ [E [true U sum(CONTROLEUR_2, CONTROLEUR_1)<=40]]]]]]]]]

abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=40)
states: 6,732,570 (6)
abstracting: (ROUTE_A<=sum(COMPTEUR_10, COMPTEUR_9, COMPTEUR_8, COMPTEUR_7, COMPTEUR_6, COMPTEUR_5, COMPTEUR_4, COMPTEUR_3, COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 1,422,222 (6)
abstracting: (CAPACITE<=9)
states: 0
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=40)
states: 6,732,570 (6)
abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=40)
states: 6,732,570 (6)
.
EG iterations: 1
abstracting: (54<=sum(COMPTEUR_10, COMPTEUR_9, COMPTEUR_8, COMPTEUR_7, COMPTEUR_6, COMPTEUR_5, COMPTEUR_4, COMPTEUR_3, COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 0
abstracting: (SORTI_B<=sum(COMPTEUR_10, COMPTEUR_9, COMPTEUR_8, COMPTEUR_7, COMPTEUR_6, COMPTEUR_5, COMPTEUR_4, COMPTEUR_3, COMPTEUR_2, COMPTEUR_1, COMPTEUR_0))
states: 669,744 (5)
abstracting: (SORTI_B<=97)
states: 6,732,570 (6)
abstracting: (16<=SUR_PONT_A)
states: 0
abstracting: (61<=SORTI_B)
states: 0
abstracting: (CAPACITE<=84)
states: 6,732,570 (6)
.abstracting: (27<=ATTENTE_A)
states: 0
abstracting: (ROUTE_A<=25)
states: 6,732,570 (6)
.abstracting: (61<=SORTI_B)
states: 0
abstracting: (CAPACITE<=84)
states: 6,732,570 (6)
.abstracting: (61<=SORTI_B)
states: 0
abstracting: (CAPACITE<=84)
states: 6,732,570 (6)
.
EG iterations: 0
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.748sec

checking: ~ [E [[~ [[AX [[82<=sum(CONTROLEUR_2, CONTROLEUR_1) | 79<=ATTENTE_A]] & [sum(VIDANGE_2, VIDANGE_1)<=ATTENTE_B | A [ATTENTE_A<=77 U SORTI_A<=ROUTE_B]]]] & [E [AX [ATTENTE_A<=ROUTE_A] U A [50<=CAPACITE U ROUTE_B<=28]] & EG [ROUTE_B<=95]]] U [AF [AF [[sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SORTI_A | SORTI_B<=SUR_PONT_A]]] & E [E [[40<=ATTENTE_B & CAPACITE<=sum(CHOIX_2, CHOIX_1)] U AG [SUR_PONT_A<=18]] U ~ [[SORTI_B<=SUR_PONT_B | AG [SORTI_A<=2]]]]]]]
normalized: ~ [E [[[E [~ [EX [~ [ATTENTE_A<=ROUTE_A]]] U [~ [EG [~ [ROUTE_B<=28]]] & ~ [E [~ [ROUTE_B<=28] U [~ [50<=CAPACITE] & ~ [ROUTE_B<=28]]]]]] & EG [ROUTE_B<=95]] & ~ [[[sum(VIDANGE_2, VIDANGE_1)<=ATTENTE_B | [~ [EG [~ [SORTI_A<=ROUTE_B]]] & ~ [E [~ [SORTI_A<=ROUTE_B] U [~ [ATTENTE_A<=77] & ~ [SORTI_A<=ROUTE_B]]]]]] & ~ [EX [~ [[82<=sum(CONTROLEUR_2, CONTROLEUR_1) | 79<=ATTENTE_A]]]]]]] U [E [E [[40<=ATTENTE_B & CAPACITE<=sum(CHOIX_2, CHOIX_1)] U ~ [E [true U ~ [SUR_PONT_A<=18]]]] U ~ [[SORTI_B<=SUR_PONT_B | ~ [E [true U ~ [SORTI_A<=2]]]]]] & ~ [EG [EG [~ [[sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SORTI_A | SORTI_B<=SUR_PONT_A]]]]]]]]

abstracting: (SORTI_B<=SUR_PONT_A)
states: 988,158 (5)
abstracting: (sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SORTI_A)
states: 6,547,764 (6)
..............................................................................................................................
EG iterations: 126
.
EG iterations: 1
abstracting: (SORTI_A<=2)
states: 1,181,778 (6)
abstracting: (SORTI_B<=SUR_PONT_B)
states: 930,138 (5)
abstracting: (SUR_PONT_A<=18)
states: 6,732,570 (6)
abstracting: (CAPACITE<=sum(CHOIX_2, CHOIX_1))
states: 0
abstracting: (40<=ATTENTE_B)
states: 0
abstracting: (79<=ATTENTE_A)
states: 0
abstracting: (82<=sum(CONTROLEUR_2, CONTROLEUR_1))
states: 0
.abstracting: (SORTI_A<=ROUTE_B)
states: 2,882,212 (6)
abstracting: (ATTENTE_A<=77)
states: 6,732,570 (6)
abstracting: (SORTI_A<=ROUTE_B)
states: 2,882,212 (6)
abstracting: (SORTI_A<=ROUTE_B)
states: 2,882,212 (6)
.
EG iterations: 1
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=ATTENTE_B)
states: 6,679,616 (6)
abstracting: (ROUTE_B<=95)
states: 6,732,570 (6)

EG iterations: 0
abstracting: (ROUTE_B<=28)
states: 6,732,570 (6)
abstracting: (50<=CAPACITE)
states: 0
abstracting: (ROUTE_B<=28)
states: 6,732,570 (6)
abstracting: (ROUTE_B<=28)
states: 6,732,570 (6)
.
EG iterations: 1
abstracting: (ATTENTE_A<=ROUTE_A)
states: 3,542,615 (6)
.-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m14.891sec

checking: E [AG [E [[[EX [ATTENTE_A<=sum(NB_ATTENTE_B_20, NB_ATTENTE_B_19, NB_ATTENTE_B_18, NB_ATTENTE_B_17, NB_ATTENTE_B_16, NB_ATTENTE_B_15, NB_ATTENTE_B_14, NB_ATTENTE_B_13, NB_ATTENTE_B_12, NB_ATTENTE_B_11, NB_ATTENTE_B_10, NB_ATTENTE_B_9, NB_ATTENTE_B_8, NB_ATTENTE_B_7, NB_ATTENTE_B_6, NB_ATTENTE_B_5, NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)] & [ROUTE_B<=22 & SUR_PONT_B<=66]] & ~ [SORTI_A<=sum(CHOIX_2, CHOIX_1)]] U EF [[sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=56 | sum(VIDANGE_2, VIDANGE_1)<=1]]]] U ~ [1<=sum(NB_ATTENTE_B_20, NB_ATTENTE_B_19, NB_ATTENTE_B_18, NB_ATTENTE_B_17, NB_ATTENTE_B_16, NB_ATTENTE_B_15, NB_ATTENTE_B_14, NB_ATTENTE_B_13, NB_ATTENTE_B_12, NB_ATTENTE_B_11, NB_ATTENTE_B_10, NB_ATTENTE_B_9, NB_ATTENTE_B_8, NB_ATTENTE_B_7, NB_ATTENTE_B_6, NB_ATTENTE_B_5, NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]]
normalized: E [~ [E [true U ~ [E [[~ [SORTI_A<=sum(CHOIX_2, CHOIX_1)] & [[ROUTE_B<=22 & SUR_PONT_B<=66] & EX [ATTENTE_A<=sum(NB_ATTENTE_B_20, NB_ATTENTE_B_19, NB_ATTENTE_B_18, NB_ATTENTE_B_17, NB_ATTENTE_B_16, NB_ATTENTE_B_15, NB_ATTENTE_B_14, NB_ATTENTE_B_13, NB_ATTENTE_B_12, NB_ATTENTE_B_11, NB_ATTENTE_B_10, NB_ATTENTE_B_9, NB_ATTENTE_B_8, NB_ATTENTE_B_7, NB_ATTENTE_B_6, NB_ATTENTE_B_5, NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]]] U E [true U [sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=56 | sum(VIDANGE_2, VIDANGE_1)<=1]]]]]] U ~ [1<=sum(NB_ATTENTE_B_20, NB_ATTENTE_B_19, NB_ATTENTE_B_18, NB_ATTENTE_B_17, NB_ATTENTE_B_16, NB_ATTENTE_B_15, NB_ATTENTE_B_14, NB_ATTENTE_B_13, NB_ATTENTE_B_12, NB_ATTENTE_B_11, NB_ATTENTE_B_10, NB_ATTENTE_B_9, NB_ATTENTE_B_8, NB_ATTENTE_B_7, NB_ATTENTE_B_6, NB_ATTENTE_B_5, NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]]

abstracting: (1<=sum(NB_ATTENTE_B_20, NB_ATTENTE_B_19, NB_ATTENTE_B_18, NB_ATTENTE_B_17, NB_ATTENTE_B_16, NB_ATTENTE_B_15, NB_ATTENTE_B_14, NB_ATTENTE_B_13, NB_ATTENTE_B_12, NB_ATTENTE_B_11, NB_ATTENTE_B_10, NB_ATTENTE_B_9, NB_ATTENTE_B_8, NB_ATTENTE_B_7, NB_ATTENTE_B_6, NB_ATTENTE_B_5, NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0))
states: 6,732,570 (6)
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=1)
states: 6,732,570 (6)
abstracting: (sum(NB_ATTENTE_A_20, NB_ATTENTE_A_19, NB_ATTENTE_A_18, NB_ATTENTE_A_17, NB_ATTENTE_A_16, NB_ATTENTE_A_15, NB_ATTENTE_A_14, NB_ATTENTE_A_13, NB_ATTENTE_A_12, NB_ATTENTE_A_11, NB_ATTENTE_A_10, NB_ATTENTE_A_9, NB_ATTENTE_A_8, NB_ATTENTE_A_7, NB_ATTENTE_A_6, NB_ATTENTE_A_5, NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=56)
states: 6,732,570 (6)
abstracting: (ATTENTE_A<=sum(NB_ATTENTE_B_20, NB_ATTENTE_B_19, NB_ATTENTE_B_18, NB_ATTENTE_B_17, NB_ATTENTE_B_16, NB_ATTENTE_B_15, NB_ATTENTE_B_14, NB_ATTENTE_B_13, NB_ATTENTE_B_12, NB_ATTENTE_B_11, NB_ATTENTE_B_10, NB_ATTENTE_B_9, NB_ATTENTE_B_8, NB_ATTENTE_B_7, NB_ATTENTE_B_6, NB_ATTENTE_B_5, NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0))
states: 1,401,039 (6)
.abstracting: (SUR_PONT_B<=66)
states: 6,732,570 (6)
abstracting: (ROUTE_B<=22)
states: 6,732,570 (6)
abstracting: (SORTI_A<=sum(CHOIX_2, CHOIX_1))
states: 404,517 (5)
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m41.073sec

checking: EG [E [~ [NB_ATTENTE_A_19<=17] U AF [EG [AX [2<=COMPTEUR_0]]]]]
normalized: EG [E [~ [NB_ATTENTE_A_19<=17] U ~ [EG [~ [EG [~ [EX [~ [2<=COMPTEUR_0]]]]]]]]]

abstracting: (2<=COMPTEUR_0)
states: 0
..
EG iterations: 1
..........................................
before gc: list nodes free: 55874625

after gc: idd nodes used:5919023, unused:58080977; list nodes free:405455364
..............................................................
before gc: list nodes free: 536625

after gc: idd nodes used:6359670, unused:57640330; list nodes free:421895321
.........................................................
before gc: list nodes free: 37750429

after gc: idd nodes used:5647769, unused:58352231; list nodes free:429689291
.........................................................................................................................
EG iterations: 282
abstracting: (NB_ATTENTE_A_19<=17)
states: 6,732,570 (6)

EG iterations: 0
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 16m 7.733sec

checking: ~ [EF [EF [[COMPTEUR_4<=20 & [~ [E [NB_ATTENTE_A_8<=COMPTEUR_2 U NB_ATTENTE_A_11<=COMPTEUR_9]] & A [NB_ATTENTE_A_7<=15 U ROUTE_A<=NB_ATTENTE_B_20]]]]]]
normalized: ~ [E [true U E [true U [COMPTEUR_4<=20 & [[~ [EG [~ [ROUTE_A<=NB_ATTENTE_B_20]]] & ~ [E [~ [ROUTE_A<=NB_ATTENTE_B_20] U [~ [NB_ATTENTE_A_7<=15] & ~ [ROUTE_A<=NB_ATTENTE_B_20]]]]] & ~ [E [NB_ATTENTE_A_8<=COMPTEUR_2 U NB_ATTENTE_A_11<=COMPTEUR_9]]]]]]]

abstracting: (NB_ATTENTE_A_11<=COMPTEUR_9)
states: 6,502,220 (6)
abstracting: (NB_ATTENTE_A_8<=COMPTEUR_2)
states: 6,374,121 (6)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16394036 kB
MemFree: 3394644 kB
After kill :
MemTotal: 16394036 kB
MemFree: 16180912 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.001sec

432177 471634 483487 462714 451035
iterations count:558285 (1018), effective:9187 (16)

initing FirstDep: 0m 0.001sec


net_ddint.h:600: Timeout: after 237 sec

512925 655270 667548 660895 743123 819162 890867 968328 1059719 1121766 1173608 1219410 1255074 1285152 1310242 1330275 1351839 1359460
iterations count:1836082 (3350), effective:9902 (18)
580774 721297 810178 887990 957192 1021196 1074684 1122528 1164918 1220380 1253440 1278587 1296202 1308060
iterations count:1406890 (2567), effective:7181 (13)

iterations count:548 (1), effective:0 (0)
448275 543240 633442 769426 859508 939562 1009289 1073820 1127253 1175068 1217452 1271057 1305201 1330242 1348431 1360476
iterations count:1609645 (2937), effective:8408 (15)

iterations count:548 (1), effective:0 (0)
1333871
iterations count:165618 (302), effective:894 (1)

iterations count:45171 (82), effective:393 (0)

net_ddint.h:600: Timeout: after 252 sec


iterations count:12155 (22), effective:270 (0)

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

net_ddint.h:600: Timeout: after 268 sec


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

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

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

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

net_ddint.h:600: Timeout: after 241 sec


iterations count:7005 (12), effective:47 (0)

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

iterations count:38227 (69), effective:208 (0)

iterations count:1008 (1), effective:46 (0)

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

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

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

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

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

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

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

iterations count:548 (1), effective:0 (0)
1351602
iterations count:131126 (239), effective:913 (1)

iterations count:548 (1), effective:0 (0)
1275099 1284503 1293325 1299895 1309526 1319002 1328029 1334808 1344488 1357347
iterations count:1033586 (1886), effective:4457 (8)

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

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

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

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

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

iterations count:45171 (82), effective:393 (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="BridgeAndVehicles-PT-V20P20N10"
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 BridgeAndVehicles-PT-V20P20N10, 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 r033-tajo-167813685700201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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