About the Execution of Irma.full for BridgeAndVehicles-PT-V50P50N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 865.500 | 966992.00 | 1863131.00 | 365.30 | TFTTFFT?FF?TFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...................
/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-full
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 r030-ebro-152646308500334
=====================================================================
--------------------
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 1526765547653
BK_STOP 1526766514645
--------------------
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-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...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ BridgeAndVehicles-PT-V50P50N10 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 236 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: ========================================
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
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: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-5.sara
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: ========================================
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.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 13455 markings, 26952 edges, 2691 markings/sec, 0 secs
lola: sara is running 5 secs || 32380 markings, 76913 edges, 3785 markings/sec, 5 secs
lola: sara is running 10 secs || 52254 markings, 128575 edges, 3975 markings/sec, 10 secs
lola: sara is running 15 secs || 77214 markings, 197577 edges, 4992 markings/sec, 15 secs
lola: sara is running 20 secs || 95858 markings, 245218 edges, 3729 markings/sec, 20 secs
lola: sara is running 25 secs || 118614 markings, 307083 edges, 4551 markings/sec, 25 secs
lola: sara is running 30 secs || 142783 markings, 373284 edges, 4834 markings/sec, 30 secs
lola: sara is running 35 secs || 153174 markings, 400312 edges, 2078 markings/sec, 35 secs
lola: sara is running 40 secs || 165609 markings, 434467 edges, 2487 markings/sec, 40 secs
lola: sara is running 45 secs || 181968 markings, 478979 edges, 3272 markings/sec, 45 secs
lola: sara is running 50 secs || 194748 markings, 509118 edges, 2556 markings/sec, 50 secs
lola: sara is running 55 secs || 204441 markings, 534835 edges, 1939 markings/sec, 55 secs
lola: sara is running 60 secs || 221017 markings, 582489 edges, 3315 markings/sec, 60 secs
lola: sara is running 65 secs || 229559 markings, 607011 edges, 1708 markings/sec, 65 secs
lola: sara is running 70 secs || 245753 markings, 653172 edges, 3239 markings/sec, 70 secs
lola: sara is running 75 secs || 258879 markings, 691177 edges, 2625 markings/sec, 75 secs
lola: sara is running 80 secs || 270820 markings, 723605 edges, 2388 markings/sec, 80 secs
lola: sara is running 85 secs || 285962 markings, 767219 edges, 3028 markings/sec, 85 secs
lola: sara is running 90 secs || 300248 markings, 809085 edges, 2857 markings/sec, 90 secs
lola: sara is running 95 secs || 309722 markings, 834952 edges, 1895 markings/sec, 95 secs
lola: sara is running 100 secs || 324520 markings, 876888 edges, 2960 markings/sec, 100 secs
lola: sara is running 105 secs || 338343 markings, 916670 edges, 2765 markings/sec, 105 secs
lola: sara is running 110 secs || 352330 markings, 956122 edges, 2797 markings/sec, 110 secs
lola: sara is running 115 secs || 364596 markings, 992922 edges, 2453 markings/sec, 115 secs
lola: sara is running 120 secs || 376283 markings, 1021481 edges, 2337 markings/sec, 120 secs
lola: sara is running 125 secs || 387250 markings, 1049374 edges, 2193 markings/sec, 125 secs
lola: sara is running 130 secs || 405201 markings, 1100918 edges, 3590 markings/sec, 130 secs
lola: sara is running 135 secs || 417599 markings, 1130193 edges, 2480 markings/sec, 135 secs
lola: sara is running 140 secs || 430663 markings, 1162185 edges, 2613 markings/sec, 140 secs
lola: sara is running 145 secs || 441256 markings, 1192060 edges, 2119 markings/sec, 145 secs
lola: sara is running 150 secs || 451424 markings, 1219747 edges, 2034 markings/sec, 150 secs
lola: sara is running 155 secs || 467368 markings, 1266821 edges, 3189 markings/sec, 155 secs
lola: sara is running 160 secs || 478290 markings, 1295966 edges, 2184 markings/sec, 160 secs
lola: sara is running 165 secs || 488886 markings, 1324402 edges, 2119 markings/sec, 165 secs
lola: sara is running 170 secs || 506222 markings, 1373462 edges, 3467 markings/sec, 170 secs
lola: sara is running 175 secs || 515983 markings, 1400805 edges, 1952 markings/sec, 175 secs
lola: sara is running 180 secs || 533209 markings, 1448821 edges, 3445 markings/sec, 180 secs
lola: sara is running 185 secs || 542297 markings, 1474864 edges, 1818 markings/sec, 185 secs
lola: sara is running 190 secs || 559404 markings, 1522393 edges, 3421 markings/sec, 190 secs
lola: sara is running 195 secs || 569060 markings, 1549747 edges, 1931 markings/sec, 195 secs
lola: sara is running 200 secs || 585004 markings, 1594963 edges, 3189 markings/sec, 200 secs
lola: sara is running 205 secs || 599699 markings, 1637687 edges, 2939 markings/sec, 205 secs
lola: sara is running 210 secs || 610867 markings, 1667561 edges, 2234 markings/sec, 210 secs
lola: sara is running 215 secs || 626268 markings, 1710774 edges, 3080 markings/sec, 215 secs
lola: sara is running 220 secs || 635642 markings, 1737075 edges, 1875 markings/sec, 220 secs
lola: sara is running 225 secs || 650655 markings, 1779596 edges, 3003 markings/sec, 225 secs
lola: sara is running 230 secs || 662983 markings, 1816805 edges, 2466 markings/sec, 230 secs
lola: sara is running 235 secs || 675254 markings, 1845535 edges, 2454 markings/sec, 235 secs
lola: sara is running 240 secs || 686535 markings, 1876785 edges, 2256 markings/sec, 240 secs
lola: sara is running 245 secs || 697334 markings, 1903941 edges, 2160 markings/sec, 245 secs
lola: sara is running 250 secs || 714094 markings, 1953203 edges, 3352 markings/sec, 250 secs
lola: sara is running 255 secs || 726349 markings, 1985866 edges, 2451 markings/sec, 255 secs
lola: sara is running 260 secs || 738626 markings, 2018172 edges, 2455 markings/sec, 260 secs
lola: sara is running 265 secs || 746376 markings, 2041394 edges, 1550 markings/sec, 265 secs
lola: sara is running 270 secs || 755922 markings, 2067838 edges, 1909 markings/sec, 270 secs
lola: sara is running 275 secs || 769090 markings, 2107104 edges, 2634 markings/sec, 275 secs
lola: sara is running 280 secs || 783371 markings, 2146274 edges, 2856 markings/sec, 280 secs
lola: sara is running 285 secs || 795661 markings, 2178771 edges, 2458 markings/sec, 285 secs
lola: sara is running 290 secs || 803454 markings, 2202222 edges, 1559 markings/sec, 290 secs
lola: sara is running 295 secs || 812990 markings, 2228901 edges, 1907 markings/sec, 295 secs
lola: sara is running 300 secs || 828554 markings, 2274716 edges, 3113 markings/sec, 300 secs
lola: sara is running 305 secs || 840592 markings, 2307043 edges, 2408 markings/sec, 305 secs
lola: sara is running 310 secs || 852317 markings, 2337596 edges, 2345 markings/sec, 310 secs
lola: sara is running 315 secs || 860391 markings, 2362129 edges, 1615 markings/sec, 315 secs
lola: sara is running 320 secs || 869566 markings, 2387974 edges, 1835 markings/sec, 320 secs
lola: sara is running 325 secs || 885057 markings, 2431967 edges, 3098 markings/sec, 325 secs
lola: sara is running 330 secs || 896798 markings, 2464729 edges, 2348 markings/sec, 330 secs
lola: sara is running 335 secs || 906804 markings, 2492043 edges, 2001 markings/sec, 335 secs
lola: sara is running 340 secs || 915888 markings, 2518026 edges, 1817 markings/sec, 340 secs
lola: sara is running 345 secs || 930385 markings, 2561024 edges, 2899 markings/sec, 345 secs
lola: sara is running 350 secs || 942639 markings, 2594045 edges, 2451 markings/sec, 350 secs
lola: sara is running 355 secs || 953427 markings, 2622431 edges, 2158 markings/sec, 355 secs
lola: sara is running 360 secs || 962502 markings, 2648640 edges, 1815 markings/sec, 360 secs
lola: sara is running 365 secs || 975886 markings, 2689354 edges, 2677 markings/sec, 365 secs
lola: sara is running 370 secs || 988152 markings, 2722081 edges, 2453 markings/sec, 370 secs
lola: sara is running 375 secs || 999638 markings, 2752226 edges, 2297 markings/sec, 375 secs
lola: sara is running 380 secs || 1008663 markings, 2778302 edges, 1805 markings/sec, 380 secs
lola: sara is running 385 secs || 1022136 markings, 2818668 edges, 2695 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 || 19185 markings, 44786 edges, 3837 markings/sec, 0 secs
lola: sara is running 5 secs || 43658 markings, 108752 edges, 4895 markings/sec, 5 secs
lola: sara is running 10 secs || 64407 markings, 161835 edges, 4150 markings/sec, 10 secs
lola: sara is running 15 secs || 85494 markings, 214864 edges, 4217 markings/sec, 15 secs
lola: sara is running 20 secs || 111243 markings, 285064 edges, 5150 markings/sec, 20 secs
lola: sara is running 25 secs || 136459 markings, 353485 edges, 5043 markings/sec, 25 secs
lola: sara is running 30 secs || 159980 markings, 417120 edges, 4704 markings/sec, 30 secs
lola: sara is running 35 secs || 181109 markings, 470581 edges, 4226 markings/sec, 35 secs
lola: sara is running 40 secs || 202960 markings, 526663 edges, 4370 markings/sec, 40 secs
lola: sara is running 45 secs || 225522 markings, 585365 edges, 4512 markings/sec, 45 secs
lola: sara is running 50 secs || 248348 markings, 645601 edges, 4565 markings/sec, 50 secs
lola: sara is running 55 secs || 271897 markings, 707917 edges, 4710 markings/sec, 55 secs
lola: sara is running 60 secs || 293923 markings, 771368 edges, 4405 markings/sec, 60 secs
lola: sara is running 65 secs || 309307 markings, 807821 edges, 3077 markings/sec, 65 secs
lola: sara is running 70 secs || 332456 markings, 874375 edges, 4630 markings/sec, 70 secs
lola: sara is running 75 secs || 349933 markings, 917465 edges, 3495 markings/sec, 75 secs
lola: sara is running 80 secs || 365212 markings, 957366 edges, 3056 markings/sec, 80 secs
lola: sara is running 85 secs || 379493 markings, 998426 edges, 2856 markings/sec, 85 secs
lola: sara is running 90 secs || 399740 markings, 1057049 edges, 4049 markings/sec, 90 secs
lola: sara is running 95 secs || 418896 markings, 1111450 edges, 3831 markings/sec, 95 secs
lola: sara is running 100 secs || 433562 markings, 1150900 edges, 2933 markings/sec, 100 secs
lola: sara is running 105 secs || 458453 markings, 1222135 edges, 4978 markings/sec, 105 secs
lola: sara is running 110 secs || 472800 markings, 1262810 edges, 2869 markings/sec, 110 secs
lola: sara is running 115 secs || 496121 markings, 1331770 edges, 4664 markings/sec, 115 secs
lola: sara is running 120 secs || 511552 markings, 1371967 edges, 3086 markings/sec, 120 secs
lola: sara is running 125 secs || 526397 markings, 1413681 edges, 2969 markings/sec, 125 secs
lola: sara is running 130 secs || 549434 markings, 1480464 edges, 4607 markings/sec, 130 secs
lola: sara is running 135 secs || 563944 markings, 1520301 edges, 2902 markings/sec, 135 secs
lola: sara is running 140 secs || 587320 markings, 1586537 edges, 4675 markings/sec, 140 secs
lola: sara is running 145 secs || 601410 markings, 1625541 edges, 2818 markings/sec, 145 secs
lola: sara is running 150 secs || 624176 markings, 1691306 edges, 4553 markings/sec, 150 secs
lola: sara is running 155 secs || 638509 markings, 1731234 edges, 2867 markings/sec, 155 secs
lola: sara is running 160 secs || 660825 markings, 1795286 edges, 4463 markings/sec, 160 secs
lola: sara is running 165 secs || 675115 markings, 1834987 edges, 2858 markings/sec, 165 secs
lola: sara is running 170 secs || 697150 markings, 1897495 edges, 4407 markings/sec, 170 secs
lola: sara is running 175 secs || 711403 markings, 1938113 edges, 2851 markings/sec, 175 secs
lola: sara is running 180 secs || 732655 markings, 2002252 edges, 4250 markings/sec, 180 secs
lola: sara is running 185 secs || 747578 markings, 2039705 edges, 2985 markings/sec, 185 secs
lola: sara is running 190 secs || 761989 markings, 2075824 edges, 2882 markings/sec, 190 secs
lola: sara is running 195 secs || 776583 markings, 2114541 edges, 2919 markings/sec, 195 secs
lola: sara is running 200 secs || 799765 markings, 2182604 edges, 4636 markings/sec, 200 secs
lola: sara is running 205 secs || 815360 markings, 2220972 edges, 3119 markings/sec, 205 secs
lola: sara is running 210 secs || 830203 markings, 2260886 edges, 2969 markings/sec, 210 secs
lola: sara is running 215 secs || 844162 markings, 2301996 edges, 2792 markings/sec, 215 secs
lola: sara is running 220 secs || 858546 markings, 2341325 edges, 2877 markings/sec, 220 secs
lola: sara is running 225 secs || 872851 markings, 2382735 edges, 2861 markings/sec, 225 secs
lola: sara is running 230 secs || 887233 markings, 2424124 edges, 2876 markings/sec, 230 secs
lola: sara is running 235 secs || 912322 markings, 2498335 edges, 5018 markings/sec, 235 secs
lola: sara is running 240 secs || 925883 markings, 2539695 edges, 2712 markings/sec, 240 secs
lola: sara is running 245 secs || 940317 markings, 2579972 edges, 2887 markings/sec, 245 secs
lola: sara is running 250 secs || 955395 markings, 2624560 edges, 3016 markings/sec, 250 secs
lola: sara is running 255 secs || 978816 markings, 2691997 edges, 4684 markings/sec, 255 secs
lola: sara is running 260 secs || 993006 markings, 2733199 edges, 2838 markings/sec, 260 secs
lola: sara is running 265 secs || 1006939 markings, 2774904 edges, 2787 markings/sec, 265 secs
lola: sara is running 270 secs || 1031102 markings, 2846374 edges, 4833 markings/sec, 270 secs
lola: sara is running 275 secs || 1045039 markings, 2887860 edges, 2787 markings/sec, 275 secs
lola: sara is running 280 secs || 1059531 markings, 2928211 edges, 2898 markings/sec, 280 secs
lola: sara is running 285 secs || 1079082 markings, 2987693 edges, 3910 markings/sec, 285 secs
lola: sara is running 290 secs || 1096871 markings, 3037613 edges, 3558 markings/sec, 290 secs
lola: sara is running 295 secs || 1110823 markings, 3078525 edges, 2790 markings/sec, 295 secs
lola: sara is running 300 secs || 1124729 markings, 3119559 edges, 2781 markings/sec, 300 secs
lola: sara is running 305 secs || 1147456 markings, 3185005 edges, 4545 markings/sec, 305 secs
lola: sara is running 310 secs || 1161726 markings, 3227071 edges, 2854 markings/sec, 310 secs
lola: sara is running 315 secs || 1175649 markings, 3268071 edges, 2785 markings/sec, 315 secs
lola: sara is running 320 secs || 1197721 markings, 3331503 edges, 4414 markings/sec, 320 secs
lola: sara is running 325 secs || 1212017 markings, 3373892 edges, 2859 markings/sec, 325 secs
lola: sara is running 330 secs || 1226241 markings, 3416048 edges, 2845 markings/sec, 330 secs
lola: sara is running 335 secs || 1248683 markings, 3481396 edges, 4488 markings/sec, 335 secs
lola: sara is running 340 secs || 1262820 markings, 3522599 edges, 2827 markings/sec, 340 secs
lola: sara is running 345 secs || 1281513 markings, 3579258 edges, 3739 markings/sec, 345 secs
lola: sara is running 350 secs || 1299123 markings, 3629570 edges, 3522 markings/sec, 350 secs
lola: sara is running 355 secs || 1313613 markings, 3671072 edges, 2898 markings/sec, 355 secs
lola: sara is running 360 secs || 1334872 markings, 3735906 edges, 4252 markings/sec, 360 secs
lola: sara is running 365 secs || 1348929 markings, 3769630 edges, 2811 markings/sec, 365 secs
lola: sara is running 370 secs || 1363226 markings, 3810028 edges, 2859 markings/sec, 370 secs
lola: sara is running 375 secs || 1376750 markings, 3849901 edges, 2705 markings/sec, 375 secs
lola: sara is running 380 secs || 1390730 markings, 3884107 edges, 2796 markings/sec, 380 secs
lola: sara is running 385 secs || 1404306 markings, 3922754 edges, 2715 markings/sec, 385 secs
lola: sara is running 390 secs || 1418183 markings, 3958862 edges, 2775 markings/sec, 390 secs
lola: sara is running 395 secs || 1438031 markings, 4016210 edges, 3970 markings/sec, 395 secs
lola: sara is running 400 secs || 1455275 markings, 4065651 edges, 3449 markings/sec, 400 secs
lola: sara is running 405 secs || 1468699 markings, 4093153 edges, 2685 markings/sec, 405 secs
lola: sara is running 410 secs || 1482795 markings, 4135239 edges, 2819 markings/sec, 410 secs
lola: sara is running 415 secs || 1496159 markings, 4175836 edges, 2673 markings/sec, 415 secs
lola: sara is running 420 secs || 1509075 markings, 4213042 edges, 2583 markings/sec, 420 secs
lola: sara is running 425 secs || 1523371 markings, 4252358 edges, 2859 markings/sec, 425 secs
lola: sara is running 430 secs || 1537725 markings, 4295202 edges, 2871 markings/sec, 430 secs
lola: sara is running 435 secs || 1551345 markings, 4337685 edges, 2724 markings/sec, 435 secs
lola: sara is running 440 secs || 1564896 markings, 4377754 edges, 2710 markings/sec, 440 secs
lola: sara is running 445 secs || 1588468 markings, 4449930 edges, 4714 markings/sec, 445 secs
lola: sara is running 450 secs || 1603213 markings, 4489915 edges, 2949 markings/sec, 450 secs
lola: sara is running 455 secs || 1617627 markings, 4532767 edges, 2883 markings/sec, 455 secs
lola: sara is running 460 secs || 1631008 markings, 4574969 edges, 2676 markings/sec, 460 secs
lola: sara is running 465 secs || 1645124 markings, 4615337 edges, 2823 markings/sec, 465 secs
lola: sara is running 470 secs || 1669365 markings, 4688377 edges, 4848 markings/sec, 470 secs
lola: sara is running 475 secs || 1683201 markings, 4729122 edges, 2767 markings/sec, 475 secs
lola: sara is running 480 secs || 1697400 markings, 4770275 edges, 2840 markings/sec, 480 secs
lola: sara is running 485 secs || 1711408 markings, 4812163 edges, 2802 markings/sec, 485 secs
lola: sara is running 490 secs || 1724973 markings, 4853855 edges, 2713 markings/sec, 490 secs
lola: sara is running 495 secs || 1748757 markings, 4921899 edges, 4757 markings/sec, 495 secs
lola: sara is running 500 secs || 1762684 markings, 4966834 edges, 2785 markings/sec, 500 secs
lola: sara is running 505 secs || 1776826 markings, 5007585 edges, 2828 markings/sec, 505 secs
lola: sara is running 510 secs || 1790976 markings, 5049944 edges, 2830 markings/sec, 510 secs
lola: sara is running 515 secs || 1814480 markings, 5119293 edges, 4701 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: 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
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-14.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-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-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-full"
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 r030-ebro-152646308500334"
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 '
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 ;