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 3.0M
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 172K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 506K 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 6.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 76K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 213K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 105K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 308K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K 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 1.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-PT-V50P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309400334
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526830251088


BK_STOP 1526831218324

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-V50P50N10 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 1062851, 'Memory': 1784.83, 'Tool': 'lola'}, {'Time': 1062896, 'Memory': 1774.77, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-PT-V50P50N10...

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V50P50N10: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ BridgeAndVehicles-PT-V50P50N10 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1456/65536 symbol table entries, 11 collisions
lola: preprocessing...
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality.task
lola: E (F (((ROUTE_B <= ATTENTE_B) AND ((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 + 1 <= CHOIX_1 + CHOIX_2) OR (CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ROUTE_B))))) : E (F ((2 <= CHOIX_1 + CHOIX_2))) : E (F ((ROUTE_B <= ATTENTE_B))) : A (G ((((2 <= VIDANGE_1 + VIDANGE_2) AND (3 <= CONTROLEUR_1 + CONTROLEUR_2) AND (ROUTE_B <= SUR_PONT_B)) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 1)))) : E (F (((1 <= CHOIX_1 + CHOIX_2) AND (1 <= ATTENTE_B) AND (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 <= 0)))) : A (G (((SORTI_A <= CHOIX_1 + CHOIX_2) OR (SORTI_B <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)))) : E (F ((((ROUTE_B <= ATTENTE_B) AND (CONTROLEUR_1 + CONTROLEUR_2 <= 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)) OR (ROUTE_A + 1 <= SUR_PONT_B) OR (3 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)))) : E (F (((CAPACITE + 1 <= ROUTE_B) AND (ROUTE_B + 1 <= ATTENTE_B) AND (SORTI_B <= CONTROLEUR_1 + CONTROLEUR_2)))) : A (G (((NB_ATTENTE_B_34 <= NB_ATTENTE_A_40) OR (NB_ATTENTE_A_28 + 1 <= NB_ATTENTE_A_31)))) : E (F ((2 <= NB_ATTENTE_B_30))) : E (F (((ATTENTE_A <= COMPTEUR_1) AND (1 <= NB_ATTENTE_A_28) AND ((COMPTEUR_4 <= SUR_PONT_A) OR (1 <= NB_ATTENTE_A_12) OR (COMPTEUR_8 + 1 <= NB_ATTENTE_B_37))))) : E (F (((NB_ATTENTE_A_8 <= 2) AND (NB_ATTENTE_B_42 <= 1) AND (1 <= COMPTEUR_9)))) : E (F ((3 <= NB_ATTENTE_B_50))) : E (F (((NB_ATTENTE_A_7 <= 1) AND (NB_ATTENTE_A_23 + 1 <= CAPACITE) AND (2 <= NB_ATTENTE_A_32)))) : A (G ((NB_ATTENTE_A_34 <= 0))) : A (G ((((2 <= NB_ATTENTE_A_25) AND ((3 <= NB_ATTENTE_B_9) OR (NB_ATTENTE_A_32 <= NB_ATTENTE_A_17))) OR (NB_ATTENTE_B_37 <= NB_ATTENTE_A_26))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ROUTE_B <= ATTENTE_B) AND ((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_2... (shortened)
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= CHOIX_1 + CHOIX_2)))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ROUTE_B <= ATTENTE_B)))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= VIDANGE_1 + VIDANGE_2) AND (3 <= CONTROLEUR_1 + CONTROLEUR_2) AND (ROUTE_B <= SUR_PONT_B)) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 1))))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-3.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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= CHOIX_1 + CHOIX_2) AND (1 <= ATTENTE_B) AND (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 + ... (shortened)
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-4.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SORTI_A <= CHOIX_1 + CHOIX_2) OR (SORTI_B <= 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_A... (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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((ROUTE_B <= ATTENTE_B) AND (CONTROLEUR_1 + CONTROLEUR_2 <= 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 + N... (shortened)
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CAPACITE + 1 <= ROUTE_B) AND (ROUTE_B + 1 <= ATTENTE_B) AND (SORTI_B <= CONTROLEUR_1 + CONTROLEUR_2))))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-7.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 11640 markings, 22957 edges, 2328 markings/sec, 0 secs
lola: sara is running 5 secs || 30925 markings, 73888 edges, 3857 markings/sec, 5 secs
lola: sara is running 10 secs || 50731 markings, 125348 edges, 3961 markings/sec, 10 secs
lola: sara is running 15 secs || 71042 markings, 178210 edges, 4062 markings/sec, 15 secs
lola: sara is running 20 secs || 94376 markings, 241956 edges, 4667 markings/sec, 20 secs
lola: sara is running 25 secs || 117450 markings, 304399 edges, 4615 markings/sec, 25 secs
lola: sara is running 30 secs || 139433 markings, 362959 edges, 4397 markings/sec, 30 secs
lola: sara is running 35 secs || 152860 markings, 399615 edges, 2685 markings/sec, 35 secs
lola: sara is running 40 secs || 162946 markings, 426243 edges, 2017 markings/sec, 40 secs
lola: sara is running 45 secs || 179974 markings, 474295 edges, 3406 markings/sec, 45 secs
lola: sara is running 50 secs || 193005 markings, 505444 edges, 2606 markings/sec, 50 secs
lola: sara is running 55 secs || 203206 markings, 531887 edges, 2040 markings/sec, 55 secs
lola: sara is running 60 secs || 219339 markings, 578700 edges, 3227 markings/sec, 60 secs
lola: sara is running 65 secs || 228571 markings, 603746 edges, 1846 markings/sec, 65 secs
lola: sara is running 70 secs || 244767 markings, 649854 edges, 3239 markings/sec, 70 secs
lola: sara is running 75 secs || 253633 markings, 675075 edges, 1773 markings/sec, 75 secs
lola: sara is running 80 secs || 269410 markings, 720248 edges, 3155 markings/sec, 80 secs
lola: sara is running 85 secs || 284987 markings, 764057 edges, 3115 markings/sec, 85 secs
lola: sara is running 90 secs || 295442 markings, 794574 edges, 2091 markings/sec, 90 secs
lola: sara is running 95 secs || 308787 markings, 831874 edges, 2669 markings/sec, 95 secs
lola: sara is running 100 secs || 322919 markings, 872987 edges, 2826 markings/sec, 100 secs
lola: sara is running 105 secs || 337429 markings, 913642 edges, 2902 markings/sec, 105 secs
lola: sara is running 110 secs || 351417 markings, 953117 edges, 2798 markings/sec, 110 secs
lola: sara is running 115 secs || 363776 markings, 990207 edges, 2472 markings/sec, 115 secs
lola: sara is running 120 secs || 374665 markings, 1017403 edges, 2178 markings/sec, 120 secs
lola: sara is running 125 secs || 385781 markings, 1046160 edges, 2223 markings/sec, 125 secs
lola: sara is running 130 secs || 404171 markings, 1097889 edges, 3678 markings/sec, 130 secs
lola: sara is running 135 secs || 416199 markings, 1126930 edges, 2406 markings/sec, 135 secs
lola: sara is running 140 secs || 428684 markings, 1157065 edges, 2497 markings/sec, 140 secs
lola: sara is running 145 secs || 439264 markings, 1186859 edges, 2116 markings/sec, 145 secs
lola: sara is running 150 secs || 449429 markings, 1214676 edges, 2033 markings/sec, 150 secs
lola: sara is running 155 secs || 460632 markings, 1245701 edges, 2241 markings/sec, 155 secs
lola: sara is running 160 secs || 477331 markings, 1292803 edges, 3340 markings/sec, 160 secs
lola: sara is running 165 secs || 487600 markings, 1321044 edges, 2054 markings/sec, 165 secs
lola: sara is running 170 secs || 505055 markings, 1369809 edges, 3491 markings/sec, 170 secs
lola: sara is running 175 secs || 514325 markings, 1396059 edges, 1854 markings/sec, 175 secs
lola: sara is running 180 secs || 531359 markings, 1444297 edges, 3407 markings/sec, 180 secs
lola: sara is running 185 secs || 541073 markings, 1470817 edges, 1943 markings/sec, 185 secs
lola: sara is running 190 secs || 557642 markings, 1518040 edges, 3314 markings/sec, 190 secs
lola: sara is running 195 secs || 567003 markings, 1543864 edges, 1872 markings/sec, 195 secs
lola: sara is running 200 secs || 583259 markings, 1589368 edges, 3251 markings/sec, 200 secs
lola: sara is running 205 secs || 592602 markings, 1615986 edges, 1869 markings/sec, 205 secs
lola: sara is running 210 secs || 607986 markings, 1659773 edges, 3077 markings/sec, 210 secs
lola: sara is running 215 secs || 623021 markings, 1702593 edges, 3007 markings/sec, 215 secs
lola: sara is running 220 secs || 633453 markings, 1730712 edges, 2086 markings/sec, 220 secs
lola: sara is running 225 secs || 648079 markings, 1772352 edges, 2925 markings/sec, 225 secs
lola: sara is running 230 secs || 661241 markings, 1811103 edges, 2632 markings/sec, 230 secs
lola: sara is running 235 secs || 672133 markings, 1838123 edges, 2178 markings/sec, 235 secs
lola: sara is running 240 secs || 683699 markings, 1868750 edges, 2313 markings/sec, 240 secs
lola: sara is running 245 secs || 694046 markings, 1896167 edges, 2069 markings/sec, 245 secs
lola: sara is running 250 secs || 705204 markings, 1925693 edges, 2232 markings/sec, 250 secs
lola: sara is running 255 secs || 723739 markings, 1978466 edges, 3707 markings/sec, 255 secs
lola: sara is running 260 secs || 735723 markings, 2010808 edges, 2397 markings/sec, 260 secs
lola: sara is running 265 secs || 744897 markings, 2036449 edges, 1835 markings/sec, 265 secs
lola: sara is running 270 secs || 754501 markings, 2063476 edges, 1921 markings/sec, 270 secs
lola: sara is running 275 secs || 762946 markings, 2088452 edges, 1689 markings/sec, 275 secs
lola: sara is running 280 secs || 781114 markings, 2139956 edges, 3634 markings/sec, 280 secs
lola: sara is running 285 secs || 793232 markings, 2172693 edges, 2424 markings/sec, 285 secs
lola: sara is running 290 secs || 802187 markings, 2197997 edges, 1791 markings/sec, 290 secs
lola: sara is running 295 secs || 811706 markings, 2224960 edges, 1904 markings/sec, 295 secs
lola: sara is running 300 secs || 826510 markings, 2269649 edges, 2961 markings/sec, 300 secs
lola: sara is running 305 secs || 838827 markings, 2302496 edges, 2463 markings/sec, 305 secs
lola: sara is running 310 secs || 851215 markings, 2334570 edges, 2478 markings/sec, 310 secs
lola: sara is running 315 secs || 858527 markings, 2357605 edges, 1462 markings/sec, 315 secs
lola: sara is running 320 secs || 868269 markings, 2384735 edges, 1948 markings/sec, 320 secs
lola: sara is running 325 secs || 884067 markings, 2429847 edges, 3160 markings/sec, 325 secs
lola: sara is running 330 secs || 896393 markings, 2463695 edges, 2465 markings/sec, 330 secs
lola: sara is running 335 secs || 906750 markings, 2491881 edges, 2071 markings/sec, 335 secs
lola: sara is running 340 secs || 916038 markings, 2518521 edges, 1858 markings/sec, 340 secs
lola: sara is running 345 secs || 930632 markings, 2561635 edges, 2919 markings/sec, 345 secs
lola: sara is running 350 secs || 943000 markings, 2595106 edges, 2474 markings/sec, 350 secs
lola: sara is running 355 secs || 953921 markings, 2624094 edges, 2184 markings/sec, 355 secs
lola: sara is running 360 secs || 963086 markings, 2650193 edges, 1833 markings/sec, 360 secs
lola: sara is running 365 secs || 976656 markings, 2691076 edges, 2714 markings/sec, 365 secs
lola: sara is running 370 secs || 989115 markings, 2724833 edges, 2492 markings/sec, 370 secs
lola: sara is running 375 secs || 1000124 markings, 2753867 edges, 2202 markings/sec, 375 secs
lola: sara is running 380 secs || 1009144 markings, 2779857 edges, 1804 markings/sec, 380 secs
lola: sara is running 385 secs || 1022721 markings, 2820388 edges, 2715 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NB_ATTENTE_B_34 <= NB_ATTENTE_A_40) OR (NB_ATTENTE_A_28 + 1 <= NB_ATTENTE_A_31))))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= NB_ATTENTE_B_30)))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-9.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 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ATTENTE_A <= COMPTEUR_1) AND (1 <= NB_ATTENTE_A_28) AND ((COMPTEUR_4 <= SUR_PONT_A) OR (1 <= NB_ATTENTE_A_12) OR (COMPTEUR_8 + 1 <= NB_ATTENTE_B_37)))))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 18857 markings, 43687 edges, 3771 markings/sec, 0 secs
lola: sara is running 5 secs || 43548 markings, 108422 edges, 4938 markings/sec, 5 secs
lola: sara is running 10 secs || 63836 markings, 159912 edges, 4058 markings/sec, 10 secs
lola: sara is running 15 secs || 84980 markings, 213930 edges, 4229 markings/sec, 15 secs
lola: sara is running 20 secs || 110721 markings, 283834 edges, 5148 markings/sec, 20 secs
lola: sara is running 25 secs || 135844 markings, 352045 edges, 5025 markings/sec, 25 secs
lola: sara is running 30 secs || 158999 markings, 414060 edges, 4631 markings/sec, 30 secs
lola: sara is running 35 secs || 180211 markings, 467819 edges, 4242 markings/sec, 35 secs
lola: sara is running 40 secs || 202078 markings, 523896 edges, 4373 markings/sec, 40 secs
lola: sara is running 45 secs || 224674 markings, 582779 edges, 4519 markings/sec, 45 secs
lola: sara is running 50 secs || 248392 markings, 645700 edges, 4744 markings/sec, 50 secs
lola: sara is running 55 secs || 271971 markings, 708174 edges, 4716 markings/sec, 55 secs
lola: sara is running 60 secs || 294071 markings, 771738 edges, 4420 markings/sec, 60 secs
lola: sara is running 65 secs || 309810 markings, 808990 edges, 3148 markings/sec, 65 secs
lola: sara is running 70 secs || 334291 markings, 880552 edges, 4896 markings/sec, 70 secs
lola: sara is running 75 secs || 350891 markings, 919683 edges, 3320 markings/sec, 75 secs
lola: sara is running 80 secs || 365898 markings, 958948 edges, 3001 markings/sec, 80 secs
lola: sara is running 85 secs || 380440 markings, 1000671 edges, 2908 markings/sec, 85 secs
lola: sara is running 90 secs || 402565 markings, 1065484 edges, 4425 markings/sec, 90 secs
lola: sara is running 95 secs || 420245 markings, 1114034 edges, 3536 markings/sec, 95 secs
lola: sara is running 100 secs || 434690 markings, 1153360 edges, 2889 markings/sec, 100 secs
lola: sara is running 105 secs || 459401 markings, 1224146 edges, 4942 markings/sec, 105 secs
lola: sara is running 110 secs || 473894 markings, 1265337 edges, 2899 markings/sec, 110 secs
lola: sara is running 115 secs || 497470 markings, 1335859 edges, 4715 markings/sec, 115 secs
lola: sara is running 120 secs || 512519 markings, 1374299 edges, 3010 markings/sec, 120 secs
lola: sara is running 125 secs || 529520 markings, 1423612 edges, 3400 markings/sec, 125 secs
lola: sara is running 130 secs || 550640 markings, 1484575 edges, 4224 markings/sec, 130 secs
lola: sara is running 135 secs || 565258 markings, 1523240 edges, 2924 markings/sec, 135 secs
lola: sara is running 140 secs || 588454 markings, 1590410 edges, 4639 markings/sec, 140 secs
lola: sara is running 145 secs || 602856 markings, 1630319 edges, 2880 markings/sec, 145 secs
lola: sara is running 150 secs || 625641 markings, 1695034 edges, 4557 markings/sec, 150 secs
lola: sara is running 155 secs || 640050 markings, 1735376 edges, 2882 markings/sec, 155 secs
lola: sara is running 160 secs || 662492 markings, 1799532 edges, 4488 markings/sec, 160 secs
lola: sara is running 165 secs || 676908 markings, 1840244 edges, 2883 markings/sec, 165 secs
lola: sara is running 170 secs || 698980 markings, 1903616 edges, 4414 markings/sec, 170 secs
lola: sara is running 175 secs || 713416 markings, 1943909 edges, 2887 markings/sec, 175 secs
lola: sara is running 180 secs || 735053 markings, 2006475 edges, 4327 markings/sec, 180 secs
lola: sara is running 185 secs || 750012 markings, 2045593 edges, 2992 markings/sec, 185 secs
lola: sara is running 190 secs || 764781 markings, 2083788 edges, 2954 markings/sec, 190 secs
lola: sara is running 195 secs || 779400 markings, 2122787 edges, 2924 markings/sec, 195 secs
lola: sara is running 200 secs || 804458 markings, 2197044 edges, 5012 markings/sec, 200 secs
lola: sara is running 205 secs || 818117 markings, 2227450 edges, 2732 markings/sec, 205 secs
lola: sara is running 210 secs || 832695 markings, 2268169 edges, 2916 markings/sec, 210 secs
lola: sara is running 215 secs || 847280 markings, 2308683 edges, 2917 markings/sec, 215 secs
lola: sara is running 220 secs || 861226 markings, 2350305 edges, 2789 markings/sec, 220 secs
lola: sara is running 225 secs || 875397 markings, 2391308 edges, 2834 markings/sec, 225 secs
lola: sara is running 230 secs || 889729 markings, 2432136 edges, 2866 markings/sec, 230 secs
lola: sara is running 235 secs || 914739 markings, 2503989 edges, 5002 markings/sec, 235 secs
lola: sara is running 240 secs || 929000 markings, 2546474 edges, 2852 markings/sec, 240 secs
lola: sara is running 245 secs || 943026 markings, 2587069 edges, 2805 markings/sec, 245 secs
lola: sara is running 250 secs || 963163 markings, 2649073 edges, 4027 markings/sec, 250 secs
lola: sara is running 255 secs || 981607 markings, 2700954 edges, 3689 markings/sec, 255 secs
lola: sara is running 260 secs || 995789 markings, 2741928 edges, 2836 markings/sec, 260 secs
lola: sara is running 265 secs || 1010044 markings, 2783413 edges, 2851 markings/sec, 265 secs
lola: sara is running 270 secs || 1034173 markings, 2853661 edges, 4826 markings/sec, 270 secs
lola: sara is running 275 secs || 1048399 markings, 2895578 edges, 2845 markings/sec, 275 secs
lola: sara is running 280 secs || 1062436 markings, 2936751 edges, 2807 markings/sec, 280 secs
lola: sara is running 285 secs || 1085646 markings, 3007450 edges, 4642 markings/sec, 285 secs
lola: sara is running 290 secs || 1100010 markings, 3047992 edges, 2873 markings/sec, 290 secs
lola: sara is running 295 secs || 1114421 markings, 3089070 edges, 2882 markings/sec, 295 secs
lola: sara is running 300 secs || 1134814 markings, 3150426 edges, 4079 markings/sec, 300 secs
lola: sara is running 305 secs || 1151497 markings, 3197548 edges, 3337 markings/sec, 305 secs
lola: sara is running 310 secs || 1165849 markings, 3240190 edges, 2870 markings/sec, 310 secs
lola: sara is running 315 secs || 1184383 markings, 3295306 edges, 3707 markings/sec, 315 secs
lola: sara is running 320 secs || 1202232 markings, 3345519 edges, 3570 markings/sec, 320 secs
lola: sara is running 325 secs || 1216088 markings, 3386776 edges, 2771 markings/sec, 325 secs
lola: sara is running 330 secs || 1235687 markings, 3445121 edges, 3920 markings/sec, 330 secs
lola: sara is running 335 secs || 1252213 markings, 3492199 edges, 3305 markings/sec, 335 secs
lola: sara is running 340 secs || 1266467 markings, 3533724 edges, 2851 markings/sec, 340 secs
lola: sara is running 345 secs || 1288435 markings, 3598811 edges, 4394 markings/sec, 345 secs
lola: sara is running 350 secs || 1302261 markings, 3638821 edges, 2765 markings/sec, 350 secs
lola: sara is running 355 secs || 1315969 markings, 3678266 edges, 2742 markings/sec, 355 secs
lola: sara is running 360 secs || 1336883 markings, 3742652 edges, 4183 markings/sec, 360 secs
lola: sara is running 365 secs || 1350809 markings, 3774551 edges, 2785 markings/sec, 365 secs
lola: sara is running 370 secs || 1364539 markings, 3814538 edges, 2746 markings/sec, 370 secs
lola: sara is running 375 secs || 1378102 markings, 3853500 edges, 2713 markings/sec, 375 secs
lola: sara is running 380 secs || 1390830 markings, 3884448 edges, 2546 markings/sec, 380 secs
lola: sara is running 385 secs || 1404493 markings, 3923347 edges, 2733 markings/sec, 385 secs
lola: sara is running 390 secs || 1418323 markings, 3959315 edges, 2766 markings/sec, 390 secs
lola: sara is running 395 secs || 1438667 markings, 4018318 edges, 4069 markings/sec, 395 secs
lola: sara is running 400 secs || 1456078 markings, 4066993 edges, 3482 markings/sec, 400 secs
lola: sara is running 405 secs || 1469730 markings, 4096033 edges, 2730 markings/sec, 405 secs
lola: sara is running 410 secs || 1483608 markings, 4137537 edges, 2776 markings/sec, 410 secs
lola: sara is running 415 secs || 1496392 markings, 4176530 edges, 2557 markings/sec, 415 secs
lola: sara is running 420 secs || 1509348 markings, 4213879 edges, 2591 markings/sec, 420 secs
lola: sara is running 425 secs || 1523491 markings, 4252648 edges, 2829 markings/sec, 425 secs
lola: sara is running 430 secs || 1537945 markings, 4295744 edges, 2891 markings/sec, 430 secs
lola: sara is running 435 secs || 1551303 markings, 4337559 edges, 2672 markings/sec, 435 secs
lola: sara is running 440 secs || 1563925 markings, 4374850 edges, 2524 markings/sec, 440 secs
lola: sara is running 445 secs || 1586342 markings, 4442815 edges, 4483 markings/sec, 445 secs
lola: sara is running 450 secs || 1599537 markings, 4478358 edges, 2639 markings/sec, 450 secs
lola: sara is running 455 secs || 1612007 markings, 4518139 edges, 2494 markings/sec, 455 secs
lola: sara is running 460 secs || 1623928 markings, 4552108 edges, 2384 markings/sec, 460 secs
lola: sara is running 465 secs || 1637653 markings, 4592952 edges, 2745 markings/sec, 465 secs
lola: sara is running 470 secs || 1652689 markings, 4639124 edges, 3007 markings/sec, 470 secs
lola: sara is running 475 secs || 1675797 markings, 4705030 edges, 4622 markings/sec, 475 secs
lola: sara is running 480 secs || 1689613 markings, 4749558 edges, 2763 markings/sec, 480 secs
lola: sara is running 485 secs || 1703730 markings, 4789919 edges, 2823 markings/sec, 485 secs
lola: sara is running 490 secs || 1717738 markings, 4832387 edges, 2802 markings/sec, 490 secs
lola: sara is running 495 secs || 1741173 markings, 4904018 edges, 4687 markings/sec, 495 secs
lola: sara is running 500 secs || 1755547 markings, 4943968 edges, 2875 markings/sec, 500 secs
lola: sara is running 505 secs || 1769782 markings, 4985398 edges, 2847 markings/sec, 505 secs
lola: sara is running 510 secs || 1783848 markings, 5027728 edges, 2813 markings/sec, 510 secs
lola: sara is running 515 secs || 1800097 markings, 5077709 edges, 3250 markings/sec, 515 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_A_8 <= 2) AND (NB_ATTENTE_B_42 <= 1) AND (1 <= COMPTEUR_9))))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 12 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= NB_ATTENTE_B_50)))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-12.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 13 will run for 873 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NB_ATTENTE_A_7 <= 1) AND (NB_ATTENTE_A_23 + 1 <= CAPACITE) AND (2 <= NB_ATTENTE_A_32))))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-13.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 14 will run for 1309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NB_ATTENTE_A_34 <= 0)))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35 markings, 34 edges
lola: ========================================
lola: subprocess 15 will run for 2618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= NB_ATTENTE_A_25) AND ((3 <= NB_ATTENTE_B_9) OR (NB_ATTENTE_A_32 <= NB_ATTENTE_A_17))) OR (NB_ATTENTE_B_37 <= NB_ATTENTE_A_26))))
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 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no yes unknown no no unknown yes no no no no
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-V50P50N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
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-V50P50N10.tgz
mv BridgeAndVehicles-PT-V50P50N10 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-structural"
echo " Input is BridgeAndVehicles-PT-V50P50N10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r031-ebro-152646309400334"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;