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 372K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K 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 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 19 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 211K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DNAwalker-PT-16redondantChoiceR, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266500257
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527460879432


BK_STOP 1527461319102

--------------------
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 DNAwalker-PT-16redondantChoiceR as instance name.
Using DNAwalker 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': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 511605, 'Memory': 8972.4, 'Tool': 'lola'}, {'Time': 511685, 'Memory': 8865.62, 'Tool': 'lola'}, {'Time': 3507686, 'Memory': 13878.25, 'Tool': 'itstools'}, {'Time': 3507970, 'Memory': 13883.47, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola DNAwalker-PT-16redondantChoiceR...

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


checking for too many tokens
===========================================================================================
DNAwalker-PT-16redondantChoiceR: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ DNAwalker-PT-16redondantChoiceR @ 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: 533/65536 symbol table entries, 8 collisions
lola: preprocessing...
lola: finding significant places
lola: 43 places, 490 transitions, 43 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 284 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: A ((A7 <= A15)) : A (F ((2 <= B29))) : A (G ((A25 <= A15))) : A (X (G (((1 <= A14) U (A9 <= B30))))) : A (G ((3 <= A33))) : A ((X ((1 <= A7)) U (A5 <= A15))) : A ((A6 <= A22)) : A (F (G (((3 <= B5) U (1 <= A33))))) : A (G (F (((A31 <= A22) U (1 <= A2))))) : A ((X (G ((3 <= A29))) U (1 <= A3))) : A (((A27 <= B16) U ((3 <= A12) U (1 <= A15)))) : A (X (X ((3 <= B6)))) : A ((B30 <= B28)) : A (F (X (((B13 <= A15) U (3 <= A15))))) : A (X (((1 <= A30) U G ((2 <= A1))))) : A (F ((2 <= A11)))
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 ((A7 <= A15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A7 <= A15)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-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 ((2 <= B29)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= B29)))
lola: processed formula: A (F ((2 <= B29)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20 markings, 20 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A25 <= A15)))
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 172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((1 <= A14) U (A9 <= B30)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (((1 <= A14) U (A9 <= B30)))))
lola: processed formula: A (X (G (((1 <= A14) U (A9 <= B30)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= A33)))
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 172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= A7)) U (A5 <= A15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((1 <= A7)) U (A5 <= A15)))
lola: processed formula: A ((X ((1 <= A7)) U (A5 <= A15)))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A6 <= A22))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A6 <= A22)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((3 <= B5) U (1 <= A33)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((3 <= B5) U (1 <= A33)))))
lola: processed formula: A (F (G (((3 <= B5) U (1 <= A33)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 100458 markings, 320270 edges, 20092 markings/sec, 0 secs
lola: 192007 markings, 659868 edges, 18310 markings/sec, 5 secs
lola: 278070 markings, 1028419 edges, 17213 markings/sec, 10 secs
lola: 368037 markings, 1434639 edges, 17993 markings/sec, 15 secs
lola: 458378 markings, 1774334 edges, 18068 markings/sec, 20 secs
lola: 545491 markings, 2137134 edges, 17423 markings/sec, 25 secs
lola: 633374 markings, 2496922 edges, 17577 markings/sec, 30 secs
lola: 719080 markings, 2875096 edges, 17141 markings/sec, 35 secs
lola: 811700 markings, 3288719 edges, 18524 markings/sec, 40 secs
lola: 903081 markings, 3663647 edges, 18276 markings/sec, 45 secs
lola: 986962 markings, 4026324 edges, 16776 markings/sec, 50 secs
lola: 1073641 markings, 4394988 edges, 17336 markings/sec, 55 secs
lola: 1164029 markings, 4785943 edges, 18078 markings/sec, 60 secs
lola: 1254627 markings, 5195680 edges, 18120 markings/sec, 65 secs
lola: 1344149 markings, 5621296 edges, 17904 markings/sec, 70 secs
lola: 1428799 markings, 5993377 edges, 16930 markings/sec, 75 secs
lola: 1513443 markings, 6403361 edges, 16929 markings/sec, 80 secs
lola: 1593594 markings, 6848282 edges, 16030 markings/sec, 85 secs
lola: 1672858 markings, 7284376 edges, 15853 markings/sec, 90 secs
lola: 1756010 markings, 7724554 edges, 16630 markings/sec, 95 secs
lola: 1843240 markings, 8184160 edges, 17446 markings/sec, 100 secs
lola: 1930774 markings, 8668785 edges, 17507 markings/sec, 105 secs
lola: 2014841 markings, 9122498 edges, 16813 markings/sec, 110 secs
lola: 2101884 markings, 9561123 edges, 17409 markings/sec, 115 secs
lola: 2183697 markings, 9958369 edges, 16363 markings/sec, 120 secs
lola: 2262003 markings, 10349447 edges, 15661 markings/sec, 125 secs
lola: 2343839 markings, 10761697 edges, 16367 markings/sec, 130 secs
lola: 2425859 markings, 11205961 edges, 16404 markings/sec, 135 secs
lola: 2518919 markings, 11673496 edges, 18612 markings/sec, 140 secs
lola: 2610315 markings, 12025960 edges, 18279 markings/sec, 145 secs
lola: 2702741 markings, 12419695 edges, 18485 markings/sec, 150 secs
lola: 2795792 markings, 12810965 edges, 18610 markings/sec, 155 secs
lola: 2881214 markings, 13177749 edges, 17084 markings/sec, 160 secs
lola: 2962913 markings, 13581937 edges, 16340 markings/sec, 165 secs
lola: 3054091 markings, 14022167 edges, 18236 markings/sec, 170 secs
lola: 3139393 markings, 14418129 edges, 17060 markings/sec, 175 secs
lola: 3221784 markings, 14852248 edges, 16478 markings/sec, 180 secs
lola: 3303341 markings, 15297970 edges, 16311 markings/sec, 185 secs
lola: 3384697 markings, 15726268 edges, 16271 markings/sec, 190 secs
lola: 3465620 markings, 16133889 edges, 16185 markings/sec, 195 secs
lola: 3546775 markings, 16602133 edges, 16231 markings/sec, 200 secs
lola: 3630573 markings, 17130891 edges, 16760 markings/sec, 205 secs
lola: 3717399 markings, 17596496 edges, 17365 markings/sec, 210 secs
lola: 3807761 markings, 18000613 edges, 18072 markings/sec, 215 secs
lola: 3894697 markings, 18391769 edges, 17387 markings/sec, 220 secs
lola: 3979496 markings, 18811115 edges, 16960 markings/sec, 225 secs
lola: 4057754 markings, 19205395 edges, 15652 markings/sec, 230 secs
lola: 4139897 markings, 19648235 edges, 16429 markings/sec, 235 secs
lola: 4220835 markings, 20138406 edges, 16188 markings/sec, 240 secs
lola: 4306034 markings, 20632995 edges, 17040 markings/sec, 245 secs
lola: 4392982 markings, 21037679 edges, 17390 markings/sec, 250 secs
lola: 4480519 markings, 21468774 edges, 17507 markings/sec, 255 secs
lola: 4560804 markings, 21899702 edges, 16057 markings/sec, 260 secs
lola: 4642161 markings, 22329798 edges, 16271 markings/sec, 265 secs
lola: 4715618 markings, 22751312 edges, 14691 markings/sec, 270 secs
lola: 4796570 markings, 23198892 edges, 16190 markings/sec, 275 secs
lola: 4874854 markings, 23719802 edges, 15657 markings/sec, 280 secs
lola: 4955099 markings, 24245973 edges, 16049 markings/sec, 285 secs
lola: 5048053 markings, 24626109 edges, 18591 markings/sec, 290 secs
lola: 5136575 markings, 25003720 edges, 17704 markings/sec, 295 secs
lola: 5221106 markings, 25404398 edges, 16906 markings/sec, 300 secs
lola: 5312492 markings, 25804653 edges, 18277 markings/sec, 305 secs
lola: 5400707 markings, 26181586 edges, 17643 markings/sec, 310 secs
lola: 5491790 markings, 26570013 edges, 18217 markings/sec, 315 secs
lola: 5579424 markings, 26966689 edges, 17527 markings/sec, 320 secs
lola: 5667469 markings, 27349268 edges, 17609 markings/sec, 325 secs
lola: 5751002 markings, 27736683 edges, 16707 markings/sec, 330 secs
lola: 5835943 markings, 28141516 edges, 16988 markings/sec, 335 secs
lola: 5923387 markings, 28541249 edges, 17489 markings/sec, 340 secs
lola: 6006566 markings, 28930105 edges, 16636 markings/sec, 345 secs
lola: 6086306 markings, 29330630 edges, 15948 markings/sec, 350 secs
lola: 6170913 markings, 29760045 edges, 16921 markings/sec, 355 secs
lola: 6252137 markings, 30218315 edges, 16245 markings/sec, 360 secs
lola: 6335986 markings, 30659492 edges, 16770 markings/sec, 365 secs
lola: 6413048 markings, 31112977 edges, 15412 markings/sec, 370 secs
lola: 6496768 markings, 31555030 edges, 16744 markings/sec, 375 secs
lola: 6578692 markings, 32006310 edges, 16385 markings/sec, 380 secs
lola: 6660695 markings, 32404646 edges, 16401 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((A31 <= A22) U (1 <= A2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((A31 <= A22) U (1 <= A2)))))
lola: processed formula: A (G (F (((A31 <= A22) U (1 <= A2)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 25 markings, 26 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((3 <= A29))) U (1 <= A3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((3 <= A29))) U (1 <= A3)))
lola: processed formula: A ((X (G ((3 <= A29))) U (1 <= A3)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((A27 <= B16) U ((3 <= A12) U (1 <= A15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((A27 <= B16) U ((3 <= A12) U (1 <= A15))))
lola: processed formula: A (((A27 <= B16) U ((3 <= A12) U (1 <= A15))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((3 <= B6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((3 <= B6))))
lola: processed formula: A (X (X ((3 <= B6))))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((B30 <= B28))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (B30 <= B28)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-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 13 will run for 1049 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((B13 <= A15) U (3 <= A15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((B13 <= A15) U (3 <= A15)))))
lola: processed formula: A (F (X (((B13 <= A15) U (3 <= A15)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= A30) U G ((2 <= A1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((1 <= A30) U G ((2 <= A1)))))
lola: processed formula: A (X (((1 <= A30) U G ((2 <= A1)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 15 will run for 3147 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= A11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= A11)))
lola: processed formula: A (F ((2 <= A11)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes yes unknown no yes no no yes no no no
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-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="DNAwalker-PT-16redondantChoiceR"
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/DNAwalker-PT-16redondantChoiceR.tgz
mv DNAwalker-PT-16redondantChoiceR 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 DNAwalker-PT-16redondantChoiceR, 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-152732266500257"
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 ;