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 irma4mcc-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 r030-ebro-152646308500381
=====================================================================

--------------------
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 1526771619629


BK_STOP 1526772628782

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

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
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: 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: ========================================
lola: 161370 markings, 439836 edges, 32274 markings/sec, 0 secs
lola: 316533 markings, 862729 edges, 31033 markings/sec, 5 secs
lola: 471883 markings, 1287179 edges, 31070 markings/sec, 10 secs
lola: 629008 markings, 1718605 edges, 31425 markings/sec, 15 secs
lola: 785661 markings, 2149045 edges, 31331 markings/sec, 20 secs
lola: 941275 markings, 2575992 edges, 31123 markings/sec, 25 secs
lola: 1096291 markings, 3002695 edges, 31003 markings/sec, 30 secs
lola: 1244350 markings, 3408671 edges, 29612 markings/sec, 35 secs
lola: 1394733 markings, 3822100 edges, 30077 markings/sec, 40 secs
lola: 1545355 markings, 4235304 edges, 30124 markings/sec, 45 secs
lola: 1696142 markings, 4649707 edges, 30157 markings/sec, 50 secs
lola: 1847314 markings, 5065238 edges, 30234 markings/sec, 55 secs
lola: 1999008 markings, 5482023 edges, 30339 markings/sec, 60 secs
lola: 2150110 markings, 5897953 edges, 30220 markings/sec, 65 secs
lola: 2300486 markings, 6310475 edges, 30075 markings/sec, 70 secs
lola: 2449649 markings, 6720378 edges, 29833 markings/sec, 75 secs
lola: 2600555 markings, 7135557 edges, 30181 markings/sec, 80 secs
lola: 2749373 markings, 7543957 edges, 29764 markings/sec, 85 secs
lola: 2899590 markings, 7957135 edges, 30043 markings/sec, 90 secs
lola: 3038159 markings, 8408044 edges, 27714 markings/sec, 95 secs
lola: 3164716 markings, 8845645 edges, 25311 markings/sec, 100 secs
lola: 3289204 markings, 9272675 edges, 24898 markings/sec, 105 secs
lola: 3412097 markings, 9690451 edges, 24579 markings/sec, 110 secs
lola: 3537564 markings, 10127296 edges, 25093 markings/sec, 115 secs
lola: 3666655 markings, 10585857 edges, 25818 markings/sec, 120 secs
lola: 3796505 markings, 11048850 edges, 25970 markings/sec, 125 secs
lola: 3923573 markings, 11501399 edges, 25414 markings/sec, 130 secs
lola: 4047025 markings, 11941787 edges, 24690 markings/sec, 135 secs
lola: 4180231 markings, 12417390 edges, 26641 markings/sec, 140 secs
lola: 4313223 markings, 12892822 edges, 26598 markings/sec, 145 secs
lola: 4442663 markings, 13351349 edges, 25888 markings/sec, 150 secs
lola: 4573575 markings, 13814999 edges, 26182 markings/sec, 155 secs
lola: 4706172 markings, 14290533 edges, 26519 markings/sec, 160 secs
lola: 4833692 markings, 14741269 edges, 25504 markings/sec, 165 secs
lola: 4967665 markings, 15226315 edges, 26795 markings/sec, 170 secs
lola: 5100036 markings, 15705042 edges, 26474 markings/sec, 175 secs
lola: 5227581 markings, 16165542 edges, 25509 markings/sec, 180 secs
lola: 5358010 markings, 16636530 edges, 26086 markings/sec, 185 secs
lola: 5486520 markings, 17099916 edges, 25702 markings/sec, 190 secs
lola: 5614152 markings, 17559695 edges, 25526 markings/sec, 195 secs
lola: 5741451 markings, 18018019 edges, 25460 markings/sec, 200 secs
lola: 5868425 markings, 18474891 edges, 25395 markings/sec, 205 secs
lola: 5995858 markings, 18933176 edges, 25487 markings/sec, 210 secs
lola: 6123084 markings, 19390702 edges, 25445 markings/sec, 215 secs
lola: 6247027 markings, 19830514 edges, 24789 markings/sec, 220 secs
lola: 6373061 markings, 20266355 edges, 25207 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: 205483 markings, 814898 edges, 3538169319433175040 markings/sec, 0 secs
lola: 409426 markings, 1632499 edges, 40789 markings/sec, 5 secs
lola: 612236 markings, 2445351 edges, 40562 markings/sec, 10 secs
lola: 838924 markings, 3270475 edges, 45338 markings/sec, 15 secs
lola: 1079151 markings, 4084053 edges, 48045 markings/sec, 20 secs
lola: 1282375 markings, 4802319 edges, 40645 markings/sec, 25 secs
lola: 1463360 markings, 5596166 edges, 36197 markings/sec, 30 secs
lola: 1645376 markings, 6390504 edges, 36403 markings/sec, 35 secs
lola: 1829104 markings, 7181801 edges, 36746 markings/sec, 40 secs
lola: 2014649 markings, 7971874 edges, 37109 markings/sec, 45 secs
lola: 2200478 markings, 8755432 edges, 37166 markings/sec, 50 secs
lola: 2378829 markings, 9477554 edges, 35670 markings/sec, 55 secs
lola: 2558303 markings, 10191118 edges, 35895 markings/sec, 60 secs
lola: 2741323 markings, 10905653 edges, 36604 markings/sec, 65 secs
lola: 2925612 markings, 11647370 edges, 36858 markings/sec, 70 secs
lola: 3117052 markings, 12428717 edges, 38288 markings/sec, 75 secs
lola: 3306180 markings, 13181291 edges, 37826 markings/sec, 80 secs
lola: 3489454 markings, 13851443 edges, 36655 markings/sec, 85 secs
lola: 3676076 markings, 14527073 edges, 37324 markings/sec, 90 secs
lola: 3861800 markings, 15291877 edges, 37145 markings/sec, 95 secs
lola: 4049385 markings, 16020239 edges, 37517 markings/sec, 100 secs
lola: 4233397 markings, 16653621 edges, 36802 markings/sec, 105 secs
lola: 4410236 markings, 17335524 edges, 35368 markings/sec, 110 secs
lola: 4598267 markings, 18081343 edges, 37606 markings/sec, 115 secs
lola: 4786401 markings, 18705739 edges, 37627 markings/sec, 120 secs
lola: 4962542 markings, 19370591 edges, 35228 markings/sec, 125 secs
lola: 5149837 markings, 20103731 edges, 37459 markings/sec, 130 secs
lola: 5343744 markings, 20729171 edges, 38781 markings/sec, 135 secs
lola: 5519027 markings, 21402682 edges, 35057 markings/sec, 140 secs
lola: 5710878 markings, 22114555 edges, 38370 markings/sec, 145 secs
lola: 5899235 markings, 22697810 edges, 37671 markings/sec, 150 secs
lola: 6066271 markings, 23442898 edges, 33407 markings/sec, 155 secs
lola: 6242424 markings, 24109355 edges, 35231 markings/sec, 160 secs
lola: 6438384 markings, 24808087 edges, 39192 markings/sec, 165 secs
lola: 6613106 markings, 25428723 edges, 34944 markings/sec, 170 secs
lola: 6815506 markings, 26167144 edges, 40480 markings/sec, 175 secs
lola: 6991587 markings, 26751073 edges, 35216 markings/sec, 180 secs
lola: 7190436 markings, 27484416 edges, 39770 markings/sec, 185 secs
lola: 7374569 markings, 28073341 edges, 36827 markings/sec, 190 secs
lola: 7567758 markings, 28798755 edges, 38638 markings/sec, 195 secs
lola: 7762745 markings, 29399717 edges, 38997 markings/sec, 200 secs
lola: 7949030 markings, 30115638 edges, 37257 markings/sec, 205 secs
lola: 8148402 markings, 30747464 edges, 39874 markings/sec, 210 secs
lola: 8332871 markings, 31432142 edges, 36894 markings/sec, 215 secs
lola: 8535866 markings, 32095923 edges, 40599 markings/sec, 220 secs
lola: 8719938 markings, 32749530 edges, 36814 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: 296414 markings, 798409 edges, 3111071174449168384 markings/sec, 0 secs
lola: 563156 markings, 1591979 edges, 53348 markings/sec, 5 secs
lola: 799536 markings, 2457617 edges, 47276 markings/sec, 10 secs
lola: 1037343 markings, 3328066 edges, 47561 markings/sec, 15 secs
lola: 1270250 markings, 4177863 edges, 46581 markings/sec, 20 secs
lola: 1501974 markings, 5031463 edges, 46345 markings/sec, 25 secs
lola: 1733278 markings, 5873346 edges, 46261 markings/sec, 30 secs
lola: 1962700 markings, 6716191 edges, 45884 markings/sec, 35 secs
lola: 2195007 markings, 7561525 edges, 46461 markings/sec, 40 secs
lola: 2420613 markings, 8392796 edges, 45121 markings/sec, 45 secs
lola: 2654725 markings, 9242155 edges, 46822 markings/sec, 50 secs
lola: 2882395 markings, 10080160 edges, 45534 markings/sec, 55 secs
lola: 3115398 markings, 10926979 edges, 46601 markings/sec, 60 secs
lola: 3341705 markings, 11760891 edges, 45261 markings/sec, 65 secs
lola: 3573020 markings, 12601711 edges, 46263 markings/sec, 70 secs
lola: 3797429 markings, 13427211 edges, 44882 markings/sec, 75 secs
lola: 4026212 markings, 14259028 edges, 45757 markings/sec, 80 secs
lola: 4249684 markings, 15080466 edges, 44694 markings/sec, 85 secs
lola: 4489061 markings, 15952772 edges, 47875 markings/sec, 90 secs
lola: 4724294 markings, 16816700 edges, 47047 markings/sec, 95 secs
lola: 4965811 markings, 17696913 edges, 48303 markings/sec, 100 secs
lola: 5197511 markings, 18547194 edges, 46340 markings/sec, 105 secs
lola: 5429371 markings, 19393468 edges, 46372 markings/sec, 110 secs
lola: 5661731 markings, 20246197 edges, 46472 markings/sec, 115 secs
lola: 5896521 markings, 21103926 edges, 46958 markings/sec, 120 secs
lola: 6127117 markings, 21947258 edges, 46119 markings/sec, 125 secs
lola: 6362957 markings, 22811411 edges, 47168 markings/sec, 130 secs
lola: 6600913 markings, 23678619 edges, 47591 markings/sec, 135 secs
lola: 6825998 markings, 24504124 edges, 45017 markings/sec, 140 secs
lola: 7064525 markings, 25370657 edges, 47705 markings/sec, 145 secs
lola: 7298025 markings, 26219164 edges, 46700 markings/sec, 150 secs
lola: 7533729 markings, 27077802 edges, 47141 markings/sec, 155 secs
lola: 7756408 markings, 27887941 edges, 44536 markings/sec, 160 secs
lola: 7989860 markings, 28729657 edges, 46690 markings/sec, 165 secs
lola: 8221989 markings, 29573167 edges, 46426 markings/sec, 170 secs
lola: 8464108 markings, 30439102 edges, 48424 markings/sec, 175 secs
lola: 8697811 markings, 31277629 edges, 46741 markings/sec, 180 secs
lola: 8938832 markings, 32137391 edges, 48204 markings/sec, 185 secs
lola: 9167838 markings, 32962168 edges, 45801 markings/sec, 190 secs
lola: 9401404 markings, 33778740 edges, 46713 markings/sec, 195 secs
lola: 9634832 markings, 34616355 edges, 46686 markings/sec, 200 secs
lola: 9866009 markings, 35426003 edges, 46235 markings/sec, 205 secs
lola: 10103432 markings, 36272829 edges, 47485 markings/sec, 210 secs
lola: 10333452 markings, 37123782 edges, 46004 markings/sec, 215 secs
lola: 10572357 markings, 37949193 edges, 47781 markings/sec, 220 secs
lola: 10809721 markings, 38742352 edges, 47473 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: 216385 markings, 527739 edges, 2977818336622018560 markings/sec, 0 secs
lola: 432290 markings, 1063874 edges, 43181 markings/sec, 5 secs
lola: 649843 markings, 1603889 edges, 43511 markings/sec, 10 secs
lola: 871807 markings, 2155257 edges, 44393 markings/sec, 15 secs
lola: 1111492 markings, 2787542 edges, 47937 markings/sec, 20 secs
lola: 1349831 markings, 3424018 edges, 47668 markings/sec, 25 secs
lola: 1597595 markings, 3998475 edges, 49553 markings/sec, 30 secs
lola: 1839308 markings, 4644626 edges, 48343 markings/sec, 35 secs
lola: 2077556 markings, 5244888 edges, 47650 markings/sec, 40 secs
lola: 2321173 markings, 5843028 edges, 48723 markings/sec, 45 secs
lola: 2563768 markings, 6491554 edges, 48519 markings/sec, 50 secs
lola: 2802526 markings, 7059331 edges, 47752 markings/sec, 55 secs
lola: 3042722 markings, 7680815 edges, 48039 markings/sec, 60 secs
lola: 3281598 markings, 8319477 edges, 47775 markings/sec, 65 secs
lola: 3521263 markings, 8867684 edges, 47933 markings/sec, 70 secs
lola: 3759015 markings, 9503312 edges, 47550 markings/sec, 75 secs
lola: 3989364 markings, 10119343 edges, 46070 markings/sec, 80 secs
lola: 4230910 markings, 10671163 edges, 48309 markings/sec, 85 secs
lola: 4466447 markings, 11301002 edges, 47107 markings/sec, 90 secs
lola: 4701154 markings, 11917792 edges, 46941 markings/sec, 95 secs
lola: 4944468 markings, 12483889 edges, 48663 markings/sec, 100 secs
lola: 5182217 markings, 13119680 edges, 47550 markings/sec, 105 secs
lola: 5415036 markings, 13723563 edges, 46564 markings/sec, 110 secs
lola: 5656987 markings, 14292707 edges, 48390 markings/sec, 115 secs
lola: 5893493 markings, 14925131 edges, 47301 markings/sec, 120 secs
lola: 6124494 markings, 15522592 edges, 46200 markings/sec, 125 secs
lola: 6364804 markings, 16087554 edges, 48062 markings/sec, 130 secs
lola: 6603687 markings, 16726574 edges, 47777 markings/sec, 135 secs
lola: 6839061 markings, 17336031 edges, 47075 markings/sec, 140 secs
lola: 7076920 markings, 17892707 edges, 47572 markings/sec, 145 secs
lola: 7315984 markings, 18532209 edges, 47813 markings/sec, 150 secs
lola: 7546674 markings, 19137070 edges, 46138 markings/sec, 155 secs
lola: 7787415 markings, 19692191 edges, 48148 markings/sec, 160 secs
lola: 8027072 markings, 20333277 edges, 47931 markings/sec, 165 secs
lola: 8263399 markings, 20961473 edges, 47265 markings/sec, 170 secs
lola: 8506157 markings, 21512442 edges, 48552 markings/sec, 175 secs
lola: 8744502 markings, 22150178 edges, 47669 markings/sec, 180 secs
lola: 8980288 markings, 22781189 edges, 47157 markings/sec, 185 secs
lola: 9222135 markings, 23324129 edges, 48369 markings/sec, 190 secs
lola: 9461314 markings, 23964102 edges, 47836 markings/sec, 195 secs
lola: 9702280 markings, 24608911 edges, 48193 markings/sec, 200 secs
lola: 9941217 markings, 25162036 edges, 47787 markings/sec, 205 secs
lola: 10180619 markings, 25783475 edges, 47880 markings/sec, 210 secs
lola: 10420351 markings, 26425131 edges, 47946 markings/sec, 215 secs
lola: 10654683 markings, 26991881 edges, 46866 markings/sec, 220 secs
lola: 10894679 markings, 27587421 edges, 47999 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: 197939 markings, 406200 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 stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="irma4mcc-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 irma4mcc-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 r030-ebro-152646308500381"
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 ;