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-full
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 r150-smll-152685548800066
=====================================================================

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


BK_STOP 1526900580381

--------------------
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-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': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola RobotManipulation-PT-01000...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
CTLCardinality @ RobotManipulation-PT-01000 @ 3540 seconds
----- Start make result stderr -----
----- 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-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 236 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: 3665591 markings, 9183256 edges, 3689329903141912576 markings/sec, 0 secs
lola: 7035857 markings, 17616302 edges, 674053 markings/sec, 5 secs
lola: 10412539 markings, 26064052 edges, 675336 markings/sec, 10 secs
lola: 13502999 markings, 34487137 edges, 618092 markings/sec, 15 secs
lola: 16084065 markings, 42029140 edges, 516213 markings/sec, 20 secs
lola: 18608616 markings, 49400594 edges, 504910 markings/sec, 25 secs
lola: 21073439 markings, 56598265 edges, 492965 markings/sec, 30 secs
lola: 23462829 markings, 63574326 edges, 477878 markings/sec, 35 secs
lola: 25783950 markings, 70349871 edges, 464224 markings/sec, 40 secs
lola: 28095733 markings, 77095745 edges, 462357 markings/sec, 45 secs
lola: 30393172 markings, 83803067 edges, 459488 markings/sec, 50 secs
lola: 32665411 markings, 90433960 edges, 454448 markings/sec, 55 secs
lola: 35008751 markings, 97273106 edges, 468668 markings/sec, 60 secs
lola: 37791741 markings, 105309918 edges, 556598 markings/sec, 65 secs
lola: 40661888 markings, 113453005 edges, 574029 markings/sec, 70 secs
lola: 43502260 markings, 121508427 edges, 568074 markings/sec, 75 secs
lola: 46327045 markings, 129518147 edges, 564957 markings/sec, 80 secs
lola: 49021451 markings, 137620891 edges, 538881 markings/sec, 85 secs
lola: 51053462 markings, 144409076 edges, 406402 markings/sec, 90 secs
lola: 53132739 markings, 151349111 edges, 415855 markings/sec, 95 secs
lola: 55184047 markings, 158194578 edges, 410262 markings/sec, 100 secs
lola: 57178167 markings, 164848962 edges, 398824 markings/sec, 105 secs
lola: 59125921 markings, 171346519 edges, 389551 markings/sec, 110 secs
lola: 60979824 markings, 177530940 edges, 370781 markings/sec, 115 secs
lola: 62796737 markings, 183591723 edges, 363383 markings/sec, 120 secs
lola: 64665050 markings, 189822794 edges, 373663 markings/sec, 125 secs
lola: 66458486 markings, 195805461 edges, 358687 markings/sec, 130 secs
lola: 68166158 markings, 201502958 edges, 341534 markings/sec, 135 secs
lola: 69898203 markings, 207278562 edges, 346409 markings/sec, 140 secs
lola: 71650258 markings, 213122573 edges, 350411 markings/sec, 145 secs
lola: 73755874 markings, 219490671 edges, 421123 markings/sec, 150 secs
lola: 75739996 markings, 225124688 edges, 396824 markings/sec, 155 secs
lola: 77693316 markings, 230668038 edges, 390664 markings/sec, 160 secs
lola: 79588174 markings, 236044022 edges, 378972 markings/sec, 165 secs
lola: 81494959 markings, 241454192 edges, 381357 markings/sec, 170 secs
lola: 83414351 markings, 246899160 edges, 383878 markings/sec, 175 secs
lola: 85263843 markings, 252914133 edges, 369898 markings/sec, 180 secs
lola: 87005993 markings, 259140338 edges, 348430 markings/sec, 185 secs
lola: 89404297 markings, 266761464 edges, 479661 markings/sec, 190 secs
lola: 91638746 markings, 273849750 edges, 446890 markings/sec, 195 secs
lola: 93806758 markings, 280725426 edges, 433602 markings/sec, 200 secs
lola: 95701313 markings, 286734630 edges, 378911 markings/sec, 205 secs
lola: 95725500 markings, 286810204 edges, 4837 markings/sec, 210 secs
lola: 95728661 markings, 286820115 edges, 632 markings/sec, 215 secs
lola: 95732582 markings, 286831881 edges, 784 markings/sec, 220 secs
lola: 95733876 markings, 286836663 edges, 259 markings/sec, 225 secs
lola: 95742296 markings, 286863896 edges, 1684 markings/sec, 230 secs
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 365 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: 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: 4932694 markings, 7039626 edges, 986539 markings/sec, 0 secs
lola: 9857844 markings, 14074074 edges, 985030 markings/sec, 5 secs
lola: 14027000 markings, 20032004 edges, 833831 markings/sec, 10 secs
lola: 14027000 markings, 27595258 edges, 0 markings/sec, 15 secs
lola: 14027000 markings, 37267890 edges, 0 markings/sec, 20 secs
lola: 14027000 markings, 46948730 edges, 0 markings/sec, 25 secs
lola: 14532259 markings, 56029400 edges, 101052 markings/sec, 30 secs
lola: 16218165 markings, 62526681 edges, 337181 markings/sec, 35 secs
lola: 17876210 markings, 68918564 edges, 331609 markings/sec, 40 secs
lola: 19527385 markings, 75284644 edges, 330235 markings/sec, 45 secs
lola: 21172625 markings, 81628246 edges, 329048 markings/sec, 50 secs
lola: 22774438 markings, 87804623 edges, 320363 markings/sec, 55 secs
lola: 24303893 markings, 93702268 edges, 305891 markings/sec, 60 secs
lola: 25941325 markings, 100016187 edges, 327486 markings/sec, 65 secs
lola: 27596656 markings, 106399365 edges, 331066 markings/sec, 70 secs
lola: 29098659 markings, 111813032 edges, 300401 markings/sec, 75 secs
lola: 30507753 markings, 116744183 edges, 281819 markings/sec, 80 secs
lola: 31894759 markings, 121598211 edges, 277401 markings/sec, 85 secs
lola: 33261755 markings, 126382301 edges, 273399 markings/sec, 90 secs
lola: 34621801 markings, 131142109 edges, 272009 markings/sec, 95 secs
lola: 35966723 markings, 135849020 edges, 268984 markings/sec, 100 secs
lola: 37303805 markings, 140528522 edges, 267416 markings/sec, 105 secs
lola: 38632094 markings, 145177273 edges, 265658 markings/sec, 110 secs
lola: 39956093 markings, 149811020 edges, 264800 markings/sec, 115 secs
lola: 41278037 markings, 154437592 edges, 264389 markings/sec, 120 secs
lola: 42606411 markings, 159086682 edges, 265675 markings/sec, 125 secs
lola: 43950855 markings, 163792023 edges, 268889 markings/sec, 130 secs
lola: 45567840 markings, 170038217 edges, 323397 markings/sec, 135 secs
lola: 47155387 markings, 176189603 edges, 317509 markings/sec, 140 secs
lola: 48702135 markings, 182182835 edges, 309350 markings/sec, 145 secs
lola: 50228568 markings, 188097571 edges, 305287 markings/sec, 150 secs
lola: 51733323 markings, 193928410 edges, 300951 markings/sec, 155 secs
lola: 53221435 markings, 199694663 edges, 297622 markings/sec, 160 secs
lola: 54694005 markings, 205400541 edges, 294514 markings/sec, 165 secs
lola: 56159324 markings, 211078489 edges, 293064 markings/sec, 170 secs
lola: 57619160 markings, 216735350 edges, 291967 markings/sec, 175 secs
lola: 59090385 markings, 222436109 edges, 294245 markings/sec, 180 secs
lola: 60553248 markings, 227875445 edges, 292573 markings/sec, 185 secs
lola: 61944030 markings, 232742395 edges, 278156 markings/sec, 190 secs
lola: 63305907 markings, 237508439 edges, 272375 markings/sec, 195 secs
lola: 64645490 markings, 242196562 edges, 267917 markings/sec, 200 secs
lola: 65975234 markings, 246850307 edges, 265949 markings/sec, 205 secs
lola: 67290787 markings, 251454423 edges, 263111 markings/sec, 210 secs
lola: 68539092 markings, 255823214 edges, 249661 markings/sec, 215 secs
lola: 69764215 markings, 260110893 edges, 245025 markings/sec, 220 secs
lola: 70986570 markings, 264388900 edges, 244471 markings/sec, 225 secs
lola: 72205099 markings, 268653531 edges, 243706 markings/sec, 230 secs
lola: 73425872 markings, 272926024 edges, 244155 markings/sec, 235 secs
lola: 74649264 markings, 277207690 edges, 244678 markings/sec, 240 secs
lola: 75900396 markings, 281602593 edges, 250226 markings/sec, 245 secs
lola: 77402180 markings, 287421138 edges, 300357 markings/sec, 250 secs
lola: 78809435 markings, 292874051 edges, 281451 markings/sec, 255 secs
lola: 80168776 markings, 298141095 edges, 271868 markings/sec, 260 secs
lola: 81504029 markings, 303314915 edges, 267051 markings/sec, 265 secs
lola: 82835475 markings, 308474144 edges, 266289 markings/sec, 270 secs
lola: 84166905 markings, 313633438 edges, 266286 markings/sec, 275 secs
lola: 85487711 markings, 318751199 edges, 264161 markings/sec, 280 secs
lola: 86810418 markings, 323876416 edges, 264541 markings/sec, 285 secs
lola: 88133140 markings, 329001834 edges, 264544 markings/sec, 290 secs
lola: 89459407 markings, 334141329 edges, 265253 markings/sec, 295 secs
lola: 90795719 markings, 339319094 edges, 267262 markings/sec, 300 secs
lola: 92161529 markings, 344457796 edges, 273162 markings/sec, 305 secs
lola: 93483011 markings, 349082143 edges, 264296 markings/sec, 310 secs
lola: 94750131 markings, 353516542 edges, 253424 markings/sec, 315 secs
lola: 95985876 markings, 357841244 edges, 247149 markings/sec, 320 secs
lola: 97202840 markings, 362100267 edges, 243393 markings/sec, 325 secs
lola: 98418251 markings, 366353900 edges, 243082 markings/sec, 330 secs
lola: 99628378 markings, 370589058 edges, 242025 markings/sec, 335 secs
lola: 100834164 markings, 374809053 edges, 241157 markings/sec, 340 secs
lola: 102039237 markings, 379026568 edges, 241015 markings/sec, 345 secs
lola: 103243808 markings, 383242336 edges, 240914 markings/sec, 350 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 487 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 585 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 585 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 731 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 731 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 731 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 975 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 1463 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 2926 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
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 -----
----- Kill lola and sara stderr -----
----- 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-01000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-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-full"
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 r150-smll-152685548800066"
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 ;