About the Execution of Marcie for BridgeAndVehicles-PT-V04P05N02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3988.430 | 5815.00 | 4940.00 | 99.60 | TFTTTFFTFFTFTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.............
=====================================================================
Generated by BenchKit 2-2270
Executing tool marcie
Input is BridgeAndVehicles-PT-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r190su-smll-143330904700262
=====================================================================
--------------------
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-COL-V04P05N02-CTLCardinality-0
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-1
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-15
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-3
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-4
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-5
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-6
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-7
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-8
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1433548849321
Model: BridgeAndVehicles-PT-V04P05N02
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5
Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 28 NrTr: 52 NrArc: 326)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m3sec
RS generation: 0m0sec
-> reachability set: #nodes 2204 (2.2e+03) #states 2,874 (3)
starting MCC model checker
--------------------------
checking: EG [SUR_PONT_B<=ATTENTE_A]
normalized: EG [SUR_PONT_B<=ATTENTE_A]
abstracting: (SUR_PONT_B<=ATTENTE_A) states: 2,626 (3)
................................
EG iterations: 32
-> the formula is TRUE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: A [AX [ROUTE_A<=SORTI_A] U AF [3<=sum(CONTROLEUR_2, CONTROLEUR_1)]]
normalized: [~ [E [EX [~ [ROUTE_A<=SORTI_A]] U [EX [~ [ROUTE_A<=SORTI_A]] & EG [~ [3<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]]] & ~ [EG [EG [~ [3<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]]]
abstracting: (3<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 0
EG iterations: 0
EG iterations: 0
abstracting: (3<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 0
EG iterations: 0
abstracting: (ROUTE_A<=SORTI_A) states: 1,924 (3)
.abstracting: (ROUTE_A<=SORTI_A) states: 1,924 (3)
.-> the formula is FALSE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[[AG [2<=ATTENTE_B] | EG [SUR_PONT_A<=sum(VIDANGE_2, VIDANGE_1)]] | ROUTE_B<=SUR_PONT_A] & E [~ [ROUTE_A<=sum(CONTROLEUR_2, CONTROLEUR_1)] U [ATTENTE_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) | 3<=SORTI_B]]]
normalized: [E [~ [ROUTE_A<=sum(CONTROLEUR_2, CONTROLEUR_1)] U [ATTENTE_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) | 3<=SORTI_B]] & [ROUTE_B<=SUR_PONT_A | [EG [SUR_PONT_A<=sum(VIDANGE_2, VIDANGE_1)] | ~ [E [true U ~ [2<=ATTENTE_B]]]]]]
abstracting: (2<=ATTENTE_B) states: 1,020 (3)
abstracting: (SUR_PONT_A<=sum(VIDANGE_2, VIDANGE_1)) states: 2,374 (3)
.................................
EG iterations: 33
abstracting: (ROUTE_B<=SUR_PONT_A) states: 1,308 (3)
abstracting: (3<=SORTI_B) states: 574
abstracting: (ATTENTE_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 1,854 (3)
abstracting: (ROUTE_A<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 1,342 (3)
-> the formula is FALSE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [AG [[3<=ROUTE_B & 1<=SORTI_A]]]
normalized: ~ [EG [E [true U ~ [[3<=ROUTE_B & 1<=SORTI_A]]]]]
abstracting: (1<=SORTI_A) states: 2,108 (3)
abstracting: (3<=ROUTE_B) states: 371
EG iterations: 0
-> the formula is FALSE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [AF [[3<=CAPACITE & ~ [ATTENTE_B<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]]]
normalized: EG [~ [[3<=CAPACITE & ~ [ATTENTE_B<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]]]
abstracting: (ATTENTE_B<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 1,854 (3)
abstracting: (3<=CAPACITE) states: 2,874 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EX [[EF [3<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)] | [[sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=SUR_PONT_A | 2<=sum(CHOIX_2, CHOIX_1)] & ~ [1<=SUR_PONT_A]]]]
normalized: EX [[[[sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=SUR_PONT_A | 2<=sum(CHOIX_2, CHOIX_1)] & ~ [1<=SUR_PONT_A]] | E [true U 3<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]]]
abstracting: (3<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 0
abstracting: (1<=SUR_PONT_A) states: 628
abstracting: (2<=sum(CHOIX_2, CHOIX_1)) states: 0
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=SUR_PONT_A) states: 628
.-> the formula is FALSE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [EF [[ROUTE_A<=SUR_PONT_A & ATTENTE_A<=CAPACITE]]]
normalized: EG [E [true U [ROUTE_A<=SUR_PONT_A & ATTENTE_A<=CAPACITE]]]
abstracting: (ATTENTE_A<=CAPACITE) states: 2,866 (3)
abstracting: (ROUTE_A<=SUR_PONT_A) states: 1,323 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) & AG [SUR_PONT_B<=SUR_PONT_B]]]
normalized: ~ [E [true U ~ [[1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) & ~ [E [true U ~ [SUR_PONT_B<=SUR_PONT_B]]]]]]]
abstracting: (SUR_PONT_B<=SUR_PONT_B) states: 2,874 (3)
abstracting: (1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 2,874 (3)
-> the formula is TRUE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [~ [[EF [3<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)] & [[2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) | 1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)] & [sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & SORTI_B<=ATTENTE_B]]]]]
normalized: [E [true U 3<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)] & [[2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) | 1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)] & [sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & SORTI_B<=ATTENTE_B]]]
abstracting: (SORTI_B<=ATTENTE_B) states: 1,577 (3)
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 2,874 (3)
abstracting: (1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 2,874 (3)
abstracting: (2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 0
abstracting: (3<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 0
-> the formula is FALSE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [EG [[1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) | 3<=sum(CHOIX_2, CHOIX_1)]]]
normalized: ~ [E [true U ~ [EG [[1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) | 3<=sum(CHOIX_2, CHOIX_1)]]]]]
abstracting: (3<=sum(CHOIX_2, CHOIX_1)) states: 0
abstracting: (1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 2,874 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [[E [sum(VIDANGE_2, VIDANGE_1)<=ROUTE_B U SORTI_A<=sum(VIDANGE_2, VIDANGE_1)] & [AF [2<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)] | ~ [[1<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) | SUR_PONT_B<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]]]
normalized: ~ [[E [sum(VIDANGE_2, VIDANGE_1)<=ROUTE_B U SORTI_A<=sum(VIDANGE_2, VIDANGE_1)] & [~ [[1<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) | SUR_PONT_B<=sum(CONTROLEUR_2, CONTROLEUR_1)]] | ~ [EG [~ [2<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]]]]]
abstracting: (2<=sum(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
abstracting: (SUR_PONT_B<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 2,376 (3)
abstracting: (1<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 2,874 (3)
abstracting: (SORTI_A<=sum(VIDANGE_2, VIDANGE_1)) states: 967
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=ROUTE_B) states: 2,594 (3)
-> the formula is TRUE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [[EG [1<=ROUTE_A] | sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=SORTI_A]] | EG [EG [sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ATTENTE_B]]]
normalized: [EG [EG [sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ATTENTE_B]] | ~ [[sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=SORTI_A | EG [1<=ROUTE_A]]]]
abstracting: (1<=ROUTE_A) states: 1,775 (3)
....................................................
EG iterations: 52
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=SORTI_A) states: 2,108 (3)
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ATTENTE_B) states: 1,874 (3)
.....................................
EG iterations: 37
.
EG iterations: 1
-> the formula is TRUE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [EG [EX [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=ROUTE_A]]]
normalized: ~ [EG [EX [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=ROUTE_A]]]
abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=ROUTE_A) states: 1,775 (3)
....................................................
EG iterations: 51
-> the formula is TRUE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [AX [EG [ATTENTE_A<=sum(CONTROLEUR_2, CONTROLEUR_1)]] | [E [SUR_PONT_B<=SUR_PONT_B U 3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)] & AX [sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]]
normalized: [~ [EX [~ [EG [ATTENTE_A<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]] | [~ [EX [~ [sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]] & E [SUR_PONT_B<=SUR_PONT_B U 3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]]
abstracting: (3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 0
abstracting: (SUR_PONT_B<=SUR_PONT_B) states: 2,874 (3)
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 2,874 (3)
.abstracting: (ATTENTE_A<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 1,259 (3)
.............................
EG iterations: 29
.-> the formula is FALSE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[AG [[SUR_PONT_B<=sum(CONTROLEUR_2, CONTROLEUR_1) & sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=sum(CHOIX_2, CHOIX_1)]] & [EG [CAPACITE<=SORTI_A] | ~ [[3<=sum(CHOIX_2, CHOIX_1) & 1<=ROUTE_B]]]] | [ROUTE_B<=SORTI_B | E [1<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) U 2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]]
normalized: [[ROUTE_B<=SORTI_B | E [1<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) U 2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]] | [~ [E [true U ~ [[SUR_PONT_B<=sum(CONTROLEUR_2, CONTROLEUR_1) & sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=sum(CHOIX_2, CHOIX_1)]]]] & [EG [CAPACITE<=SORTI_A] | ~ [[3<=sum(CHOIX_2, CHOIX_1) & 1<=ROUTE_B]]]]]
abstracting: (1<=ROUTE_B) states: 1,772 (3)
abstracting: (3<=sum(CHOIX_2, CHOIX_1)) states: 0
abstracting: (CAPACITE<=SORTI_A) states: 68
.........
EG iterations: 9
abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=sum(CHOIX_2, CHOIX_1)) states: 1,321 (3)
abstracting: (SUR_PONT_B<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 2,376 (3)
abstracting: (2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 0
abstracting: (1<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 2,874 (3)
abstracting: (ROUTE_B<=SORTI_B) states: 1,927 (3)
-> the formula is FALSE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [AG [sum(VIDANGE_2, VIDANGE_1)<=CAPACITE] & sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]
normalized: [sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & ~ [E [true U ~ [sum(VIDANGE_2, VIDANGE_1)<=CAPACITE]]]]
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=CAPACITE) states: 2,874 (3)
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 2,874 (3)
-> the formula is TRUE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m5sec
BK_STOP 1433548855136
--------------------
content from stderr:
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: 0m0sec
928 1756
iterations count:2592 (49), effective:176 (3)
initing FirstDep: 0m0sec
iterations count:52 (1), effective:0 (0)
2415
iterations count:1681 (32), effective:94 (1)
2817
iterations count:1091 (20), effective:58 (1)
iterations count:461 (8), effective:19 (0)
iterations count:92 (1), effective:8 (0)
iterations count:562 (10), effective:28 (0)
iterations count:146 (2), effective:6 (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-V04P05N02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is BridgeAndVehicles-PT-V04P05N02, 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 r190su-smll-143330904700262"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 '
echo "FORMULA_NAME $x"
done
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 ;