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 184K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 9.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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.9K 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 6 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is RobotManipulation-PT-00500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-152685548800059
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526898826413


BK_STOP 1526899282569

--------------------
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 RobotManipulation-PT-00500 as instance name.
Using RobotManipulation 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 1186325, 'Memory': 12718.95, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola RobotManipulation-PT-00500...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-00500: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ RobotManipulation-PT-00500 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-00500-CTLCardinality.task
lola: A (X (A (F ((p_rdy + 1 <= initialized))))) : E (G (A (((3 <= off) U (p_rdy <= p_sc))))) : E (F (E (G ((3 <= p_rel))))) : A ((A (X ((3 <= p_i1))) U (r_moving + 1 <= p_rdy))) : E (F (((p_i1 <= 2) AND (p_rel + 1 <= move) AND (2 <= p_rel)))) : A (G (E (((3 <= r_stopped) U (p_rdy <= r_stopped))))) : ((E (X ((2 <= p_i2))) AND ((r_moving <= moved) AND (r_active + 1 <= initialized) AND ((r_moving + 1 <= move) OR (p_i2 + 1 <= access)))) OR (((p_i2 <= r_moving) AND A (G ((moved <= access)))) OR A (G (((2 <= p_i2) OR (p_m <= access)))))) : (A (((p_i2 + 1 <= off) U (off + 1 <= access))) AND A ((((moved <= initialized) OR (2 <= p_rdy)) U ((1 <= p_rdy) AND (3 <= access))))) : (E (F (A (G ((2 <= r_moving))))) OR A (G (E (F ((2 <= off)))))) : A (F (A (G ((r_active <= r_stopped))))) : E ((((move <= 1) OR (p_sc + 1 <= off)) U A (G ((3 <= initialize))))) : A (G (A (F (((off <= move) OR (1 <= r_stopped)))))) : A (F ((E (G ((r_active <= p_rdy))) OR ((r_stopped + 1 <= initialize) AND (move <= 1))))) : E (F (A (G ((p_m <= moved))))) : (A (G (((1 <= r_stopped) OR (3 <= access)))) AND (((p_i2 <= p_m) OR ((p_rdy <= 1) AND (r_stopped <= 1))) AND (initialize <= 1))) : E ((((2 <= initialized) OR (1 <= p_i2) OR (r_active <= r_stopped)) U A (G ((r_stopped <= p_rdy)))))
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 (A (F ((p_rdy + 1 <= initialized)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (p_rdy + 1 <= initialized)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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 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: 2002 markings, 2001 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((3 <= off) U (p_rdy <= p_sc)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((3 <= off) U (p_rdy <= p_sc)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2003 markings, 4005 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((3 <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p_rel <= 2))))
lola: processed formula length: 37
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 3398130 markings, 8151275 edges, 3689348869717491712 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5001063 markings, 11997653 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((3 <= p_i1))) U (r_moving + 1 <= p_rdy)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((3 <= p_i1)) U (r_moving + 1 <= p_rdy))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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 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: 999 markings, 998 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p_i1 <= 2) AND (p_rel + 1 <= move) AND (2 <= p_rel))))
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 36 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00500-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00500-CTLCardinality-4.sara.

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((3 <= r_stopped) U (p_rdy <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((3 <= r_stopped) U (p_rdy <= r_stopped)))))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2003 markings, 4005 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (X ((2 <= p_i2))) AND ((r_moving <= moved) AND (r_active + 1 <= initialized) AND ((r_moving + 1 <= move) OR (p_i2 + 1 <= access)))) OR (((p_i2 <= r_moving) AND A (G ((moved <= access)))) OR A (G (((2 <= p_i2) OR (p_m <= access))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= p_i2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= p_i2))
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p_i2 <= r_moving)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_i2 <= r_moving)
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-CTLCardinality.task
lola: processed formula with 1 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 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((moved <= access)))
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 36 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 RobotManipulation-PT-00500-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00500-CTLCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4004 markings, 4003 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p_i2) OR (p_m <= access))))
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 36 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00500-CTLCardinality-9.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: 2505 markings, 2504 edges
lola: lola: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((p_i2 + 1 <= off) U (off + 1 <= access))) AND A ((((moved <= initialized) OR (2 <= p_rdy)) U ((1 <= p_rdy) AND (3 <= access)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p_i2 + 1 <= off) U (off + 1 <= access)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p_i2 + 1 <= off) U (off + 1 <= access)))
lola: processed formula: A (((p_i2 + 1 <= off) U (off + 1 <= access)))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((moved <= initialized) OR (2 <= p_rdy)) U ((1 <= p_rdy) AND (3 <= access))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((moved <= initialized) OR (2 <= p_rdy)) U ((1 <= p_rdy) AND (3 <= access))))
lola: processed formula: A ((((moved <= initialized) OR (2 <= p_rdy)) U ((1 <= p_rdy) AND (3 <= access))))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3002 markings, 3001 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((2 <= r_moving))))) OR A (G (E (F ((2 <= off))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((2 <= r_moving)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (r_moving <= 1))))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 3665287 markings, 8701906 edges, 2227232188435267584 markings/sec, 0 secs
lola: 6506700 markings, 15923827 edges, 568283 markings/sec, 5 secs
lola: 7895285 markings, 20549653 edges, 277717 markings/sec, 10 secs
lola: 9260628 markings, 25100354 edges, 273069 markings/sec, 15 secs
lola: 10611171 markings, 29594676 edges, 270109 markings/sec, 20 secs
lola: 11962087 markings, 34124690 edges, 270183 markings/sec, 25 secs
lola: 13288913 markings, 38560272 edges, 265365 markings/sec, 30 secs
lola: 14575531 markings, 42843152 edges, 257324 markings/sec, 35 secs
lola: 15875125 markings, 47196883 edges, 259919 markings/sec, 40 secs
lola: 17157019 markings, 51487153 edges, 256379 markings/sec, 45 secs
lola: 18434791 markings, 55761347 edges, 255554 markings/sec, 50 secs
lola: 19704931 markings, 60012576 edges, 254028 markings/sec, 55 secs
lola: 20969251 markings, 64230661 edges, 252864 markings/sec, 60 secs
lola: 22240030 markings, 68485714 edges, 254156 markings/sec, 65 secs
lola: 23514191 markings, 72751490 edges, 254832 markings/sec, 70 secs
lola: 24774991 markings, 76972892 edges, 252160 markings/sec, 75 secs
lola: 26035934 markings, 81186375 edges, 252189 markings/sec, 80 secs
lola: 27316108 markings, 85472761 edges, 256035 markings/sec, 85 secs
lola: 28602675 markings, 89787871 edges, 257313 markings/sec, 90 secs
lola: 29889154 markings, 94076446 edges, 257296 markings/sec, 95 secs
lola: 31168480 markings, 98365815 edges, 255865 markings/sec, 100 secs
lola: 32439607 markings, 102629464 edges, 254225 markings/sec, 105 secs
lola: 33692846 markings, 106817923 edges, 250648 markings/sec, 110 secs
lola: 35008512 markings, 111231148 edges, 263133 markings/sec, 115 secs
lola: 36315207 markings, 115612338 edges, 261339 markings/sec, 120 secs
lola: 37633791 markings, 120034735 edges, 263717 markings/sec, 125 secs
lola: 38943424 markings, 124423352 edges, 261927 markings/sec, 130 secs
lola: 40256065 markings, 128802746 edges, 262528 markings/sec, 135 secs
lola: 41550316 markings, 133144116 edges, 258850 markings/sec, 140 secs
lola: 42838245 markings, 137461010 edges, 257586 markings/sec, 145 secs
lola: 44120815 markings, 141753069 edges, 256514 markings/sec, 150 secs
lola: 45409420 markings, 146072336 edges, 257721 markings/sec, 155 secs
lola: 46682783 markings, 150341750 edges, 254673 markings/sec, 160 secs
lola: 47971764 markings, 154654062 edges, 257796 markings/sec, 165 secs
lola: 49255617 markings, 158953825 edges, 256771 markings/sec, 170 secs
lola: 50538625 markings, 163257238 edges, 256602 markings/sec, 175 secs
lola: 51827199 markings, 167579608 edges, 257715 markings/sec, 180 secs
lola: 53109348 markings, 171871953 edges, 256430 markings/sec, 185 secs
lola: 54397879 markings, 176184503 edges, 257706 markings/sec, 190 secs
lola: 55679672 markings, 180478615 edges, 256359 markings/sec, 195 secs
lola: 56964732 markings, 184789723 edges, 257012 markings/sec, 200 secs
lola: 58246835 markings, 189089687 edges, 256421 markings/sec, 205 secs
lola: 59533691 markings, 193389119 edges, 257371 markings/sec, 210 secs
lola: 60811276 markings, 197653209 edges, 255517 markings/sec, 215 secs
lola: 62091384 markings, 201947169 edges, 256022 markings/sec, 220 secs
lola: 63381771 markings, 206274802 edges, 258077 markings/sec, 225 secs
lola: 64558989 markings, 210223211 edges, 235444 markings/sec, 230 secs
lola: 65801976 markings, 214392095 edges, 248597 markings/sec, 235 secs
lola: 67051140 markings, 218582764 edges, 249833 markings/sec, 240 secs
lola: 68299647 markings, 222770938 edges, 249701 markings/sec, 245 secs
lola: 69558723 markings, 226985255 edges, 251815 markings/sec, 250 secs
lola: 70813217 markings, 231193121 edges, 250899 markings/sec, 255 secs
lola: 72064572 markings, 235390710 edges, 250271 markings/sec, 260 secs
lola: 73318566 markings, 239597719 edges, 250799 markings/sec, 265 secs
lola: 74577762 markings, 243815332 edges, 251839 markings/sec, 270 secs
lola: 75832437 markings, 248023660 edges, 250935 markings/sec, 275 secs
lola: 77089250 markings, 252240067 edges, 251363 markings/sec, 280 secs
lola: 78345665 markings, 256454482 edges, 251283 markings/sec, 285 secs
lola: 79620463 markings, 260727681 edges, 254960 markings/sec, 290 secs
lola: 80882219 markings, 264959791 edges, 252351 markings/sec, 295 secs
lola: 82138696 markings, 269175310 edges, 251295 markings/sec, 300 secs
lola: 83400621 markings, 273408397 edges, 252385 markings/sec, 305 secs
lola: 84660097 markings, 277633592 edges, 251895 markings/sec, 310 secs
lola: 85917075 markings, 281850242 edges, 251396 markings/sec, 315 secs
lola: 87175052 markings, 286064255 edges, 251595 markings/sec, 320 secs
lola: 88440127 markings, 290308288 edges, 253015 markings/sec, 325 secs
lola: 89693629 markings, 294513199 edges, 250700 markings/sec, 330 secs
lola: 90951834 markings, 298734529 edges, 251641 markings/sec, 335 secs
lola: 92207734 markings, 302944567 edges, 251180 markings/sec, 340 secs
lola: 93460472 markings, 307144343 edges, 250548 markings/sec, 345 secs
lola: 94708514 markings, 311323356 edges, 249608 markings/sec, 350 secs
lola: 95972599 markings, 315555341 edges, 252817 markings/sec, 355 secs
lola: 97234348 markings, 319788466 edges, 252350 markings/sec, 360 secs
lola: 98493136 markings, 324011492 edges, 251758 markings/sec, 365 secs
lola: 99751415 markings, 328233173 edges, 251656 markings/sec, 370 secs
lola: 100998213 markings, 332415796 edges, 249360 markings/sec, 375 secs
lola: 102242022 markings, 336588025 edges, 248762 markings/sec, 380 secs
lola: 103447771 markings, 340632744 edges, 241150 markings/sec, 385 secs
lola: 104656249 markings, 344683678 edges, 241696 markings/sec, 390 secs
lola: 105858514 markings, 348715094 edges, 240453 markings/sec, 395 secs
lola: 107061140 markings, 352750121 edges, 240525 markings/sec, 400 secs
lola: 108256690 markings, 356759285 edges, 239110 markings/sec, 405 secs
lola: 109453493 markings, 360774164 edges, 239361 markings/sec, 410 secs
lola: 110638709 markings, 364750657 edges, 237043 markings/sec, 415 secs
lola: 111823971 markings, 368725492 edges, 237052 markings/sec, 420 secs
lola: 113025276 markings, 372753319 edges, 240261 markings/sec, 425 secs
lola: 114234140 markings, 376808663 edges, 241773 markings/sec, 430 secs
lola: 115404892 markings, 380736316 edges, 234150 markings/sec, 435 secs
lola: local time limit reached - aborting
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 RobotManipulation-PT-00500-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00500-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 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="RobotManipulation-PT-00500"
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/RobotManipulation-PT-00500.tgz
mv RobotManipulation-PT-00500 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 RobotManipulation-PT-00500, 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 r150-smll-152685548800059"
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 ;