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 184K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 8.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 13K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is HouseConstruction-PT-200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265400289
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527453663432


BK_STOP 1527454195321

--------------------
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 HouseConstruction-PT-200 as instance name.
Using HouseConstruction 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': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 974842, 'Memory': 15941.66, 'Tool': 'itstools'}, {'Time': 1029926, 'Memory': 15951.05, 'Tool': 'itstools'}, {'Time': 1230604, 'Memory': 15928.88, 'Tool': 'lola'}, {'Time': 1232681, 'Memory': 15937.01, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.2623625161821095x far from the best tool itstools.
LTLCardinality lola HouseConstruction-PT-200...

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


checking for too many tokens
===========================================================================================
HouseConstruction-PT-200: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ HouseConstruction-PT-200 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 44/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 26 places, 18 transitions, 18 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from HouseConstruction-PT-200-LTLCardinality.task
lola: A ((1 <= p13)) : A (F (((p5 <= p9) U G ((2 <= p23))))) : A (F (((2 <= p2) U X ((p22 <= p20))))) : A ((X (F ((p3 <= p10))) U X (X ((1 <= p12))))) : A (G (((p1 <= p14) U F ((p9 <= p23))))) : A (G (G (((2 <= p4) U (p14 <= p19))))) : A (X (F ((p5 <= p13)))) : A ((2 <= p8)) : A (F (F (G (G ((2 <= p22)))))) : A ((p10 <= p2)) : A ((1 <= p25)) : A (X (X (F (F ((2 <= p25)))))) : A ((X (F ((p7 <= p2))) U ((p20 <= p9) U (3 <= p1)))) : A (G (G (((p13 <= p2) U (p13 <= p12))))) : A (F ((p11 <= p4))) : A ((G (G ((p5 <= p23))) U X (F ((p7 <= p15)))))
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 ((1 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p13)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p5 <= p9) U G ((2 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p5 <= p9) U G ((2 <= p23)))))
lola: processed formula: A (F (((p5 <= p9) U G ((2 <= p23)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 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: 3602 markings, 3603 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p2) U X ((p22 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p2) U X ((p22 <= p20)))))
lola: processed formula: A (F (((2 <= p2) U X ((p22 <= p20)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p3 <= p10))) U X (X ((1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((p3 <= p10)) U X ((1 <= p12)))))
lola: processed formula: A (X ((F ((p3 <= p10)) U X ((1 <= p12)))))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 2447127 markings, 4677145 edges, 489425 markings/sec, 0 secs
lola: 4696685 markings, 9369367 edges, 449912 markings/sec, 5 secs
lola: 6914579 markings, 13979353 edges, 443579 markings/sec, 10 secs
lola: 8950563 markings, 18405631 edges, 407197 markings/sec, 15 secs
lola: 11007070 markings, 22757829 edges, 411301 markings/sec, 20 secs
lola: 13120421 markings, 27235767 edges, 422670 markings/sec, 25 secs
lola: 15047736 markings, 31538092 edges, 385463 markings/sec, 30 secs
lola: 17146933 markings, 35941541 edges, 419839 markings/sec, 35 secs
lola: 19051832 markings, 40221894 edges, 380980 markings/sec, 40 secs
lola: 21169086 markings, 44682319 edges, 423451 markings/sec, 45 secs
lola: 23016031 markings, 48836577 edges, 369389 markings/sec, 50 secs
lola: 25154817 markings, 53399574 edges, 427757 markings/sec, 55 secs
lola: 27002019 markings, 57454944 edges, 369440 markings/sec, 60 secs
lola: 28851397 markings, 61651608 edges, 369876 markings/sec, 65 secs
lola: 30991096 markings, 66173395 edges, 427940 markings/sec, 70 secs
lola: 32798604 markings, 70204165 edges, 361502 markings/sec, 75 secs
lola: 34644347 markings, 74375218 edges, 369149 markings/sec, 80 secs
lola: 36730182 markings, 78914784 edges, 417167 markings/sec, 85 secs
lola: 38607146 markings, 82970814 edges, 375393 markings/sec, 90 secs
lola: 40403786 markings, 87012388 edges, 359328 markings/sec, 95 secs
lola: 42244451 markings, 91211325 edges, 368133 markings/sec, 100 secs
lola: 44383067 markings, 95696327 edges, 427723 markings/sec, 105 secs
lola: 46177877 markings, 99698571 edges, 358962 markings/sec, 110 secs
lola: 47950089 markings, 103710579 edges, 354442 markings/sec, 115 secs
lola: 49734615 markings, 107793521 edges, 356905 markings/sec, 120 secs
lola: 51845901 markings, 112253441 edges, 422257 markings/sec, 125 secs
lola: 53558384 markings, 116027462 edges, 342497 markings/sec, 130 secs
lola: 55262345 markings, 119889917 edges, 340792 markings/sec, 135 secs
lola: 56943852 markings, 123725595 edges, 336301 markings/sec, 140 secs
lola: 58681760 markings, 127675675 edges, 347582 markings/sec, 145 secs
lola: 60712444 markings, 131928808 edges, 406137 markings/sec, 150 secs
lola: 62357648 markings, 135589084 edges, 329041 markings/sec, 155 secs
lola: 64033550 markings, 139387599 edges, 335180 markings/sec, 160 secs
lola: 65687532 markings, 143134960 edges, 330796 markings/sec, 165 secs
lola: 67377592 markings, 146999450 edges, 338012 markings/sec, 170 secs
lola: 69239552 markings, 151132623 edges, 372392 markings/sec, 175 secs
lola: 71077672 markings, 154992281 edges, 367624 markings/sec, 180 secs
lola: 72701296 markings, 158637027 edges, 324725 markings/sec, 185 secs
lola: 74346136 markings, 162363856 edges, 328968 markings/sec, 190 secs
lola: 75967571 markings, 166069741 edges, 324287 markings/sec, 195 secs
lola: 77656363 markings, 169931706 edges, 337758 markings/sec, 200 secs
lola: 79524845 markings, 174098362 edges, 373696 markings/sec, 205 secs
lola: 81381509 markings, 177973054 edges, 371333 markings/sec, 210 secs
lola: 82954877 markings, 181502409 edges, 314674 markings/sec, 215 secs
lola: 84546973 markings, 185140271 edges, 318419 markings/sec, 220 secs
lola: 86140041 markings, 188747807 edges, 318614 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1 <= p14) U F ((p9 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (((p1 <= p14) U F ((p9 <= p23)))))
lola: processed formula: A (G (((p1 <= p14) U F ((p9 <= p23)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 2842533 markings, 3962428 edges, 568507 markings/sec, 0 secs
lola: 5717435 markings, 7978117 edges, 574980 markings/sec, 5 secs
lola: 8298080 markings, 11885051 edges, 516129 markings/sec, 10 secs
lola: 10642131 markings, 15631674 edges, 468810 markings/sec, 15 secs
lola: 12991380 markings, 19387311 edges, 469850 markings/sec, 20 secs
lola: 15515792 markings, 23408796 edges, 504882 markings/sec, 25 secs
lola: 17957741 markings, 27356340 edges, 488390 markings/sec, 30 secs
lola: 20449283 markings, 31373612 edges, 498308 markings/sec, 35 secs
lola: 23105769 markings, 35618417 edges, 531297 markings/sec, 40 secs
lola: 25694570 markings, 39756775 edges, 517760 markings/sec, 45 secs
lola: 28641599 markings, 43875870 edges, 589406 markings/sec, 50 secs
lola: 31745982 markings, 47747661 edges, 620877 markings/sec, 55 secs
lola: 34824127 markings, 51588080 edges, 615629 markings/sec, 60 secs
lola: 37905927 markings, 55434431 edges, 616360 markings/sec, 65 secs
lola: 41027991 markings, 59331592 edges, 624413 markings/sec, 70 secs
lola: 43971163 markings, 63298247 edges, 588634 markings/sec, 75 secs
lola: 46383436 markings, 67153529 edges, 482455 markings/sec, 80 secs
lola: 48773064 markings, 70973757 edges, 477926 markings/sec, 85 secs
lola: 51131207 markings, 75008231 edges, 471629 markings/sec, 90 secs
lola: 53292093 markings, 78948024 edges, 432177 markings/sec, 95 secs
lola: 55447579 markings, 82867517 edges, 431097 markings/sec, 100 secs
lola: 57739354 markings, 87011389 edges, 458355 markings/sec, 105 secs
lola: 59991762 markings, 91067001 edges, 450482 markings/sec, 110 secs
lola: 62210808 markings, 95062281 edges, 443809 markings/sec, 115 secs
lola: 64909145 markings, 99024462 edges, 539667 markings/sec, 120 secs
lola: 67728507 markings, 102776972 edges, 563872 markings/sec, 125 secs
lola: 70502882 markings, 106470937 edges, 554875 markings/sec, 130 secs
lola: 73299313 markings, 110194952 edges, 559286 markings/sec, 135 secs
lola: 76092774 markings, 113915077 edges, 558692 markings/sec, 140 secs
lola: 78926271 markings, 117689299 edges, 566699 markings/sec, 145 secs
lola: 81485379 markings, 121885063 edges, 511822 markings/sec, 150 secs
lola: 83966160 markings, 125941048 edges, 496156 markings/sec, 155 secs
lola: 86444182 markings, 130065829 edges, 495604 markings/sec, 160 secs
lola: 88659331 markings, 134111413 edges, 443030 markings/sec, 165 secs
lola: 90865844 markings, 138124862 edges, 441303 markings/sec, 170 secs
lola: 93337550 markings, 142139701 edges, 494341 markings/sec, 175 secs
lola: 96182014 markings, 145994842 edges, 568893 markings/sec, 180 secs
lola: 98935762 markings, 149711703 edges, 550750 markings/sec, 185 secs
lola: 101675549 markings, 153403478 edges, 547957 markings/sec, 190 secs
lola: 104359708 markings, 157016340 edges, 536832 markings/sec, 195 secs
lola: 104414397 markings, 157089278 edges, 10938 markings/sec, 200 secs
lola: 104416591 markings, 157092205 edges, 439 markings/sec, 205 secs
lola: 104416596 markings, 157092211 edges, 1 markings/sec, 210 secs
lola: 104416602 markings, 157092221 edges, 1 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((2 <= p4) U (p14 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (((2 <= p4) U (p14 <= p19)))))
lola: processed formula: A (G (G (((2 <= p4) U (p14 <= p19)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 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: 3999 markings, 3999 edges
lola: ========================================
lola: subprocess 6 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p5 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((p5 <= p13))))
lola: processed formula: A (X (F ((p5 <= p13))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p8)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-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 8 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (G ((2 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G ((2 <= p22)))))
lola: processed formula: A (F (G (G ((2 <= p22)))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 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: 3602 markings, 3603 edges
lola: ========================================
lola: subprocess 9 will run for 436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p10 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 <= p2)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-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 10 will run for 509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p25))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p25)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-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 11 will run for 610 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (F ((2 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F ((2 <= p25)))))
lola: processed formula: A (X (X (F ((2 <= p25)))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 3601 markings, 3601 edges
lola: ========================================
lola: subprocess 12 will run for 763 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p7 <= p2))) U ((p20 <= p9) U (3 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (F ((p7 <= p2))) U ((p20 <= p9) U (3 <= p1))))
lola: processed formula: A ((X (F ((p7 <= p2))) U ((p20 <= p9) U (3 <= p1))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1018 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((p13 <= p2) U (p13 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (((p13 <= p2) U (p13 <= p12)))))
lola: processed formula: A (G (G (((p13 <= p2) U (p13 <= p12)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 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: 3602 markings, 3602 edges
lola: ========================================
lola: subprocess 14 will run for 1527 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p11 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p11 <= p4)))
lola: processed formula: A (F ((p11 <= p4)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 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 15 will run for 3054 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p5 <= p23))) U X (F ((p7 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p5 <= p23))) U X (F ((p7 <= p15)))))
lola: processed formula: A ((G (G ((p5 <= p23))) U X (F ((p7 <= p15)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-200-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes unknown unknown no yes no no yes no no yes no yes yes
FORMULA HouseConstruction-PT-200-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-200-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-200"
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/HouseConstruction-PT-200.tgz
mv HouseConstruction-PT-200 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 HouseConstruction-PT-200, 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 r214-smll-152732265400289"
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 ;