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)
..................
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 95K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 278K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 150K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 359 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 87K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 230K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 4.1M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is BridgeAndVehicles-PT-V80P50N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-ebro-152646312500381
=====================================================================

--------------------
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-V80P50N20-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527044907906


BK_STOP 1527045916859

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-V80P50N20 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1405048, 'Memory': 15936.98, 'Tool': 'lola'}, {'Time': 3427826, 'Memory': 15950.02, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-PT-V80P50N20...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V80P50N20: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-PT-V80P50N20 @ 3540 seconds
----- Start make result stderr -----
----- 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: 3926/65536 symbol table entries, 230 collisions
lola: preprocessing...
lola: finding significant places
lola: 198 places, 3728 transitions, 191 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4253 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: A (G ((CHOIX_1 + CHOIX_2 <= 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_51 + NB_ATTENTE_B_52 + NB_ATTENTE_B_53 + NB_ATTENTE_B_54 + NB_ATTENTE_B_55 + NB_ATTENTE_B_56 + NB_ATTENTE_B_57 + NB_ATTENTE_B_58 + NB_ATTENTE_B_59 + NB_ATTENTE_B_60 + NB_ATTENTE_B_61 + NB_ATTENTE_B_62 + NB_ATTENTE_B_63 + NB_ATTENTE_B_64 + NB_ATTENTE_B_65 + NB_ATTENTE_B_66 + NB_ATTENTE_B_67 + NB_ATTENTE_B_68 + NB_ATTENTE_B_69 + NB_ATTENTE_B_70 + NB_ATTENTE_B_71 + NB_ATTENTE_B_72 + NB_ATTENTE_B_73 + NB_ATTENTE_B_74 + NB_ATTENTE_B_75 + NB_ATTENTE_B_76 + NB_ATTENTE_B_77 + NB_ATTENTE_B_78 + NB_ATTENTE_B_79 + NB_ATTENTE_B_80 + 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 (F (A (X ((3 <= SUR_PONT_B))))) AND (A (X (((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 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80 <= ATTENTE_A) OR (ATTENTE_A <= ROUTE_A)))) OR NOT(A (G ((1 <= 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 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80)))))) : A (F (A (((CAPACITE <= VIDANGE_1 + VIDANGE_2) U (3 <= SORTI_A))))) : (A (X (A (F ((ROUTE_B <= SORTI_A))))) OR E (G (((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= SUR_PONT_A) OR ((3 <= ATTENTE_A) AND (CHOIX_1 + CHOIX_2 <= SUR_PONT_B)))))) : NOT((((3 <= SUR_PONT_B) AND (3 <= SUR_PONT_A)) OR NOT(E (G ((SORTI_B <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)))))) : (E ((((1 <= CHOIX_1 + CHOIX_2) OR (3 <= SUR_PONT_B)) U (ROUTE_B + 1 <= SUR_PONT_B))) AND E ((((2 <= ROUTE_B) OR (SUR_PONT_A <= CONTROLEUR_1 + CONTROLEUR_2)) U ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_A) AND (1 <= ROUTE_A))))) : E (F (NOT(A (X ((ATTENTE_B <= ROUTE_A)))))) : E (F (A (G (((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= SORTI_A) AND (1 <= CAPACITE)))))) : (NOT(NOT(A (F ((3 <= NB_ATTENTE_A_36))))) OR (3 <= NB_ATTENTE_B_1)) : (E (X ((2 <= CONTROLEUR_1))) OR E (X (A (G ((NB_ATTENTE_A_42 <= NB_ATTENTE_B_41)))))) : A (F ((CAPACITE <= NB_ATTENTE_A_25))) : E (F (E (F ((3 <= NB_ATTENTE_B_25))))) : E (G ((CONTROLEUR_1 <= NB_ATTENTE_B_78))) : E (F (NOT(E (F ((1 <= NB_ATTENTE_A_68)))))) : ((A (F ((NB_ATTENTE_B_30 <= 2))) AND E (X (((NB_ATTENTE_A_17 <= NB_ATTENTE_A_63) AND (NB_ATTENTE_A_22 <= NB_ATTENTE_B_3))))) AND E (F (((NB_ATTENTE_A_48 + 1 <= NB_ATTENTE_B_54) AND (NB_ATTENTE_B_28 <= NB_ATTENTE_A_49))))) : E (F ((A (X ((NB_ATTENTE_A_68 <= NB_ATTENTE_A_75))) AND (NB_ATTENTE_A_39 + 1 <= NB_ATTENTE_A_68))))
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 (G ((CHOIX_1 + CHOIX_2 <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N20-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= SUR_PONT_B))))) AND (A (X (((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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= SUR_PONT_B)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= SUR_PONT_B)))
lola: processed formula length: 31
lola: 5 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 153573 markings, 418004 edges, 30715 markings/sec, 0 secs
lola: 293399 markings, 799693 edges, 27965 markings/sec, 5 secs
lola: 435827 markings, 1188441 edges, 28486 markings/sec, 10 secs
lola: 581149 markings, 1587226 edges, 29064 markings/sec, 15 secs
lola: 725052 markings, 1982405 edges, 28781 markings/sec, 20 secs
lola: 866953 markings, 2372136 edges, 28380 markings/sec, 25 secs
lola: 1007009 markings, 2756558 edges, 28011 markings/sec, 30 secs
lola: 1150660 markings, 3151268 edges, 28730 markings/sec, 35 secs
lola: 1291868 markings, 3539528 edges, 28242 markings/sec, 40 secs
lola: 1432727 markings, 3926663 edges, 28172 markings/sec, 45 secs
lola: 1572059 markings, 4308911 edges, 27866 markings/sec, 50 secs
lola: 1706269 markings, 4677559 edges, 26842 markings/sec, 55 secs
lola: 1848239 markings, 5067870 edges, 28394 markings/sec, 60 secs
lola: 1988844 markings, 5454554 edges, 28121 markings/sec, 65 secs
lola: 2126046 markings, 5831237 edges, 27440 markings/sec, 70 secs
lola: 2258530 markings, 6195393 edges, 26497 markings/sec, 75 secs
lola: 2395995 markings, 6572762 edges, 27493 markings/sec, 80 secs
lola: 2531414 markings, 6944956 edges, 27084 markings/sec, 85 secs
lola: 2669351 markings, 7323937 edges, 27587 markings/sec, 90 secs
lola: 2810865 markings, 7713072 edges, 28303 markings/sec, 95 secs
lola: 2951172 markings, 8098946 edges, 28061 markings/sec, 100 secs
lola: 3079590 markings, 8551504 edges, 25684 markings/sec, 105 secs
lola: 3200705 markings, 8970210 edges, 24223 markings/sec, 110 secs
lola: 3320859 markings, 9380288 edges, 24031 markings/sec, 115 secs
lola: 3437665 markings, 9778335 edges, 23361 markings/sec, 120 secs
lola: 3562505 markings, 10214989 edges, 24968 markings/sec, 125 secs
lola: 3698622 markings, 10703429 edges, 27223 markings/sec, 130 secs
lola: 3830753 markings, 11174079 edges, 26426 markings/sec, 135 secs
lola: 3965054 markings, 11651959 edges, 26860 markings/sec, 140 secs
lola: 4098475 markings, 12127816 edges, 26684 markings/sec, 145 secs
lola: 4230736 markings, 12599012 edges, 26452 markings/sec, 150 secs
lola: 4357813 markings, 13047776 edges, 25415 markings/sec, 155 secs
lola: 4488963 markings, 13514704 edges, 26230 markings/sec, 160 secs
lola: 4618433 markings, 13979420 edges, 25894 markings/sec, 165 secs
lola: 4741078 markings, 14410804 edges, 24529 markings/sec, 170 secs
lola: 4871705 markings, 14879836 edges, 26125 markings/sec, 175 secs
lola: 5002315 markings, 15349498 edges, 26122 markings/sec, 180 secs
lola: 5138388 markings, 15838058 edges, 27215 markings/sec, 185 secs
lola: 5275212 markings, 16329859 edges, 27365 markings/sec, 190 secs
lola: 5411530 markings, 16820880 edges, 27264 markings/sec, 195 secs
lola: 5549734 markings, 17319578 edges, 27641 markings/sec, 200 secs
lola: 5687710 markings, 17817919 edges, 27595 markings/sec, 205 secs
lola: 5825190 markings, 18313894 edges, 27496 markings/sec, 210 secs
lola: 5959112 markings, 18796360 edges, 26784 markings/sec, 215 secs
lola: 6093288 markings, 19279579 edges, 26835 markings/sec, 220 secs
lola: 6229134 markings, 19769342 edges, 27169 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((CAPACITE <= VIDANGE_1 + VIDANGE_2) U (3 <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((CAPACITE <= VIDANGE_1 + VIDANGE_2) U (3 <= SORTI_A)))
lola: processed formula length: 65
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 202818 markings, 804167 edges, 3538169319433175040 markings/sec, 0 secs
lola: 405291 markings, 1615848 edges, 40495 markings/sec, 5 secs
lola: 607528 markings, 2426588 edges, 40447 markings/sec, 10 secs
lola: 833353 markings, 3251152 edges, 45165 markings/sec, 15 secs
lola: 1073818 markings, 4066327 edges, 48093 markings/sec, 20 secs
lola: 1279333 markings, 4791193 edges, 41103 markings/sec, 25 secs
lola: 1457691 markings, 5572677 edges, 35672 markings/sec, 30 secs
lola: 1637078 markings, 6356942 edges, 35877 markings/sec, 35 secs
lola: 1820977 markings, 7150134 edges, 36780 markings/sec, 40 secs
lola: 2006607 markings, 7941567 edges, 37126 markings/sec, 45 secs
lola: 2188710 markings, 8704632 edges, 36421 markings/sec, 50 secs
lola: 2363532 markings, 9410306 edges, 34964 markings/sec, 55 secs
lola: 2539413 markings, 10106262 edges, 35176 markings/sec, 60 secs
lola: 2719895 markings, 10807635 edges, 36096 markings/sec, 65 secs
lola: 2903268 markings, 11575962 edges, 36675 markings/sec, 70 secs
lola: 3092717 markings, 12347689 edges, 37890 markings/sec, 75 secs
lola: 3274355 markings, 13036818 edges, 36328 markings/sec, 80 secs
lola: 3460120 markings, 13721788 edges, 37153 markings/sec, 85 secs
lola: 3645090 markings, 14441685 edges, 36994 markings/sec, 90 secs
lola: 3838043 markings, 15216065 edges, 38591 markings/sec, 95 secs
lola: 4029273 markings, 15927918 edges, 38246 markings/sec, 100 secs
lola: 4215615 markings, 16573275 edges, 37268 markings/sec, 105 secs
lola: 4397617 markings, 17296133 edges, 36400 markings/sec, 110 secs
lola: 4590004 markings, 18046323 edges, 38477 markings/sec, 115 secs
lola: 4766613 markings, 18619408 edges, 35322 markings/sec, 120 secs
lola: 4937658 markings, 19294181 edges, 34209 markings/sec, 125 secs
lola: 5124271 markings, 19988563 edges, 37323 markings/sec, 130 secs
lola: 5300044 markings, 20548964 edges, 35155 markings/sec, 135 secs
lola: 5470778 markings, 21256455 edges, 34147 markings/sec, 140 secs
lola: 5667196 markings, 21919019 edges, 39284 markings/sec, 145 secs
lola: 5834911 markings, 22527501 edges, 33543 markings/sec, 150 secs
lola: 6024832 markings, 23251943 edges, 37984 markings/sec, 155 secs
lola: 6195861 markings, 23948094 edges, 34206 markings/sec, 160 secs
lola: 6382863 markings, 24558405 edges, 37400 markings/sec, 165 secs
lola: 6561224 markings, 25251480 edges, 35672 markings/sec, 170 secs
lola: 6751459 markings, 25896104 edges, 38047 markings/sec, 175 secs
lola: 6927047 markings, 26544576 edges, 35118 markings/sec, 180 secs
lola: 7121736 markings, 27223583 edges, 38938 markings/sec, 185 secs
lola: 7296039 markings, 27838024 edges, 34861 markings/sec, 190 secs
lola: 7497461 markings, 28562565 edges, 40284 markings/sec, 195 secs
lola: 7670446 markings, 29138647 edges, 34597 markings/sec, 200 secs
lola: 7876388 markings, 29877013 edges, 41188 markings/sec, 205 secs
lola: 8054865 markings, 30451421 edges, 35695 markings/sec, 210 secs
lola: 8255810 markings, 31180563 edges, 40189 markings/sec, 215 secs
lola: 8439961 markings, 31759317 edges, 36830 markings/sec, 220 secs
lola: 8639184 markings, 32488388 edges, 39845 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((ROUTE_B <= SORTI_A))))) OR E (G (((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= SUR_PONT_A) OR ((3 <= ATTENTE_A) AND (CHOIX_1 + CHOIX_2 <= SUR_PONT_B))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((ROUTE_B <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (ROUTE_B <= SORTI_A)))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 287147 markings, 773253 edges, 3111071174449168384 markings/sec, 0 secs
lola: 552619 markings, 1555163 edges, 53094 markings/sec, 5 secs
lola: 787739 markings, 2413760 edges, 47024 markings/sec, 10 secs
lola: 1020199 markings, 3268108 edges, 46492 markings/sec, 15 secs
lola: 1248095 markings, 4097891 edges, 45579 markings/sec, 20 secs
lola: 1473290 markings, 4925602 edges, 45039 markings/sec, 25 secs
lola: 1702531 markings, 5759662 edges, 45848 markings/sec, 30 secs
lola: 1924030 markings, 6575545 edges, 44300 markings/sec, 35 secs
lola: 2152876 markings, 7407150 edges, 45769 markings/sec, 40 secs
lola: 2381305 markings, 8247710 edges, 45686 markings/sec, 45 secs
lola: 2612612 markings, 9088549 edges, 46261 markings/sec, 50 secs
lola: 2839710 markings, 9922586 edges, 45420 markings/sec, 55 secs
lola: 3068230 markings, 10755216 edges, 45704 markings/sec, 60 secs
lola: 3293875 markings, 11583207 edges, 45129 markings/sec, 65 secs
lola: 3523960 markings, 12421568 edges, 46017 markings/sec, 70 secs
lola: 3750341 markings, 13253986 edges, 45276 markings/sec, 75 secs
lola: 3982633 markings, 14100472 edges, 46458 markings/sec, 80 secs
lola: 4213690 markings, 14946953 edges, 46211 markings/sec, 85 secs
lola: 4440739 markings, 15778819 edges, 45410 markings/sec, 90 secs
lola: 4666655 markings, 16603671 edges, 45183 markings/sec, 95 secs
lola: 4891494 markings, 17433622 edges, 44968 markings/sec, 100 secs
lola: 5123193 markings, 18273503 edges, 46340 markings/sec, 105 secs
lola: 5348848 markings, 19104720 edges, 45131 markings/sec, 110 secs
lola: 5582663 markings, 19954953 edges, 46763 markings/sec, 115 secs
lola: 5816148 markings, 20815040 edges, 46697 markings/sec, 120 secs
lola: 6048937 markings, 21659787 edges, 46558 markings/sec, 125 secs
lola: 6272465 markings, 22482342 edges, 44706 markings/sec, 130 secs
lola: 6503079 markings, 23318112 edges, 46123 markings/sec, 135 secs
lola: 6723952 markings, 24131477 edges, 44175 markings/sec, 140 secs
lola: 6950674 markings, 24951939 edges, 45344 markings/sec, 145 secs
lola: 7167215 markings, 25747135 edges, 43308 markings/sec, 150 secs
lola: 7389703 markings, 26548914 edges, 44498 markings/sec, 155 secs
lola: 7605146 markings, 27340489 edges, 43089 markings/sec, 160 secs
lola: 7826198 markings, 28135420 edges, 44210 markings/sec, 165 secs
lola: 8053146 markings, 28962669 edges, 45390 markings/sec, 170 secs
lola: 8279720 markings, 29772902 edges, 45315 markings/sec, 175 secs
lola: 8520970 markings, 30648368 edges, 48250 markings/sec, 180 secs
lola: 8748055 markings, 31454181 edges, 45417 markings/sec, 185 secs
lola: 8977995 markings, 32281031 edges, 45988 markings/sec, 190 secs
lola: 9199634 markings, 33075277 edges, 44328 markings/sec, 195 secs
lola: 9427898 markings, 33873300 edges, 45653 markings/sec, 200 secs
lola: 9652078 markings, 34681175 edges, 44836 markings/sec, 205 secs
lola: 9877956 markings, 35469910 edges, 45176 markings/sec, 210 secs
lola: 10114068 markings, 36312086 edges, 47222 markings/sec, 215 secs
lola: 10338796 markings, 37144064 edges, 44946 markings/sec, 220 secs
lola: 10559297 markings, 37907942 edges, 44100 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((3 <= SUR_PONT_B) AND (3 <= SUR_PONT_A)) OR NOT(E (G ((SORTI_B <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + 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 a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((SUR_PONT_B <= 2) OR (SUR_PONT_A <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((SUR_PONT_B <= 2) OR (SUR_PONT_A <= 2))
lola: processed formula length: 41
lola: 8 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: processed formula with 2 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((SORTI_B <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + 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 CTL
lola: processed formula: NOT(A(TRUE U (COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + 1 <= SORTI_B)))
lola: processed formula length: 313
lola: 10 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 218265 markings, 532016 edges, 2977818336622018560 markings/sec, 0 secs
lola: 435350 markings, 1071419 edges, 43417 markings/sec, 5 secs
lola: 643102 markings, 1586520 edges, 41550 markings/sec, 10 secs
lola: 854731 markings, 2112612 edges, 42326 markings/sec, 15 secs
lola: 1085783 markings, 2718747 edges, 46210 markings/sec, 20 secs
lola: 1319790 markings, 3344119 edges, 46801 markings/sec, 25 secs
lola: 1556128 markings, 3887750 edges, 47268 markings/sec, 30 secs
lola: 1792380 markings, 4519167 edges, 47250 markings/sec, 35 secs
lola: 2021246 markings, 5119411 edges, 45773 markings/sec, 40 secs
lola: 2258795 markings, 5676283 edges, 47510 markings/sec, 45 secs
lola: 2494091 markings, 6305117 edges, 47059 markings/sec, 50 secs
lola: 2728689 markings, 6897693 edges, 46920 markings/sec, 55 secs
lola: 2972269 markings, 7492481 edges, 48716 markings/sec, 60 secs
lola: 3208052 markings, 8122809 edges, 47157 markings/sec, 65 secs
lola: 3440982 markings, 8688714 edges, 46586 markings/sec, 70 secs
lola: 3671401 markings, 9269076 edges, 46084 markings/sec, 75 secs
lola: 3903828 markings, 9890519 edges, 46485 markings/sec, 80 secs
lola: 4140472 markings, 10454623 edges, 47329 markings/sec, 85 secs
lola: 4380358 markings, 11070868 edges, 47977 markings/sec, 90 secs
lola: 4618948 markings, 11708772 edges, 47718 markings/sec, 95 secs
lola: 4853052 markings, 12252219 edges, 46821 markings/sec, 100 secs
lola: 5089284 markings, 12871277 edges, 47246 markings/sec, 105 secs
lola: 5326242 markings, 13504941 edges, 47392 markings/sec, 110 secs
lola: 5562853 markings, 14047792 edges, 47322 markings/sec, 115 secs
lola: 5799299 markings, 14673340 edges, 47289 markings/sec, 120 secs
lola: 6035597 markings, 15305209 edges, 47260 markings/sec, 125 secs
lola: 6272055 markings, 15846000 edges, 47292 markings/sec, 130 secs
lola: 6510942 markings, 16478502 edges, 47777 markings/sec, 135 secs
lola: 6751116 markings, 17120818 edges, 48035 markings/sec, 140 secs
lola: 6991549 markings, 17670358 edges, 48087 markings/sec, 145 secs
lola: 7228802 markings, 18298952 edges, 47451 markings/sec, 150 secs
lola: 7464295 markings, 18929010 edges, 47099 markings/sec, 155 secs
lola: 7697344 markings, 19469204 edges, 46610 markings/sec, 160 secs
lola: 7932280 markings, 20079693 edges, 46987 markings/sec, 165 secs
lola: 8171414 markings, 20719566 edges, 47827 markings/sec, 170 secs
lola: 8409936 markings, 21286254 edges, 47704 markings/sec, 175 secs
lola: 8650778 markings, 21899468 edges, 48168 markings/sec, 180 secs
lola: 8890905 markings, 22542014 edges, 48025 markings/sec, 185 secs
lola: 9124352 markings, 23110630 edges, 46689 markings/sec, 190 secs
lola: 9362637 markings, 23700052 edges, 47657 markings/sec, 195 secs
lola: 9599412 markings, 24333730 edges, 47355 markings/sec, 200 secs
lola: 9830295 markings, 24918736 edges, 46177 markings/sec, 205 secs
lola: 10067713 markings, 25481236 edges, 47484 markings/sec, 210 secs
lola: 10302951 markings, 26110767 edges, 47048 markings/sec, 215 secs
lola: 10531416 markings, 26717761 edges, 45693 markings/sec, 220 secs
lola: 10769989 markings, 27253772 edges, 47715 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((1 <= CHOIX_1 + CHOIX_2) OR (3 <= SUR_PONT_B)) U (ROUTE_B + 1 <= SUR_PONT_B))) AND E ((((2 <= ROUTE_B) OR (SUR_PONT_A <= CONTROLEUR_1 + CONTROLEUR_2)) U ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_A) AND (1 <= ROUTE_A)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= CHOIX_1 + CHOIX_2) OR (3 <= SUR_PONT_B)) U (ROUTE_B + 1 <= SUR_PONT_B)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= CHOIX_1 + CHOIX_2) OR (3 <= SUR_PONT_B)) U (ROUTE_B + 1 <= SUR_PONT_B))
lola: processed formula length: 81
lola: 1 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13122 markings, 19521 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 259 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (X ((ATTENTE_B <= ROUTE_A))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((ROUTE_A + 1 <= ATTENTE_B)))
lola: processed formula length: 40
lola: 5 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 81 markings, 80 edges
lola: ========================================
lola: subprocess 7 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= SORTI_A) AND (1 <= CAPACITE))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((SORTI_A + 1 <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) OR (CAPACITE <= 0)))))
lola: processed formula length: 345
lola: 3 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3458 markings, 6460 edges
lola: ========================================
lola: subprocess 8 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(A (F ((3 <= NB_ATTENTE_A_36))))) OR (3 <= NB_ATTENTE_B_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= NB_ATTENTE_A_36)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= NB_ATTENTE_A_36)))
lola: processed formula: A (F ((3 <= NB_ATTENTE_A_36)))
lola: processed formula length: 30
lola: 6 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 768 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 658 markings, 658 edges
lola: ========================================
lola: subprocess 9 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= NB_ATTENTE_B_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= NB_ATTENTE_B_1)
lola: processed formula length: 21
lola: 6 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((2 <= CONTROLEUR_1))) OR E (X (A (G ((NB_ATTENTE_A_42 <= NB_ATTENTE_B_41))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= CONTROLEUR_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= CONTROLEUR_1))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((NB_ATTENTE_A_42 <= NB_ATTENTE_B_41)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (NB_ATTENTE_B_41 + 1 <= NB_ATTENTE_A_42))))
lola: processed formula length: 59
lola: 3 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 115 markings, 115 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CAPACITE <= NB_ATTENTE_A_25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((CAPACITE <= NB_ATTENTE_A_25)))
lola: processed formula: A (F ((CAPACITE <= NB_ATTENTE_A_25)))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 768 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 658 markings, 658 edges
lola: ========================================
lola: subprocess 11 will run for 517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F ((3 <= NB_ATTENTE_B_25)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N20-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 646 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((CONTROLEUR_1 <= NB_ATTENTE_B_78)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NB_ATTENTE_B_78 + 1 <= CONTROLEUR_1)))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 197748 markings, 405798 edges, 3689320832170983424 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 313554 markings, 647941 edges
lola: ========================================
lola: subprocess 13 will run for 858 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F ((1 <= NB_ATTENTE_A_68))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (1 <= NB_ATTENTE_A_68))))
lola: processed formula length: 47
lola: 6 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 658 markings, 1050 edges
lola: ========================================
lola: subprocess 14 will run for 1288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((NB_ATTENTE_B_30 <= 2))) AND E (X (((NB_ATTENTE_A_17 <= NB_ATTENTE_A_63) AND (NB_ATTENTE_A_22 <= NB_ATTENTE_B_3))))) AND E (F (((NB_ATTENTE_A_48 + 1 <= NB_ATTENTE_B_54) AND (NB_ATTENTE_B_28 <= NB_ATTENTE_A_49)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NB_ATTENTE_B_30 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NB_ATTENTE_B_30 <= 2)))
lola: processed formula: A (F ((NB_ATTENTE_B_30 <= 2)))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 768 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2576 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((NB_ATTENTE_A_17 <= NB_ATTENTE_A_63) AND (NB_ATTENTE_A_22 <= NB_ATTENTE_B_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((NB_ATTENTE_A_17 <= NB_ATTENTE_A_63) AND (NB_ATTENTE_A_22 <= NB_ATTENTE_B_3)))
lola: processed formula length: 82
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2576 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((NB_ATTENTE_A_68 <= NB_ATTENTE_A_75))) AND (NB_ATTENTE_A_39 + 1 <= NB_ATTENTE_A_68))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (AX((NB_ATTENTE_A_68 <= NB_ATTENTE_A_75)) AND (NB_ATTENTE_A_39 + 1 <= NB_ATTENTE_A_68)))
lola: processed formula length: 97
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3714 markings, 6768 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown unknown unknown unknown no yes yes no no no no no yes unknown yes
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- 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="BridgeAndVehicles-PT-V80P50N20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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/BridgeAndVehicles-PT-V80P50N20.tgz
mv BridgeAndVehicles-PT-V80P50N20 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is BridgeAndVehicles-PT-V80P50N20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-ebro-152646312500381"
echo "====================================================================="
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
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 ;