fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r088-csrt-149441074500473
Last Updated
June 27, 2017

About the Execution of LoLA for S_BridgeAndVehicles-PT-V50P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8287.860 601802.00 603515.00 57.60 FFFTFFTFFFTT?FTF 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-3254
Executing tool lola
Input is S_BridgeAndVehicles-PT-V50P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074500473
=====================================================================


--------------------
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-V50P20N10-LTLCardinality-0
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-1
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-15
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-2
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-3
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-4
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-5
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-6
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-7
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-8
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496348624381


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_BridgeAndVehicles-PT-V50P20N10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-PT-V50P20N10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_BridgeAndVehicles-PT-V50P20N10 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1456/65536 symbol table entries, 11 collisions
lola: preprocessing...
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: A ((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 <= SUR_PONT_B)) : A (G (X ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B)))) : A ((((2 <= ROUTE_A) U (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B)) U X (F ((CAPACITE <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9))))) : A ((2 <= CONTROLEUR_1 + CONTROLEUR_2)) : A ((((2 <= SORTI_A) U (3 <= CAPACITE)) U F (X ((1 <= SORTI_A))))) : A (X (F (F ((3 <= SORTI_A))))) : A (F (X (F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2)))))) : A ((1 <= ATTENTE_B)) : A (F (F ((3 <= ROUTE_A)))) : A (X ((3 <= VIDANGE_1 + VIDANGE_2))) : A ((1 <= CONTROLEUR_1 + CONTROLEUR_2)) : A ((2 <= CAPACITE)) : A (((CAPACITE <= ROUTE_B) U ((CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2) U (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)))) : A (G (X (((ROUTE_A <= VIDANGE_1 + VIDANGE_2) U (ATTENTE_B <= CHOIX_1 + CHOIX_2))))) : A (F (F ((ATTENTE_B <= ROUTE_A)))) : A (G ((1 <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_... (shortened)
lola: processed formula length: 921
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))))
lola: processed formula: A (G (X ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= ROUTE_A) U (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B)) U X (F ((CAPACITE <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= ROUTE_A) U (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B)) U X (F ((CAPACITE <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)))))
lola: processed formula: A ((((2 <= ROUTE_A) U (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B)) U X (F ((CAPACITE <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B... (shortened)
lola: processed formula length: 992
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= CONTROLEUR_1 + CONTROLEUR_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= CONTROLEUR_1 + CONTROLEUR_2)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= SORTI_A) U (3 <= CAPACITE)) U F (X ((1 <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= SORTI_A) U (3 <= CAPACITE)) U F (X ((1 <= SORTI_A)))))
lola: processed formula: A ((((2 <= SORTI_A) U (3 <= CAPACITE)) U F (X ((1 <= SORTI_A)))))
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 652636 markings, 1735540 edges, 130527 markings/sec, 0 secs
lola: 1309595 markings, 3388827 edges, 131392 markings/sec, 5 secs
lola: 1974035 markings, 4938218 edges, 132888 markings/sec, 10 secs
lola: 2637845 markings, 6390891 edges, 132762 markings/sec, 15 secs
lola: 3336977 markings, 7835745 edges, 139826 markings/sec, 20 secs
lola: 4039742 markings, 9272805 edges, 140553 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((3 <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= SORTI_A))))
lola: processed formula: A (X (F ((3 <= SORTI_A))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 710740 markings, 2005412 edges, 142148 markings/sec, 0 secs
lola: 1339469 markings, 3589713 edges, 125746 markings/sec, 5 secs
lola: 2008587 markings, 5145177 edges, 133824 markings/sec, 10 secs
lola: 2674465 markings, 6601426 edges, 133176 markings/sec, 15 secs
lola: 3330123 markings, 7955902 edges, 131132 markings/sec, 20 secs
lola: 3899406 markings, 9663252 edges, 113857 markings/sec, 25 secs
lola: 4428867 markings, 11354853 edges, 105892 markings/sec, 30 secs
lola: 4931364 markings, 13010389 edges, 100499 markings/sec, 35 secs
lola: 5452774 markings, 14730514 edges, 104282 markings/sec, 40 secs
lola: 5996896 markings, 16517141 edges, 108824 markings/sec, 45 secs
lola: 6532256 markings, 18304479 edges, 107072 markings/sec, 50 secs
lola: 7100131 markings, 20157190 edges, 113575 markings/sec, 55 secs
lola: 7659681 markings, 22034267 edges, 111910 markings/sec, 60 secs
lola: 8229914 markings, 23923788 edges, 114047 markings/sec, 65 secs
lola: 8788329 markings, 25805144 edges, 111683 markings/sec, 70 secs
lola: 9344241 markings, 27717035 edges, 111182 markings/sec, 75 secs
lola: 9917229 markings, 29622666 edges, 114598 markings/sec, 80 secs
lola: 10465325 markings, 31459654 edges, 109619 markings/sec, 85 secs
lola: 10998912 markings, 33221184 edges, 106717 markings/sec, 90 secs
lola: 11487201 markings, 34832323 edges, 97658 markings/sec, 95 secs
lola: 11963636 markings, 36428462 edges, 95287 markings/sec, 100 secs
lola: 12450628 markings, 38061215 edges, 97398 markings/sec, 105 secs
lola: 12966500 markings, 39814513 edges, 103174 markings/sec, 110 secs
lola: 13475161 markings, 41549594 edges, 101732 markings/sec, 115 secs
lola: 13981647 markings, 43271416 edges, 101297 markings/sec, 120 secs
lola: 14487115 markings, 44985587 edges, 101094 markings/sec, 125 secs
lola: 14977764 markings, 46656813 edges, 98130 markings/sec, 130 secs
lola: 15498444 markings, 48467093 edges, 104136 markings/sec, 135 secs
lola: 16049440 markings, 50308030 edges, 110199 markings/sec, 140 secs
lola: 16580959 markings, 52153119 edges, 106304 markings/sec, 145 secs
lola: 17149333 markings, 54095448 edges, 113675 markings/sec, 150 secs
lola: 17673243 markings, 55902410 edges, 104782 markings/sec, 155 secs
lola: 18267471 markings, 57699319 edges, 118846 markings/sec, 160 secs
lola: 18853281 markings, 59752056 edges, 117162 markings/sec, 165 secs
lola: 19422303 markings, 61499249 edges, 113804 markings/sec, 170 secs
lola: 19982689 markings, 63278587 edges, 112077 markings/sec, 175 secs
lola: 20553330 markings, 65099177 edges, 114128 markings/sec, 180 secs
lola: 21139002 markings, 66873268 edges, 117134 markings/sec, 185 secs
lola: 21707331 markings, 68872385 edges, 113666 markings/sec, 190 secs
lola: 22291982 markings, 70669172 edges, 116930 markings/sec, 195 secs
lola: 22828519 markings, 72461469 edges, 107307 markings/sec, 200 secs
lola: 23414547 markings, 74272324 edges, 117206 markings/sec, 205 secs
lola: 24007763 markings, 76075647 edges, 118643 markings/sec, 210 secs
lola: 24575494 markings, 78017389 edges, 113546 markings/sec, 215 secs
lola: 25149100 markings, 79763004 edges, 114721 markings/sec, 220 secs
lola: 25691951 markings, 81668119 edges, 108570 markings/sec, 225 secs
lola: 26262204 markings, 83398349 edges, 114051 markings/sec, 230 secs
lola: 26776756 markings, 85197412 edges, 102910 markings/sec, 235 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2))))))
lola: processed formula: A (F (X (F (G ((ATTENTE_A <= CHOIX_1 + CHOIX_2))))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 550875 markings, 2757524 edges, 110175 markings/sec, 0 secs
lola: 1067427 markings, 5589997 edges, 103310 markings/sec, 5 secs
lola: 1500719 markings, 8372896 edges, 86658 markings/sec, 10 secs
lola: 1925817 markings, 11073759 edges, 85020 markings/sec, 15 secs
lola: 2357023 markings, 13750640 edges, 86241 markings/sec, 20 secs
lola: 2771434 markings, 16458318 edges, 82882 markings/sec, 25 secs
lola: 3193718 markings, 19086262 edges, 84457 markings/sec, 30 secs
lola: 3615736 markings, 21775169 edges, 84404 markings/sec, 35 secs
lola: 4033804 markings, 24538221 edges, 83614 markings/sec, 40 secs
lola: 4454903 markings, 27217857 edges, 84220 markings/sec, 45 secs
lola: 4875713 markings, 29889700 edges, 84162 markings/sec, 50 secs
lola: 5290945 markings, 32630204 edges, 83046 markings/sec, 55 secs
lola: 5700514 markings, 35343984 edges, 81914 markings/sec, 60 secs
lola: 6109789 markings, 37915734 edges, 81855 markings/sec, 65 secs
lola: 6520670 markings, 40577510 edges, 82176 markings/sec, 70 secs
lola: 6926768 markings, 43264265 edges, 81220 markings/sec, 75 secs
lola: 7329276 markings, 45960676 edges, 80502 markings/sec, 80 secs
lola: 7730941 markings, 48525788 edges, 80333 markings/sec, 85 secs
lola: 8134409 markings, 51128762 edges, 80694 markings/sec, 90 secs
lola: 8542660 markings, 53815212 edges, 81650 markings/sec, 95 secs
lola: 8958097 markings, 56608781 edges, 83087 markings/sec, 100 secs
lola: 9368656 markings, 59354640 edges, 82112 markings/sec, 105 secs
lola: 9769438 markings, 61881559 edges, 80156 markings/sec, 110 secs
lola: 10169416 markings, 64500137 edges, 79996 markings/sec, 115 secs
lola: 10581468 markings, 67231136 edges, 82410 markings/sec, 120 secs
lola: 10989213 markings, 69974543 edges, 81549 markings/sec, 125 secs
lola: 11387908 markings, 72661490 edges, 79739 markings/sec, 130 secs
lola: 11799717 markings, 75340751 edges, 82362 markings/sec, 135 secs
lola: 12187045 markings, 77827255 edges, 77466 markings/sec, 140 secs
lola: 12587157 markings, 80482235 edges, 80022 markings/sec, 145 secs
lola: 12993581 markings, 83173290 edges, 81285 markings/sec, 150 secs
lola: 13409472 markings, 86003608 edges, 83178 markings/sec, 155 secs
lola: 13813988 markings, 88740674 edges, 80903 markings/sec, 160 secs
lola: 14213506 markings, 91376722 edges, 79904 markings/sec, 165 secs
lola: 14603648 markings, 93872061 edges, 78028 markings/sec, 170 secs
lola: 15016835 markings, 96557082 edges, 82637 markings/sec, 175 secs
lola: 15421991 markings, 99200618 edges, 81031 markings/sec, 180 secs
lola: 15825461 markings, 101872229 edges, 80694 markings/sec, 185 secs
lola: 16216637 markings, 104483833 edges, 78235 markings/sec, 190 secs
lola: 16616648 markings, 107148026 edges, 80002 markings/sec, 195 secs
lola: 17006706 markings, 109709272 edges, 78012 markings/sec, 200 secs
lola: 17371610 markings, 112088114 edges, 72981 markings/sec, 205 secs
lola: 17788789 markings, 114871578 edges, 83436 markings/sec, 210 secs
lola: 18204490 markings, 117486990 edges, 83140 markings/sec, 215 secs
lola: 18590331 markings, 120045708 edges, 77168 markings/sec, 220 secs
lola: 18976884 markings, 122599551 edges, 77311 markings/sec, 225 secs
lola: 19358056 markings, 125159560 edges, 76234 markings/sec, 230 secs
lola: 19755517 markings, 127805010 edges, 79492 markings/sec, 235 secs
lola: 20154566 markings, 130489123 edges, 79810 markings/sec, 240 secs
lola: 20552758 markings, 133143368 edges, 79638 markings/sec, 245 secs
lola: 20946657 markings, 135799778 edges, 78780 markings/sec, 250 secs
lola: 21346100 markings, 138456778 edges, 79889 markings/sec, 255 secs
lola: 21740627 markings, 140985092 edges, 78905 markings/sec, 260 secs
lola: 22118569 markings, 143498532 edges, 75588 markings/sec, 265 secs
lola: 22496832 markings, 146017385 edges, 75653 markings/sec, 270 secs
lola: 22870162 markings, 148538719 edges, 74666 markings/sec, 275 secs
lola: 23248183 markings, 151087649 edges, 75604 markings/sec, 280 secs
lola: 23641941 markings, 153739473 edges, 78752 markings/sec, 285 secs
lola: 24029963 markings, 156373479 edges, 77604 markings/sec, 290 secs
lola: 24413829 markings, 158978248 edges, 76773 markings/sec, 295 secs
lola: 24804888 markings, 161629423 edges, 78212 markings/sec, 300 secs
lola: 25185261 markings, 164217735 edges, 76075 markings/sec, 305 secs
lola: 25561774 markings, 166649730 edges, 75303 markings/sec, 310 secs
lola: 25944683 markings, 169189793 edges, 76582 markings/sec, 315 secs
lola: 26332631 markings, 171792750 edges, 77590 markings/sec, 320 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= ATTENTE_B))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= ATTENTE_B)
lola: processed formula length: 16
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((3 <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((3 <= ROUTE_A)))
lola: processed formula: A (F ((3 <= ROUTE_A)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 9 will run for 419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= VIDANGE_1 + VIDANGE_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= VIDANGE_1 + VIDANGE_2)))
lola: processed formula: A (X ((3 <= VIDANGE_1 + VIDANGE_2)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 489 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= CONTROLEUR_1 + CONTROLEUR_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= CONTROLEUR_1 + CONTROLEUR_2)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= CAPACITE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= CAPACITE)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 734 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((CAPACITE <= ROUTE_B) U ((CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2) U (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((CAPACITE <= ROUTE_B) U ((CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2) U (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))
lola: processed formula: A (((CAPACITE <= ROUTE_B) U ((CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2) U (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))
lola: processed formula length: 224
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 979 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((ROUTE_A <= VIDANGE_1 + VIDANGE_2) U (ATTENTE_B <= CHOIX_1 + CHOIX_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((ROUTE_A <= VIDANGE_1 + VIDANGE_2) U (ATTENTE_B <= CHOIX_1 + CHOIX_2)))))
lola: processed formula: A (G (X (((ROUTE_A <= VIDANGE_1 + VIDANGE_2) U (ATTENTE_B <= CHOIX_1 + CHOIX_2)))))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((ATTENTE_B <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((ATTENTE_B <= ROUTE_A)))
lola: processed formula: A (F ((ATTENTE_B <= ROUTE_A)))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 2938 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: RESULT
lola:
SUMMARY: no no no no yes yes unknown no yes no no yes no no yes no
lola: ========================================
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496349226183

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

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="S_BridgeAndVehicles-PT-V50P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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/S_BridgeAndVehicles-PT-V50P20N10.tgz
mv S_BridgeAndVehicles-PT-V50P20N10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_BridgeAndVehicles-PT-V50P20N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-csrt-149441074500473"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;