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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309400306
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526828444660


BK_STOP 1526829213489

--------------------
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': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 4046, 'Memory': 172.36, 'Tool': 'lola'}, {'Time': 4090, 'Memory': 169.57, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality 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 ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ BridgeAndVehicles-PT-V20P20N50 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2336/65536 symbol table entries, 26 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2453 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality.task
lola: E (F ((((2 <= CHOIX_1 + CHOIX_2) OR (VIDANGE_1 + VIDANGE_2 <= ATTENTE_A)) AND (ROUTE_A + 1 <= VIDANGE_1 + VIDANGE_2) AND (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= SORTI_B)))) : A (G ((2 <= ROUTE_A))) : 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 <= ROUTE_B) OR (ROUTE_A <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) OR (SORTI_B + 1 <= CONTROLEUR_1 + CONTROLEUR_2) OR (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 <= CONTROLEUR_1 + CONTROLEUR_2) OR (SUR_PONT_A <= 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) OR ((2 <= ATTENTE_B) AND (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_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 <= SUR_PONT_A))))) : A (G (((3 <= ROUTE_B) OR (SUR_PONT_B <= ROUTE_A)))) : A (G ((3 <= ROUTE_A))) : E (F (())) : E (F (((ATTENTE_B <= SORTI_B) AND (3 <= CAPACITE) AND (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 <= 0) AND (2 <= CHOIX_1 + CHOIX_2)))) : A (G (((3 <= SUR_PONT_B) OR (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= ROUTE_B)))) : A (G ((COMPTEUR_14 <= ATTENTE_A))) : A (G ((COMPTEUR_8 <= COMPTEUR_2))) : A (G ((((CONTROLEUR_1 <= COMPTEUR_36) AND (3 <= COMPTEUR_33)) OR ((3 <= NB_ATTENTE_A_15) AND (COMPTEUR_17 <= NB_ATTENTE_A_12)) OR (SORTI_B + 1 <= COMPTEUR_27) OR (COMPTEUR_35 <= 1)))) : E (F ((1 <= COMPTEUR_34))) : E (F ((2 <= NB_ATTENTE_B_13))) : E (F (((1 <= COMPTEUR_43) AND (NB_ATTENTE_A_12 <= SORTI_B)))) : A (G (((COMPTEUR_28 <= 1) OR (CONTROLEUR_2 <= 2) OR (COMPTEUR_36 <= NB_ATTENTE_A_18)))) : A (G ((COMPTEUR_37 <= 2)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= CHOIX_1 + CHOIX_2) OR (VIDANGE_1 + VIDANGE_2 <= ATTENTE_A)) AND (ROUTE_A + 1 <= VIDANGE_1 + VIDANGE_2) AND (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4867 markings, 10640 edges, 973 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8955 markings, 20148 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= 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-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: 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 <= ROUTE_B) OR (ROUTE_A <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3414 markings, 7844 edges, 683 markings/sec, 0 secs
lola: sara is running 5 secs || 7012 markings, 16289 edges, 720 markings/sec, 5 secs
lola: sara is running 10 secs || 10378 markings, 24261 edges, 673 markings/sec, 10 secs
lola: sara is running 15 secs || 13914 markings, 32243 edges, 707 markings/sec, 15 secs
lola: sara is running 20 secs || 17528 markings, 40337 edges, 723 markings/sec, 20 secs
lola: sara is running 25 secs || 21099 markings, 48383 edges, 714 markings/sec, 25 secs
lola: sara is running 30 secs || 24753 markings, 56479 edges, 731 markings/sec, 30 secs
lola: sara is running 35 secs || 28339 markings, 64548 edges, 717 markings/sec, 35 secs
lola: sara is running 40 secs || 31763 markings, 72483 edges, 685 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34782 markings, 79742 edges
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= ROUTE_B) OR (SUR_PONT_B <= 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 106 markings, 105 edges
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= 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-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality.task
lola: processed formula with 0 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 6 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ATTENTE_B <= SORTI_B) AND (3 <= CAPACITE) AND (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-6.sara
lola: ========================================
lola: subprocess 7 will run for 386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= SUR_PONT_B) OR (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= R... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 8 will run for 435 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((COMPTEUR_14 <= ATTENTE_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-ReachabilityCardinality-8.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: 41 markings, 40 edges
lola: ========================================
lola: subprocess 9 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((COMPTEUR_8 <= COMPTEUR_2)))
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-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 11411 markings, 23757 edges, 2282 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17151 markings, 36205 edges
lola: ========================================
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((CONTROLEUR_1 <= COMPTEUR_36) AND (3 <= COMPTEUR_33)) OR ((3 <= NB_ATTENTE_A_15) AND (COMPTEUR_17 <= NB_ATTENTE_A_12)) OR (SORTI_B + 1 <= COMPTEUR_27) OR (COMPTEUR_35 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= COMPTEUR_34)))
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-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 7555 markings, 16432 edges, 1511 markings/sec, 0 secs
lola: sara is running 5 secs || 15332 markings, 33329 edges, 1555 markings/sec, 5 secs
lola: sara is running 10 secs || 24196 markings, 51343 edges, 1773 markings/sec, 10 secs
lola: sara is running 15 secs || 33952 markings, 76945 edges, 1951 markings/sec, 15 secs
lola: sara is running 20 secs || 43304 markings, 102118 edges, 1870 markings/sec, 20 secs
lola: sara is running 25 secs || 53798 markings, 130951 edges, 2099 markings/sec, 25 secs
lola: sara is running 30 secs || 64788 markings, 159382 edges, 2198 markings/sec, 30 secs
lola: sara is running 35 secs || 75554 markings, 184680 edges, 2153 markings/sec, 35 secs
lola: sara is running 40 secs || 85330 markings, 210937 edges, 1955 markings/sec, 40 secs
lola: sara is running 45 secs || 92566 markings, 228194 edges, 1447 markings/sec, 45 secs
lola: sara is running 50 secs || 101763 markings, 252379 edges, 1839 markings/sec, 50 secs
lola: sara is running 55 secs || 111840 markings, 279994 edges, 2015 markings/sec, 55 secs
lola: sara is running 60 secs || 121213 markings, 303310 edges, 1875 markings/sec, 60 secs
lola: sara is running 65 secs || 131199 markings, 328827 edges, 1997 markings/sec, 65 secs
lola: sara is running 70 secs || 142570 markings, 357327 edges, 2274 markings/sec, 70 secs
lola: sara is running 75 secs || 151893 markings, 378385 edges, 1865 markings/sec, 75 secs
lola: sara is running 80 secs || 160846 markings, 402269 edges, 1791 markings/sec, 80 secs
lola: sara is running 85 secs || 168987 markings, 421962 edges, 1628 markings/sec, 85 secs
lola: sara is running 90 secs || 177430 markings, 444324 edges, 1689 markings/sec, 90 secs
lola: sara is running 95 secs || 185729 markings, 464457 edges, 1660 markings/sec, 95 secs
lola: sara is running 100 secs || 194988 markings, 488412 edges, 1852 markings/sec, 100 secs
lola: sara is running 105 secs || 204047 markings, 511632 edges, 1812 markings/sec, 105 secs
lola: sara is running 110 secs || 213132 markings, 534598 edges, 1817 markings/sec, 110 secs
lola: sara is running 115 secs || 222770 markings, 559672 edges, 1928 markings/sec, 115 secs
lola: sara is running 120 secs || 232650 markings, 584254 edges, 1976 markings/sec, 120 secs
lola: sara is running 125 secs || 243305 markings, 609906 edges, 2131 markings/sec, 125 secs
lola: sara is running 130 secs || 253027 markings, 631608 edges, 1944 markings/sec, 130 secs
sara: warning, failure of lp_solve (at job 8162)
lola: sara is running 135 secs || 260545 markings, 649376 edges, 1504 markings/sec, 135 secs
lola: sara is running 140 secs || 269959 markings, 675013 edges, 1883 markings/sec, 140 secs
lola: sara is running 145 secs || 277432 markings, 692699 edges, 1495 markings/sec, 145 secs
lola: sara is running 150 secs || 284834 markings, 710824 edges, 1480 markings/sec, 150 secs
lola: sara is running 155 secs || 294327 markings, 735501 edges, 1899 markings/sec, 155 secs
lola: sara is running 160 secs || 302802 markings, 757900 edges, 1695 markings/sec, 160 secs
lola: sara is running 165 secs || 311248 markings, 778096 edges, 1689 markings/sec, 165 secs
lola: sara is running 170 secs || 320496 markings, 801710 edges, 1850 markings/sec, 170 secs
lola: sara is running 175 secs || 329762 markings, 825361 edges, 1853 markings/sec, 175 secs
lola: sara is running 180 secs || 338821 markings, 848134 edges, 1812 markings/sec, 180 secs
lola: sara is running 185 secs || 348177 markings, 871098 edges, 1871 markings/sec, 185 secs
lola: sara is running 190 secs || 357414 markings, 893865 edges, 1847 markings/sec, 190 secs
lola: sara is running 195 secs || 367754 markings, 919823 edges, 2068 markings/sec, 195 secs
lola: sara is running 200 secs || 378999 markings, 946134 edges, 2249 markings/sec, 200 secs
lola: sara is running 205 secs || 387335 markings, 964451 edges, 1667 markings/sec, 205 secs
lola: sara is running 210 secs || 395031 markings, 982667 edges, 1539 markings/sec, 210 secs
lola: sara is running 215 secs || 404376 markings, 1008129 edges, 1869 markings/sec, 215 secs
lola: sara is running 220 secs || 412372 markings, 1027044 edges, 1599 markings/sec, 220 secs
lola: sara is running 225 secs || 419566 markings, 1044622 edges, 1439 markings/sec, 225 secs
lola: sara is running 230 secs || 428615 markings, 1069017 edges, 1810 markings/sec, 230 secs
lola: sara is running 235 secs || 436739 markings, 1088013 edges, 1625 markings/sec, 235 secs
lola: sara is running 240 secs || 444275 markings, 1106517 edges, 1507 markings/sec, 240 secs
lola: sara is running 245 secs || 453890 markings, 1131031 edges, 1923 markings/sec, 245 secs
lola: sara is running 250 secs || 461846 markings, 1150968 edges, 1591 markings/sec, 250 secs
lola: sara is running 255 secs || 471077 markings, 1173964 edges, 1846 markings/sec, 255 secs
lola: sara is running 260 secs || 480583 markings, 1198174 edges, 1901 markings/sec, 260 secs
lola: sara is running 265 secs || 488566 markings, 1217657 edges, 1597 markings/sec, 265 secs
lola: sara is running 270 secs || 497865 markings, 1240839 edges, 1860 markings/sec, 270 secs
lola: sara is running 275 secs || 507249 markings, 1264057 edges, 1877 markings/sec, 275 secs
lola: sara is running 280 secs || 517203 markings, 1288997 edges, 1991 markings/sec, 280 secs
lola: sara is running 285 secs || 526811 markings, 1312355 edges, 1922 markings/sec, 285 secs
lola: sara is running 290 secs || 537131 markings, 1337319 edges, 2064 markings/sec, 290 secs
lola: sara is running 295 secs || 547632 markings, 1360733 edges, 2100 markings/sec, 295 secs
lola: sara is running 300 secs || 555012 markings, 1377668 edges, 1476 markings/sec, 300 secs
lola: sara is running 305 secs || 562684 markings, 1395887 edges, 1534 markings/sec, 305 secs
lola: sara is running 310 secs || 571914 markings, 1420988 edges, 1846 markings/sec, 310 secs
lola: sara is running 315 secs || 580302 markings, 1441413 edges, 1678 markings/sec, 315 secs
lola: sara is running 320 secs || 587453 markings, 1458159 edges, 1430 markings/sec, 320 secs
lola: sara is running 325 secs || 594827 markings, 1476307 edges, 1475 markings/sec, 325 secs
lola: sara is running 330 secs || 604693 markings, 1502548 edges, 1973 markings/sec, 330 secs
lola: sara is running 335 secs || 612344 markings, 1520500 edges, 1530 markings/sec, 335 secs
lola: sara is running 340 secs || 619945 markings, 1538994 edges, 1520 markings/sec, 340 secs
lola: sara is running 345 secs || 629893 markings, 1564652 edges, 1990 markings/sec, 345 secs
lola: sara is running 350 secs || 637354 markings, 1582748 edges, 1492 markings/sec, 350 secs
lola: sara is running 355 secs || 646891 markings, 1607563 edges, 1907 markings/sec, 355 secs
lola: sara is running 360 secs || 654904 markings, 1626470 edges, 1603 markings/sec, 360 secs
lola: sara is running 365 secs || 664343 markings, 1650839 edges, 1888 markings/sec, 365 secs
lola: sara is running 370 secs || 672394 markings, 1669953 edges, 1610 markings/sec, 370 secs
lola: sara is running 375 secs || 682043 markings, 1693942 edges, 1930 markings/sec, 375 secs
lola: sara is running 380 secs || 691192 markings, 1717179 edges, 1830 markings/sec, 380 secs
lola: sara is running 385 secs || 700108 markings, 1739358 edges, 1783 markings/sec, 385 secs
lola: sara is running 390 secs || 709682 markings, 1762753 edges, 1915 markings/sec, 390 secs
lola: sara is running 395 secs || 719508 markings, 1786511 edges, 1965 markings/sec, 395 secs
lola: sara is running 400 secs || 729392 markings, 1810643 edges, 1977 markings/sec, 400 secs
lola: sara is running 405 secs || 739901 markings, 1835575 edges, 2102 markings/sec, 405 secs
lola: sara is running 410 secs || 749823 markings, 1857214 edges, 1984 markings/sec, 410 secs
lola: sara is running 415 secs || 757271 markings, 1874467 edges, 1490 markings/sec, 415 secs
lola: sara is running 420 secs || 764857 markings, 1892615 edges, 1517 markings/sec, 420 secs
lola: sara is running 425 secs || 773191 markings, 1913314 edges, 1667 markings/sec, 425 secs
lola: sara is running 430 secs || 782088 markings, 1937150 edges, 1779 markings/sec, 430 secs
lola: sara is running 435 secs || 790406 markings, 1956744 edges, 1664 markings/sec, 435 secs
lola: sara is running 440 secs || 797565 markings, 1974206 edges, 1432 markings/sec, 440 secs
lola: sara is running 445 secs || 805075 markings, 1992744 edges, 1502 markings/sec, 445 secs
lola: sara is running 450 secs || 814997 markings, 2019201 edges, 1984 markings/sec, 450 secs
lola: sara is running 455 secs || 822851 markings, 2037322 edges, 1571 markings/sec, 455 secs
lola: sara is running 460 secs || 830266 markings, 2055637 edges, 1483 markings/sec, 460 secs
lola: sara is running 465 secs || 839681 markings, 2080230 edges, 1883 markings/sec, 465 secs
lola: sara is running 470 secs || 848054 markings, 2099978 edges, 1675 markings/sec, 470 secs
lola: sara is running 475 secs || 855526 markings, 2118305 edges, 1494 markings/sec, 475 secs
lola: sara is running 480 secs || 864914 markings, 2142893 edges, 1878 markings/sec, 480 secs
lola: sara is running 485 secs || 872963 markings, 2161777 edges, 1610 markings/sec, 485 secs
lola: sara is running 490 secs || 880822 markings, 2181285 edges, 1572 markings/sec, 490 secs
lola: sara is running 495 secs || 890469 markings, 2205241 edges, 1929 markings/sec, 495 secs
lola: sara is running 500 secs || 898280 markings, 2224455 edges, 1562 markings/sec, 500 secs
lola: sara is running 505 secs || 908039 markings, 2248648 edges, 1952 markings/sec, 505 secs
lola: sara is running 510 secs || 917074 markings, 2271423 edges, 1807 markings/sec, 510 secs
lola: sara is running 515 secs || 925727 markings, 2292226 edges, 1731 markings/sec, 515 secs
lola: sara is running 520 secs || 935277 markings, 2315769 edges, 1910 markings/sec, 520 secs
lola: sara is running 525 secs || 944704 markings, 2339044 edges, 1885 markings/sec, 525 secs
lola: sara is running 530 secs || 954187 markings, 2362219 edges, 1897 markings/sec, 530 secs
lola: sara is running 535 secs || 963665 markings, 2385465 edges, 1896 markings/sec, 535 secs
lola: sara is running 540 secs || 973705 markings, 2409557 edges, 2008 markings/sec, 540 secs
lola: sara is running 545 secs || 984155 markings, 2434010 edges, 2090 markings/sec, 545 secs
lola: sara is running 550 secs || 992773 markings, 2452598 edges, 1724 markings/sec, 550 secs
lola: sara is running 555 secs || 1000168 markings, 2469960 edges, 1479 markings/sec, 555 secs
lola: sara is running 560 secs || 1007790 markings, 2488082 edges, 1524 markings/sec, 560 secs
lola: sara is running 565 secs || 1015427 markings, 2506418 edges, 1527 markings/sec, 565 secs
lola: sara is running 570 secs || 1024740 markings, 2532165 edges, 1863 markings/sec, 570 secs
lola: sara is running 575 secs || 1033783 markings, 2554047 edges, 1809 markings/sec, 575 secs
lola: sara is running 580 secs || 1040828 markings, 2570475 edges, 1409 markings/sec, 580 secs
lola: sara is running 585 secs || 1047998 markings, 2588206 edges, 1434 markings/sec, 585 secs
lola: sara is running 590 secs || 1055438 markings, 2606338 edges, 1488 markings/sec, 590 secs
lola: sara is running 595 secs || 1065327 markings, 2633055 edges, 1978 markings/sec, 595 secs
lola: sara is running 600 secs || 1073439 markings, 2651690 edges, 1622 markings/sec, 600 secs
lola: sara is running 605 secs || 1080726 markings, 2669528 edges, 1457 markings/sec, 605 secs
lola: sara is running 610 secs || 1088324 markings, 2688200 edges, 1520 markings/sec, 610 secs
lola: sara is running 615 secs || 1098384 markings, 2714782 edges, 2012 markings/sec, 615 secs
lola: sara is running 620 secs || 1106251 markings, 2732939 edges, 1573 markings/sec, 620 secs
lola: sara is running 625 secs || 1113792 markings, 2751508 edges, 1508 markings/sec, 625 secs
lola: sara is running 630 secs || 1123287 markings, 2776468 edges, 1899 markings/sec, 630 secs
lola: sara is running 635 secs || 1131723 markings, 2796146 edges, 1687 markings/sec, 635 secs
lola: sara is running 640 secs || 1139395 markings, 2815044 edges, 1534 markings/sec, 640 secs
lola: sara is running 645 secs || 1148978 markings, 2839801 edges, 1917 markings/sec, 645 secs
lola: sara is running 650 secs || 1157156 markings, 2859073 edges, 1636 markings/sec, 650 secs
lola: sara is running 655 secs || 1165657 markings, 2880926 edges, 1700 markings/sec, 655 secs
lola: sara is running 660 secs || 1174916 markings, 2902925 edges, 1852 markings/sec, 660 secs
lola: sara is running 665 secs || 1182751 markings, 2922264 edges, 1567 markings/sec, 665 secs
lola: sara is running 670 secs || 1192442 markings, 2946155 edges, 1938 markings/sec, 670 secs
lola: sara is running 675 secs || 1201264 markings, 2968168 edges, 1764 markings/sec, 675 secs
lola: sara is running 680 secs || 1210038 markings, 2989445 edges, 1755 markings/sec, 680 secs
lola: sara is running 685 secs || 1219379 markings, 3012485 edges, 1868 markings/sec, 685 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '@'
Aborted (core dumped)
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-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="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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