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.6M
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 99K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 295K 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 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 155K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 102K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 298K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 2.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is BridgeAndVehicles-PT-V20P20N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-ebro-152646312400304
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527027202650


BK_STOP 1527028342517

--------------------
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-V20P20N50 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 582845, 'Memory': 1913.45, 'Tool': 'lola'}, {'Time': 588539, 'Memory': 1917.88, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-PT-V20P20N50...

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V20P20N50: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-PT-V20P20N50 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2336/65536 symbol table entries, 26 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2453 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: NOT((((SORTI_A <= CHOIX_1 + CHOIX_2) OR (COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= 2)) AND NOT(E (G ((2 <= ROUTE_A)))))) : (E (F (((ATTENTE_A <= SUR_PONT_A) AND (3 <= CHOIX_1 + CHOIX_2)))) AND ((E (G ((ATTENTE_A <= SUR_PONT_A))) AND E (G ((2 <= CAPACITE)))) AND A (X ((ATTENTE_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_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9))))) : A (F (A (G ((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_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 <= 2))))) : E (G ((A (G ((3 <= VIDANGE_1 + VIDANGE_2))) OR TRUE))) : (((2 <= SORTI_B) OR A (G ((SUR_PONT_A <= ROUTE_A)))) OR (A (X ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A))) AND A (G ((ROUTE_A <= 0))))) : A (G (A (F ((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_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 <= CAPACITE))))) : NOT(A (F (E (G ((SUR_PONT_B <= VIDANGE_1 + VIDANGE_2)))))) : NOT((E (G ((SUR_PONT_A <= ROUTE_A))) OR (ROUTE_A <= 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_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 (G ((((NB_ATTENTE_B_17 <= ATTENTE_B) OR (ATTENTE_B <= COMPTEUR_2) OR ((2 <= COMPTEUR_42) AND (3 <= COMPTEUR_17))) OR E (G ((CONTROLEUR_1 <= COMPTEUR_7)))))) : NOT(A (F (A (G ((2 <= COMPTEUR_9)))))) : A (G (E (F (((3 <= NB_ATTENTE_A_8) AND (1 <= NB_ATTENTE_A_6)))))) : A (F (E (F ((COMPTEUR_7 + 1 <= NB_ATTENTE_B_17))))) : (E (F ((2 <= COMPTEUR_45))) AND (COMPTEUR_23 <= NB_ATTENTE_A_11)) : E (F ((1 <= COMPTEUR_10))) : E (G ((COMPTEUR_44 <= COMPTEUR_8))) : A (X (((NB_ATTENTE_A_6 <= NB_ATTENTE_B_11) AND E (F ((3 <= NB_ATTENTE_A_13))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((SORTI_A <= CHOIX_1 + CHOIX_2) OR (COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A) AND (3 <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMP... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A) AND (3 <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMP... (shortened)
lola: processed formula length: 749
lola: 8 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= ROUTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (ROUTE_A <= 1)))
lola: processed formula length: 29
lola: 10 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 296146 markings, 612286 edges, 3689348869717491712 markings/sec, 0 secs
lola: 579405 markings, 1220069 edges, 56652 markings/sec, 5 secs
lola: 862376 markings, 1830725 edges, 56594 markings/sec, 10 secs
lola: 1146963 markings, 2446092 edges, 56917 markings/sec, 15 secs
lola: 1434560 markings, 3065764 edges, 57519 markings/sec, 20 secs
lola: 1722756 markings, 3689292 edges, 57639 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1899579 markings, 4078065 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((ATTENTE_A <= SUR_PONT_A) AND (3 <= CHOIX_1 + CHOIX_2)))) AND ((E (G ((ATTENTE_A <= SUR_PONT_A))) AND E (G ((2 <= CAPACITE)))) AND A (X ((ATTENTE_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_0 + NB_ATTENTE_B_1 + NB_ATTENT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ATTENTE_A <= SUR_PONT_A) AND (3 <= 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 404 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-V20P20N50-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((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_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 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((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_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 <= 2)))))
lola: processed formula: A (F (A (G ((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_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 <= 2)))))
lola: processed formula length: 388
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 16445 markings, 25539 edges, 3289 markings/sec, 0 secs
lola: 30035 markings, 48457 edges, 2718 markings/sec, 5 secs
lola: 42738 markings, 70016 edges, 2541 markings/sec, 10 secs
lola: 55292 markings, 91295 edges, 2511 markings/sec, 15 secs
lola: 67297 markings, 111695 edges, 2401 markings/sec, 20 secs
lola: 79389 markings, 132671 edges, 2418 markings/sec, 25 secs
lola: 90530 markings, 151596 edges, 2228 markings/sec, 30 secs
lola: 102120 markings, 171769 edges, 2318 markings/sec, 35 secs
lola: 112549 markings, 189167 edges, 2086 markings/sec, 40 secs
lola: 123464 markings, 208226 edges, 2183 markings/sec, 45 secs
lola: 133758 markings, 225598 edges, 2059 markings/sec, 50 secs
lola: 143715 markings, 242615 edges, 1991 markings/sec, 55 secs
lola: 153743 markings, 260170 edges, 2006 markings/sec, 60 secs
lola: 163661 markings, 276870 edges, 1984 markings/sec, 65 secs
lola: 173076 markings, 292947 edges, 1883 markings/sec, 70 secs
lola: 182256 markings, 308887 edges, 1836 markings/sec, 75 secs
lola: 191349 markings, 324883 edges, 1819 markings/sec, 80 secs
lola: 200282 markings, 339688 edges, 1787 markings/sec, 85 secs
lola: 208745 markings, 354045 edges, 1693 markings/sec, 90 secs
lola: 217638 markings, 369541 edges, 1779 markings/sec, 95 secs
lola: 227128 markings, 386363 edges, 1898 markings/sec, 100 secs
lola: 235011 markings, 399140 edges, 1577 markings/sec, 105 secs
lola: 243222 markings, 413057 edges, 1642 markings/sec, 110 secs
lola: 251811 markings, 427934 edges, 1718 markings/sec, 115 secs
lola: 260012 markings, 442092 edges, 1640 markings/sec, 120 secs
lola: 268845 markings, 457965 edges, 1767 markings/sec, 125 secs
lola: 276913 markings, 470886 edges, 1614 markings/sec, 130 secs
lola: 285174 markings, 484895 edges, 1652 markings/sec, 135 secs
lola: 292915 markings, 498144 edges, 1548 markings/sec, 140 secs
lola: 301408 markings, 512990 edges, 1699 markings/sec, 145 secs
lola: 309127 markings, 526413 edges, 1544 markings/sec, 150 secs
lola: 316879 markings, 539603 edges, 1550 markings/sec, 155 secs
lola: 325301 markings, 553574 edges, 1684 markings/sec, 160 secs
lola: 333339 markings, 567246 edges, 1608 markings/sec, 165 secs
lola: 341407 markings, 581182 edges, 1614 markings/sec, 170 secs
lola: 349792 markings, 595760 edges, 1677 markings/sec, 175 secs
lola: 357722 markings, 609558 edges, 1586 markings/sec, 180 secs
lola: 365284 markings, 622848 edges, 1512 markings/sec, 185 secs
lola: 373048 markings, 635294 edges, 1553 markings/sec, 190 secs
lola: 380909 markings, 648522 edges, 1572 markings/sec, 195 secs
lola: 389323 markings, 662983 edges, 1683 markings/sec, 200 secs
lola: 396818 markings, 675879 edges, 1499 markings/sec, 205 secs
lola: 404521 markings, 689229 edges, 1541 markings/sec, 210 secs
lola: 412537 markings, 703201 edges, 1603 markings/sec, 215 secs
lola: 420148 markings, 716639 edges, 1522 markings/sec, 220 secs
lola: 427967 markings, 729078 edges, 1564 markings/sec, 225 secs
lola: 436016 markings, 742592 edges, 1610 markings/sec, 230 secs
lola: 443266 markings, 754872 edges, 1450 markings/sec, 235 secs
lola: 451127 markings, 768352 edges, 1572 markings/sec, 240 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((3 <= VIDANGE_1 + VIDANGE_2))) OR TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= SORTI_B) OR A (G ((SUR_PONT_A <= ROUTE_A)))) OR (A (X ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A))) AND A (G ((ROUTE_A <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= SORTI_B)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SORTI_B)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SUR_PONT_A <= ROUTE_A)))
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 404 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-V20P20N50-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A)))
lola: processed formula: A (X ((CHOIX_1 + CHOIX_2 + 1 <= SORTI_A)))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 165 markings, 165 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((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_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 <= CAPACITE)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (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_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 <= CAPA... (shortened)
lola: processed formula length: 409
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 207690 markings, 877939 edges, 3689320832170983424 markings/sec, 0 secs
lola: 415544 markings, 1777111 edges, 41571 markings/sec, 5 secs
lola: 616648 markings, 2653809 edges, 40221 markings/sec, 10 secs
lola: 808608 markings, 3495716 edges, 38392 markings/sec, 15 secs
lola: 1001003 markings, 4338389 edges, 38479 markings/sec, 20 secs
lola: 1189615 markings, 5171677 edges, 37722 markings/sec, 25 secs
lola: 1375347 markings, 5999729 edges, 37146 markings/sec, 30 secs
lola: 1560650 markings, 6821456 edges, 37061 markings/sec, 35 secs
lola: 1742607 markings, 7629703 edges, 36391 markings/sec, 40 secs
lola: 1920810 markings, 8421800 edges, 35641 markings/sec, 45 secs
lola: 2102997 markings, 9238720 edges, 36437 markings/sec, 50 secs
lola: 2285943 markings, 10054540 edges, 36589 markings/sec, 55 secs
lola: 2461879 markings, 10850022 edges, 35187 markings/sec, 60 secs
lola: 2641852 markings, 11652579 edges, 35995 markings/sec, 65 secs
lola: 2813898 markings, 12432776 edges, 34409 markings/sec, 70 secs
lola: 2991340 markings, 13215458 edges, 35488 markings/sec, 75 secs
lola: 3170479 markings, 14019669 edges, 35828 markings/sec, 80 secs
lola: 3343223 markings, 14806226 edges, 34549 markings/sec, 85 secs
lola: 3530741 markings, 15630415 edges, 37504 markings/sec, 90 secs
lola: 3709023 markings, 16434891 edges, 35656 markings/sec, 95 secs
lola: 3881934 markings, 17225454 edges, 34582 markings/sec, 100 secs
lola: 4069522 markings, 18051466 edges, 37518 markings/sec, 105 secs
lola: 4249278 markings, 18861732 edges, 35951 markings/sec, 110 secs
lola: 4424422 markings, 19662898 edges, 35029 markings/sec, 115 secs
lola: 4607523 markings, 20478392 edges, 36620 markings/sec, 120 secs
lola: 4790693 markings, 21303357 edges, 36634 markings/sec, 125 secs
lola: 4968275 markings, 22112324 edges, 35516 markings/sec, 130 secs
lola: 5143072 markings, 22915219 edges, 34959 markings/sec, 135 secs
lola: 5332607 markings, 23753359 edges, 37907 markings/sec, 140 secs
lola: 5514169 markings, 24575439 edges, 36312 markings/sec, 145 secs
lola: 5691787 markings, 25389434 edges, 35524 markings/sec, 150 secs
lola: 5869164 markings, 26205631 edges, 35475 markings/sec, 155 secs
lola: 6059874 markings, 27052956 edges, 38142 markings/sec, 160 secs
lola: 6243724 markings, 27887344 edges, 36770 markings/sec, 165 secs
lola: 6423480 markings, 28709771 edges, 35951 markings/sec, 170 secs
lola: 6602501 markings, 29531025 edges, 35804 markings/sec, 175 secs
lola: 6783867 markings, 30356984 edges, 36273 markings/sec, 180 secs
lola: 6975231 markings, 31217387 edges, 38273 markings/sec, 185 secs
lola: 7159241 markings, 32054002 edges, 36802 markings/sec, 190 secs
lola: 7339535 markings, 32886155 edges, 36059 markings/sec, 195 secs
lola: 7520548 markings, 33718597 edges, 36203 markings/sec, 200 secs
lola: 7703308 markings, 34551849 edges, 36552 markings/sec, 205 secs
lola: 7895786 markings, 35421205 edges, 38496 markings/sec, 210 secs
lola: 8082640 markings, 36271620 edges, 37371 markings/sec, 215 secs
lola: 8264541 markings, 37111501 edges, 36380 markings/sec, 220 secs
lola: 8447436 markings, 37952657 edges, 36579 markings/sec, 225 secs
lola: 8628367 markings, 38790330 edges, 36186 markings/sec, 230 secs
lola: 8819969 markings, 39652415 edges, 38320 markings/sec, 235 secs
lola: 9008539 markings, 40513805 edges, 37714 markings/sec, 240 secs
lola: 9195121 markings, 41370406 edges, 37316 markings/sec, 245 secs
lola: 9377342 markings, 42210204 edges, 36444 markings/sec, 250 secs
lola: 9557634 markings, 43047996 edges, 36058 markings/sec, 255 secs
lola: 9739809 markings, 43890357 edges, 36435 markings/sec, 260 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9792342 markings, 44141586 edges
lola: ========================================
lola: subprocess 6 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E (G ((SUR_PONT_B <= VIDANGE_1 + VIDANGE_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (VIDANGE_1 + VIDANGE_2 + 1 <= SUR_PONT_B)))))
lola: processed formula length: 71
lola: 7 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 184337 markings, 798025 edges, 2316351866474070016 markings/sec, 0 secs
lola: 349970 markings, 1614668 edges, 33127 markings/sec, 5 secs
lola: 513121 markings, 2426702 edges, 32630 markings/sec, 10 secs
lola: 677436 markings, 3243487 edges, 32863 markings/sec, 15 secs
lola: 833870 markings, 4032041 edges, 31287 markings/sec, 20 secs
lola: 994657 markings, 4833992 edges, 32157 markings/sec, 25 secs
lola: 1153114 markings, 5633007 edges, 31691 markings/sec, 30 secs
lola: 1310581 markings, 6425944 edges, 31493 markings/sec, 35 secs
lola: 1467080 markings, 7217070 edges, 31300 markings/sec, 40 secs
lola: 1621267 markings, 7996833 edges, 30837 markings/sec, 45 secs
lola: 1771598 markings, 8762878 edges, 30066 markings/sec, 50 secs
lola: 1919213 markings, 9527750 edges, 29523 markings/sec, 55 secs
lola: 2070819 markings, 10298202 edges, 30321 markings/sec, 60 secs
lola: 2219212 markings, 11061722 edges, 29679 markings/sec, 65 secs
lola: 2370728 markings, 11837275 edges, 30303 markings/sec, 70 secs
lola: 2520377 markings, 12610646 edges, 29930 markings/sec, 75 secs
lola: 2673026 markings, 13386887 edges, 30530 markings/sec, 80 secs
lola: 2827369 markings, 14177730 edges, 30869 markings/sec, 85 secs
lola: 2978125 markings, 14963655 edges, 30151 markings/sec, 90 secs
lola: 3135414 markings, 15753773 edges, 31458 markings/sec, 95 secs
lola: 3290591 markings, 16552995 edges, 31035 markings/sec, 100 secs
lola: 3443775 markings, 17344835 edges, 30637 markings/sec, 105 secs
lola: 3603646 markings, 18151943 edges, 31974 markings/sec, 110 secs
lola: 3759925 markings, 18961013 edges, 31256 markings/sec, 115 secs
lola: 3917903 markings, 19772373 edges, 31596 markings/sec, 120 secs
lola: 4077834 markings, 20584331 edges, 31986 markings/sec, 125 secs
lola: 4236717 markings, 21399537 edges, 31777 markings/sec, 130 secs
lola: 4397459 markings, 22222342 edges, 32148 markings/sec, 135 secs
lola: 4554831 markings, 23036021 edges, 31474 markings/sec, 140 secs
lola: 4717516 markings, 23854637 edges, 32537 markings/sec, 145 secs
lola: 4880397 markings, 24685073 edges, 32576 markings/sec, 150 secs
lola: 5041340 markings, 25514479 edges, 32189 markings/sec, 155 secs
lola: 5197403 markings, 26327388 edges, 31213 markings/sec, 160 secs
lola: 5364792 markings, 27163635 edges, 33478 markings/sec, 165 secs
lola: 5525878 markings, 27987744 edges, 32217 markings/sec, 170 secs
lola: 5688561 markings, 28816372 edges, 32537 markings/sec, 175 secs
lola: 5851965 markings, 29661680 edges, 32681 markings/sec, 180 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6008780 markings, 30480276 edges
lola: ========================================
lola: subprocess 7 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((SUR_PONT_A <= ROUTE_A))) OR (ROUTE_A <= 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_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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((ROUTE_A + 1 <= SUR_PONT_A)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((ROUTE_A + 1 <= SUR_PONT_A)))
lola: processed formula: A (F ((ROUTE_A + 1 <= SUR_PONT_A)))
lola: processed formula length: 35
lola: 5 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 8560 markings, 14727 edges, 1712 markings/sec, 0 secs
lola: 21161 markings, 39246 edges, 2520 markings/sec, 5 secs
lola: 34115 markings, 65318 edges, 2591 markings/sec, 10 secs
lola: 47753 markings, 93374 edges, 2728 markings/sec, 15 secs
lola: 60639 markings, 120614 edges, 2577 markings/sec, 20 secs
lola: 76099 markings, 154284 edges, 3092 markings/sec, 25 secs
lola: 91579 markings, 187349 edges, 3096 markings/sec, 30 secs
lola: 106177 markings, 220903 edges, 2920 markings/sec, 35 secs
lola: 122782 markings, 256857 edges, 3321 markings/sec, 40 secs
lola: 137942 markings, 291924 edges, 3032 markings/sec, 45 secs
lola: 155723 markings, 331841 edges, 3556 markings/sec, 50 secs
lola: 172109 markings, 370798 edges, 3277 markings/sec, 55 secs
lola: 188520 markings, 409823 edges, 3282 markings/sec, 60 secs
lola: 207595 markings, 454048 edges, 3815 markings/sec, 65 secs
lola: 223302 markings, 491721 edges, 3141 markings/sec, 70 secs
lola: 242855 markings, 538091 edges, 3911 markings/sec, 75 secs
lola: 262147 markings, 585519 edges, 3858 markings/sec, 80 secs
lola: 277907 markings, 624000 edges, 3152 markings/sec, 85 secs
lola: 298024 markings, 672948 edges, 4023 markings/sec, 90 secs
lola: 317982 markings, 721750 edges, 3992 markings/sec, 95 secs
lola: 336381 markings, 768850 edges, 3680 markings/sec, 100 secs
lola: 352730 markings, 809634 edges, 3270 markings/sec, 105 secs
lola: 375672 markings, 865899 edges, 4588 markings/sec, 110 secs
lola: 395654 markings, 917774 edges, 3996 markings/sec, 115 secs
lola: 414581 markings, 967546 edges, 3785 markings/sec, 120 secs
lola: 430516 markings, 1006908 edges, 3187 markings/sec, 125 secs
lola: 453874 markings, 1065388 edges, 4672 markings/sec, 130 secs
lola: 473275 markings, 1114911 edges, 3880 markings/sec, 135 secs
lola: 491799 markings, 1163722 edges, 3705 markings/sec, 140 secs
lola: 513638 markings, 1224412 edges, 4368 markings/sec, 145 secs
lola: 532886 markings, 1271963 edges, 3850 markings/sec, 150 secs
lola: 555719 markings, 1329640 edges, 4567 markings/sec, 155 secs
lola: 575813 markings, 1383275 edges, 4019 markings/sec, 160 secs
lola: 597359 markings, 1443934 edges, 4309 markings/sec, 165 secs
lola: 616986 markings, 1494769 edges, 3925 markings/sec, 170 secs
lola: 637837 markings, 1548345 edges, 4170 markings/sec, 175 secs
lola: 661815 markings, 1611100 edges, 4796 markings/sec, 180 secs
lola: 682475 markings, 1668737 edges, 4132 markings/sec, 185 secs
lola: 699757 markings, 1713449 edges, 3456 markings/sec, 190 secs
lola: 721639 markings, 1773914 edges, 4376 markings/sec, 195 secs
lola: 742492 markings, 1832583 edges, 4171 markings/sec, 200 secs
lola: 766021 markings, 1890975 edges, 4706 markings/sec, 205 secs
lola: 789258 markings, 1953805 edges, 4647 markings/sec, 210 secs
lola: 810128 markings, 2011550 edges, 4174 markings/sec, 215 secs
lola: 831412 markings, 2070257 edges, 4257 markings/sec, 220 secs
lola: 853461 markings, 2133336 edges, 4410 markings/sec, 225 secs
lola: 874197 markings, 2191066 edges, 4147 markings/sec, 230 secs
lola: 899605 markings, 2256902 edges, 5082 markings/sec, 235 secs
lola: 921655 markings, 2316118 edges, 4410 markings/sec, 240 secs
lola: 945977 markings, 2386373 edges, 4864 markings/sec, 245 secs
lola: 968289 markings, 2447842 edges, 4462 markings/sec, 250 secs
lola: 988982 markings, 2505996 edges, 4139 markings/sec, 255 secs
lola: 1011377 markings, 2569707 edges, 4479 markings/sec, 260 secs
lola: 1033848 markings, 2636020 edges, 4494 markings/sec, 265 secs
lola: 1058748 markings, 2697023 edges, 4980 markings/sec, 270 secs
lola: 1082371 markings, 2762627 edges, 4725 markings/sec, 275 secs
lola: 1107409 markings, 2836304 edges, 5008 markings/sec, 280 secs
lola: 1128880 markings, 2896487 edges, 4294 markings/sec, 285 secs
lola: 1151532 markings, 2961758 edges, 4530 markings/sec, 290 secs
lola: 1174540 markings, 3030515 edges, 4602 markings/sec, 295 secs
lola: 1195521 markings, 3090846 edges, 4196 markings/sec, 300 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((NB_ATTENTE_B_17 <= ATTENTE_B) OR (ATTENTE_B <= COMPTEUR_2) OR ((2 <= COMPTEUR_42) AND (3 <= COMPTEUR_17))) OR E (G ((CONTROLEUR_1 <= COMPTEUR_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((ATTENTE_B + 1 <= NB_ATTENTE_B_17) AND (COMPTEUR_2 + 1 <= ATTENTE_B) AND ((COMPTEUR_42 <= 1) OR (COMPTEUR_17 <= 2))) AND A(TRUE U (COMPTEUR_7 + 1 <= CONTROLEUR_1)))))
lola: processed formula length: 182
lola: 6 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 165 markings, 164 edges
lola: ========================================
lola: subprocess 9 will run for 355 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((2 <= COMPTEUR_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (COMPTEUR_9 <= 1)))))
lola: processed formula length: 47
lola: 7 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 165 markings, 329 edges
lola: ========================================
lola: subprocess 10 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((3 <= NB_ATTENTE_A_8) AND (1 <= NB_ATTENTE_A_6))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((3 <= NB_ATTENTE_A_8) AND (1 <= NB_ATTENTE_A_6))))))
lola: processed formula length: 79
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 270155 markings, 590442 edges, 2474372852984315904 markings/sec, 0 secs
lola: 538822 markings, 1187213 edges, 53733 markings/sec, 5 secs
lola: 807804 markings, 1791692 edges, 53796 markings/sec, 10 secs
lola: 1077354 markings, 2401580 edges, 53910 markings/sec, 15 secs
lola: 1348073 markings, 3016402 edges, 54144 markings/sec, 20 secs
lola: 1619516 markings, 3630795 edges, 54289 markings/sec, 25 secs
lola: 1892083 markings, 4249957 edges, 54513 markings/sec, 30 secs
lola: 2157867 markings, 4854516 edges, 53157 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2233602 markings, 5028399 edges
lola: ========================================
lola: subprocess 11 will run for 489 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((COMPTEUR_7 + 1 <= NB_ATTENTE_B_17)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (COMPTEUR_7 + 1 <= NB_ATTENTE_B_17)))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 38 markings, 38 edges
lola: ========================================
lola: subprocess 12 will run for 611 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((2 <= COMPTEUR_45))) AND (COMPTEUR_23 <= NB_ATTENTE_A_11))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 611 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= COMPTEUR_45)))
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 404 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-V20P20N50-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-CTLCardinality-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 815 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= COMPTEUR_10)))
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 404 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-V20P20N50-CTLCardinality-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 14 will run for 1222 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((COMPTEUR_44 <= COMPTEUR_8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (COMPTEUR_8 + 1 <= COMPTEUR_44)))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 165 markings, 164 edges
lola: ========================================
lola: subprocess 15 will run for 2445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((NB_ATTENTE_A_6 <= NB_ATTENTE_B_11) AND E (F ((3 <= NB_ATTENTE_A_13))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NB_ATTENTE_A_6 <= NB_ATTENTE_B_11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NB_ATTENTE_A_6 <= NB_ATTENTE_B_11)))
lola: processed formula: A (X ((NB_ATTENTE_A_6 <= NB_ATTENTE_B_11)))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown yes no yes no unknown yes yes no yes no yes yes unknown
----- Kill lola and sara stderr -----
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V20P20N50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N50.tgz
mv BridgeAndVehicles-PT-V20P20N50 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is BridgeAndVehicles-PT-V20P20N50, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-ebro-152646312400304"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;