fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r034-ebro-152646312400332
Last Updated
June 26, 2018

About the Execution of M4M.full for BridgeAndVehicles-PT-V50P50N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4960.880 495159.00 737200.00 228.50 ???????????????? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 172K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 506K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 76K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 213K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 359 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 105K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 308K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 1.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is BridgeAndVehicles-PT-V50P50N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-ebro-152646312400332
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527034008869


BK_STOP 1527034504028

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-V50P50N10 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': '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': 2354341, 'Memory': 15575.46, 'Tool': 'lola'}, {'Time': 2355144, 'Memory': 15931.55, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-PT-V50P50N10...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V50P50N10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ BridgeAndVehicles-PT-V50P50N10 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- 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: 1456/65536 symbol table entries, 11 collisions
lola: preprocessing...
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V50P50N10-CTLCardinality.task
lola: E (X (NOT(A (G ((2 <= ROUTE_B)))))) : A (G (((ATTENTE_A <= VIDANGE_1 + VIDANGE_2) 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 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 <= SUR_PONT_A) 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 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 <= CAPACITE) OR (3 <= ROUTE_A) OR (SUR_PONT_B + 1 <= CAPACITE)))) : (NOT((((SORTI_B + 1 <= CONTROLEUR_1 + CONTROLEUR_2) AND (ATTENTE_A + 1 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50)) OR A (F ((2 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9))))) OR (A (G ((3 <= VIDANGE_1 + VIDANGE_2))) OR E (G ((ATTENTE_A + 1 <= CHOIX_1 + CHOIX_2))))) : (((((ROUTE_B <= 0) 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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 <= 1)) AND E (F ((ROUTE_A <= ATTENTE_A)))) AND (ATTENTE_B <= 2)) AND A (X (A (F ((ROUTE_A <= CHOIX_1 + CHOIX_2)))))) : A (G (A (F ((1 <= ATTENTE_B))))) : E (X (E (G (((2 <= ATTENTE_B) OR (2 <= ROUTE_A)))))) : E (G (A (X ((SORTI_A <= CAPACITE))))) : A ((((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= SORTI_B) OR (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + 1 <= CAPACITE)) U ((ROUTE_B <= SUR_PONT_A) OR (ROUTE_B <= 1)))) : E (G (NOT(E (G ((NB_ATTENTE_B_47 <= NB_ATTENTE_A_35)))))) : (E (G (((NB_ATTENTE_A_21 <= NB_ATTENTE_B_11) OR (2 <= COMPTEUR_10) OR (NB_ATTENTE_A_43 + 1 <= NB_ATTENTE_A_50)))) AND (NB_ATTENTE_B_2 <= NB_ATTENTE_B_36)) : (E (G (E (F ((NB_ATTENTE_A_10 <= NB_ATTENTE_B_43))))) AND A (G (E (F ((2 <= NB_ATTENTE_B_29)))))) : NOT(E (F (E (F ((2 <= NB_ATTENTE_A_25)))))) : A (G (A (((NB_ATTENTE_B_21 <= NB_ATTENTE_A_24) U (NB_ATTENTE_B_49 <= NB_ATTENTE_B_47))))) : E (G ((((NB_ATTENTE_A_18 <= NB_ATTENTE_B_30) AND ((2 <= NB_ATTENTE_B_40) OR (NB_ATTENTE_A_39 <= NB_ATTENTE_B_47))) OR E (F ((3 <= CONTROLEUR_1)))))) : (((A (F ((NB_ATTENTE_B_4 <= NB_ATTENTE_B_48))) AND ((3 <= NB_ATTENTE_A_31) OR ((NB_ATTENTE_B_50 <= ROUTE_A) AND (3 <= NB_ATTENTE_A_3)))) OR (E (F ((NB_ATTENTE_B_19 <= ROUTE_B))) AND E (F ((1 <= NB_ATTENTE_A_39))))) AND ((2 <= NB_ATTENTE_A_33) OR (COMPTEUR_8 <= 0))) : (A (F (E (X ((1 <= NB_ATTENTE_A_27))))) AND ((((NB_ATTENTE_A_15 <= NB_ATTENTE_B_16) OR (1 <= NB_ATTENTE_A_38) OR (NB_ATTENTE_B_15 <= CAPACITE)) AND (((NB_ATTENTE_A_4 <= COMPTEUR_2) AND (NB_ATTENTE_B_34 <= NB_ATTENTE_B_13)) OR ((NB_ATTENTE_B_22 <= NB_ATTENTE_B_5) AND (3 <= NB_ATTENTE_A_26)))) OR ((NB_ATTENTE_B_28 <= NB_ATTENTE_B_43) AND (2 <= NB_ATTENTE_B_11) AND (VIDANGE_1 <= CAPACITE) AND (NB_ATTENTE_B_0 <= NB_ATTENTE_B_12) AND (NB_ATTENTE_B_41 <= NB_ATTENTE_B_44))))
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 (X (NOT(A (G ((2 <= ROUTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (ROUTE_B <= 1)))
lola: processed formula length: 28
lola: 5 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 99 markings, 98 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((ATTENTE_A <= VIDANGE_1 + VIDANGE_2) 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 + N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 17505 markings, 41273 edges, 3501 markings/sec, 0 secs
lola: sara is running 5 secs || 31157 markings, 75779 edges, 2730 markings/sec, 5 secs
lola: sara is running 10 secs || 43688 markings, 108228 edges, 2506 markings/sec, 10 secs
lola: sara is running 15 secs || 53431 markings, 134885 edges, 1949 markings/sec, 15 secs
lola: sara is running 20 secs || 64486 markings, 161351 edges, 2211 markings/sec, 20 secs
lola: sara is running 25 secs || 73692 markings, 187453 edges, 1841 markings/sec, 25 secs
lola: sara is running 30 secs || 84938 markings, 213285 edges, 2249 markings/sec, 30 secs
lola: sara is running 35 secs || 93442 markings, 237873 edges, 1701 markings/sec, 35 secs
lola: sara is running 40 secs || 102741 markings, 262158 edges, 1860 markings/sec, 40 secs
lola: sara is running 45 secs || 116279 markings, 298264 edges, 2708 markings/sec, 45 secs
lola: sara is running 50 secs || 125999 markings, 325270 edges, 1944 markings/sec, 50 secs
lola: sara is running 55 secs || 135620 markings, 351789 edges, 1924 markings/sec, 55 secs
lola: sara is running 60 secs || 143740 markings, 374399 edges, 1624 markings/sec, 60 secs
lola: sara is running 65 secs || 157809 markings, 413260 edges, 2814 markings/sec, 65 secs
lola: sara is running 70 secs || 167135 markings, 439227 edges, 1865 markings/sec, 70 secs
lola: sara is running 75 secs || 176583 markings, 466265 edges, 1890 markings/sec, 75 secs
lola: sara is running 80 secs || 184698 markings, 488776 edges, 1623 markings/sec, 80 secs
lola: sara is running 85 secs || 198133 markings, 525196 edges, 2687 markings/sec, 85 secs
lola: sara is running 90 secs || 208912 markings, 555313 edges, 2156 markings/sec, 90 secs
lola: sara is running 95 secs || 219254 markings, 584424 edges, 2068 markings/sec, 95 secs
lola: sara is running 100 secs || 228339 markings, 609955 edges, 1817 markings/sec, 100 secs
lola: sara is running 105 secs || 236179 markings, 632228 edges, 1568 markings/sec, 105 secs
lola: sara is running 110 secs || 249093 markings, 666966 edges, 2583 markings/sec, 110 secs
lola: sara is running 115 secs || 261969 markings, 702844 edges, 2575 markings/sec, 115 secs
lola: sara is running 120 secs || 271210 markings, 729327 edges, 1848 markings/sec, 120 secs
lola: sara is running 125 secs || 280535 markings, 755812 edges, 1865 markings/sec, 125 secs
lola: sara is running 130 secs || 290076 markings, 782354 edges, 1908 markings/sec, 130 secs
lola: sara is running 135 secs || 298137 markings, 805695 edges, 1612 markings/sec, 135 secs
lola: sara is running 140 secs || 312641 markings, 844545 edges, 2901 markings/sec, 140 secs
lola: sara is running 145 secs || 323760 markings, 875977 edges, 2224 markings/sec, 145 secs
lola: sara is running 150 secs || 333387 markings, 903324 edges, 1925 markings/sec, 150 secs
lola: sara is running 155 secs || 343094 markings, 930675 edges, 1941 markings/sec, 155 secs
lola: sara is running 160 secs || 352834 markings, 958054 edges, 1948 markings/sec, 160 secs
lola: sara is running 165 secs || 359357 markings, 977198 edges, 1305 markings/sec, 165 secs
lola: sara is running 170 secs || 372893 markings, 1013279 edges, 2707 markings/sec, 170 secs
lola: sara is running 175 secs || 385504 markings, 1049364 edges, 2522 markings/sec, 175 secs
lola: sara is running 180 secs || 396386 markings, 1079681 edges, 2176 markings/sec, 180 secs
lola: sara is running 185 secs || 404387 markings, 1102948 edges, 1600 markings/sec, 185 secs
lola: sara is running 190 secs || 414493 markings, 1131244 edges, 2021 markings/sec, 190 secs
lola: sara is running 195 secs || 424537 markings, 1159540 edges, 2009 markings/sec, 195 secs
lola: sara is running 200 secs || 431057 markings, 1178706 edges, 1304 markings/sec, 200 secs
lola: sara is running 205 secs || 443587 markings, 1211693 edges, 2506 markings/sec, 205 secs
lola: sara is running 210 secs || 457440 markings, 1250685 edges, 2771 markings/sec, 210 secs
lola: sara is running 215 secs || 467616 markings, 1279846 edges, 2035 markings/sec, 215 secs
lola: sara is running 220 secs || 477870 markings, 1308997 edges, 2051 markings/sec, 220 secs
lola: sara is running 225 secs || 488204 markings, 1338150 edges, 2067 markings/sec, 225 secs
lola: sara is running 230 secs || 496415 markings, 1361759 edges, 1642 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((SORTI_B + 1 <= CONTROLEUR_1 + CONTROLEUR_2) AND (ATTENTE_A + 1 <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((CONTROLEUR_1 + CONTROLEUR_2 <= SORTI_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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((CONTROLEUR_1 + CONTROLEUR_2 <= SORTI_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_... (shortened)
lola: processed formula length: 967
lola: 5 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N10-CTLCardinality.task
lola: processed formula with 2 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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_... (shortened)
lola: processed formula length: 927
lola: 7 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 422 markings, 421 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((ROUTE_B <= 0) 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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((ROUTE_B <= 0) 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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ROUTE_B <= 0) 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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + N... (shortened)
lola: processed formula length: 933
lola: 3 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N10-CTLCardinality.task
lola: processed formula with 2 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 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ROUTE_A <= ATTENTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P50N10-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P50N10-CTLCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (ATTENTE_B <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ATTENTE_B <= 2)
lola: processed formula length: 16
lola: 3 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N10-CTLCardinality.task
lola: processed formula with 1 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 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((ROUTE_A <= CHOIX_1 + CHOIX_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (ROUTE_A <= CHOIX_1 + CHOIX_2)))
lola: processed formula length: 44
lola: 5 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 507750 markings, 1106188 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1005465 markings, 2203968 edges, 99543 markings/sec, 5 secs
lola: 1405129 markings, 3329670 edges, 79933 markings/sec, 10 secs
lola: 1767818 markings, 4498956 edges, 72538 markings/sec, 15 secs
lola: 2142560 markings, 5653986 edges, 74948 markings/sec, 20 secs
lola: 2512006 markings, 6858556 edges, 73889 markings/sec, 25 secs
lola: 2881963 markings, 8001179 edges, 73991 markings/sec, 30 secs
lola: 3235576 markings, 9162360 edges, 70723 markings/sec, 35 secs
lola: 3592438 markings, 10278833 edges, 71372 markings/sec, 40 secs
lola: 3953526 markings, 11440911 edges, 72218 markings/sec, 45 secs
lola: 4310178 markings, 12620589 edges, 71330 markings/sec, 50 secs
lola: 4654287 markings, 13693816 edges, 68822 markings/sec, 55 secs
lola: 5014552 markings, 14870104 edges, 72053 markings/sec, 60 secs
lola: 5371995 markings, 16052796 edges, 71489 markings/sec, 65 secs
lola: 5710564 markings, 17112983 edges, 67714 markings/sec, 70 secs
lola: 6059981 markings, 18248943 edges, 69883 markings/sec, 75 secs
lola: 6411030 markings, 19411281 edges, 70210 markings/sec, 80 secs
lola: 6752650 markings, 20512628 edges, 68324 markings/sec, 85 secs
lola: 7090491 markings, 21602869 edges, 67568 markings/sec, 90 secs
lola: 7436641 markings, 22743372 edges, 69230 markings/sec, 95 secs
lola: 7782969 markings, 23898153 edges, 69266 markings/sec, 100 secs
lola: 8114357 markings, 24987250 edges, 66278 markings/sec, 105 secs
lola: 8432468 markings, 26129193 edges, 63622 markings/sec, 110 secs
lola: 8771601 markings, 27184645 edges, 67827 markings/sec, 115 secs
lola: 9104343 markings, 28260999 edges, 66548 markings/sec, 120 secs
lola: 9441062 markings, 29369104 edges, 67344 markings/sec, 125 secs
lola: 9774456 markings, 30467135 edges, 66679 markings/sec, 130 secs
lola: 10107834 markings, 31561941 edges, 66676 markings/sec, 135 secs
lola: 10439490 markings, 32601674 edges, 66331 markings/sec, 140 secs
lola: 10760246 markings, 33651551 edges, 64151 markings/sec, 145 secs
lola: 11078693 markings, 34707165 edges, 63689 markings/sec, 150 secs
lola: 11402007 markings, 35779838 edges, 64663 markings/sec, 155 secs
lola: 11717834 markings, 36823150 edges, 63165 markings/sec, 160 secs
lola: 12039356 markings, 37897625 edges, 64304 markings/sec, 165 secs
lola: 12348956 markings, 38885567 edges, 61920 markings/sec, 170 secs
lola: 12662655 markings, 39914329 edges, 62740 markings/sec, 175 secs
lola: 12977992 markings, 40968219 edges, 63067 markings/sec, 180 secs
lola: 13298048 markings, 42034087 edges, 64011 markings/sec, 185 secs
lola: 13627359 markings, 43146734 edges, 65862 markings/sec, 190 secs
lola: 13957789 markings, 44260805 edges, 66086 markings/sec, 195 secs
lola: 14288945 markings, 45355075 edges, 66231 markings/sec, 200 secs
lola: 14604105 markings, 46375508 edges, 63032 markings/sec, 205 secs
lola: 14920151 markings, 47430681 edges, 63209 markings/sec, 210 secs
lola: 15231034 markings, 48477297 edges, 62177 markings/sec, 215 secs
lola: 15550837 markings, 49564645 edges, 63961 markings/sec, 220 secs
lola: 15871772 markings, 50652840 edges, 64187 markings/sec, 225 secs
lola: 16198856 markings, 51764867 edges, 65417 markings/sec, 230 secs
lola: 16519884 markings, 52839490 edges, 64206 markings/sec, 235 secs
lola: 16815341 markings, 53802053 edges, 59091 markings/sec, 240 secs
lola: 17122347 markings, 54830155 edges, 61401 markings/sec, 245 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
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-V50P50N10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished 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-V50P50N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is BridgeAndVehicles-PT-V50P50N10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-ebro-152646312400332"
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 ;