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.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 17K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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 irma4mcc-structural
Input is RobotManipulation-PT-01000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-smll-152685549500066
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526925375013


BK_STOP 1526926079328

--------------------
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-01000 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': 637163, 'Memory': 15952.7, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola RobotManipulation-PT-01000...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-01000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ RobotManipulation-PT-01000 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-01000-CTLCardinality.task
lola: NOT((NOT(A (X ((move <= p_m)))) OR A (G (())))) : A (G (((1 <= access) OR (2 <= access) OR ((1 <= p_rel) AND (p_i2 <= r_active)) OR (access <= r_moving)))) : A (G (E (F (((3 <= initialized) OR (p_rdy <= off)))))) : (A (G (E (X ((3 <= r_stopped))))) AND E (G ((off <= 2)))) : E (F (E (F ((p_i1 <= p_sc))))) : E ((A (X (TRUE)) U A (G (TRUE)))) : A (F ((A (G ((p_rdy <= p_i1))) AND A (F ((p_rel <= initialized)))))) : NOT(A (G (((r_stopped <= moved) OR (p_i2 <= r_stopped) OR ((p_rel <= r_active) AND (p_sc <= p_rdy)))))) : A (F (((2 <= initialized) OR (1 <= p_sc) OR (1 <= initialized) OR (2 <= p_rel)))) : NOT(E (F (A (G ((1 <= p_i2)))))) : A (G (E (X (TRUE)))) : (E ((((p_m <= p_i2) AND (1 <= access)) U ((2 <= off) AND (p_i1 <= r_active)))) AND NOT(E (X (((access <= r_active) OR (1 <= moved)))))) : NOT((A (G (((p_sc <= off) OR (moved <= p_m)))) OR (((1 <= p_m) AND (p_rel <= r_active)) OR ((access <= move) AND (off <= p_rel)) OR (3 <= p_rdy)))) : A ((A (G ((1 <= p_i1))) U E (F ((p_i1 <= p_rel))))) : E (F (A (X (FALSE)))) : A (G (()))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(A (X ((move <= p_m)))) OR A (G (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 8 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= access) OR (2 <= access) OR ((1 <= p_rel) AND (p_i2 <= r_active)) OR (access <= r_moving))))
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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-CTLCardinality.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((3 <= initialized) OR (p_rdy <= off))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((3 <= initialized) OR (p_rdy <= off))))))
lola: processed formula length: 69
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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: 3709694 markings, 9293400 edges, 3689329903141912576 markings/sec, 0 secs
lola: 7256421 markings, 18167994 edges, 709345 markings/sec, 5 secs
lola: 10714223 markings, 26819370 edges, 691560 markings/sec, 10 secs
lola: 13732330 markings, 35157563 edges, 603621 markings/sec, 15 secs
lola: 16272946 markings, 42581074 edges, 508123 markings/sec, 20 secs
lola: 18496038 markings, 49072055 edges, 444618 markings/sec, 25 secs
lola: 20544342 markings, 55053270 edges, 409661 markings/sec, 30 secs
lola: 22552581 markings, 60916147 edges, 401648 markings/sec, 35 secs
lola: 24497544 markings, 66593322 edges, 388993 markings/sec, 40 secs
lola: 26349786 markings, 72001367 edges, 370448 markings/sec, 45 secs
lola: 28184132 markings, 77355189 edges, 366869 markings/sec, 50 secs
lola: 30440602 markings, 83940693 edges, 451294 markings/sec, 55 secs
lola: 32901775 markings, 91123842 edges, 492235 markings/sec, 60 secs
lola: 35376123 markings, 98343342 edges, 494870 markings/sec, 65 secs
lola: 38163931 markings, 106366306 edges, 557562 markings/sec, 70 secs
lola: 41012399 markings, 114447259 edges, 569694 markings/sec, 75 secs
lola: 43836075 markings, 122454988 edges, 564735 markings/sec, 80 secs
lola: 46644825 markings, 130419313 edges, 561750 markings/sec, 85 secs
lola: 49271280 markings, 138455718 edges, 525291 markings/sec, 90 secs
lola: 51524444 markings, 145981071 edges, 450633 markings/sec, 95 secs
lola: 53662270 markings, 153116539 edges, 427565 markings/sec, 100 secs
lola: 55693148 markings, 159893537 edges, 406176 markings/sec, 105 secs
lola: 57674137 markings, 166502455 edges, 396198 markings/sec, 110 secs
lola: 59609648 markings, 172960220 edges, 387102 markings/sec, 115 secs
lola: 61081231 markings, 177870519 edges, 294317 markings/sec, 120 secs
lola: 62525309 markings, 182687478 edges, 288816 markings/sec, 125 secs
lola: 63966286 markings, 187493329 edges, 288195 markings/sec, 130 secs
lola: 65404466 markings, 192290534 edges, 287636 markings/sec, 135 secs
lola: 66843205 markings, 197089064 edges, 287748 markings/sec, 140 secs
lola: 68289450 markings, 201913033 edges, 289249 markings/sec, 145 secs
lola: 69747434 markings, 206776430 edges, 291597 markings/sec, 150 secs
lola: 71228807 markings, 211718304 edges, 296275 markings/sec, 155 secs
lola: 72972035 markings, 217261959 edges, 348646 markings/sec, 160 secs
lola: 74912538 markings, 222775671 edges, 388101 markings/sec, 165 secs
lola: 76499161 markings, 227280514 edges, 317325 markings/sec, 170 secs
lola: 78252031 markings, 232253595 edges, 350574 markings/sec, 175 secs
lola: 80091246 markings, 237471357 edges, 367843 markings/sec, 180 secs
lola: 81885860 markings, 242561882 edges, 358923 markings/sec, 185 secs
lola: 83672219 markings, 247629983 edges, 357272 markings/sec, 190 secs
lola: 85373189 markings, 253308933 edges, 340194 markings/sec, 195 secs
lola: 86960278 markings, 258994288 edges, 317418 markings/sec, 200 secs
lola: 89402303 markings, 266754617 edges, 488405 markings/sec, 205 secs
lola: 91700172 markings, 274044456 edges, 459574 markings/sec, 210 secs
lola: 93895125 markings, 281005686 edges, 438991 markings/sec, 215 secs
lola: 95714942 markings, 286777069 edges, 363963 markings/sec, 220 secs
lola: 95722134 markings, 286799722 edges, 1438 markings/sec, 225 secs
lola: 95725763 markings, 286810942 edges, 726 markings/sec, 230 secs
lola: 95727778 markings, 286816586 edges, 403 markings/sec, 235 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((3 <= r_stopped))))) AND E (G ((off <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((3 <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((3 <= r_stopped)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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: 4000 markings, 3999 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F ((p_i1 <= p_sc)))))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2002 markings, 2001 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (X (TRUE)) U A (G (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: processed formula with 0 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 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p_rdy <= p_i1))) AND A (F ((p_rel <= initialized))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (p_i1 + 1 <= p_rdy))) AND A(TRUE U (p_rel <= initialized))))
lola: processed formula length: 83
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 10005 markings, 24017 edges
lola: ========================================
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((r_stopped <= moved) OR (p_i2 <= r_stopped) OR ((p_rel <= r_active) AND (p_sc <= p_rdy))))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-CTLCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2015 markings, 2019 edges
lola: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= initialized) OR (1 <= p_sc) OR (1 <= initialized) OR (2 <= p_rel))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= initialized) OR (1 <= p_sc) OR (1 <= initialized) OR (2 <= p_rel))))
lola: processed formula: A (F (((2 <= initialized) OR (1 <= p_sc) OR (1 <= initialized) OR (2 <= p_rel))))
lola: processed formula length: 84
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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: 2003 markings, 2002 edges
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (G ((1 <= p_i2))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (p_i2 <= 0)))))
lola: processed formula length: 41
lola: 7 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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: 4976887 markings, 7102439 edges, 995377 markings/sec, 0 secs
lola: 9534165 markings, 13611915 edges, 911456 markings/sec, 5 secs
lola: 13859247 markings, 19789374 edges, 865016 markings/sec, 10 secs
lola: 14027000 markings, 24911757 edges, 33551 markings/sec, 15 secs
lola: 14027000 markings, 32761152 edges, 0 markings/sec, 20 secs
lola: 14027000 markings, 40743912 edges, 0 markings/sec, 25 secs
lola: 14027000 markings, 48545280 edges, 0 markings/sec, 30 secs
lola: 14592001 markings, 56259546 edges, 113000 markings/sec, 35 secs
lola: 16243632 markings, 62624805 edges, 330326 markings/sec, 40 secs
lola: 17847364 markings, 68807398 edges, 320746 markings/sec, 45 secs
lola: 19421184 markings, 74875083 edges, 314764 markings/sec, 50 secs
lola: 20969038 markings, 80843148 edges, 309571 markings/sec, 55 secs
lola: 22488375 markings, 86701603 edges, 303867 markings/sec, 60 secs
lola: 23991697 markings, 92498223 edges, 300664 markings/sec, 65 secs
lola: 25476906 markings, 98225430 edges, 297042 markings/sec, 70 secs
lola: 26959805 markings, 103943499 edges, 296580 markings/sec, 75 secs
lola: 28448637 markings, 109538436 edges, 297766 markings/sec, 80 secs
lola: 29819018 markings, 114333898 edges, 274076 markings/sec, 85 secs
lola: 30986757 markings, 118420508 edges, 233548 markings/sec, 90 secs
lola: 32125826 markings, 122406876 edges, 227814 markings/sec, 95 secs
lola: 33297105 markings, 126506009 edges, 234256 markings/sec, 100 secs
lola: 34450789 markings, 130543605 edges, 230737 markings/sec, 105 secs
lola: 35607894 markings, 134593199 edges, 231421 markings/sec, 110 secs
lola: 36761241 markings, 138629668 edges, 230669 markings/sec, 115 secs
lola: 37906922 markings, 142639312 edges, 229136 markings/sec, 120 secs
lola: 39050088 markings, 146640164 edges, 228633 markings/sec, 125 secs
lola: 40192992 markings, 150640125 edges, 228581 markings/sec, 130 secs
lola: 41338509 markings, 154649234 edges, 229103 markings/sec, 135 secs
lola: 42490802 markings, 158682067 edges, 230459 markings/sec, 140 secs
lola: 43657385 markings, 162764922 edges, 233317 markings/sec, 145 secs
lola: 45070771 markings, 168112165 edges, 282677 markings/sec, 150 secs
lola: 46458575 markings, 173489462 edges, 277561 markings/sec, 155 secs
lola: 47759604 markings, 178530680 edges, 260206 markings/sec, 160 secs
lola: 49020029 markings, 183414576 edges, 252085 markings/sec, 165 secs
lola: 50267585 markings, 188248793 edges, 249511 markings/sec, 170 secs
lola: 51505504 markings, 193045481 edges, 247584 markings/sec, 175 secs
lola: 52736186 markings, 197814149 edges, 246136 markings/sec, 180 secs
lola: 53959978 markings, 202556082 edges, 244758 markings/sec, 185 secs
lola: 55186918 markings, 207310639 edges, 245388 markings/sec, 190 secs
lola: 56409199 markings, 212046822 edges, 244456 markings/sec, 195 secs
lola: 57641381 markings, 216821144 edges, 246436 markings/sec, 200 secs
lola: 58880643 markings, 221623086 edges, 247852 markings/sec, 205 secs
lola: 60148201 markings, 226458194 edges, 253512 markings/sec, 210 secs
lola: 61412136 markings, 230881012 edges, 252787 markings/sec, 215 secs
lola: 62583132 markings, 234978984 edges, 234199 markings/sec, 220 secs
lola: 63711002 markings, 238926136 edges, 225574 markings/sec, 225 secs
lola: 64825057 markings, 242824999 edges, 222811 markings/sec, 230 secs
lola: 65936715 markings, 246715500 edges, 222332 markings/sec, 235 secs
lola: 67050803 markings, 250614535 edges, 222818 markings/sec, 240 secs
lola: 68159889 markings, 254496089 edges, 221817 markings/sec, 245 secs
lola: 69266874 markings, 258370297 edges, 221397 markings/sec, 250 secs
lola: 70367184 markings, 262221162 edges, 220062 markings/sec, 255 secs
lola: 71491564 markings, 266156280 edges, 224876 markings/sec, 260 secs
lola: 72622685 markings, 270115005 edges, 226224 markings/sec, 265 secs
lola: 73756445 markings, 274082970 edges, 226752 markings/sec, 270 secs
lola: 74897818 markings, 278077584 edges, 228275 markings/sec, 275 secs
lola: 76114536 markings, 282432170 edges, 243344 markings/sec, 280 secs
lola: 77530168 markings, 287917198 edges, 283126 markings/sec, 285 secs
lola: 78820454 markings, 292916575 edges, 258057 markings/sec, 290 secs
lola: 80055050 markings, 297700361 edges, 246919 markings/sec, 295 secs
lola: 81264739 markings, 302387895 edges, 241938 markings/sec, 300 secs
lola: 82461443 markings, 307024788 edges, 239341 markings/sec, 305 secs
lola: 83601816 markings, 311443746 edges, 228075 markings/sec, 310 secs
lola: 85025428 markings, 316959768 edges, 284722 markings/sec, 315 secs
lola: 86437619 markings, 322432096 edges, 282438 markings/sec, 320 secs
lola: 87839697 markings, 327864730 edges, 280416 markings/sec, 325 secs
lola: 89237921 markings, 333283049 edges, 279645 markings/sec, 330 secs
lola: 90639613 markings, 338714280 edges, 280338 markings/sec, 335 secs
lola: 92062828 markings, 344112447 edges, 284643 markings/sec, 340 secs
lola: 93456036 markings, 348987742 edges, 278642 markings/sec, 345 secs
lola: 94824283 markings, 353776040 edges, 273649 markings/sec, 350 secs
lola: 96169137 markings, 358482600 edges, 268971 markings/sec, 355 secs
lola: 97498469 markings, 363134895 edges, 265866 markings/sec, 360 secs
lola: 98812006 markings, 367731947 edges, 262707 markings/sec, 365 secs
lola: 100115287 markings, 372293139 edges, 260656 markings/sec, 370 secs
lola: 101408734 markings, 376819926 edges, 258689 markings/sec, 375 secs
lola: 102693243 markings, 381315461 edges, 256902 markings/sec, 380 secs
lola: 103971006 markings, 385787956 edges, 255553 markings/sec, 385 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 480 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: processed formula with 0 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 11 will run for 576 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((p_m <= p_i2) AND (1 <= access)) U ((2 <= off) AND (p_i1 <= r_active)))) AND NOT(E (X (((access <= r_active) OR (1 <= moved))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 576 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p_m <= p_i2) AND (1 <= access)) U ((2 <= off) AND (p_i1 <= r_active))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p_m <= p_i2) AND (1 <= access)) U ((2 <= off) AND (p_i1 <= r_active)))
lola: processed formula length: 74
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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 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: 25032 markings, 27051 edges
lola: ========================================
lola: subprocess 12 will run for 720 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((r_active + 1 <= access) AND (moved <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((r_active + 1 <= access) AND (moved <= 0))))
lola: processed formula: A (X (((r_active + 1 <= access) AND (moved <= 0))))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 720 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G (((p_sc <= off) OR (moved <= p_m)))) OR (((1 <= p_m) AND (p_rel <= r_active)) OR ((access <= move) AND (off <= p_rel)) OR (3 <= p_rdy))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 720 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((off + 1 <= p_sc) AND (p_m + 1 <= moved))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-CTLCardinality-12.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: lola: SUBRESULT========================================

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 960 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((1 <= p_i1))) U E (F ((p_i1 <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U (p_i1 <= 0))) U E(TRUE U (p_i1 <= p_rel)))
lola: processed formula length: 57
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6002 markings, 6002 edges
lola: ========================================
lola: subprocess 14 will run for 1441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (FALSE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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 15 will run for 2882 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: processed formula with 0 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: RESULT
lola:
SUMMARY: no yes unknown no yes yes no yes yes unknown yes yes no yes no yes
----- Kill lola and sara stderr -----
FORMULA RobotManipulation-PT-01000-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-01000"
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-01000.tgz
mv RobotManipulation-PT-01000 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-01000, 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-152685549500066"
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 ;