About the Execution of M4M.full for BridgeAndVehicles-PT-V50P50N50
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3706.120 | 454213.00 | 458047.00 | 337.90 | ???????????????? | 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 9.2M
-rw-r--r-- 1 mcc users 6.8K 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 415K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M 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 3.7K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 67K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 193K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K 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 312K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 873K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 6.0M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is BridgeAndVehicles-PT-V50P50N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-ebro-152732380200099
=====================================================================
--------------------
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-V50P50N50-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527639348659
BK_STOP 1527639802872
--------------------
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-V50P50N50 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 1408401, 'Memory': 15028.04, 'Tool': 'lola'}, {'Time': 1409338, 'Memory': 14715.98, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola BridgeAndVehicles-PT-V50P50N50...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-PT-V50P50N50: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V50P50N50: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ BridgeAndVehicles-PT-V50P50N50 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- 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: 5576/65536 symbol table entries, 632 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 5408 transitions, 161 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5813 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V50P50N50-LTLCardinality.task
lola: A (X ((G ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_A)) U G ((SUR_PONT_A <= SORTI_B))))) : A (X (G (X (F ((1 <= ROUTE_A)))))) : A (F (X (X (F ((1 <= SUR_PONT_A)))))) : A ((SORTI_A <= VIDANGE_1 + VIDANGE_2)) : A (X (F (F ((CAPACITE <= ATTENTE_A))))) : A ((2 <= ROUTE_A)) : A (X (X (F (G ((CHOIX_1 + CHOIX_2 <= ROUTE_B)))))) : A (X ((F ((3 <= SUR_PONT_A)) U F ((3 <= 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))))) : A (X (X (X (G ((NB_ATTENTE_B_45 <= COMPTEUR_12)))))) : A ((NB_ATTENTE_B_30 <= CHOIX_1)) : A (X (G (X (X ((COMPTEUR_15 <= COMPTEUR_3)))))) : A (G ((CHOIX_1 <= NB_ATTENTE_B_32))) : A (G ((NB_ATTENTE_A_28 <= NB_ATTENTE_A_9))) : A (F (G ((COMPTEUR_17 <= NB_ATTENTE_B_2)))) : A (G (X (((NB_ATTENTE_A_24 <= NB_ATTENTE_A_1) U (NB_ATTENTE_B_1 <= COMPTEUR_6))))) : A (F (F (F (X ((COMPTEUR_49 <= NB_ATTENTE_B_11))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_A)) U G ((SUR_PONT_A <= SORTI_B)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_A)) U G ((SUR_PONT_A <= SORTI_B)))))
lola: processed formula: A (X ((G ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_A)) U G ((SUR_PONT_A <= SORTI_B)))))
lola: processed formula length: 86
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 648 bytes per marking, with 29 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: 406 markings, 406 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (F ((1 <= ROUTE_A))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (F ((1 <= ROUTE_A))))))
lola: processed formula: A (X (G (X (F ((1 <= ROUTE_A))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 648 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: 464 markings, 464 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (F ((1 <= SUR_PONT_A))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X (F ((1 <= SUR_PONT_A))))))
lola: processed formula: A (F (X (X (F ((1 <= SUR_PONT_A))))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 648 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: 200675 markings, 635167 edges, 40135 markings/sec, 0 secs
lola: 381726 markings, 1336668 edges, 36210 markings/sec, 5 secs
lola: 558690 markings, 2014712 edges, 35393 markings/sec, 10 secs
lola: 737533 markings, 2697262 edges, 35769 markings/sec, 15 secs
lola: 914514 markings, 3368314 edges, 35396 markings/sec, 20 secs
lola: 1091044 markings, 4028635 edges, 35306 markings/sec, 25 secs
lola: 1270175 markings, 4694210 edges, 35826 markings/sec, 30 secs
lola: 1450518 markings, 5359890 edges, 36069 markings/sec, 35 secs
lola: 1630840 markings, 6017476 edges, 36064 markings/sec, 40 secs
lola: 1810499 markings, 6666301 edges, 35932 markings/sec, 45 secs
lola: 1989584 markings, 7307709 edges, 35817 markings/sec, 50 secs
lola: 2168379 markings, 7939112 edges, 35759 markings/sec, 55 secs
lola: 2346703 markings, 8561540 edges, 35665 markings/sec, 60 secs
lola: 2524298 markings, 9171875 edges, 35519 markings/sec, 65 secs
lola: 2701026 markings, 9771170 edges, 35346 markings/sec, 70 secs
lola: 2876992 markings, 10358411 edges, 35193 markings/sec, 75 secs
lola: 3052526 markings, 10932435 edges, 35107 markings/sec, 80 secs
lola: 3227812 markings, 11493021 edges, 35057 markings/sec, 85 secs
lola: 3403212 markings, 12037919 edges, 35080 markings/sec, 90 secs
lola: 3579995 markings, 12565517 edges, 35357 markings/sec, 95 secs
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: 3757104 markings, 13045803 edges
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((SORTI_A <= VIDANGE_1 + VIDANGE_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SORTI_A <= VIDANGE_1 + VIDANGE_2)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N50-LTLCardinality.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 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((CAPACITE <= ATTENTE_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((CAPACITE <= ATTENTE_A))))
lola: processed formula: A (X (F ((CAPACITE <= ATTENTE_A))))
lola: processed formula length: 35
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 648 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: 537 markings, 537 edges
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= ROUTE_A))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= ROUTE_A)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N50-LTLCardinality.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 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (G ((CHOIX_1 + CHOIX_2 <= ROUTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F (G ((CHOIX_1 + CHOIX_2 <= ROUTE_B))))))
lola: processed formula: A (X (X (F (G ((CHOIX_1 + CHOIX_2 <= ROUTE_B))))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V50P50N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 648 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 229808 markings, 720496 edges, 45962 markings/sec, 0 secs
lola: 401730 markings, 1275327 edges, 34384 markings/sec, 5 secs
lola: 572378 markings, 1787023 edges, 34130 markings/sec, 10 secs
lola: 750515 markings, 2361583 edges, 35627 markings/sec, 15 secs
lola: 920014 markings, 2951718 edges, 33900 markings/sec, 20 secs
lola: 1074256 markings, 3477322 edges, 30848 markings/sec, 25 secs
lola: 1228655 markings, 4004389 edges, 30880 markings/sec, 30 secs
lola: 1387891 markings, 4548849 edges, 31847 markings/sec, 35 secs
lola: 1551376 markings, 5109304 edges, 32697 markings/sec, 40 secs
lola: 1728328 markings, 5754294 edges, 35390 markings/sec, 45 secs
lola: 1891138 markings, 6327186 edges, 32562 markings/sec, 50 secs
lola: 2041141 markings, 6857026 edges, 30001 markings/sec, 55 secs
lola: 2191057 markings, 7389309 edges, 29983 markings/sec, 60 secs
lola: 2341467 markings, 7925265 edges, 30082 markings/sec, 65 secs
lola: 2498280 markings, 8486972 edges, 31363 markings/sec, 70 secs
lola: 2652241 markings, 9038751 edges, 30792 markings/sec, 75 secs
lola: 2811873 markings, 9612638 edges, 31926 markings/sec, 80 secs
lola: 2982397 markings, 10247756 edges, 34105 markings/sec, 85 secs
lola: 3152153 markings, 10858742 edges, 33951 markings/sec, 90 secs
lola: 3303806 markings, 11399436 edges, 30331 markings/sec, 95 secs
lola: 3451888 markings, 11931547 edges, 29616 markings/sec, 100 secs
lola: 3599356 markings, 12465826 edges, 29494 markings/sec, 105 secs
lola: 3749382 markings, 13010948 edges, 30005 markings/sec, 110 secs
lola: 3900936 markings, 13564979 edges, 30311 markings/sec, 115 secs
lola: 4054424 markings, 14126899 edges, 30698 markings/sec, 120 secs
lola: 4209449 markings, 14696123 edges, 31005 markings/sec, 125 secs
lola: 4362295 markings, 15256924 edges, 30569 markings/sec, 130 secs
lola: 4524772 markings, 15856825 edges, 32495 markings/sec, 135 secs
lola: 4692790 markings, 16493918 edges, 33604 markings/sec, 140 secs
lola: 4862510 markings, 17107004 edges, 33944 markings/sec, 145 secs
lola: 5012949 markings, 17646610 edges, 30088 markings/sec, 150 secs
lola: 5158438 markings, 18172425 edges, 29098 markings/sec, 155 secs
lola: 5303787 markings, 18701875 edges, 29070 markings/sec, 160 secs
lola: 5449252 markings, 19238553 edges, 29093 markings/sec, 165 secs
lola: 5595055 markings, 19775581 edges, 29161 markings/sec, 170 secs
lola: 5744777 markings, 20328953 edges, 29944 markings/sec, 175 secs
lola: 5895106 markings, 20885613 edges, 30066 markings/sec, 180 secs
lola: 6043504 markings, 21436452 edges, 29680 markings/sec, 185 secs
lola: 6197488 markings, 22009621 edges, 30797 markings/sec, 190 secs
lola: 6352707 markings, 22588005 edges, 31044 markings/sec, 195 secs
lola: 6507191 markings, 23164237 edges, 30897 markings/sec, 200 secs
lola: 6661767 markings, 23741302 edges, 30915 markings/sec, 205 secs
lola: 6833597 markings, 24397017 edges, 34366 markings/sec, 210 secs
lola: 6999308 markings, 24998039 edges, 33142 markings/sec, 215 secs
lola: 7150327 markings, 25542681 edges, 30204 markings/sec, 220 secs
lola: 7294673 markings, 26070024 edges, 28869 markings/sec, 225 secs
lola: 7440665 markings, 26604537 edges, 29198 markings/sec, 230 secs
lola: 7584194 markings, 27132520 edges, 28706 markings/sec, 235 secs
lola: 7730251 markings, 27671445 edges, 29211 markings/sec, 240 secs
lola: 7877413 markings, 28220571 edges, 29432 markings/sec, 245 secs
lola: 8024779 markings, 28768529 edges, 29473 markings/sec, 250 secs
lola: 8173474 markings, 29324636 edges, 29739 markings/sec, 255 secs
lola: 8321259 markings, 29871988 edges, 29557 markings/sec, 260 secs
lola: 8474877 markings, 30452038 edges, 30724 markings/sec, 265 secs
lola: 8628317 markings, 31029146 edges, 30688 markings/sec, 270 secs
lola: 8782523 markings, 31608817 edges, 30841 markings/sec, 275 secs
lola: 8937365 markings, 32191458 edges, 30968 markings/sec, 280 secs
lola: 9092505 markings, 32776292 edges, 31028 markings/sec, 285 secs
lola: 9250155 markings, 33387152 edges, 31530 markings/sec, 290 secs
lola: 9425351 markings, 34037030 edges, 35039 markings/sec, 295 secs
lola: 9583908 markings, 34613932 edges, 31711 markings/sec, 300 secs
lola: 9733680 markings, 35154434 edges, 29954 markings/sec, 305 secs
lola: 9879034 markings, 35683913 edges, 29071 markings/sec, 310 secs
lola: 10021373 markings, 36211098 edges, 28468 markings/sec, 315 secs
lola: 10163384 markings, 36736078 edges, 28402 markings/sec, 320 secs
lola: 10309166 markings, 37277117 edges, 29156 markings/sec, 325 secs
lola: 10454716 markings, 37817711 edges, 29110 markings/sec, 330 secs
lola: 10599086 markings, 38359213 edges, 28874 markings/sec, 335 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: 'P'
Aborted (core dumped)
----- Kill lola and sara stderr -----
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V50P50N50-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P50N50"
export BK_EXAMINATION="LTLCardinality"
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-V50P50N50.tgz
mv BridgeAndVehicles-PT-V50P50N50 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-V50P50N50, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-ebro-152732380200099"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
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 ;