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-structural
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 r151-smll-152685549500059
=====================================================================

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


BK_STOP 1526924783149

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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': 'itstools'}].
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 -----
----- Kill lola and sara stderr -----
----- Finished 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: 3516734 markings, 8435838 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: 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: 3693673 markings, 8769361 edges, 2227232188435267584 markings/sec, 0 secs
lola: 6519667 markings, 15967307 edges, 565199 markings/sec, 5 secs
lola: 7915686 markings, 20616508 edges, 279204 markings/sec, 10 secs
lola: 9286063 markings, 25185592 edges, 274075 markings/sec, 15 secs
lola: 10642404 markings, 29699483 edges, 271268 markings/sec, 20 secs
lola: 11999322 markings, 34249583 edges, 271384 markings/sec, 25 secs
lola: 13339362 markings, 38729452 edges, 268008 markings/sec, 30 secs
lola: 14674808 markings, 43176095 edges, 267089 markings/sec, 35 secs
lola: 16011053 markings, 47652801 edges, 267249 markings/sec, 40 secs
lola: 17341838 markings, 52107049 edges, 266157 markings/sec, 45 secs
lola: 18668668 markings, 56545657 edges, 265366 markings/sec, 50 secs
lola: 19990504 markings, 60969902 edges, 264367 markings/sec, 55 secs
lola: 21307710 markings, 65366048 edges, 263441 markings/sec, 60 secs
lola: 22630393 markings, 69789586 edges, 264537 markings/sec, 65 secs
lola: 23950960 markings, 74216494 edges, 264113 markings/sec, 70 secs
lola: 25267995 markings, 78622029 edges, 263407 markings/sec, 75 secs
lola: 26581531 markings, 83016194 edges, 262707 markings/sec, 80 secs
lola: 27890322 markings, 87398220 edges, 261758 markings/sec, 85 secs
lola: 29206767 markings, 91802448 edges, 263289 markings/sec, 90 secs
lola: 30518831 markings, 96188120 edges, 262413 markings/sec, 95 secs
lola: 31835112 markings, 100601763 edges, 263256 markings/sec, 100 secs
lola: 33147606 markings, 104988922 edges, 262499 markings/sec, 105 secs
lola: 34460849 markings, 109394037 edges, 262649 markings/sec, 110 secs
lola: 35767513 markings, 113775347 edges, 261333 markings/sec, 115 secs
lola: 37076353 markings, 118164884 edges, 261768 markings/sec, 120 secs
lola: 38385173 markings, 122551337 edges, 261764 markings/sec, 125 secs
lola: 39691649 markings, 126919132 edges, 261295 markings/sec, 130 secs
lola: 41002332 markings, 131306353 edges, 262137 markings/sec, 135 secs
lola: 42304541 markings, 135670873 edges, 260442 markings/sec, 140 secs
lola: 43616179 markings, 140060344 edges, 262328 markings/sec, 145 secs
lola: 44922408 markings, 144438772 edges, 261246 markings/sec, 150 secs
lola: 46226817 markings, 148812197 edges, 260882 markings/sec, 155 secs
lola: 47531658 markings, 153188134 edges, 260968 markings/sec, 160 secs
lola: 48842638 markings, 157568708 edges, 262196 markings/sec, 165 secs
lola: 50145608 markings, 161938849 edges, 260594 markings/sec, 170 secs
lola: 51454517 markings, 166329990 edges, 261782 markings/sec, 175 secs
lola: 52753486 markings, 170678616 edges, 259794 markings/sec, 180 secs
lola: 54056979 markings, 175040917 edges, 260699 markings/sec, 185 secs
lola: 55363775 markings, 179420691 edges, 261359 markings/sec, 190 secs
lola: 56665254 markings, 183785027 edges, 260296 markings/sec, 195 secs
lola: 57961656 markings, 188133028 edges, 259280 markings/sec, 200 secs
lola: 59270313 markings, 192515908 edges, 261731 markings/sec, 205 secs
lola: 60575128 markings, 196861354 edges, 260963 markings/sec, 210 secs
lola: 61871082 markings, 201208607 edges, 259191 markings/sec, 215 secs
lola: 63175216 markings, 205581861 edges, 260827 markings/sec, 220 secs
lola: 64464750 markings, 209907093 edges, 257907 markings/sec, 225 secs
lola: 65744543 markings, 214199275 edges, 255959 markings/sec, 230 secs
lola: 67027708 markings, 218504193 edges, 256633 markings/sec, 235 secs
lola: 68302688 markings, 222781149 edges, 254996 markings/sec, 240 secs
lola: 69589162 markings, 227087382 edges, 257295 markings/sec, 245 secs
lola: 70862347 markings, 231357686 edges, 254637 markings/sec, 250 secs
lola: 72130721 markings, 235612564 edges, 253675 markings/sec, 255 secs
lola: 73396493 markings, 239859150 edges, 253154 markings/sec, 260 secs
lola: 74673859 markings, 244137577 edges, 255473 markings/sec, 265 secs
lola: 75939890 markings, 248384283 edges, 253206 markings/sec, 270 secs
lola: 77203990 markings, 252624969 edges, 252820 markings/sec, 275 secs
lola: 78470821 markings, 256873973 edges, 253366 markings/sec, 280 secs
lola: 79750327 markings, 261163254 edges, 255901 markings/sec, 285 secs
lola: 81014428 markings, 265403258 edges, 252820 markings/sec, 290 secs
lola: 82273105 markings, 269626232 edges, 251735 markings/sec, 295 secs
lola: 83537891 markings, 273868945 edges, 252957 markings/sec, 300 secs
lola: 84800885 markings, 278105898 edges, 252599 markings/sec, 305 secs
lola: 86058906 markings, 282326146 edges, 251604 markings/sec, 310 secs
lola: 87326150 markings, 286571273 edges, 253449 markings/sec, 315 secs
lola: 88589659 markings, 290809861 edges, 252702 markings/sec, 320 secs
lola: 89848118 markings, 295031469 edges, 251692 markings/sec, 325 secs
lola: 91104779 markings, 299247343 edges, 251332 markings/sec, 330 secs
lola: 92361457 markings, 303458723 edges, 251336 markings/sec, 335 secs
lola: 93614532 markings, 307661366 edges, 250615 markings/sec, 340 secs
lola: 94877234 markings, 311887074 edges, 252540 markings/sec, 345 secs
lola: 96144796 markings, 316133052 edges, 253512 markings/sec, 350 secs
lola: 97399646 markings, 320343034 edges, 250970 markings/sec, 355 secs
lola: 98653483 markings, 324549408 edges, 250767 markings/sec, 360 secs
lola: 99906363 markings, 328753026 edges, 250576 markings/sec, 365 secs
lola: 101165763 markings, 332977817 edges, 251880 markings/sec, 370 secs
lola: 102422472 markings, 337193482 edges, 251342 markings/sec, 375 secs
lola: 103673771 markings, 341389675 edges, 250260 markings/sec, 380 secs
lola: 104930855 markings, 345605019 edges, 251417 markings/sec, 385 secs
lola: 106190760 markings, 349829778 edges, 251981 markings/sec, 390 secs
lola: 107441039 markings, 354024648 edges, 250056 markings/sec, 395 secs
lola: 108696197 markings, 358233636 edges, 251032 markings/sec, 400 secs
lola: 109953947 markings, 362453282 edges, 251550 markings/sec, 405 secs
lola: 111201046 markings, 366637139 edges, 249420 markings/sec, 410 secs
lola: 112456648 markings, 370846998 edges, 251120 markings/sec, 415 secs
lola: 113714057 markings, 375063493 edges, 251482 markings/sec, 420 secs
lola: 114870581 markings, 378943635 edges, 231305 markings/sec, 425 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ''
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 -----
----- 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="RobotManipulation-PT-00500"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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-structural"
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 r151-smll-152685549500059"
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 ;