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 172K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is SwimmingPool-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732267100667
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527513616416


BK_STOP 1527514090035

--------------------
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 SwimmingPool-PT-10 as instance name.
Using SwimmingPool as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 506370, 'Memory': 14779.59, 'Tool': 'lola'}, {'Time': 506567, 'Memory': 13813.52, 'Tool': 'lola'}, {'Time': 3511122, 'Memory': 5451.85, 'Tool': 'itstools'}, {'Time': 3512195, 'Memory': 5454.14, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola SwimmingPool-PT-10...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
SwimmingPool-PT-10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ SwimmingPool-PT-10 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- 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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-10-LTLCardinality.task
lola: A ((1 <= Dressed)) : A (G ((1 <= InBath))) : A (F ((G ((Bags <= Entered)) U G ((1 <= Dress))))) : A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered))) : A (G ((Out <= Bags))) : A (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins))))) : A (F (F (X (G ((Bags <= Dress)))))) : A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress))))) : A (X (G ((2 <= Entered)))) : A (F (F (((Entered <= Out) U (Dress <= Cabins))))) : A ((G (F ((2 <= Out))) U F ((2 <= Bags)))) : A (X (F (X (G ((1 <= Bags)))))) : A ((1 <= Entered)) : A (X ((Out <= Dressed))) : A (X (X (((Dress <= InBath) U (Undress <= Entered))))) : A (G (G (X (F ((Cabins <= Out))))))
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 <= Dressed))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Dressed)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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 (G ((1 <= InBath)))
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 24 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((Bags <= Entered)) U G ((1 <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((Bags <= Entered)) U G ((1 <= Dress)))))
lola: processed formula: A (F ((G ((Bags <= Entered)) U G ((1 <= Dress)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 307 markings, 308 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered)))
lola: processed formula: A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered)))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Out <= Bags)))
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 24 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 (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins)))))
lola: processed formula: A (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins)))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (G ((Bags <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G ((Bags <= Dress)))))
lola: processed formula: A (F (X (G ((Bags <= Dress)))))
lola: processed formula length: 31
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 406 markings, 406 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress)))))
lola: processed formula: A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress)))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 406 markings, 406 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((2 <= Entered))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((2 <= Entered))))
lola: processed formula: A (X (G ((2 <= Entered))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 406 markings, 406 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((Entered <= Out) U (Dress <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((Entered <= Out) U (Dress <= Cabins))))
lola: processed formula: A (F (((Entered <= Out) U (Dress <= Cabins))))
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((2 <= Out))) U F ((2 <= Bags))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((2 <= Out))) U F ((2 <= Bags))))
lola: processed formula: A ((G (F ((2 <= Out))) U F ((2 <= Bags))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X (G ((1 <= Bags))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X (G ((1 <= Bags))))))
lola: processed formula: A (X (F (X (G ((1 <= Bags))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 1835601 markings, 5039488 edges, 367120 markings/sec, 0 secs
lola: 3301707 markings, 9498320 edges, 293221 markings/sec, 5 secs
lola: 4715396 markings, 13923395 edges, 282738 markings/sec, 10 secs
lola: 6083473 markings, 18256968 edges, 273615 markings/sec, 15 secs
lola: 7403200 markings, 22478647 edges, 263945 markings/sec, 20 secs
lola: 8687828 markings, 26636214 edges, 256926 markings/sec, 25 secs
lola: 9948067 markings, 30734882 edges, 252048 markings/sec, 30 secs
lola: 11168961 markings, 34760874 edges, 244179 markings/sec, 35 secs
lola: 12376677 markings, 38744392 edges, 241543 markings/sec, 40 secs
lola: 13557632 markings, 42654780 edges, 236191 markings/sec, 45 secs
lola: 14746216 markings, 46587747 edges, 237717 markings/sec, 50 secs
lola: 15910778 markings, 50472306 edges, 232912 markings/sec, 55 secs
lola: 17051526 markings, 54309252 edges, 228150 markings/sec, 60 secs
lola: 18167196 markings, 58069807 edges, 223134 markings/sec, 65 secs
lola: 19279963 markings, 61830268 edges, 222553 markings/sec, 70 secs
lola: 20366593 markings, 65501687 edges, 217326 markings/sec, 75 secs
lola: 21423320 markings, 69081144 edges, 211345 markings/sec, 80 secs
lola: 22274237 markings, 71969621 edges, 170183 markings/sec, 85 secs
lola: 23130664 markings, 74888482 edges, 171285 markings/sec, 90 secs
lola: 23986238 markings, 77802775 edges, 171115 markings/sec, 95 secs
lola: 24841270 markings, 80711981 edges, 171006 markings/sec, 100 secs
lola: 25710987 markings, 83681107 edges, 173943 markings/sec, 105 secs
lola: 26608750 markings, 86756982 edges, 179553 markings/sec, 110 secs
lola: 27509660 markings, 89839672 edges, 180182 markings/sec, 115 secs
lola: 28415876 markings, 92929116 edges, 181243 markings/sec, 120 secs
lola: 29319894 markings, 96012715 edges, 180804 markings/sec, 125 secs
lola: 30232904 markings, 99116282 edges, 182602 markings/sec, 130 secs
lola: 31132432 markings, 102193192 edges, 179906 markings/sec, 135 secs
lola: 32031832 markings, 105259116 edges, 179880 markings/sec, 140 secs
lola: 32925088 markings, 108320022 edges, 178651 markings/sec, 145 secs
lola: 33810952 markings, 111367939 edges, 177173 markings/sec, 150 secs
lola: 34690260 markings, 114383642 edges, 175862 markings/sec, 155 secs
lola: 35524654 markings, 117248982 edges, 166879 markings/sec, 160 secs
lola: 36362260 markings, 120136171 edges, 167521 markings/sec, 165 secs
lola: 37198694 markings, 123011126 edges, 167287 markings/sec, 170 secs
lola: 38039677 markings, 125907895 edges, 168197 markings/sec, 175 secs
lola: 38869758 markings, 128772445 edges, 166016 markings/sec, 180 secs
lola: 39696048 markings, 131632111 edges, 165258 markings/sec, 185 secs
lola: 40528863 markings, 134515968 edges, 166563 markings/sec, 190 secs
lola: 41347465 markings, 137355162 edges, 163720 markings/sec, 195 secs
lola: 42172608 markings, 140214185 edges, 165029 markings/sec, 200 secs
lola: 42996752 markings, 143069126 edges, 164829 markings/sec, 205 secs
lola: 43818947 markings, 145919908 edges, 164439 markings/sec, 210 secs
lola: 44637281 markings, 148769389 edges, 163667 markings/sec, 215 secs
lola: 45455875 markings, 151618385 edges, 163719 markings/sec, 220 secs
lola: 46262638 markings, 154435573 edges, 161353 markings/sec, 225 secs
lola: 47080777 markings, 157286091 edges, 163628 markings/sec, 230 secs
lola: 47892332 markings, 160113046 edges, 162311 markings/sec, 235 secs
lola: 48697553 markings, 162922802 edges, 161044 markings/sec, 240 secs
lola: 49496515 markings, 165709721 edges, 159792 markings/sec, 245 secs
lola: 50297779 markings, 168505736 edges, 160253 markings/sec, 250 secs
lola: 51089591 markings, 171271870 edges, 158362 markings/sec, 255 secs
lola: 51884458 markings, 174053603 edges, 158973 markings/sec, 260 secs
lola: 52674408 markings, 176821643 edges, 157990 markings/sec, 265 secs
lola: 53473737 markings, 179611941 edges, 159866 markings/sec, 270 secs
lola: 54255128 markings, 182360746 edges, 156278 markings/sec, 275 secs
lola: 55036240 markings, 185101655 edges, 156222 markings/sec, 280 secs
lola: 55826852 markings, 187875526 edges, 158122 markings/sec, 285 secs
lola: 56620502 markings, 190656231 edges, 158730 markings/sec, 290 secs
lola: 57407321 markings, 193417973 edges, 157364 markings/sec, 295 secs
lola: 58193634 markings, 196174050 edges, 157263 markings/sec, 300 secs
lola: 58972952 markings, 198917774 edges, 155864 markings/sec, 305 secs
lola: 59755698 markings, 201658843 edges, 156549 markings/sec, 310 secs
lola: 60526682 markings, 204375112 edges, 154197 markings/sec, 315 secs
lola: 61311610 markings, 207134290 edges, 156986 markings/sec, 320 secs
lola: 62106075 markings, 209917320 edges, 158893 markings/sec, 325 secs
lola: 62888963 markings, 212662418 edges, 156578 markings/sec, 330 secs
lola: 63654689 markings, 215354088 edges, 153145 markings/sec, 335 secs
lola: 64421655 markings, 218050150 edges, 153393 markings/sec, 340 secs
lola: 65186598 markings, 220745561 edges, 152989 markings/sec, 345 secs
lola: 65949984 markings, 223427518 edges, 152677 markings/sec, 350 secs
lola: 66723218 markings, 226140780 edges, 154647 markings/sec, 355 secs
lola: 67480590 markings, 228818563 edges, 151474 markings/sec, 360 secs
lola: 68242529 markings, 231497422 edges, 152388 markings/sec, 365 secs
lola: 68996925 markings, 234158672 edges, 150879 markings/sec, 370 secs
lola: 69740082 markings, 236769160 edges, 148631 markings/sec, 375 secs
lola: 70479697 markings, 239383198 edges, 147923 markings/sec, 380 secs
lola: 71257411 markings, 242119427 edges, 155543 markings/sec, 385 secs
lola: 72060956 markings, 244960198 edges, 160709 markings/sec, 390 secs
lola: 72855244 markings, 247773974 edges, 158858 markings/sec, 395 secs
lola: 73658432 markings, 250613575 edges, 160638 markings/sec, 400 secs
lola: 74461568 markings, 253453379 edges, 160627 markings/sec, 405 secs
lola: 75254666 markings, 256268613 edges, 158620 markings/sec, 410 secs
lola: 76051003 markings, 259093964 edges, 159267 markings/sec, 415 secs
lola: 76830499 markings, 261859128 edges, 155899 markings/sec, 420 secs
lola: 77593535 markings, 264563153 edges, 152607 markings/sec, 425 secs
lola: 78354385 markings, 267262754 edges, 152170 markings/sec, 430 secs
lola: 79116896 markings, 269969809 edges, 152502 markings/sec, 435 secs
lola: 79871433 markings, 272652918 edges, 150907 markings/sec, 440 secs
lola: 80624034 markings, 275330110 edges, 150520 markings/sec, 445 secs
lola: 81384860 markings, 278032565 edges, 152165 markings/sec, 450 secs
lola: 82138142 markings, 280721717 edges, 150656 markings/sec, 455 secs
lola: 82894676 markings, 283404095 edges, 151307 markings/sec, 460 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
Aborted (core dumped)
FORMULA SwimmingPool-PT-10-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-15 CANNOT_COMPUTE 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="SwimmingPool-PT-10"
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/SwimmingPool-PT-10.tgz
mv SwimmingPool-PT-10 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 SwimmingPool-PT-10, 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-152732267100667"
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 ;