fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r239-blw3-152732479000139
Last Updated
June 26, 2018

About the Execution of M4M.struct for EnergyBus-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
546.150 574700.00 542064.00 434.00 F?FTTTFFFTFFFFFF 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.3M
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is EnergyBus-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r239-blw3-152732479000139
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1528038885292


BK_STOP 1528039459992

--------------------
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 EnergyBus-PT-none as instance name.
Using EnergyBus as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 78511, 'Memory': 1973.82, 'Tool': 'itstools'}, {'Time': 79033, 'Memory': 1959.55, 'Tool': 'itstools'}, {'Time': 721196, 'Memory': 7601.84, 'Tool': 'lola'}, {'Time': 721403, 'Memory': 7730.54, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 9.185922991682695x far from the best tool itstools.
LTLCardinality lola EnergyBus-PT-none...

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


checking for too many tokens
===========================================================================================
EnergyBus-PT-none: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ EnergyBus-PT-none @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 4587/65536 symbol table entries, 981 collisions
lola: preprocessing...
lola: finding significant places
lola: 157 places, 4430 transitions, 134 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1049 transition conflict sets
lola: TASK
lola: reading formula from EnergyBus-PT-none-LTLCardinality.task
lola: A (X ((2 <= p15))) : A (G ((p144 <= p19))) : A (F ((F ((1 <= p73)) U F ((2 <= p2))))) : A (F ((G ((2 <= p22)) U F ((p28 <= p21))))) : A ((F (G ((p49 <= p84))) U ((p95 <= p46) U (p149 <= p59)))) : A (F (X (((p105 <= p46) U (p34 <= p49))))) : A (G (G ((2 <= p35)))) : A (F (F (G ((p131 <= p125))))) : A (G (F (((3 <= p107) U (2 <= p10))))) : A (F (F (((p63 <= p12) U (p97 <= p27))))) : A (F ((G ((p127 <= p81)) U G ((p88 <= p62))))) : A ((3 <= p110)) : A ((2 <= p101)) : A ((1 <= p101)) : A (X (F (G ((2 <= p111))))) : A (X (F (X ((2 <= p18)))))
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 ((2 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((2 <= p15)))
lola: processed formula: A (X ((2 <= p15)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p144 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 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: 4773 markings, 7126 edges, 955 markings/sec, 0 secs
lola: 8636 markings, 13560 edges, 773 markings/sec, 5 secs
lola: 11595 markings, 18771 edges, 592 markings/sec, 10 secs
lola: 15520 markings, 25100 edges, 785 markings/sec, 15 secs
lola: 18928 markings, 30965 edges, 682 markings/sec, 20 secs
lola: 22291 markings, 36753 edges, 673 markings/sec, 25 secs
lola: 25429 markings, 42166 edges, 628 markings/sec, 30 secs
lola: 28640 markings, 48201 edges, 642 markings/sec, 35 secs
lola: 31495 markings, 53567 edges, 571 markings/sec, 40 secs
lola: 34627 markings, 59986 edges, 626 markings/sec, 45 secs
lola: 37048 markings, 65383 edges, 484 markings/sec, 50 secs
lola: 39430 markings, 70640 edges, 476 markings/sec, 55 secs
lola: 42486 markings, 76219 edges, 611 markings/sec, 60 secs
lola: 45909 markings, 82108 edges, 685 markings/sec, 65 secs
lola: 48317 markings, 87344 edges, 482 markings/sec, 70 secs
lola: 50852 markings, 92395 edges, 507 markings/sec, 75 secs
lola: 54403 markings, 99018 edges, 710 markings/sec, 80 secs
lola: 57145 markings, 104956 edges, 548 markings/sec, 85 secs
lola: 59941 markings, 110171 edges, 559 markings/sec, 90 secs
lola: 62569 markings, 116215 edges, 526 markings/sec, 95 secs
lola: 65043 markings, 121809 edges, 495 markings/sec, 100 secs
lola: 67781 markings, 127321 edges, 548 markings/sec, 105 secs
lola: 70040 markings, 132398 edges, 452 markings/sec, 110 secs
lola: 73116 markings, 138284 edges, 615 markings/sec, 115 secs
lola: 76257 markings, 144053 edges, 628 markings/sec, 120 secs
lola: 79386 markings, 149973 edges, 626 markings/sec, 125 secs
lola: 82364 markings, 155665 edges, 596 markings/sec, 130 secs
lola: 84838 markings, 161401 edges, 495 markings/sec, 135 secs
lola: 87675 markings, 167272 edges, 567 markings/sec, 140 secs
lola: 90234 markings, 173053 edges, 512 markings/sec, 145 secs
lola: 93389 markings, 179207 edges, 631 markings/sec, 150 secs
lola: 97465 markings, 186158 edges, 815 markings/sec, 155 secs
lola: 101451 markings, 192618 edges, 797 markings/sec, 160 secs
lola: 105421 markings, 198909 edges, 794 markings/sec, 165 secs
lola: 109033 markings, 204965 edges, 722 markings/sec, 170 secs
lola: 112275 markings, 210989 edges, 648 markings/sec, 175 secs
lola: 115618 markings, 217162 edges, 669 markings/sec, 180 secs
lola: 118585 markings, 222834 edges, 593 markings/sec, 185 secs
lola: 120730 markings, 228115 edges, 429 markings/sec, 190 secs
lola: 123552 markings, 233456 edges, 564 markings/sec, 195 secs
lola: 126851 markings, 239459 edges, 660 markings/sec, 200 secs
lola: 130039 markings, 245029 edges, 638 markings/sec, 205 secs
lola: 132531 markings, 249862 edges, 498 markings/sec, 210 secs
lola: 135785 markings, 255730 edges, 651 markings/sec, 215 secs
lola: 138502 markings, 261290 edges, 543 markings/sec, 220 secs
lola: 140854 markings, 266360 edges, 470 markings/sec, 225 secs
lola: 144420 markings, 272783 edges, 713 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: A (F ((F ((1 <= p73)) U F ((2 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((1 <= p73)) U F ((2 <= p2)))))
lola: processed formula: A (F ((F ((1 <= p73)) U F ((2 <= p2)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 16 markings, 16 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((2 <= p22)) U F ((p28 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((2 <= p22)) U F ((p28 <= p21)))))
lola: processed formula: A (F ((G ((2 <= p22)) U F ((p28 <= p21)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((p49 <= p84))) U ((p95 <= p46) U (p149 <= p59))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (G ((p49 <= p84))) U ((p95 <= p46) U (p149 <= p59))))
lola: processed formula: A ((F (G ((p49 <= p84))) U ((p95 <= p46) U (p149 <= p59))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((p105 <= p46) U (p34 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((p105 <= p46) U (p34 <= p49)))))
lola: processed formula: A (F (X (((p105 <= p46) U (p34 <= p49)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((2 <= p35))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G ((2 <= p35))))
lola: processed formula: A (G (G ((2 <= p35))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G ((p131 <= p125)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((p131 <= p125))))
lola: processed formula: A (F (G ((p131 <= p125))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 13942 markings, 27725 edges, 2788 markings/sec, 0 secs
lola: 27708 markings, 55027 edges, 2753 markings/sec, 5 secs
lola: 42531 markings, 84450 edges, 2965 markings/sec, 10 secs
lola: 57326 markings, 113803 edges, 2959 markings/sec, 15 secs
lola: 73360 markings, 145513 edges, 3207 markings/sec, 20 secs
lola: 87357 markings, 173452 edges, 2799 markings/sec, 25 secs
lola: 103193 markings, 204555 edges, 3167 markings/sec, 30 secs
lola: 121417 markings, 240463 edges, 3645 markings/sec, 35 secs
lola: 139807 markings, 276469 edges, 3678 markings/sec, 40 secs
lola: 160300 markings, 316991 edges, 4099 markings/sec, 45 secs
lola: 177317 markings, 350572 edges, 3403 markings/sec, 50 secs
lola: 196014 markings, 388034 edges, 3739 markings/sec, 55 secs
lola: 218174 markings, 431909 edges, 4432 markings/sec, 60 secs
lola: 237019 markings, 469370 edges, 3769 markings/sec, 65 secs
lola: 254691 markings, 504485 edges, 3534 markings/sec, 70 secs
lola: 270178 markings, 535245 edges, 3097 markings/sec, 75 secs
lola: 289952 markings, 575260 edges, 3955 markings/sec, 80 secs
lola: 306957 markings, 609006 edges, 3401 markings/sec, 85 secs
lola: 325789 markings, 646461 edges, 3766 markings/sec, 90 secs
lola: 347887 markings, 690594 edges, 4420 markings/sec, 95 secs
lola: 366771 markings, 728349 edges, 3777 markings/sec, 100 secs
lola: 389139 markings, 773236 edges, 4474 markings/sec, 105 secs
lola: 410446 markings, 815532 edges, 4261 markings/sec, 110 secs
lola: 430134 markings, 854850 edges, 3938 markings/sec, 115 secs
lola: 451267 markings, 897517 edges, 4227 markings/sec, 120 secs
lola: 474788 markings, 945102 edges, 4704 markings/sec, 125 secs
lola: 493818 markings, 983294 edges, 3806 markings/sec, 130 secs
lola: 511240 markings, 1017901 edges, 3484 markings/sec, 135 secs
lola: 527629 markings, 1050484 edges, 3278 markings/sec, 140 secs
lola: 544572 markings, 1084280 edges, 3389 markings/sec, 145 secs
lola: 564025 markings, 1123214 edges, 3891 markings/sec, 150 secs
lola: 579880 markings, 1155162 edges, 3171 markings/sec, 155 secs
lola: 595072 markings, 1185738 edges, 3038 markings/sec, 160 secs
lola: 604200 markings, 1203882 edges, 1826 markings/sec, 165 secs
lola: 606889 markings, 1209530 edges, 538 markings/sec, 170 secs
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: 607285 markings, 1210355 edges
lola: ========================================
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((3 <= p107) U (2 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((3 <= p107) U (2 <= p10)))))
lola: processed formula: A (G (F (((3 <= p107) U (2 <= p10)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((p63 <= p12) U (p97 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p63 <= p12) U (p97 <= p27))))
lola: processed formula: A (F (((p63 <= p12) U (p97 <= p27))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 521 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((p127 <= p81)) U G ((p88 <= p62)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((p127 <= p81)) U G ((p88 <= p62)))))
lola: processed formula: A (F ((G ((p127 <= p81)) U G ((p88 <= p62)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 4001 markings, 8686 edges, 800 markings/sec, 0 secs
lola: 7608 markings, 16887 edges, 721 markings/sec, 5 secs
lola: 15260 markings, 32134 edges, 1530 markings/sec, 10 secs
lola: 18732 markings, 40292 edges, 694 markings/sec, 15 secs
lola: 22650 markings, 49138 edges, 784 markings/sec, 20 secs
lola: 27146 markings, 58548 edges, 899 markings/sec, 25 secs
lola: 33173 markings, 71051 edges, 1205 markings/sec, 30 secs
lola: 36605 markings, 78920 edges, 686 markings/sec, 35 secs
lola: 41564 markings, 89187 edges, 992 markings/sec, 40 secs
lola: 45848 markings, 98284 edges, 857 markings/sec, 45 secs
lola: 52079 markings, 111154 edges, 1246 markings/sec, 50 secs
lola: 57633 markings, 122940 edges, 1111 markings/sec, 55 secs
lola: 63908 markings, 136191 edges, 1255 markings/sec, 60 secs
lola: 69069 markings, 147021 edges, 1032 markings/sec, 65 secs
lola: 74118 markings, 157869 edges, 1010 markings/sec, 70 secs
lola: 77362 markings, 165559 edges, 649 markings/sec, 75 secs
lola: 83470 markings, 178471 edges, 1222 markings/sec, 80 secs
lola: 89522 markings, 191298 edges, 1210 markings/sec, 85 secs
lola: 96039 markings, 205449 edges, 1303 markings/sec, 90 secs
lola: 102075 markings, 218127 edges, 1207 markings/sec, 95 secs
lola: 107979 markings, 229976 edges, 1181 markings/sec, 100 secs
lola: 113092 markings, 241270 edges, 1023 markings/sec, 105 secs
lola: 117246 markings, 250320 edges, 831 markings/sec, 110 secs
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: 123657 markings, 263668 edges
lola: subprocess 11 will run for 601 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p110))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p110)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: ========================================
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 12 will run for 752 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p101))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p101)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1002 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p101))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p101)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G ((2 <= p111)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((2 <= p111)))))
lola: processed formula: A (X (F (G ((2 <= p111)))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 15 will run for 3008 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((2 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X ((2 <= p18)))))
lola: processed formula: A (X (F (X ((2 <= p18)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 6 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no yes yes yes no no no yes no no no no no no
FORMULA EnergyBus-PT-none-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-15 FALSE 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="EnergyBus-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is EnergyBus-PT-none, 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 r239-blw3-152732479000139"
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 '' LTLCardinality.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 ;