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 312K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.2K 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 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 127K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is IBMB2S565S3960-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-152658633000192
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526722077556


BK_STOP 1526722437881

--------------------
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 IBMB2S565S3960-PT-none as instance name.
Using IBMB2S565S3960 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': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1127034, 'Memory': 15950.84, 'Tool': 'lola'}, {'Time': 1187495, 'Memory': 15944.85, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola IBMB2S565S3960-PT-none...

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


checking for too many tokens
===========================================================================================
IBMB2S565S3960-PT-none: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ IBMB2S565S3960-PT-none @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
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: 452/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 273 places, 179 transitions, 172 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 171 transition conflict sets
lola: TASK
lola: reading formula from IBMB2S565S3960-PT-none-CTLCardinality.task
lola: (((A (X ((2 <= merge.s00002238.input.s00001066))) AND (callToProcess.s00003904.output.s00001077 <= callToProcess.s00003880.output.s00001077)) OR ((callToTask.s00003961.inputCriterion.s00001053.used <= 2) OR (process.s00000565__s00003960.outputCriterion.s00001055_omega <= merge.s00001161.activated))) AND NOT((A (F ((3 <= merge.s00001061.activated))) AND E (F ((2 <= callToTask.s00003908.output.s00001083)))))) : A (F ((2 <= callToTask.s00003963.inputCriterion.s00001053.used))) : (A (G ((callToTask.s00003970.input.s00001068 <= 1))) OR E (X ((1 <= fork.s00002500.input.s00001052)))) : E (F ((E (G ((callToProcess.s00003859.inputCriterion.s00001053.used <= merge.s00001161.input.s00001052))) OR (1 <= fork.s00002501.activated.s00001075)))) : E ((((callToTask.s00003975.input.s00001052 + 1 <= callToTask.s00003964.output.s00001054) AND (callToTask.s00003969.input.s00001052 + 1 <= callToProcess.s00003884.inputCriterion.s00001053.used)) U E (G ((merge.s00001162.input.s00001843 <= merge.s00001161.input.s00001052))))) : A (G ((decision.s00001159.activated <= join.s00001163.activated.s00001062))) : E (F (E (((1 <= merge.s00001161.input.s00001066) U (3 <= fork.s00002755.activated.s00001075))))) : E ((A (X ((callToTask.s00003980.input.s00001127 <= callToTask.s00003908.output.s00001077))) U (3 <= fork.s00001071.activated.s00001073))) : NOT(E (X (E (G ((callToProcess.s00003872.input.s00001066 <= callToProcess.s00001108.inputCriterion.s00001053.used)))))) : E (G (E (F ((callToProcess.s00003859.output.s00001077 <= 1))))) : NOT((A (G ((callToTask.s00003979.output.s00001077 <= 0))) AND (A (F ((3 <= decision.s00001841.activated))) AND A (F ((merge.s00002238.activated <= callToTask.s00003973.output.s00001077)))))) : E (X (E (F ((2 <= callToProcess.s00003880.output.s00001054))))) : A (F (E (G ((merge.s00001162.input.s00001129 + 1 <= callToProcess.s00003884.input.s00001127))))) : E (((1 <= callToTask.s00003961.inputCriterion.s00001053.used) U E (F ((1 <= merge.s00002240.input.s00001066))))) : E (X ((A (F ((1 <= callToTask.s00003963.input.s00001052))) OR (3 <= callToTask.s00003968.output.s00001080)))) : NOT(E (F (((2 <= callToTask.s00003913.output.s00001054) AND (3 <= callToTask.s00003961.output.s00001080) AND (fork.s00001403.activated.s00001073 + 1 <= callToTask.s00003980.output.s00001054)))))
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 ((2 <= merge.s00002238.input.s00001066))) AND (callToProcess.s00003904.output.s00001077 <= callToProcess.s00003880.output.s00001077)) OR ((callToTask.s00003961.inputCriterion.s00001053.used <= 2) OR (process.s00000565__s00003960.outputCriterion.s00001055_omega <= merge.s00001161.activated))) AND NOT((A (F ((3 <= merge.s00001061.activated))) AND E (F ((2 <= callToTask.s00003908.output.s000... (shortened)
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 ((2 <= merge.s00002238.input.s00001066)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((2 <= merge.s00002238.input.s00001066)))
lola: processed formula: A (X ((2 <= merge.s00002238.input.s00001066)))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 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: 324 markings, 324 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((callToTask.s00003961.inputCriterion.s00001053.used <= 2) OR (process.s00000565__s00003960.outputCriterion.s00001055_omega <= merge.s00001161.activated))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((callToTask.s00003961.inputCriterion.s00001053.used <= 2) OR (process.s00000565__s00003960.outputCriterion.s00001055_omega <= merge.s00001161.activated))
lola: processed formula length: 155
lola: 7 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-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 ((merge.s00001061.activated <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= merge.s00001061.activated)))
lola: processed formula length: 47
lola: 9 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 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: 324 markings, 323 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= callToTask.s00003963.inputCriterion.s00001053.used)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= callToTask.s00003963.inputCriterion.s00001053.used)))
lola: processed formula: A (F ((2 <= callToTask.s00003963.inputCriterion.s00001053.used)))
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 128 markings, 128 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((callToTask.s00003970.input.s00001068 <= 1))) OR E (X ((1 <= fork.s00002500.input.s00001052))))
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: A (G ((callToTask.s00003970.input.s00001068 <= 1)))
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 688 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2167 markings, 2766 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= fork.s00002500.input.s00001052)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((1 <= fork.s00002500.input.s00001052))
lola: processed formula length: 41
lola: 1 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((callToProcess.s00003859.inputCriterion.s00001053.used <= merge.s00001161.input.s00001052))) OR (1 <= fork.s00002501.activated.s00001075))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((callToProcess.s00003859.inputCriterion.s00001053.used <= merge.s00001161.input.s00001052)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (merge.s00001161.input.s00001052 + 1 <= callToProcess.s00003859.inputCriterion.s00001053.used))))
lola: processed formula length: 119
lola: 4 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 361 markings, 548 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((callToTask.s00003975.input.s00001052 + 1 <= callToTask.s00003964.output.s00001054) AND (callToTask.s00003969.input.s00001052 + 1 <= callToProcess.s00003884.inputCriterion.s00001053.used)) U E (G ((merge.s00001162.input.s00001843 <= merge.s00001161.input.s00001052)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((callToTask.s00003975.input.s00001052 + 1 <= callToTask.s00003964.output.s00001054) AND (callToTask.s00003969.input.s00001052 + 1 <= callToProcess.s00003884.inputCriterion.s00001053.used)) U NOT(A(TRUE U (merge.s00001161.input.s00001052 + 1 <= merge.s00001162.input.s00001843))))
lola: processed formula length: 282
lola: 3 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 355 markings, 356 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((decision.s00001159.activated <= join.s00001163.activated.s00001062)))
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 688 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 47 markings, 46 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (((1 <= merge.s00001161.input.s00001066) U (3 <= fork.s00002755.activated.s00001075)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E((1 <= merge.s00001161.input.s00001066) U (3 <= fork.s00002755.activated.s00001075)))
lola: processed formula length: 95
lola: 2 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 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: 595795 markings, 2704649 edges, 3096146403613736960 markings/sec, 0 secs
lola: 1136400 markings, 5110132 edges, 108121 markings/sec, 5 secs
lola: 1640090 markings, 7420906 edges, 100738 markings/sec, 10 secs
lola: 2097557 markings, 9874696 edges, 91493 markings/sec, 15 secs
lola: 2546499 markings, 12263256 edges, 89788 markings/sec, 20 secs
lola: 3001736 markings, 14537096 edges, 91047 markings/sec, 25 secs
lola: 3408672 markings, 16751947 edges, 81387 markings/sec, 30 secs
lola: 3853632 markings, 19091656 edges, 88992 markings/sec, 35 secs
lola: 4275835 markings, 21390865 edges, 84441 markings/sec, 40 secs
lola: 4720086 markings, 23616121 edges, 88850 markings/sec, 45 secs
lola: 5166539 markings, 25718587 edges, 89291 markings/sec, 50 secs
lola: 5587544 markings, 27818826 edges, 84201 markings/sec, 55 secs
lola: 6069768 markings, 30210126 edges, 96445 markings/sec, 60 secs
lola: 6417014 markings, 32272103 edges, 69449 markings/sec, 65 secs
lola: 6773332 markings, 34483183 edges, 71264 markings/sec, 70 secs
lola: 7097524 markings, 36649309 edges, 64838 markings/sec, 75 secs
lola: 7424322 markings, 38787209 edges, 65360 markings/sec, 80 secs
lola: 7782067 markings, 40854425 edges, 71549 markings/sec, 85 secs
lola: 8105174 markings, 42866968 edges, 64621 markings/sec, 90 secs
lola: 8409327 markings, 44957296 edges, 60831 markings/sec, 95 secs
lola: 8763777 markings, 47256550 edges, 70890 markings/sec, 100 secs
lola: 9034326 markings, 49042684 edges, 54110 markings/sec, 105 secs
lola: 9337550 markings, 50992840 edges, 60645 markings/sec, 110 secs
lola: 9677389 markings, 53257812 edges, 67968 markings/sec, 115 secs
lola: 10015789 markings, 55356096 edges, 67680 markings/sec, 120 secs
lola: 10307654 markings, 57280788 edges, 58373 markings/sec, 125 secs
lola: 10655609 markings, 59299942 edges, 69591 markings/sec, 130 secs
lola: 11016429 markings, 61301755 edges, 72164 markings/sec, 135 secs
lola: 11342444 markings, 63203719 edges, 65203 markings/sec, 140 secs
lola: 11721822 markings, 65170511 edges, 75876 markings/sec, 145 secs
lola: 12175354 markings, 67277287 edges, 90706 markings/sec, 150 secs
lola: 12588568 markings, 69422052 edges, 82643 markings/sec, 155 secs
lola: 12920352 markings, 71506473 edges, 66357 markings/sec, 160 secs
lola: 13280226 markings, 73589185 edges, 71975 markings/sec, 165 secs
lola: 13711675 markings, 75553550 edges, 86290 markings/sec, 170 secs
lola: 14018635 markings, 77492122 edges, 61392 markings/sec, 175 secs
lola: 14328898 markings, 79388005 edges, 62053 markings/sec, 180 secs
lola: 14656047 markings, 81333857 edges, 65430 markings/sec, 185 secs
lola: 14961746 markings, 83173499 edges, 61140 markings/sec, 190 secs
lola: 15320009 markings, 85169228 edges, 71653 markings/sec, 195 secs
lola: 15667760 markings, 87249330 edges, 69550 markings/sec, 200 secs
lola: 15994764 markings, 89279823 edges, 65401 markings/sec, 205 secs
lola: 16423544 markings, 91226900 edges, 85756 markings/sec, 210 secs
lola: 16707145 markings, 93084921 edges, 56720 markings/sec, 215 secs
lola: 17002756 markings, 95029619 edges, 59122 markings/sec, 220 secs
lola: 17239924 markings, 96615468 edges, 47434 markings/sec, 225 secs
lola: 17559444 markings, 98654635 edges, 63904 markings/sec, 230 secs
lola: 17871651 markings, 100643502 edges, 62441 markings/sec, 235 secs
lola: 18115874 markings, 102219985 edges, 48845 markings/sec, 240 secs
lola: 18394114 markings, 103987150 edges, 55648 markings/sec, 245 secs
lola: 18684722 markings, 105675190 edges, 58122 markings/sec, 250 secs
lola: 19104671 markings, 107528758 edges, 83990 markings/sec, 255 secs
lola: 19489078 markings, 109323320 edges, 76881 markings/sec, 260 secs
lola: 19836527 markings, 111160364 edges, 69490 markings/sec, 265 secs
lola: 20205144 markings, 113141869 edges, 73723 markings/sec, 270 secs
lola: 20528850 markings, 114924306 edges, 64741 markings/sec, 275 secs
lola: 20925302 markings, 116691845 edges, 79290 markings/sec, 280 secs
lola: 21342666 markings, 118558584 edges, 83473 markings/sec, 285 secs
lola: 21709590 markings, 120440612 edges, 73385 markings/sec, 290 secs
lola: 22050945 markings, 122108278 edges, 68271 markings/sec, 295 secs
lola: 22347365 markings, 123845282 edges, 59284 markings/sec, 300 secs
lola: 22665180 markings, 125535263 edges, 63563 markings/sec, 305 secs
lola: 23133834 markings, 127124588 edges, 93731 markings/sec, 310 secs
lola: 23403651 markings, 128705309 edges, 53963 markings/sec, 315 secs
lola: 23703557 markings, 130366426 edges, 59981 markings/sec, 320 secs
lola: 23992719 markings, 131992475 edges, 57832 markings/sec, 325 secs
lola: 24266472 markings, 133565383 edges, 54751 markings/sec, 330 secs
lola: 24593038 markings, 135290366 edges, 65313 markings/sec, 335 secs
lola: 25052745 markings, 137311089 edges, 91941 markings/sec, 340 secs
lola: 25409271 markings, 139203262 edges, 71305 markings/sec, 345 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 IBMB2S565S3960-PT-none-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-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 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="IBMB2S565S3960-PT-none"
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/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none 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 IBMB2S565S3960-PT-none, 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 r102-smll-152658633000192"
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 ;