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 256K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 85K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is AutoFlight-PT-12a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-qhx1-152646247300136
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526891569470


BK_STOP 1526891941212

--------------------
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 AutoFlight-PT-12a as instance name.
Using AutoFlight as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 485730, 'Memory': 3253.16, 'Tool': 'itstools'}, {'Time': 489306, 'Memory': 3248.15, 'Tool': 'itstools'}, {'Time': 3540143, 'Memory': 4276.49, 'Tool': 'lola'}, {'Time': 3540243, 'Memory': 4337.38, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 7.288293908138266x far from the best tool itstools.
CTLCardinality lola AutoFlight-PT-12a...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
AutoFlight-PT-12a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ AutoFlight-PT-12a @ 3538 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 612/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 307 places, 305 transitions, 231 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 296 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-12a-CTLCardinality.task
lola: ((A (F ((3 <= p166))) OR A (X (((p76 <= p276) AND (p253 <= p304))))) AND (p18 <= p281)) : ((((p172 <= p218) OR (p93 <= p27)) AND E (G ((p100 <= 0)))) OR (1 <= p206)) : E (F (((p106 + 1 <= p77) AND (p279 + 1 <= p123) AND (3 <= p178)))) : NOT(A (G (((p290 <= 1) AND (p258 <= 1))))) : (E (G (E (F ((1 <= p209))))) OR ((p197 + 1 <= p10) AND ((p105 + 1 <= p140) OR (p222 + 1 <= p37)) AND ((p280 <= p227) OR (3 <= p197)))) : A (((p205 <= p126) U A (G ((3 <= p247))))) : (A (G (((p219 + 1 <= p183) OR (3 <= p28)))) OR (A (X (((p167 <= p190) OR (p48 <= p86)))) AND E (G (((p51 <= p256) AND (p296 <= p295)))))) : A (G ((p178 <= p279))) : ((((p247 <= p95) OR ((1 <= p69) AND (p299 <= p169) AND (p217 <= p3))) AND NOT(E (X ((2 <= p210))))) AND A (G (E (F ((1 <= p305)))))) : (NOT(NOT(E (X ((2 <= p305))))) OR NOT(A (((p79 <= p230) U (2 <= p182))))) : A ((E (G ((3 <= p305))) U E (G ((p210 <= p32))))) : A (G (((p201 <= p237) OR (3 <= p194)))) : E (F ((E (X ((3 <= p63))) AND A (F ((p249 <= p64)))))) : A (F (E (G ((p272 + 1 <= p68))))) : A (F (((p83 <= 1) AND (p21 <= 1) AND ((1 <= p200) OR (2 <= p115) OR ((2 <= p273) AND (p275 <= p45)))))) : ((A (((2 <= p218) U (p191 <= p128))) AND E (G ((p204 <= p125)))) OR (3 <= p36))
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 (F ((3 <= p166))) OR A (X (((p76 <= p276) AND (p253 <= p304))))) AND (p18 <= p281))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p166)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p166)))
lola: processed formula: A (F ((3 <= p166)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 307 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 24 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: 42 markings, 42 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p76 <= p276) AND (p253 <= p304))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((p76 <= p276) AND (p253 <= p304))))
lola: processed formula: A (X (((p76 <= p276) AND (p253 <= p304))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 307 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 23 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: 42 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p172 <= p218) OR (p93 <= p27)) AND E (G ((p100 <= 0)))) OR (1 <= p206))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p172 <= p218) OR (p93 <= p27))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p172 <= p218) OR (p93 <= p27))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 307 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12a-CTLCardinality.task
lola: processed formula with 2 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p100 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p100)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 307 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 141375 markings, 1124499 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p106 + 1 <= p77) AND (p279 + 1 <= p123) AND (3 <= p178))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 25 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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-12a-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-12a-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((p290 <= 1) AND (p258 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 25 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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-12a-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-12a-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((1 <= p209))))) OR ((p197 + 1 <= p10) AND ((p105 + 1 <= p140) OR (p222 + 1 <= p37)) AND ((p280 <= p227) OR (3 <= p197))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((1 <= p209)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (1 <= p209)))))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 307 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 272490 markings, 3769949 edges, 3689329903141912576 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 316930 markings, 4290328 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p205 <= p126) U A (G ((3 <= p247)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p205 <= p126) U A (G ((3 <= p247)))))
lola: processed formula: A (((p205 <= p126) U A (G ((3 <= p247)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 307 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 22 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: 43 markings, 44 edges
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p219 + 1 <= p183) OR (3 <= p28)))) OR (A (X (((p167 <= p190) OR (p48 <= p86)))) AND E (G (((p51 <= p256) AND (p296 <= p295))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p219 + 1 <= p183) OR (3 <= p28))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 25 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to AutoFlight-PT-12a-CTLCardinality-6.sara
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p167 <= p190) OR (p48 <= p86))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((p167 <= p190) OR (p48 <= p86))))
lola: processed formula: A (X (((p167 <= p190) OR (p48 <= p86))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 307 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 23 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 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p51 <= p256) AND (p296 <= p295))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p256 + 1 <= p51) OR (p295 + 1 <= p296))))
lola: processed formula length: 57
lola: 2 rewrites
lola: formula mentions 0 of 307 places; total mentions: 0
lola: closed formula file AutoFlight-PT-12a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 387274 markings, 3533304 edges, 3689329903141912576 markings/sec, 0 secs
lola: 724556 markings, 6913070 edges, 67456 markings/sec, 5 secs
lola: 1035080 markings, 10305677 edges, 62105 markings/sec, 10 secs
lola: 1353244 markings, 13510248 edges, 63633 markings/sec, 15 secs
lola: 1652108 markings, 16778744 edges, 59773 markings/sec, 20 secs
lola: 1941852 markings, 20069384 edges, 57949 markings/sec, 25 secs
lola: 2249718 markings, 23458243 edges, 61573 markings/sec, 30 secs
lola: 2556874 markings, 26746887 edges, 61431 markings/sec, 35 secs
lola: 2842442 markings, 29893580 edges, 57114 markings/sec, 40 secs
lola: 3109668 markings, 33064442 edges, 53445 markings/sec, 45 secs
lola: 3388390 markings, 36183186 edges, 55744 markings/sec, 50 secs
lola: 3650176 markings, 39304553 edges, 52357 markings/sec, 55 secs
lola: 3911696 markings, 42442429 edges, 52304 markings/sec, 60 secs
lola: 4160792 markings, 45649515 edges, 49819 markings/sec, 65 secs
lola: 4470166 markings, 48877801 edges, 61875 markings/sec, 70 secs
lola: 4769183 markings, 52130131 edges, 59803 markings/sec, 75 secs
lola: 5059958 markings, 55392892 edges, 58155 markings/sec, 80 secs
lola: 5338100 markings, 58632546 edges, 55628 markings/sec, 85 secs
lola: 5617154 markings, 61814530 edges, 55811 markings/sec, 90 secs
lola: 5881298 markings, 64986686 edges, 52829 markings/sec, 95 secs
lola: 6136404 markings, 68151576 edges, 51021 markings/sec, 100 secs
lola: 6397756 markings, 71336948 edges, 52270 markings/sec, 105 secs
lola: 6676512 markings, 74534848 edges, 55751 markings/sec, 110 secs
lola: 6942576 markings, 77731119 edges, 53213 markings/sec, 115 secs
lola: 7201180 markings, 80953822 edges, 51721 markings/sec, 120 secs
lola: 7459588 markings, 84189514 edges, 51682 markings/sec, 125 secs
lola: 7717058 markings, 87393929 edges, 51494 markings/sec, 130 secs
lola: 7963486 markings, 90595968 edges, 49286 markings/sec, 135 secs
lola: 8204688 markings, 93811013 edges, 48240 markings/sec, 140 secs
lola: 8448740 markings, 96998923 edges, 48810 markings/sec, 145 secs
lola: 8755394 markings, 100153786 edges, 61331 markings/sec, 150 secs
lola: 9039736 markings, 103294528 edges, 56868 markings/sec, 155 secs
lola: 9309436 markings, 106396705 edges, 53940 markings/sec, 160 secs
lola: 9584074 markings, 109535826 edges, 54928 markings/sec, 165 secs
lola: 9855605 markings, 112674861 edges, 54306 markings/sec, 170 secs
lola: 10116314 markings, 115803175 edges, 52142 markings/sec, 175 secs
lola: 10363113 markings, 118912875 edges, 49360 markings/sec, 180 secs
lola: 10626324 markings, 122051623 edges, 52642 markings/sec, 185 secs
lola: 10900376 markings, 125211917 edges, 54810 markings/sec, 190 secs
lola: 11160722 markings, 128337006 edges, 52069 markings/sec, 195 secs
lola: 11405086 markings, 131418005 edges, 48873 markings/sec, 200 secs
lola: 11653510 markings, 134516558 edges, 49685 markings/sec, 205 secs
lola: 11904000 markings, 137625088 edges, 50098 markings/sec, 210 secs
lola: 12141814 markings, 140719322 edges, 47563 markings/sec, 215 secs
lola: 12373730 markings, 143801647 edges, 46383 markings/sec, 220 secs
lola: 12586569 markings, 146828789 edges, 42568 markings/sec, 225 secs
lola: 12876688 markings, 150012949 edges, 58024 markings/sec, 230 secs
lola: 13139162 markings, 153162794 edges, 52495 markings/sec, 235 secs
lola: 13397726 markings, 156294687 edges, 51713 markings/sec, 240 secs
lola: 13633977 markings, 159404257 edges, 47250 markings/sec, 245 secs
lola: 13894818 markings, 162539548 edges, 52168 markings/sec, 250 secs
lola: 14137284 markings, 165658093 edges, 48493 markings/sec, 255 secs
lola: 14379500 markings, 168784865 edges, 48443 markings/sec, 260 secs
lola: 14604818 markings, 171880451 edges, 45064 markings/sec, 265 secs
lola: 14852376 markings, 174995810 edges, 49512 markings/sec, 270 secs
lola: 15098870 markings, 178109824 edges, 49299 markings/sec, 275 secs
lola: 15335424 markings, 181206442 edges, 47311 markings/sec, 280 secs
lola: 15566996 markings, 184297752 edges, 46314 markings/sec, 285 secs
lola: 15790172 markings, 187376232 edges, 44635 markings/sec, 290 secs
lola: 16022666 markings, 190450016 edges, 46499 markings/sec, 295 secs
lola: 16238592 markings, 193491403 edges, 43185 markings/sec, 300 secs
lola: 16461392 markings, 196572058 edges, 44560 markings/sec, 305 secs
lola: 16668574 markings, 199609260 edges, 41436 markings/sec, 310 secs
lola: 16912930 markings, 202608287 edges, 48871 markings/sec, 315 secs
lola: 17202214 markings, 205655038 edges, 57857 markings/sec, 320 secs
lola: 17478228 markings, 208688842 edges, 55203 markings/sec, 325 secs
lola: 17737546 markings, 211714229 edges, 51864 markings/sec, 330 secs
lola: 18004418 markings, 214740492 edges, 53374 markings/sec, 335 secs
lola: 18259480 markings, 217715774 edges, 51012 markings/sec, 340 secs
lola: 18507229 markings, 220688213 edges, 49550 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
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 AutoFlight-PT-12a-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-12a-CTLCardinality-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 stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12a"
export BK_EXAMINATION="CTLCardinality"
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/AutoFlight-PT-12a.tgz
mv AutoFlight-PT-12a 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 AutoFlight-PT-12a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r022-qhx1-152646247300136"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;