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 824K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K 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 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 660K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is CloudReconfiguration-PT-301, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r054-smll-152646381900003
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526464715205


BK_STOP 1526465019716

--------------------
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 CloudReconfiguration-PT-301 as instance name.
Using CloudReconfiguration 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': True, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 631469, 'Memory': 3122.82, 'Tool': 'lola'}, {'Time': 739148, 'Memory': 15936.17, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola CloudReconfiguration-PT-301...

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


checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-301: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ CloudReconfiguration-PT-301 @ 3539 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 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 5678/65536 symbol table entries, 638 collisions
lola: preprocessing...
lola: finding significant places
lola: 2584 places, 3094 transitions, 2580 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2707 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-301-CTLCardinality.task
lola: (A (X ((p1365 <= p2031))) AND NOT(A (F (((2 <= p2494) AND (p642 <= p465)))))) : E (F ((3 <= p2012))) : (((((p284 + 1 <= p2521) OR ((p1816 <= p2195) AND (p1693 <= p404))) OR A (G ((p2491 <= p1680)))) OR A (((p1920 <= p1165) U (3 <= p1525)))) AND A (G (E (X ((p150 <= p1390)))))) : ((((1 <= p2181) AND (3 <= p455)) OR NOT(A (F ((2 <= p830))))) AND (E (F ((p1276 <= 2))) AND (A (F ((p490 <= p1643))) AND A (F ((2 <= p2283)))))) : A (G (E (F ((2 <= p1146))))) : NOT(E (X (E (F ((1 <= p1159)))))) : ((E (G (((p1251 <= p690) AND (p1557 <= p1021)))) OR ((1 <= p1907) AND ((p1922 + 1 <= p361) OR (p955 + 1 <= p125)))) AND E (G ((p2197 <= p988)))) : A (G (((p1812 <= p1139) AND A (X ((p546 <= p2309)))))) : NOT(NOT(A (G (((p1016 <= p2423) OR (2 <= p1196)))))) : (A (G (E (G ((p406 <= p1171))))) OR NOT(((p1012 <= p626) AND A (X ((p1107 <= p2033)))))) : (E (X (E (F ((1 <= p2210))))) AND (A (X (((p2115 <= p1194) AND (1 <= p857)))) OR E (X (((p1544 <= p997) AND (p1754 <= p543)))))) : (NOT(E (G (((p682 <= p83) OR (1 <= p2460))))) OR ((3 <= p27) AND (p2529 <= p2107))) : A (F (NOT(E (F ((p60 <= p2394)))))) : ((1 <= p2001) OR A (G (A (F ((p996 <= p23)))))) : E (G (((p2105 + 1 <= p623) OR (p1676 <= 1) OR (p2468 <= 0) OR (p1192 <= 1)))) : (A ((((p1984 <= p2522) AND (p2558 <= p670)) U ((1 <= p857) OR (2 <= p603)))) AND A (G ((((p2232 <= p211) OR (p1432 <= p1361)) AND (p1701 <= 2)))))
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 (X ((p1365 <= p2031))) AND NOT(A (F (((2 <= p2494) AND (p642 <= p465))))))
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 (X ((p1365 <= p2031)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p1365 <= p2031)))
lola: processed formula: A (X ((p1365 <= p2031)))
lola: processed formula length: 24
lola: 3 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-301-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 10 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p2494 <= 1) OR (p465 + 1 <= p642))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p2494) AND (p642 <= p465))))
lola: processed formula length: 48
lola: 5 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-301-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 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: 71 markings, 71 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p2012)))
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 324 bytes per marking, with 12 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-301-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-301-CTLCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((p284 + 1 <= p2521) OR ((p1816 <= p2195) AND (p1693 <= p404))) OR A (G ((p2491 <= p1680)))) OR A (((p1920 <= p1165) U (3 <= p1525)))) AND A (G (E (X ((p150 <= p1390))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p284 + 1 <= p2521) OR ((p1816 <= p2195) AND (p1693 <= p404)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p284 + 1 <= p2521) OR ((p1816 <= p2195) AND (p1693 <= p404)))
lola: processed formula length: 64
lola: 1 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-301-CTLCardinality.task
lola: processed formula with 3 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 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p150 <= p1390)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p150 <= p1390)))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-301-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 177 markings, 184 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p2181) AND (3 <= p455)) OR NOT(A (F ((2 <= p830))))) AND (E (F ((p1276 <= 2))) AND (A (F ((p490 <= p1643))) AND A (F ((2 <= p2283))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2181) AND (3 <= p455))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2181) AND (3 <= p455))
lola: processed formula length: 30
lola: 3 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-301-CTLCardinality.task
lola: processed formula with 2 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p830 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p830)))
lola: processed formula length: 26
lola: 5 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-301-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 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: 71 markings, 71 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1276 <= 2)))
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 324 bytes per marking, with 12 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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CloudReconfiguration-PT-301-CTLCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p490 <= p1643)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p490 <= p1643)))
lola: processed formula: A (F ((p490 <= p1643)))
lola: processed formula length: 23
lola: 3 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-301-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 11 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 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p2283)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p2283)))
lola: processed formula: A (F ((2 <= p2283)))
lola: processed formula length: 20
lola: 3 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-301-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 11 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: 77 markings, 77 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((2 <= p1146)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (2 <= p1146)))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-301-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 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: 234191 markings, 433089 edges, 3689329903141912576 markings/sec, 0 secs
lola: 472850 markings, 881204 edges, 47732 markings/sec, 5 secs
lola: 721449 markings, 1321541 edges, 49720 markings/sec, 10 secs
lola: 949993 markings, 1723953 edges, 45709 markings/sec, 15 secs
lola: 1159483 markings, 2089813 edges, 41898 markings/sec, 20 secs
lola: 1398539 markings, 2489221 edges, 47811 markings/sec, 25 secs
lola: 1612875 markings, 2864261 edges, 42867 markings/sec, 30 secs
lola: 1800466 markings, 3214720 edges, 37518 markings/sec, 35 secs
lola: 1989916 markings, 3585521 edges, 37890 markings/sec, 40 secs
lola: 2178727 markings, 3967255 edges, 37762 markings/sec, 45 secs
lola: 2400049 markings, 4353640 edges, 44264 markings/sec, 50 secs
lola: 2619193 markings, 4750778 edges, 43829 markings/sec, 55 secs
lola: 2838681 markings, 5147282 edges, 43898 markings/sec, 60 secs
lola: 3061409 markings, 5517218 edges, 44546 markings/sec, 65 secs
lola: 3254670 markings, 5871138 edges, 38652 markings/sec, 70 secs
lola: 3475495 markings, 6233685 edges, 44165 markings/sec, 75 secs
lola: 3663054 markings, 6574385 edges, 37512 markings/sec, 80 secs
lola: 3863114 markings, 6926217 edges, 40012 markings/sec, 85 secs
lola: 4042273 markings, 7244695 edges, 35832 markings/sec, 90 secs
lola: 4211520 markings, 7569391 edges, 33849 markings/sec, 95 secs
lola: 4402002 markings, 7871026 edges, 38096 markings/sec, 100 secs
lola: 4589536 markings, 8161586 edges, 37507 markings/sec, 105 secs
lola: 4753480 markings, 8485824 edges, 32789 markings/sec, 110 secs
lola: 4956079 markings, 8855543 edges, 40520 markings/sec, 115 secs
lola: 5150229 markings, 9245639 edges, 38830 markings/sec, 120 secs
lola: 5319075 markings, 9597759 edges, 33769 markings/sec, 125 secs
lola: 5488351 markings, 9950931 edges, 33855 markings/sec, 130 secs
lola: 5653764 markings, 10243047 edges, 33083 markings/sec, 135 secs
lola: 5840989 markings, 10576703 edges, 37445 markings/sec, 140 secs
lola: 6021309 markings, 10924334 edges, 36064 markings/sec, 145 secs
lola: 6177110 markings, 11244730 edges, 31160 markings/sec, 150 secs
lola: 6323529 markings, 11600015 edges, 29284 markings/sec, 155 secs
lola: 6481570 markings, 11958804 edges, 31608 markings/sec, 160 secs
lola: 6641380 markings, 12298762 edges, 31962 markings/sec, 165 secs
lola: 6812590 markings, 12642874 edges, 34242 markings/sec, 170 secs
lola: 6985642 markings, 12968477 edges, 34610 markings/sec, 175 secs
lola: 7146582 markings, 13278811 edges, 32188 markings/sec, 180 secs
lola: 7298556 markings, 13568587 edges, 30395 markings/sec, 185 secs
lola: 7437083 markings, 13858771 edges, 27705 markings/sec, 190 secs
lola: 7570659 markings, 14128519 edges, 26715 markings/sec, 195 secs
lola: 7753337 markings, 14494210 edges, 36536 markings/sec, 200 secs
lola: 7955871 markings, 14885799 edges, 40507 markings/sec, 205 secs
lola: 8141308 markings, 15277639 edges, 37087 markings/sec, 210 secs
lola: 8313905 markings, 15690145 edges, 34519 markings/sec, 215 secs
lola: 8468299 markings, 16082544 edges, 30879 markings/sec, 220 secs
lola: 8603749 markings, 16379034 edges, 27090 markings/sec, 225 secs
lola: 8762385 markings, 16730699 edges, 31727 markings/sec, 230 secs
lola: 8891723 markings, 17038941 edges, 25868 markings/sec, 235 secs
lola: 9035090 markings, 17368861 edges, 28673 markings/sec, 240 secs
lola: 9192417 markings, 17703253 edges, 31465 markings/sec, 245 secs
lola: 9336984 markings, 17985048 edges, 28913 markings/sec, 250 secs
lola: 9455200 markings, 18258924 edges, 23643 markings/sec, 255 secs
lola: 9589113 markings, 18565465 edges, 26783 markings/sec, 260 secs
lola: 9768861 markings, 18939054 edges, 35950 markings/sec, 265 secs
lola: 9946970 markings, 19308837 edges, 35622 markings/sec, 270 secs
lola: 10131955 markings, 19670267 edges, 36997 markings/sec, 275 secs
lola: 10293563 markings, 20006902 edges, 32322 markings/sec, 280 secs
lola: 10465906 markings, 20408691 edges, 34469 markings/sec, 285 secs
lola: local time limit reached - aborting
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: '
'
Aborted (core dumped)
FORMULA CloudReconfiguration-PT-301-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-301-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- 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="CloudReconfiguration-PT-301"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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/CloudReconfiguration-PT-301.tgz
mv CloudReconfiguration-PT-301 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 irma4mcc-full"
echo " Input is CloudReconfiguration-PT-301, 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 r054-smll-152646381900003"
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 ;