fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r215-smll-152732266600289
Last Updated
June 26, 2018

About the Execution of M4M.struct for HouseConstruction-PT-200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.230 519061.00 440939.00 2781.80 FFT??FTFFTFFTFTT 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 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-structural
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 r215-smll-152732266600289
=====================================================================


--------------------
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 1527465393615


BK_STOP 1527465912676

--------------------
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 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 stdout -----
----- Start make result stderr -----
LTLCardinality @ HouseConstruction-PT-200 @ 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: 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 236 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: 2341272 markings, 4465824 edges, 468254 markings/sec, 0 secs
lola: 4598737 markings, 9174245 edges, 451493 markings/sec, 5 secs
lola: 6822254 markings, 13825860 edges, 444703 markings/sec, 10 secs
lola: 8880997 markings, 18280459 edges, 411749 markings/sec, 15 secs
lola: 10974730 markings, 22682368 edges, 418747 markings/sec, 20 secs
lola: 13099578 markings, 27187483 edges, 424970 markings/sec, 25 secs
lola: 15032494 markings, 31502526 edges, 386583 markings/sec, 30 secs
lola: 17140757 markings, 35929188 edges, 421653 markings/sec, 35 secs
lola: 19053369 markings, 40225480 edges, 382522 markings/sec, 40 secs
lola: 21179091 markings, 44705662 edges, 425144 markings/sec, 45 secs
lola: 23030559 markings, 48870476 edges, 370294 markings/sec, 50 secs
lola: 25178221 markings, 53446383 edges, 429532 markings/sec, 55 secs
lola: 27026060 markings, 57511038 edges, 369568 markings/sec, 60 secs
lola: 28880464 markings, 61719432 edges, 370881 markings/sec, 65 secs
lola: 31026262 markings, 66255249 edges, 429160 markings/sec, 70 secs
lola: 32836479 markings, 70292166 edges, 362043 markings/sec, 75 secs
lola: 34694458 markings, 74475439 edges, 371596 markings/sec, 80 secs
lola: 36795375 markings, 79040088 edges, 420183 markings/sec, 85 secs
lola: 38658084 markings, 83083430 edges, 372542 markings/sec, 90 secs
lola: 40452573 markings, 87125854 edges, 358898 markings/sec, 95 secs
lola: 42313576 markings, 91351646 edges, 372201 markings/sec, 100 secs
lola: 44441996 markings, 95822728 edges, 425684 markings/sec, 105 secs
lola: 46236843 markings, 99827632 edges, 358969 markings/sec, 110 secs
lola: 48003784 markings, 103835500 edges, 353388 markings/sec, 115 secs
lola: 49819996 markings, 107992376 edges, 363242 markings/sec, 120 secs
lola: 51952492 markings, 112482727 edges, 426499 markings/sec, 125 secs
lola: 53708740 markings, 116377197 edges, 351250 markings/sec, 130 secs
lola: 55447365 markings, 120320534 edges, 347725 markings/sec, 135 secs
lola: 57242656 markings, 124395356 edges, 359058 markings/sec, 140 secs
lola: 59103955 markings, 128657508 edges, 372260 markings/sec, 145 secs
lola: 61188256 markings, 132969150 edges, 416860 markings/sec, 150 secs
lola: 62926049 markings, 136878046 edges, 347559 markings/sec, 155 secs
lola: 64659031 markings, 140809017 edges, 346596 markings/sec, 160 secs
lola: 66441158 markings, 144854655 edges, 356425 markings/sec, 165 secs
lola: 68287103 markings, 149081786 edges, 369189 markings/sec, 170 secs
lola: 70424631 markings, 153539104 edges, 427506 markings/sec, 175 secs
lola: 72117953 markings, 157312945 edges, 338664 markings/sec, 180 secs
lola: 73844264 markings, 161229743 edges, 345262 markings/sec, 185 secs
lola: 75560180 markings, 165155003 edges, 343183 markings/sec, 190 secs
lola: 77360301 markings, 169257775 edges, 360024 markings/sec, 195 secs
lola: 79286515 markings, 173623146 edges, 385243 markings/sec, 200 secs
lola: 81319061 markings, 177827702 edges, 406509 markings/sec, 205 secs
lola: 83011086 markings, 181632845 edges, 338405 markings/sec, 210 secs
lola: 84752332 markings, 185585417 edges, 348249 markings/sec, 215 secs
lola: 86446967 markings, 189461812 edges, 338927 markings/sec, 220 secs
lola: 87301238 markings, 191416412 edges, 170854 markings/sec, 225 secs
lola: 87306957 markings, 191429629 edges, 1144 markings/sec, 230 secs
lola: 87309680 markings, 191435750 edges, 545 markings/sec, 235 secs
lola: 87313555 markings, 191444792 edges, 775 markings/sec, 240 secs
lola: 87316053 markings, 191450622 edges, 500 markings/sec, 245 secs
lola: 87316067 markings, 191450653 edges, 3 markings/sec, 250 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 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: 2674779 markings, 3728191 edges, 534956 markings/sec, 0 secs
lola: 5529937 markings, 7716138 edges, 571032 markings/sec, 5 secs
lola: 8166342 markings, 11674522 edges, 527281 markings/sec, 10 secs
lola: 10554351 markings, 15491306 edges, 477602 markings/sec, 15 secs
lola: 12845705 markings, 19154506 edges, 458271 markings/sec, 20 secs
lola: 15382170 markings, 23192540 edges, 507293 markings/sec, 25 secs
lola: 17930103 markings, 27312087 edges, 509587 markings/sec, 30 secs
lola: 20555004 markings, 31542401 edges, 524980 markings/sec, 35 secs
lola: 23326750 markings, 35971621 edges, 554349 markings/sec, 40 secs
lola: 26055784 markings, 40334274 edges, 545807 markings/sec, 45 secs
lola: 29185605 markings, 44554150 edges, 625964 markings/sec, 50 secs
lola: 32355779 markings, 48508265 edges, 634035 markings/sec, 55 secs
lola: 35471301 markings, 52395812 edges, 623104 markings/sec, 60 secs
lola: 38593035 markings, 56291855 edges, 624347 markings/sec, 65 secs
lola: 41731463 markings, 60209287 edges, 627686 markings/sec, 70 secs
lola: 44515312 markings, 64167728 edges, 556770 markings/sec, 75 secs
lola: 46905182 markings, 67987553 edges, 477974 markings/sec, 80 secs
lola: 49306637 markings, 71826802 edges, 480291 markings/sec, 85 secs
lola: 51605999 markings, 75875648 edges, 459872 markings/sec, 90 secs
lola: 53739364 markings, 79762399 edges, 426673 markings/sec, 95 secs
lola: 55906752 markings, 83701781 edges, 433478 markings/sec, 100 secs
lola: 58228860 markings, 87892817 edges, 464422 markings/sec, 105 secs
lola: 60474498 markings, 91936156 edges, 449128 markings/sec, 110 secs
lola: 62749479 markings, 96032112 edges, 454996 markings/sec, 115 secs
lola: 65609013 markings, 99955748 edges, 571907 markings/sec, 120 secs
lola: 68420974 markings, 103698932 edges, 562392 markings/sec, 125 secs
lola: 71200267 markings, 107399460 edges, 555859 markings/sec, 130 secs
lola: 73958366 markings, 111072514 edges, 551620 markings/sec, 135 secs
lola: 76751765 markings, 114792807 edges, 558680 markings/sec, 140 secs
lola: 79552422 markings, 118695499 edges, 560131 markings/sec, 145 secs
lola: 82040196 markings, 122793592 edges, 497555 markings/sec, 150 secs
lola: 84513811 markings, 126835498 edges, 494723 markings/sec, 155 secs
lola: 86946162 markings, 130984761 edges, 486470 markings/sec, 160 secs
lola: 89179337 markings, 135057451 edges, 446635 markings/sec, 165 secs
lola: 91402957 markings, 139102149 edges, 444724 markings/sec, 170 secs
lola: 94129720 markings, 143217449 edges, 545353 markings/sec, 175 secs
lola: 97030961 markings, 147141405 edges, 580248 markings/sec, 180 secs
lola: 99847061 markings, 150940465 edges, 563220 markings/sec, 185 secs
lola: 102675480 markings, 154749941 edges, 565684 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 278 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 306 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 340 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 383 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 438 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 511 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 613 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 766 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 1022 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 1533 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 3067 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 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="HouseConstruction-PT-200"
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/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-structural"
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 r215-smll-152732266600289"
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 ;