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 irma4mcc-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 r031-ebro-152646309400304
=====================================================================

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


BK_STOP 1526829176356

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

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 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 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: 305622 markings, 632406 edges, 3689348869717491712 markings/sec, 0 secs
lola: 600134 markings, 1265041 edges, 58902 markings/sec, 5 secs
lola: 892190 markings, 1895520 edges, 58411 markings/sec, 10 secs
lola: 1186951 markings, 2530645 edges, 58952 markings/sec, 15 secs
lola: 1475323 markings, 3156448 edges, 57674 markings/sec, 20 secs
lola: 1772514 markings, 3796681 edges, 59438 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
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: 16594 markings, 25819 edges, 3319 markings/sec, 0 secs
lola: 30291 markings, 48963 edges, 2739 markings/sec, 5 secs
lola: 43130 markings, 70785 edges, 2568 markings/sec, 10 secs
lola: 55614 markings, 91840 edges, 2497 markings/sec, 15 secs
lola: 67755 markings, 112478 edges, 2428 markings/sec, 20 secs
lola: 79932 markings, 133719 edges, 2435 markings/sec, 25 secs
lola: 90974 markings, 152235 edges, 2208 markings/sec, 30 secs
lola: 102649 markings, 172826 edges, 2335 markings/sec, 35 secs
lola: 113083 markings, 190085 edges, 2087 markings/sec, 40 secs
lola: 123974 markings, 209230 edges, 2178 markings/sec, 45 secs
lola: 134156 markings, 226297 edges, 2036 markings/sec, 50 secs
lola: 144135 markings, 243388 edges, 1996 markings/sec, 55 secs
lola: 154109 markings, 260795 edges, 1995 markings/sec, 60 secs
lola: 164195 markings, 277747 edges, 2017 markings/sec, 65 secs
lola: 173403 markings, 293492 edges, 1842 markings/sec, 70 secs
lola: 183038 markings, 310264 edges, 1927 markings/sec, 75 secs
lola: 191686 markings, 325363 edges, 1730 markings/sec, 80 secs
lola: 200816 markings, 340455 edges, 1826 markings/sec, 85 secs
lola: 209382 markings, 355136 edges, 1713 markings/sec, 90 secs
lola: 217992 markings, 370131 edges, 1722 markings/sec, 95 secs
lola: 227549 markings, 387181 edges, 1911 markings/sec, 100 secs
lola: 235648 markings, 400202 edges, 1620 markings/sec, 105 secs
lola: 243690 markings, 413845 edges, 1608 markings/sec, 110 secs
lola: 252170 markings, 428538 edges, 1696 markings/sec, 115 secs
lola: 261013 markings, 444035 edges, 1769 markings/sec, 120 secs
lola: 269241 markings, 458540 edges, 1646 markings/sec, 125 secs
lola: 277454 markings, 471833 edges, 1643 markings/sec, 130 secs
lola: 285581 markings, 485585 edges, 1625 markings/sec, 135 secs
lola: 293782 markings, 499851 edges, 1640 markings/sec, 140 secs
lola: 301751 markings, 513567 edges, 1594 markings/sec, 145 secs
lola: 309537 markings, 527100 edges, 1557 markings/sec, 150 secs
lola: 317477 markings, 540595 edges, 1588 markings/sec, 155 secs
lola: 325877 markings, 554542 edges, 1680 markings/sec, 160 secs
lola: 333755 markings, 567939 edges, 1576 markings/sec, 165 secs
lola: 342234 markings, 582849 edges, 1696 markings/sec, 170 secs
lola: 350227 markings, 596490 edges, 1599 markings/sec, 175 secs
lola: 358109 markings, 610203 edges, 1576 markings/sec, 180 secs
lola: 365634 markings, 623344 edges, 1505 markings/sec, 185 secs
lola: 373831 markings, 636626 edges, 1639 markings/sec, 190 secs
lola: 381553 markings, 649605 edges, 1544 markings/sec, 195 secs
lola: 389841 markings, 663851 edges, 1658 markings/sec, 200 secs
lola: 397308 markings, 676709 edges, 1493 markings/sec, 205 secs
lola: 405029 markings, 690095 edges, 1544 markings/sec, 210 secs
lola: 413057 markings, 704072 edges, 1606 markings/sec, 215 secs
lola: 420659 markings, 717364 edges, 1520 markings/sec, 220 secs
lola: 428670 markings, 730261 edges, 1602 markings/sec, 225 secs
lola: 436670 markings, 743686 edges, 1600 markings/sec, 230 secs
lola: 444454 markings, 756916 edges, 1557 markings/sec, 235 secs
lola: 452270 markings, 770631 edges, 1563 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 296 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: 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 296 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: 206404 markings, 872906 edges, 3689320832170983424 markings/sec, 0 secs
lola: 413226 markings, 1767730 edges, 41364 markings/sec, 5 secs
lola: 614566 markings, 2645077 edges, 40268 markings/sec, 10 secs
lola: 809795 markings, 3501190 edges, 39046 markings/sec, 15 secs
lola: 1004891 markings, 4355805 edges, 39019 markings/sec, 20 secs
lola: 1196714 markings, 5203103 edges, 38365 markings/sec, 25 secs
lola: 1385710 markings, 6043353 edges, 37799 markings/sec, 30 secs
lola: 1574738 markings, 6885148 edges, 37806 markings/sec, 35 secs
lola: 1763108 markings, 7722375 edges, 37674 markings/sec, 40 secs
lola: 1949252 markings, 8548415 edges, 37229 markings/sec, 45 secs
lola: 2131588 markings, 9369495 edges, 36467 markings/sec, 50 secs
lola: 2317888 markings, 10198487 edges, 37260 markings/sec, 55 secs
lola: 2495901 markings, 11005730 edges, 35603 markings/sec, 60 secs
lola: 2681363 markings, 11831348 edges, 37092 markings/sec, 65 secs
lola: 2857574 markings, 12630598 edges, 35242 markings/sec, 70 secs
lola: 3043937 markings, 13448434 edges, 37273 markings/sec, 75 secs
lola: 3222431 markings, 14255511 edges, 35699 markings/sec, 80 secs
lola: 3401760 markings, 15059797 edges, 35866 markings/sec, 85 secs
lola: 3587447 markings, 15883985 edges, 37137 markings/sec, 90 secs
lola: 3766424 markings, 16695990 edges, 35795 markings/sec, 95 secs
lola: 3946120 markings, 17503888 edges, 35939 markings/sec, 100 secs
lola: 4133030 markings, 18335916 edges, 37382 markings/sec, 105 secs
lola: 4312452 markings, 19149958 edges, 35884 markings/sec, 110 secs
lola: 4490887 markings, 19965590 edges, 35687 markings/sec, 115 secs
lola: 4681143 markings, 20807355 edges, 38051 markings/sec, 120 secs
lola: 4865516 markings, 21641876 edges, 36875 markings/sec, 125 secs
lola: 5045611 markings, 22467061 edges, 36019 markings/sec, 130 secs
lola: 5231542 markings, 23302608 edges, 37186 markings/sec, 135 secs
lola: 5421562 markings, 24156902 edges, 38004 markings/sec, 140 secs
lola: 5606052 markings, 24994683 edges, 36898 markings/sec, 145 secs
lola: 5788587 markings, 25834046 edges, 36507 markings/sec, 150 secs
lola: 5974850 markings, 26673994 edges, 37253 markings/sec, 155 secs
lola: 6166128 markings, 27534825 edges, 38256 markings/sec, 160 secs
lola: 6352370 markings, 28381126 edges, 37248 markings/sec, 165 secs
lola: 6535016 markings, 29222428 edges, 36529 markings/sec, 170 secs
lola: 6717556 markings, 30061619 edges, 36508 markings/sec, 175 secs
lola: 6909514 markings, 30919575 edges, 38392 markings/sec, 180 secs
lola: 7095675 markings, 31763656 edges, 37232 markings/sec, 185 secs
lola: 7276806 markings, 32594921 edges, 36226 markings/sec, 190 secs
lola: 7457484 markings, 33426284 edges, 36136 markings/sec, 195 secs
lola: 7638611 markings, 34265737 edges, 36225 markings/sec, 200 secs
lola: 7829475 markings, 35116129 edges, 38173 markings/sec, 205 secs
lola: 8015743 markings, 35965507 edges, 37254 markings/sec, 210 secs
lola: 8201276 markings, 36815945 edges, 37107 markings/sec, 215 secs
lola: 8384655 markings, 37663080 edges, 36676 markings/sec, 220 secs
lola: 8567256 markings, 38508317 edges, 36520 markings/sec, 225 secs
lola: 8756860 markings, 39366565 edges, 37921 markings/sec, 230 secs
lola: 8947818 markings, 40235837 edges, 38192 markings/sec, 235 secs
lola: 9135895 markings, 41101325 edges, 37615 markings/sec, 240 secs
lola: 9321558 markings, 41952498 edges, 37133 markings/sec, 245 secs
lola: 9506673 markings, 42812403 edges, 37023 markings/sec, 250 secs
lola: 9688579 markings, 43656580 edges, 36381 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: 186222 markings, 807100 edges, 2316351866474070016 markings/sec, 0 secs
lola: 354494 markings, 1636375 edges, 33654 markings/sec, 5 secs
lola: 519112 markings, 2455564 edges, 32924 markings/sec, 10 secs
lola: 684004 markings, 3278574 edges, 32978 markings/sec, 15 secs
lola: 845333 markings, 4084043 edges, 32266 markings/sec, 20 secs
lola: 1009344 markings, 4908758 edges, 32802 markings/sec, 25 secs
lola: 1169908 markings, 5718459 edges, 32113 markings/sec, 30 secs
lola: 1329280 markings, 6522628 edges, 31874 markings/sec, 35 secs
lola: 1488308 markings, 7327625 edges, 31806 markings/sec, 40 secs
lola: 1647271 markings, 8128306 edges, 31793 markings/sec, 45 secs
lola: 1799080 markings, 8902325 edges, 30362 markings/sec, 50 secs
lola: 1948202 markings, 9674245 edges, 29824 markings/sec, 55 secs
lola: 2101778 markings, 10455461 edges, 30715 markings/sec, 60 secs
lola: 2251990 markings, 11231477 edges, 30042 markings/sec, 65 secs
lola: 2406683 markings, 12021115 edges, 30939 markings/sec, 70 secs
lola: 2558619 markings, 12803407 edges, 30387 markings/sec, 75 secs
lola: 2714302 markings, 13596854 edges, 31137 markings/sec, 80 secs
lola: 2868105 markings, 14392310 edges, 30761 markings/sec, 85 secs
lola: 3022577 markings, 15186894 edges, 30894 markings/sec, 90 secs
lola: 3181573 markings, 15989477 edges, 31799 markings/sec, 95 secs
lola: 3336815 markings, 16794683 edges, 31048 markings/sec, 100 secs
lola: 3494065 markings, 17599072 edges, 31450 markings/sec, 105 secs
lola: 3653280 markings, 18411224 edges, 31843 markings/sec, 110 secs
lola: 3812042 markings, 19223293 edges, 31752 markings/sec, 115 secs
lola: 3969461 markings, 20039807 edges, 31484 markings/sec, 120 secs
lola: 4131536 markings, 20858308 edges, 32415 markings/sec, 125 secs
lola: 4292746 markings, 21680946 edges, 32242 markings/sec, 130 secs
lola: 4452323 markings, 22506549 edges, 31915 markings/sec, 135 secs
lola: 4612521 markings, 23324927 edges, 32040 markings/sec, 140 secs
lola: 4776415 markings, 24156619 edges, 32779 markings/sec, 145 secs
lola: 4939804 markings, 24991842 edges, 32678 markings/sec, 150 secs
lola: 5101172 markings, 25823685 edges, 32274 markings/sec, 155 secs
lola: 5261523 markings, 26649938 edges, 32070 markings/sec, 160 secs
lola: 5427009 markings, 27478565 edges, 33097 markings/sec, 165 secs
lola: 5589644 markings, 28308682 edges, 32527 markings/sec, 170 secs
lola: 5751393 markings, 29139956 edges, 32350 markings/sec, 175 secs
lola: 5915263 markings, 29987572 edges, 32774 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 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: 8554 markings, 14721 edges, 1711 markings/sec, 0 secs
lola: 21151 markings, 39226 edges, 2519 markings/sec, 5 secs
lola: 33974 markings, 65096 edges, 2565 markings/sec, 10 secs
lola: 47497 markings, 92868 edges, 2705 markings/sec, 15 secs
lola: 60032 markings, 119472 edges, 2507 markings/sec, 20 secs
lola: 74767 markings, 151019 edges, 2947 markings/sec, 25 secs
lola: 90029 markings, 183825 edges, 3052 markings/sec, 30 secs
lola: 104507 markings, 216448 edges, 2896 markings/sec, 35 secs
lola: 121723 markings, 254697 edges, 3443 markings/sec, 40 secs
lola: 136860 markings, 289593 edges, 3027 markings/sec, 45 secs
lola: 154090 markings, 328426 edges, 3446 markings/sec, 50 secs
lola: 170646 markings, 367373 edges, 3311 markings/sec, 55 secs
lola: 186486 markings, 405954 edges, 3168 markings/sec, 60 secs
lola: 205505 markings, 448746 edges, 3804 markings/sec, 65 secs
lola: 222530 markings, 490268 edges, 3405 markings/sec, 70 secs
lola: 240632 markings, 532981 edges, 3620 markings/sec, 75 secs
lola: 259743 markings, 579297 edges, 3822 markings/sec, 80 secs
lola: 277408 markings, 623123 edges, 3533 markings/sec, 85 secs
lola: 295035 markings, 667196 edges, 3525 markings/sec, 90 secs
lola: 316857 markings, 719623 edges, 4364 markings/sec, 95 secs
lola: 333451 markings, 760633 edges, 3319 markings/sec, 100 secs
lola: 351886 markings, 807933 edges, 3687 markings/sec, 105 secs
lola: 373506 markings, 860387 edges, 4324 markings/sec, 110 secs
lola: 393600 markings, 912574 edges, 4019 markings/sec, 115 secs
lola: 412705 markings, 963073 edges, 3821 markings/sec, 120 secs
lola: 428610 markings, 1002170 edges, 3181 markings/sec, 125 secs
lola: 452337 markings, 1060702 edges, 4745 markings/sec, 130 secs
lola: 472202 markings, 1111883 edges, 3973 markings/sec, 135 secs
lola: 491145 markings, 1162246 edges, 3789 markings/sec, 140 secs
lola: 513413 markings, 1224028 edges, 4454 markings/sec, 145 secs
lola: 532883 markings, 1271959 edges, 3894 markings/sec, 150 secs
lola: 555711 markings, 1329622 edges, 4566 markings/sec, 155 secs
lola: 575789 markings, 1383237 edges, 4016 markings/sec, 160 secs
lola: 597459 markings, 1444157 edges, 4334 markings/sec, 165 secs
lola: 617016 markings, 1494830 edges, 3911 markings/sec, 170 secs
lola: 638700 markings, 1550605 edges, 4337 markings/sec, 175 secs
lola: 662241 markings, 1611807 edges, 4708 markings/sec, 180 secs
lola: 684223 markings, 1672357 edges, 4396 markings/sec, 185 secs
lola: 702652 markings, 1720964 edges, 3686 markings/sec, 190 secs
lola: 725020 markings, 1785226 edges, 4474 markings/sec, 195 secs
lola: 745977 markings, 1844468 edges, 4191 markings/sec, 200 secs
lola: 769638 markings, 1900644 edges, 4732 markings/sec, 205 secs
lola: 793125 markings, 1966424 edges, 4697 markings/sec, 210 secs
lola: 812329 markings, 2016781 edges, 3841 markings/sec, 215 secs
lola: 835561 markings, 2083771 edges, 4646 markings/sec, 220 secs
lola: 857371 markings, 2146523 edges, 4362 markings/sec, 225 secs
lola: 878065 markings, 2204283 edges, 4139 markings/sec, 230 secs
lola: 901311 markings, 2260328 edges, 4649 markings/sec, 235 secs
lola: 924816 markings, 2324115 edges, 4701 markings/sec, 240 secs
lola: 949568 markings, 2395719 edges, 4950 markings/sec, 245 secs
lola: 968969 markings, 2449027 edges, 3880 markings/sec, 250 secs
lola: 989595 markings, 2507089 edges, 4125 markings/sec, 255 secs
lola: 1012052 markings, 2570913 edges, 4491 markings/sec, 260 secs
lola: 1036291 markings, 2640508 edges, 4848 markings/sec, 265 secs
lola: 1063018 markings, 2709437 edges, 5345 markings/sec, 270 secs
lola: 1086794 markings, 2777386 edges, 4755 markings/sec, 275 secs
lola: 1108793 markings, 2838776 edges, 4400 markings/sec, 280 secs
lola: 1129380 markings, 2897383 edges, 4117 markings/sec, 285 secs
lola: 1152011 markings, 2962596 edges, 4526 markings/sec, 290 secs
lola: 1176131 markings, 3033407 edges, 4824 markings/sec, 295 secs
lola: 1198161 markings, 3099979 edges, 4406 markings/sec, 300 secs
lola: 1211452 markings, 3127661 edges, 2658 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: 278059 markings, 608416 edges, 2474372852984315904 markings/sec, 0 secs
lola: 553751 markings, 1221090 edges, 55138 markings/sec, 5 secs
lola: 822831 markings, 1825803 edges, 53816 markings/sec, 10 secs
lola: 1092595 markings, 2436052 edges, 53953 markings/sec, 15 secs
lola: 1363405 markings, 3051293 edges, 54162 markings/sec, 20 secs
lola: 1635822 markings, 3667775 edges, 54483 markings/sec, 25 secs
lola: 1908994 markings, 4288573 edges, 54634 markings/sec, 30 secs
lola: 2183026 markings, 4911663 edges, 54806 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 613 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 613 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 817 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 1226 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 2452 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 2452 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 stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-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 irma4mcc-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 r031-ebro-152646309400304"
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 ;