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 188K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K 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.1K 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 22K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18: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.3K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is RobotManipulation-PT-00050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-smll-152685551600038
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526935538898


BK_STOP 1526936139862

--------------------
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-00050 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': 475014, 'Memory': 15931.03, 'Tool': 'marcie'}, {'Time': 513450, 'Memory': 11029.86, 'Tool': 'lola'}, {'Time': 3511024, 'Memory': 12801.37, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0809155098586567x far from the best tool marcie.
CTLCardinality lola RobotManipulation-PT-00050...

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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-00050: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ RobotManipulation-PT-00050 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- 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: 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-00050-CTLCardinality.task
lola: A (G (NOT(A (X ((3 <= r_moving)))))) : E (F ((((2 <= p_i2) AND (r_active <= p_i2) AND ((p_rel <= initialized) OR (r_moving <= p_m))) AND E (X ((r_stopped <= initialize)))))) : ((moved <= r_stopped) AND A (G (((p_rdy <= r_active) OR (2 <= initialized) OR (3 <= access))))) : E ((E (G ((move <= p_sc))) U ((p_i1 <= 2) AND (p_sc <= 1)))) : A (X (E (G (((3 <= initialized) OR (access <= r_stopped)))))) : (NOT(E (F (((access <= p_rdy) AND (move <= initialize))))) OR (((p_rdy <= 0) OR (r_stopped + 1 <= p_i1) OR (p_i2 <= p_i1)) AND (((p_m <= 0) AND (r_active + 1 <= move)) OR A (X ((1 <= p_m)))))) : E (F ((r_stopped <= 1))) : (A (X (A (F ((r_moving <= r_active))))) AND A (G (((2 <= initialize) OR (3 <= r_moving) OR (2 <= access))))) : A (G (((p_rel <= 0) OR (r_moving <= 2) OR (r_moving <= p_i2)))) : NOT(A (G (TRUE))) : NOT((E (G ((r_active <= p_m))) AND (A (X ((p_i1 <= r_stopped))) AND TRUE))) : A (G ((E (F ((moved <= p_i2))) OR E (F ((p_i1 <= p_m)))))) : E (F ((3 <= moved))) : NOT(E (F (A (G ((1 <= p_rdy)))))) : E (G ((initialized <= r_moving))) : A (G (E (F ((3 <= 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 (G (NOT(A (X ((3 <= r_moving))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((r_moving <= 2)))))
lola: processed formula length: 39
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: 100807 markings, 312086 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p_i2) AND (r_active <= p_i2) AND ((p_rel <= initialized) OR (r_moving <= p_m))) AND E (X ((r_stopped <= initialize))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (((2 <= p_i2) AND (r_active <= p_i2) AND ((p_rel <= initialized) OR (r_moving <= p_m))) AND EX((r_stopped <= initialize))))
lola: processed formula length: 133
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: 100 markings, 99 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((moved <= r_stopped) AND A (G (((p_rdy <= r_active) OR (2 <= initialized) OR (3 <= access)))))
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: (moved <= r_stopped)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (moved <= r_stopped)
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_rdy <= r_active) OR (2 <= initialized) OR (3 <= 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00050-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00050-CTLCardinality-3.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((move <= p_sc))) U ((p_i1 <= 2) AND (p_sc <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(A(TRUE U (p_sc + 1 <= move))) U ((p_i1 <= 2) AND (p_sc <= 1)))
lola: processed formula length: 68
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 555 markings, 1145 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((3 <= initialized) OR (access <= r_stopped))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U ((initialized <= 2) AND (r_stopped + 1 <= access)))))
lola: processed formula length: 69
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: 202 markings, 201 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((access <= p_rdy) AND (move <= initialize))))) OR (((p_rdy <= 0) OR (r_stopped + 1 <= p_i1) OR (p_i2 <= p_i1)) AND (((p_m <= 0) AND (r_active + 1 <= move)) OR A (X ((1 <= p_m))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_rdy + 1 <= access) OR (initialize + 1 <= move))))
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-00050-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 301 markings, 300 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_rdy <= 0) OR (r_stopped + 1 <= p_i1) OR (p_i2 <= p_i1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_rdy <= 0) OR (r_stopped + 1 <= p_i1) OR (p_i2 <= p_i1))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_m <= 0) AND (r_active + 1 <= move))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_m <= 0) AND (r_active + 1 <= move))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p_m)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((1 <= p_m)))
lola: processed formula: A (X ((1 <= p_m)))
lola: processed formula length: 18
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 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: 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: 505 markings, 505 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((r_stopped <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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-00050-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 199 markings, 198 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((r_moving <= r_active))))) AND A (G (((2 <= initialize) OR (3 <= r_moving) OR (2 <= access)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((r_moving <= r_active)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (r_moving <= r_active)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= initialize) OR (3 <= r_moving) OR (2 <= 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00050-CTLCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 397 markings, 396 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_rel <= 0) OR (r_moving <= 2) OR (r_moving <= p_i2))))
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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: state equation: write sara problem file to RobotManipulation-PT-00050-CTLCardinality-8.sara
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: NOT(A (G (TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((r_active <= p_m))) AND (A (X ((p_i1 <= r_stopped))) AND TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p_m + 1 <= r_active)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p_m + 1 <= r_active)))
lola: processed formula: A (F ((p_m + 1 <= r_active)))
lola: processed formula length: 29
lola: 9 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 103 markings, 102 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((moved <= p_i2))) OR E (F ((p_i1 <= p_m))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (moved <= p_i2))) AND NOT(E(TRUE U (p_i1 <= p_m))))))
lola: processed formula length: 80
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1567703 markings, 5292194 edges, 3689330178019819520 markings/sec, 0 secs
lola: 2977455 markings, 10144891 edges, 281950 markings/sec, 5 secs
lola: 4254197 markings, 14558533 edges, 255348 markings/sec, 10 secs
lola: 5509754 markings, 18921571 edges, 251111 markings/sec, 15 secs
lola: 6773178 markings, 23312688 edges, 252685 markings/sec, 20 secs
lola: 7983273 markings, 27549069 edges, 242019 markings/sec, 25 secs
lola: 9203667 markings, 31798493 edges, 244079 markings/sec, 30 secs
lola: 10381053 markings, 35925259 edges, 235477 markings/sec, 35 secs
lola: 11549612 markings, 40026248 edges, 233712 markings/sec, 40 secs
lola: 12718198 markings, 44110798 edges, 233717 markings/sec, 45 secs
lola: 13852321 markings, 48104108 edges, 226825 markings/sec, 50 secs
lola: 14990543 markings, 52101232 edges, 227644 markings/sec, 55 secs
lola: 16121153 markings, 56071948 edges, 226122 markings/sec, 60 secs
lola: 17235056 markings, 59994040 edges, 222781 markings/sec, 65 secs
lola: 18337667 markings, 63877192 edges, 220522 markings/sec, 70 secs
lola: 19442878 markings, 67762927 edges, 221042 markings/sec, 75 secs
lola: 20549177 markings, 71645304 edges, 221260 markings/sec, 80 secs
lola: 21631719 markings, 75467683 edges, 216508 markings/sec, 85 secs
lola: 22710131 markings, 79271603 edges, 215682 markings/sec, 90 secs
lola: 23780741 markings, 83052070 edges, 214122 markings/sec, 95 secs
lola: 24855514 markings, 86838381 edges, 214955 markings/sec, 100 secs
lola: 25909557 markings, 90572662 edges, 210809 markings/sec, 105 secs
lola: 26976890 markings, 94333037 edges, 213467 markings/sec, 110 secs
lola: 28006494 markings, 97969300 edges, 205921 markings/sec, 115 secs
lola: 28783027 markings, 100723104 edges, 155307 markings/sec, 120 secs
lola: 29556154 markings, 103461406 edges, 154625 markings/sec, 125 secs
lola: 30333064 markings, 106208555 edges, 155382 markings/sec, 130 secs
lola: 31104193 markings, 108933775 edges, 154226 markings/sec, 135 secs
lola: 31885729 markings, 111692694 edges, 156307 markings/sec, 140 secs
lola: 32655271 markings, 114413847 edges, 153908 markings/sec, 145 secs
lola: 33436716 markings, 117176545 edges, 156289 markings/sec, 150 secs
lola: 34209705 markings, 119912729 edges, 154598 markings/sec, 155 secs
lola: 34982501 markings, 122655549 edges, 154559 markings/sec, 160 secs
lola: 35764527 markings, 125416413 edges, 156405 markings/sec, 165 secs
lola: 36536948 markings, 128158848 edges, 154484 markings/sec, 170 secs
lola: 37318510 markings, 130909869 edges, 156312 markings/sec, 175 secs
lola: 38085678 markings, 133625482 edges, 153434 markings/sec, 180 secs
lola: 38860522 markings, 136367005 edges, 154969 markings/sec, 185 secs
lola: 39630020 markings, 139099846 edges, 153900 markings/sec, 190 secs
lola: 40409262 markings, 141857898 edges, 155848 markings/sec, 195 secs
lola: 41177384 markings, 144582266 edges, 153624 markings/sec, 200 secs
lola: 41948531 markings, 147313131 edges, 154229 markings/sec, 205 secs
lola: 42706472 markings, 150008509 edges, 151588 markings/sec, 210 secs
lola: 43472490 markings, 152718171 edges, 153204 markings/sec, 215 secs
lola: 44236920 markings, 155440383 edges, 152886 markings/sec, 220 secs
lola: 44990725 markings, 158123359 edges, 150761 markings/sec, 225 secs
lola: 45759884 markings, 160842621 edges, 153832 markings/sec, 230 secs
lola: 46524950 markings, 163562935 edges, 153013 markings/sec, 235 secs
lola: 47284932 markings, 166263150 edges, 151996 markings/sec, 240 secs
lola: 48042000 markings, 168954705 edges, 151414 markings/sec, 245 secs
lola: 48805469 markings, 171661211 edges, 152694 markings/sec, 250 secs
lola: 49574955 markings, 174395592 edges, 153897 markings/sec, 255 secs
lola: 50330779 markings, 177076772 edges, 151165 markings/sec, 260 secs
lola: 51090043 markings, 179773639 edges, 151853 markings/sec, 265 secs
lola: 51840346 markings, 182435334 edges, 150061 markings/sec, 270 secs
lola: 52621442 markings, 185202514 edges, 156219 markings/sec, 275 secs
lola: 53450162 markings, 188140246 edges, 165744 markings/sec, 280 secs
lola: 54262582 markings, 191030599 edges, 162484 markings/sec, 285 secs
lola: 55077457 markings, 193928777 edges, 162975 markings/sec, 290 secs
lola: 55898081 markings, 196834449 edges, 164125 markings/sec, 295 secs
lola: 56703598 markings, 199709981 edges, 161103 markings/sec, 300 secs
lola: 57518959 markings, 202600911 edges, 163072 markings/sec, 305 secs
lola: 58309053 markings, 205427039 edges, 158019 markings/sec, 310 secs
lola: 59083601 markings, 208179225 edges, 154910 markings/sec, 315 secs
lola: 59889404 markings, 211034322 edges, 161161 markings/sec, 320 secs
lola: 60687438 markings, 213870887 edges, 159607 markings/sec, 325 secs
lola: 61494465 markings, 216729506 edges, 161405 markings/sec, 330 secs
lola: 62295540 markings, 219576745 edges, 160215 markings/sec, 335 secs
lola: 63087391 markings, 222403308 edges, 158370 markings/sec, 340 secs
lola: 63861988 markings, 225169560 edges, 154919 markings/sec, 345 secs
lola: 64703318 markings, 228157153 edges, 168266 markings/sec, 350 secs
lola: 65555748 markings, 231204143 edges, 170486 markings/sec, 355 secs
lola: 66412755 markings, 234252991 edges, 171401 markings/sec, 360 secs
lola: 67273385 markings, 237314346 edges, 172126 markings/sec, 365 secs
lola: 68131125 markings, 240355515 edges, 171548 markings/sec, 370 secs
lola: 68982744 markings, 243397724 edges, 170324 markings/sec, 375 secs
lola: 69825654 markings, 246412760 edges, 168582 markings/sec, 380 secs
lola: 70686161 markings, 249458401 edges, 172101 markings/sec, 385 secs
lola: 71557770 markings, 252537140 edges, 174322 markings/sec, 390 secs
lola: 72453245 markings, 255726605 edges, 179095 markings/sec, 395 secs
lola: 73358199 markings, 258941403 edges, 180991 markings/sec, 400 secs
lola: 74258506 markings, 262134891 edges, 180061 markings/sec, 405 secs
lola: 75144232 markings, 265287194 edges, 177145 markings/sec, 410 secs
lola: 76020139 markings, 268429213 edges, 175181 markings/sec, 415 secs
lola: 76901333 markings, 271590216 edges, 176239 markings/sec, 420 secs
lola: 77779218 markings, 274732262 edges, 175577 markings/sec, 425 secs
lola: 78676286 markings, 277917616 edges, 179414 markings/sec, 430 secs
lola: 79555065 markings, 281056869 edges, 175756 markings/sec, 435 secs
lola: 80449329 markings, 284236871 edges, 178853 markings/sec, 440 secs
lola: 81332733 markings, 287386128 edges, 176681 markings/sec, 445 secs
lola: 82199852 markings, 290476899 edges, 173424 markings/sec, 450 secs
lola: 83057568 markings, 293529397 edges, 171543 markings/sec, 455 secs
lola: 83905402 markings, 296549606 edges, 169567 markings/sec, 460 secs
lola: 84764285 markings, 299595529 edges, 171777 markings/sec, 465 secs
lola: 85604907 markings, 302603036 edges, 168124 markings/sec, 470 secs
lola: 86441934 markings, 305597258 edges, 167405 markings/sec, 475 secs
lola: 87293254 markings, 308634011 edges, 170264 markings/sec, 480 secs
lola: 88131710 markings, 311629550 edges, 167691 markings/sec, 485 secs
lola: 88972153 markings, 314637564 edges, 168089 markings/sec, 490 secs
lola: 89808526 markings, 317626581 edges, 167275 markings/sec, 495 secs
lola: 90646408 markings, 320621217 edges, 167576 markings/sec, 500 secs
lola: 91485786 markings, 323611337 edges, 167876 markings/sec, 505 secs
lola: 92318757 markings, 326587132 edges, 166594 markings/sec, 510 secs
lola: 93157040 markings, 329571346 edges, 167657 markings/sec, 515 secs
lola: 93988303 markings, 332548170 edges, 166253 markings/sec, 520 secs
lola: 94827869 markings, 335545297 edges, 167913 markings/sec, 525 secs
lola: 95653891 markings, 338508147 edges, 165204 markings/sec, 530 secs
lola: 96490845 markings, 341496317 edges, 167391 markings/sec, 535 secs
lola: 97332619 markings, 344490896 edges, 168355 markings/sec, 540 secs
lola: 98181658 markings, 347506136 edges, 169808 markings/sec, 545 secs
lola: 99009164 markings, 350468500 edges, 165501 markings/sec, 550 secs
lola: 99852777 markings, 353462867 edges, 168723 markings/sec, 555 secs
lola: 100701229 markings, 356463380 edges, 169690 markings/sec, 560 secs
lola: 101522161 markings, 359401533 edges, 164186 markings/sec, 565 secs
lola: 102345028 markings, 362344306 edges, 164573 markings/sec, 570 secs
lola: 103165549 markings, 365267928 edges, 164104 markings/sec, 575 secs
lola: 104000232 markings, 368242856 edges, 166937 markings/sec, 580 secs
lola: 104817379 markings, 371180391 edges, 163429 markings/sec, 585 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: 'p'
Aborted (core dumped)
FORMULA RobotManipulation-PT-00050-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA RobotManipulation-PT-00050-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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="RobotManipulation-PT-00050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00050.tgz
mv RobotManipulation-PT-00050 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is RobotManipulation-PT-00050, 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 r154-smll-152685551600038"
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 ;