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-structural
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 r035-ebro-152646315300304
=====================================================================

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


BK_STOP 1527117925003

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-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...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 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: 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 235 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: 299639 markings, 619463 edges, 3689348869717491712 markings/sec, 0 secs
lola: 590211 markings, 1243409 edges, 58114 markings/sec, 5 secs
lola: 877214 markings, 1863607 edges, 57401 markings/sec, 10 secs
lola: 1165833 markings, 2487901 edges, 57724 markings/sec, 15 secs
lola: 1457426 markings, 3116913 edges, 58319 markings/sec, 20 secs
lola: 1751049 markings, 3749870 edges, 58725 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: 16585 markings, 25804 edges, 3317 markings/sec, 0 secs
lola: 30335 markings, 49044 edges, 2750 markings/sec, 5 secs
lola: 43216 markings, 70909 edges, 2576 markings/sec, 10 secs
lola: 55645 markings, 91891 edges, 2486 markings/sec, 15 secs
lola: 67784 markings, 112530 edges, 2428 markings/sec, 20 secs
lola: 80010 markings, 133885 edges, 2445 markings/sec, 25 secs
lola: 91042 markings, 152346 edges, 2206 markings/sec, 30 secs
lola: 102725 markings, 172949 edges, 2337 markings/sec, 35 secs
lola: 113015 markings, 189959 edges, 2058 markings/sec, 40 secs
lola: 123970 markings, 209222 edges, 2191 markings/sec, 45 secs
lola: 134212 markings, 226370 edges, 2048 markings/sec, 50 secs
lola: 144211 markings, 243545 edges, 2000 markings/sec, 55 secs
lola: 154189 markings, 260939 edges, 1996 markings/sec, 60 secs
lola: 164263 markings, 277865 edges, 2015 markings/sec, 65 secs
lola: 173457 markings, 293586 edges, 1839 markings/sec, 70 secs
lola: 183116 markings, 310401 edges, 1932 markings/sec, 75 secs
lola: 191704 markings, 325387 edges, 1718 markings/sec, 80 secs
lola: 200799 markings, 340432 edges, 1819 markings/sec, 85 secs
lola: 209321 markings, 355033 edges, 1704 markings/sec, 90 secs
lola: 217958 markings, 370084 edges, 1727 markings/sec, 95 secs
lola: 227517 markings, 387128 edges, 1912 markings/sec, 100 secs
lola: 235265 markings, 399617 edges, 1550 markings/sec, 105 secs
lola: 243502 markings, 413522 edges, 1647 markings/sec, 110 secs
lola: 252037 markings, 428301 edges, 1707 markings/sec, 115 secs
lola: 260701 markings, 443415 edges, 1733 markings/sec, 120 secs
lola: 269035 markings, 458280 edges, 1667 markings/sec, 125 secs
lola: 277211 markings, 471446 edges, 1635 markings/sec, 130 secs
lola: 285415 markings, 485298 edges, 1641 markings/sec, 135 secs
lola: 293420 markings, 499130 edges, 1601 markings/sec, 140 secs
lola: 301538 markings, 513206 edges, 1624 markings/sec, 145 secs
lola: 309342 markings, 526773 edges, 1561 markings/sec, 150 secs
lola: 317149 markings, 540043 edges, 1561 markings/sec, 155 secs
lola: 325669 markings, 554200 edges, 1704 markings/sec, 160 secs
lola: 333623 markings, 567725 edges, 1591 markings/sec, 165 secs
lola: 342008 markings, 582395 edges, 1677 markings/sec, 170 secs
lola: 350095 markings, 596259 edges, 1617 markings/sec, 175 secs
lola: 358031 markings, 610071 edges, 1587 markings/sec, 180 secs
lola: 365577 markings, 623263 edges, 1509 markings/sec, 185 secs
lola: 373643 markings, 636291 edges, 1613 markings/sec, 190 secs
lola: 381430 markings, 649407 edges, 1557 markings/sec, 195 secs
lola: 389754 markings, 663704 edges, 1665 markings/sec, 200 secs
lola: 397256 markings, 676622 edges, 1500 markings/sec, 205 secs
lola: 404933 markings, 689923 edges, 1535 markings/sec, 210 secs
lola: 412995 markings, 703974 edges, 1612 markings/sec, 215 secs
lola: 420599 markings, 717275 edges, 1521 markings/sec, 220 secs
lola: 428582 markings, 730104 edges, 1597 markings/sec, 225 secs
lola: 436634 markings, 743625 edges, 1610 markings/sec, 230 secs
lola: 444470 markings, 756944 edges, 1567 markings/sec, 235 secs
lola: 452490 markings, 771074 edges, 1604 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
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: 205028 markings, 866778 edges, 3689320832170983424 markings/sec, 0 secs
lola: 409341 markings, 1750772 edges, 40863 markings/sec, 5 secs
lola: 606930 markings, 2611151 edges, 39518 markings/sec, 10 secs
lola: 798577 markings, 3451445 edges, 38329 markings/sec, 15 secs
lola: 992988 markings, 4303706 edges, 38882 markings/sec, 20 secs
lola: 1186373 markings, 5156692 edges, 38677 markings/sec, 25 secs
lola: 1377079 markings, 6007798 edges, 38141 markings/sec, 30 secs
lola: 1567269 markings, 6852260 edges, 38038 markings/sec, 35 secs
lola: 1757857 markings, 7697949 edges, 38118 markings/sec, 40 secs
lola: 1943584 markings, 8524711 edges, 37145 markings/sec, 45 secs
lola: 2128147 markings, 9354873 edges, 36913 markings/sec, 50 secs
lola: 2315867 markings, 10189064 edges, 37544 markings/sec, 55 secs
lola: 2494284 markings, 10998247 edges, 35683 markings/sec, 60 secs
lola: 2681797 markings, 11833316 edges, 37503 markings/sec, 65 secs
lola: 2859852 markings, 12641281 edges, 35611 markings/sec, 70 secs
lola: 3048471 markings, 13468968 edges, 37724 markings/sec, 75 secs
lola: 3229330 markings, 14287070 edges, 36172 markings/sec, 80 secs
lola: 3410687 markings, 15098941 edges, 36271 markings/sec, 85 secs
lola: 3597606 markings, 15931501 edges, 37384 markings/sec, 90 secs
lola: 3778558 markings, 16747349 edges, 36190 markings/sec, 95 secs
lola: 3961360 markings, 17570678 edges, 36560 markings/sec, 100 secs
lola: 4148908 markings, 18406675 edges, 37510 markings/sec, 105 secs
lola: 4329528 markings, 19230360 edges, 36124 markings/sec, 110 secs
lola: 4509629 markings, 20050037 edges, 36020 markings/sec, 115 secs
lola: 4700445 markings, 20894816 edges, 38163 markings/sec, 120 secs
lola: 4884467 markings, 21726078 edges, 36804 markings/sec, 125 secs
lola: 5065561 markings, 22554300 edges, 36219 markings/sec, 130 secs
lola: 5251009 markings, 23388775 edges, 37090 markings/sec, 135 secs
lola: 5438809 markings, 24234203 edges, 37560 markings/sec, 140 secs
lola: 5621678 markings, 25068581 edges, 36574 markings/sec, 145 secs
lola: 5804112 markings, 25902629 edges, 36487 markings/sec, 150 secs
lola: 5989306 markings, 26739119 edges, 37039 markings/sec, 155 secs
lola: 6180765 markings, 27598812 edges, 38292 markings/sec, 160 secs
lola: 6365115 markings, 28440762 edges, 36870 markings/sec, 165 secs
lola: 6546696 markings, 29273142 edges, 36316 markings/sec, 170 secs
lola: 6728769 markings, 30115425 edges, 36415 markings/sec, 175 secs
lola: 6921404 markings, 30972384 edges, 38527 markings/sec, 180 secs
lola: 7109835 markings, 31831402 edges, 37686 markings/sec, 185 secs
lola: 7292570 markings, 32669743 edges, 36547 markings/sec, 190 secs
lola: 7475778 markings, 33513841 edges, 36642 markings/sec, 195 secs
lola: 7659021 markings, 34360236 edges, 36649 markings/sec, 200 secs
lola: 7853862 markings, 35230628 edges, 38968 markings/sec, 205 secs
lola: 8043381 markings, 36090140 edges, 37904 markings/sec, 210 secs
lola: 8228396 markings, 36945803 edges, 37003 markings/sec, 215 secs
lola: 8413171 markings, 37797214 edges, 36955 markings/sec, 220 secs
lola: 8593986 markings, 38636633 edges, 36163 markings/sec, 225 secs
lola: 8786523 markings, 39500031 edges, 38507 markings/sec, 230 secs
lola: 8978439 markings, 40375390 edges, 38383 markings/sec, 235 secs
lola: 9163541 markings, 41227424 edges, 37020 markings/sec, 240 secs
lola: 9348225 markings, 42080126 edges, 36937 markings/sec, 245 secs
lola: 9533609 markings, 42933260 edges, 37077 markings/sec, 250 secs
lola: 9714800 markings, 43781643 edges, 36238 markings/sec, 255 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 299 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: 181534 markings, 783790 edges, 2316351866474070016 markings/sec, 0 secs
lola: 346938 markings, 1598399 edges, 33081 markings/sec, 5 secs
lola: 508857 markings, 2403257 edges, 32384 markings/sec, 10 secs
lola: 670379 markings, 3209180 edges, 32304 markings/sec, 15 secs
lola: 827273 markings, 4000682 edges, 31379 markings/sec, 20 secs
lola: 988217 markings, 4801642 edges, 32189 markings/sec, 25 secs
lola: 1146899 markings, 5600943 edges, 31736 markings/sec, 30 secs
lola: 1303772 markings, 6392867 edges, 31375 markings/sec, 35 secs
lola: 1460105 markings, 7182544 edges, 31267 markings/sec, 40 secs
lola: 1615483 markings, 7966483 edges, 31076 markings/sec, 45 secs
lola: 1762711 markings, 8718787 edges, 29446 markings/sec, 50 secs
lola: 1912220 markings, 9490319 edges, 29902 markings/sec, 55 secs
lola: 2064715 markings, 10265543 edges, 30499 markings/sec, 60 secs
lola: 2213796 markings, 11038582 edges, 29816 markings/sec, 65 secs
lola: 2367689 markings, 11819313 edges, 30779 markings/sec, 70 secs
lola: 2518529 markings, 12600472 edges, 30168 markings/sec, 75 secs
lola: 2673172 markings, 13387698 edges, 30929 markings/sec, 80 secs
lola: 2827742 markings, 14179798 edges, 30914 markings/sec, 85 secs
lola: 2979173 markings, 14968599 edges, 30286 markings/sec, 90 secs
lola: 3138619 markings, 15770781 edges, 31889 markings/sec, 95 secs
lola: 3294128 markings, 16572576 edges, 31102 markings/sec, 100 secs
lola: 3448559 markings, 17370090 edges, 30886 markings/sec, 105 secs
lola: 3609130 markings, 18180570 edges, 32114 markings/sec, 110 secs
lola: 3765069 markings, 18983017 edges, 31188 markings/sec, 115 secs
lola: 3921671 markings, 19792470 edges, 31320 markings/sec, 120 secs
lola: 4080392 markings, 20598790 edges, 31744 markings/sec, 125 secs
lola: 4237970 markings, 21405240 edges, 31516 markings/sec, 130 secs
lola: 4398397 markings, 22227350 edges, 32085 markings/sec, 135 secs
lola: 4555366 markings, 23038776 edges, 31394 markings/sec, 140 secs
lola: 4717751 markings, 23855606 edges, 32477 markings/sec, 145 secs
lola: 4880237 markings, 24684216 edges, 32497 markings/sec, 150 secs
lola: 5040675 markings, 25510972 edges, 32088 markings/sec, 155 secs
lola: 5196178 markings, 26323061 edges, 31101 markings/sec, 160 secs
lola: 5363615 markings, 27157434 edges, 33487 markings/sec, 165 secs
lola: 5524411 markings, 27982687 edges, 32159 markings/sec, 170 secs
lola: 5686676 markings, 28808587 edges, 32453 markings/sec, 175 secs
lola: 5850143 markings, 29651910 edges, 32693 markings/sec, 180 secs
lola: 6008780 markings, 30479301 edges, 31727 markings/sec, 185 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 311 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 311 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: 8747 markings, 14992 edges, 1749 markings/sec, 0 secs
lola: 21226 markings, 39370 edges, 2496 markings/sec, 5 secs
lola: 34153 markings, 65382 edges, 2585 markings/sec, 10 secs
lola: 47805 markings, 93466 edges, 2730 markings/sec, 15 secs
lola: 60662 markings, 120652 edges, 2571 markings/sec, 20 secs
lola: 76147 markings, 154360 edges, 3097 markings/sec, 25 secs
lola: 91829 markings, 188086 edges, 3136 markings/sec, 30 secs
lola: 106400 markings, 221464 edges, 2914 markings/sec, 35 secs
lola: 123131 markings, 257853 edges, 3346 markings/sec, 40 secs
lola: 138396 markings, 293259 edges, 3053 markings/sec, 45 secs
lola: 156385 markings, 333705 edges, 3598 markings/sec, 50 secs
lola: 172927 markings, 373194 edges, 3308 markings/sec, 55 secs
lola: 189829 markings, 412173 edges, 3380 markings/sec, 60 secs
lola: 209120 markings, 458166 edges, 3858 markings/sec, 65 secs
lola: 225307 markings, 497272 edges, 3237 markings/sec, 70 secs
lola: 244276 markings, 541149 edges, 3794 markings/sec, 75 secs
lola: 263137 markings, 587478 edges, 3772 markings/sec, 80 secs
lola: 280462 markings, 630892 edges, 3465 markings/sec, 85 secs
lola: 299960 markings, 677086 edges, 3900 markings/sec, 90 secs
lola: 319803 markings, 726030 edges, 3969 markings/sec, 95 secs
lola: 339289 markings, 777761 edges, 3897 markings/sec, 100 secs
lola: 356141 markings, 819396 edges, 3370 markings/sec, 105 secs
lola: 377724 markings, 870562 edges, 4317 markings/sec, 110 secs
lola: 396963 markings, 920199 edges, 3848 markings/sec, 115 secs
lola: 416411 markings, 970921 edges, 3890 markings/sec, 120 secs
lola: 435591 markings, 1022835 edges, 3836 markings/sec, 125 secs
lola: 457480 markings, 1073663 edges, 4378 markings/sec, 130 secs
lola: 479340 markings, 1131963 edges, 4372 markings/sec, 135 secs
lola: 499138 markings, 1186127 edges, 3960 markings/sec, 140 secs
lola: 516406 markings, 1229432 edges, 3454 markings/sec, 145 secs
lola: 539544 markings, 1287874 edges, 4628 markings/sec, 150 secs
lola: 561217 markings, 1345048 edges, 4335 markings/sec, 155 secs
lola: 581669 markings, 1399659 edges, 4090 markings/sec, 160 secs
lola: 601760 markings, 1453438 edges, 4018 markings/sec, 165 secs
lola: 619517 markings, 1500170 edges, 3551 markings/sec, 170 secs
lola: 645812 markings, 1568608 edges, 5259 markings/sec, 175 secs
lola: 667929 markings, 1627456 edges, 4423 markings/sec, 180 secs
lola: 687859 markings, 1680462 edges, 3986 markings/sec, 185 secs
lola: 711573 markings, 1749553 edges, 4743 markings/sec, 190 secs
lola: 731871 markings, 1803043 edges, 4060 markings/sec, 195 secs
lola: 751886 markings, 1857754 edges, 4003 markings/sec, 200 secs
lola: 776196 markings, 1917565 edges, 4862 markings/sec, 205 secs
lola: 797978 markings, 1977041 edges, 4356 markings/sec, 210 secs
lola: 822576 markings, 2049195 edges, 4920 markings/sec, 215 secs
lola: 843534 markings, 2105163 edges, 4192 markings/sec, 220 secs
lola: 863883 markings, 2161652 edges, 4070 markings/sec, 225 secs
lola: 886043 markings, 2223447 edges, 4432 markings/sec, 230 secs
lola: 910532 markings, 2285226 edges, 4898 markings/sec, 235 secs
lola: 934945 markings, 2353429 edges, 4883 markings/sec, 240 secs
lola: 956662 markings, 2413601 edges, 4343 markings/sec, 245 secs
lola: 980156 markings, 2482293 edges, 4699 markings/sec, 250 secs
lola: 1002078 markings, 2544908 edges, 4384 markings/sec, 255 secs
lola: 1022668 markings, 2601524 edges, 4118 markings/sec, 260 secs
lola: 1048328 markings, 2668378 edges, 5132 markings/sec, 265 secs
lola: 1074242 markings, 2741848 edges, 5183 markings/sec, 270 secs
lola: 1095046 markings, 2798003 edges, 4161 markings/sec, 275 secs
lola: 1119674 markings, 2870290 edges, 4926 markings/sec, 280 secs
lola: 1142502 markings, 2936809 edges, 4566 markings/sec, 285 secs
lola: 1163722 markings, 2996411 edges, 4244 markings/sec, 290 secs
lola: 1182866 markings, 3049154 edges, 3829 markings/sec, 295 secs
lola: 1206346 markings, 3117937 edges, 4696 markings/sec, 300 secs
lola: 1218077 markings, 3141760 edges, 2346 markings/sec, 305 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 356 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 415 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: 277357 markings, 606786 edges, 2474372852984315904 markings/sec, 0 secs
lola: 552699 markings, 1218561 edges, 55068 markings/sec, 5 secs
lola: 818419 markings, 1815652 edges, 53144 markings/sec, 10 secs
lola: 1086849 markings, 2423315 edges, 53686 markings/sec, 15 secs
lola: 1356638 markings, 3035998 edges, 53958 markings/sec, 20 secs
lola: 1627845 markings, 3649575 edges, 54241 markings/sec, 25 secs
lola: 1899610 markings, 4267086 edges, 54353 markings/sec, 30 secs
lola: 2172170 markings, 4886779 edges, 54512 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 490 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 612 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 612 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 816 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
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-CTLCardinality-13.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 1224 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 2449 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 2449 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
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 -----
----- 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-V20P20N50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-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-structural"
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 r035-ebro-152646315300304"
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 ;