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-full
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 r214-smll-152732265900667
=====================================================================

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


BK_STOP 1527500345661

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using 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...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 294 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 353 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)))))
----- Kill lola and sara stderr -----
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 589 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 707 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: 2000257 markings, 5529793 edges, 400051 markings/sec, 0 secs
lola: 3634718 markings, 10522270 edges, 326892 markings/sec, 5 secs
lola: 5125478 markings, 15209914 edges, 298152 markings/sec, 10 secs
lola: 6546792 markings, 19729935 edges, 284263 markings/sec, 15 secs
lola: 7910214 markings, 24117713 edges, 272684 markings/sec, 20 secs
lola: 9239134 markings, 28417522 edges, 265784 markings/sec, 25 secs
lola: 10525408 markings, 32642863 edges, 257255 markings/sec, 30 secs
lola: 11782733 markings, 36791245 edges, 251465 markings/sec, 35 secs
lola: 13021118 markings, 40873479 edges, 247677 markings/sec, 40 secs
lola: 14242757 markings, 44923566 edges, 244328 markings/sec, 45 secs
lola: 15456115 markings, 48950901 edges, 242672 markings/sec, 50 secs
lola: 16639440 markings, 52926700 edges, 236665 markings/sec, 55 secs
lola: 17807058 markings, 56849667 edges, 233524 markings/sec, 60 secs
lola: 18960659 markings, 60751966 edges, 230720 markings/sec, 65 secs
lola: 20095990 markings, 64593310 edges, 227066 markings/sec, 70 secs
lola: 21225419 markings, 68404220 edges, 225886 markings/sec, 75 secs
lola: 22333936 markings, 72172923 edges, 221703 markings/sec, 80 secs
lola: 23433180 markings, 75915873 edges, 219849 markings/sec, 85 secs
lola: 24522121 markings, 79626521 edges, 217788 markings/sec, 90 secs
lola: 25599075 markings, 83297182 edges, 215391 markings/sec, 95 secs
lola: 26658335 markings, 86927082 edges, 211852 markings/sec, 100 secs
lola: 27704406 markings, 90501705 edges, 209214 markings/sec, 105 secs
lola: 28761113 markings, 94109032 edges, 211341 markings/sec, 110 secs
lola: 29819261 markings, 97711311 edges, 211630 markings/sec, 115 secs
lola: 30871547 markings, 101295595 edges, 210457 markings/sec, 120 secs
lola: 31907155 markings, 104832994 edges, 207122 markings/sec, 125 secs
lola: 32941290 markings, 108375053 edges, 206827 markings/sec, 130 secs
lola: 33967193 markings, 111904093 edges, 205181 markings/sec, 135 secs
lola: 34992950 markings, 115420754 edges, 205151 markings/sec, 140 secs
lola: 36011170 markings, 118924079 edges, 203644 markings/sec, 145 secs
lola: 37019509 markings, 122394901 edges, 201668 markings/sec, 150 secs
lola: 38031976 markings, 125880426 edges, 202493 markings/sec, 155 secs
lola: 39029217 markings, 129328705 edges, 199448 markings/sec, 160 secs
lola: 40027711 markings, 132776336 edges, 199699 markings/sec, 165 secs
lola: 41017031 markings, 136206441 edges, 197864 markings/sec, 170 secs
lola: 41999627 markings, 139616176 edges, 196519 markings/sec, 175 secs
lola: 42980292 markings, 143013278 edges, 196133 markings/sec, 180 secs
lola: 43958167 markings, 146403830 edges, 195575 markings/sec, 185 secs
lola: 44932162 markings, 149793888 edges, 194799 markings/sec, 190 secs
lola: 45896852 markings, 153155891 edges, 192938 markings/sec, 195 secs
lola: 46861127 markings, 156523169 edges, 192855 markings/sec, 200 secs
lola: 47821247 markings, 159864801 edges, 192024 markings/sec, 205 secs
lola: 48773915 markings, 163187541 edges, 190534 markings/sec, 210 secs
lola: 49730746 markings, 166517315 edges, 191366 markings/sec, 215 secs
lola: 50673412 markings, 169822189 edges, 188533 markings/sec, 220 secs
lola: 51616535 markings, 173119023 edges, 188625 markings/sec, 225 secs
lola: 52559156 markings, 176415673 edges, 188524 markings/sec, 230 secs
lola: 53502943 markings, 179714984 edges, 188757 markings/sec, 235 secs
lola: 54431502 markings, 182979463 edges, 185712 markings/sec, 240 secs
lola: 55363708 markings, 186252639 edges, 186441 markings/sec, 245 secs
lola: 56295260 markings, 189517614 edges, 186310 markings/sec, 250 secs
lola: 57226106 markings, 192779003 edges, 186169 markings/sec, 255 secs
lola: 58152262 markings, 196029830 edges, 185231 markings/sec, 260 secs
lola: 59069188 markings, 199257069 edges, 183385 markings/sec, 265 secs
lola: 59993688 markings, 202497875 edges, 184900 markings/sec, 270 secs
lola: 60910323 markings, 205727529 edges, 183327 markings/sec, 275 secs
lola: 61828026 markings, 208944694 edges, 183541 markings/sec, 280 secs
lola: 62745160 markings, 212159909 edges, 183427 markings/sec, 285 secs
lola: 63654742 markings, 215354273 edges, 181916 markings/sec, 290 secs
lola: 64561059 markings, 218545955 edges, 181263 markings/sec, 295 secs
lola: 65465278 markings, 221725279 edges, 180844 markings/sec, 300 secs
lola: 66377147 markings, 224924262 edges, 182374 markings/sec, 305 secs
lola: 67277993 markings, 228101934 edges, 180169 markings/sec, 310 secs
lola: 68175674 markings, 231262877 edges, 179536 markings/sec, 315 secs
lola: 69069166 markings, 234410692 edges, 178698 markings/sec, 320 secs
lola: 69962336 markings, 237555624 edges, 178634 markings/sec, 325 secs
lola: 70852677 markings, 240699762 edges, 178068 markings/sec, 330 secs
lola: 71742479 markings, 243837566 edges, 177960 markings/sec, 335 secs
lola: 72629881 markings, 246970453 edges, 177480 markings/sec, 340 secs
lola: 73513297 markings, 250101037 edges, 176683 markings/sec, 345 secs
lola: 74400314 markings, 253236179 edges, 177403 markings/sec, 350 secs
lola: 75276075 markings, 256345945 edges, 175152 markings/sec, 355 secs
lola: 76154258 markings, 259458626 edges, 175637 markings/sec, 360 secs
lola: 77030585 markings, 262566804 edges, 175265 markings/sec, 365 secs
lola: 77904625 markings, 265668249 edges, 174808 markings/sec, 370 secs
lola: 78783207 markings, 268782405 edges, 175716 markings/sec, 375 secs
lola: 79649237 markings, 271866185 edges, 173206 markings/sec, 380 secs
lola: 80515461 markings, 274941172 edges, 173245 markings/sec, 385 secs
lola: 81382599 markings, 278024609 edges, 173428 markings/sec, 390 secs
lola: 82214478 markings, 280995182 edges, 166376 markings/sec, 395 secs
lola: 82961978 markings, 283642689 edges, 149500 markings/sec, 400 secs
lola: 82966347 markings, 283657759 edges, 874 markings/sec, 405 secs
lola: 82969865 markings, 283670658 edges, 704 markings/sec, 410 secs
lola: 82972973 markings, 283681290 edges, 622 markings/sec, 415 secs
lola: 82972987 markings, 283681332 edges, 3 markings/sec, 420 secs
lola: 82976946 markings, 283695376 edges, 792 markings/sec, 425 secs
lola: 83010262 markings, 283815567 edges, 6663 markings/sec, 430 secs
lola: 83011150 markings, 283818848 edges, 178 markings/sec, 435 secs
lola: 83011161 markings, 283818885 edges, 2 markings/sec, 440 secs
lola: 83011169 markings, 283818917 edges, 2 markings/sec, 445 secs
lola: 83012165 markings, 283822585 edges, 199 markings/sec, 450 secs
lola: 83012172 markings, 283822612 edges, 1 markings/sec, 455 secs
lola: 83012180 markings, 283822645 edges, 2 markings/sec, 460 secs
lola: 83012192 markings, 283822691 edges, 2 markings/sec, 465 secs
lola: 83012197 markings, 283822710 edges, 1 markings/sec, 470 secs
lola: 83012207 markings, 283822744 edges, 2 markings/sec, 475 secs
lola: 83012216 markings, 283822787 edges, 2 markings/sec, 480 secs
lola: 83012227 markings, 283822827 edges, 2 markings/sec, 485 secs
lola: 83012253 markings, 283822920 edges, 5 markings/sec, 490 secs
lola: 83012263 markings, 283822958 edges, 2 markings/sec, 495 secs
lola: 83012269 markings, 283822980 edges, 1 markings/sec, 500 secs
lola: 83012276 markings, 283823004 edges, 1 markings/sec, 505 secs
lola: 83012279 markings, 283823019 edges, 1 markings/sec, 510 secs
lola: 83013589 markings, 283827802 edges, 262 markings/sec, 515 secs
lola: 83013611 markings, 283827888 edges, 4 markings/sec, 520 secs
lola: 83014934 markings, 283832800 edges, 265 markings/sec, 525 secs
lola: 83014946 markings, 283832845 edges, 2 markings/sec, 530 secs
lola: 83015712 markings, 283835602 edges, 153 markings/sec, 535 secs
lola: 83015719 markings, 283835627 edges, 1 markings/sec, 540 secs
lola: 83015724 markings, 283835645 edges, 1 markings/sec, 545 secs
lola: 83015728 markings, 283835663 edges, 1 markings/sec, 550 secs
lola: 83015731 markings, 283835679 edges, 1 markings/sec, 555 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 -----
----- 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-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/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-full"
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 r214-smll-152732265900667"
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 ;