fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r154-smll-152685551600032
Last Updated
June 26, 2018

About the Execution of M4M.full for RobotManipulation-PT-00020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4316.400 273186.00 233169.00 1554.60 TTFTTTFTTFFTTF?T normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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.4K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is RobotManipulation-PT-00020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-smll-152685551600032
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526935138494


BK_STOP 1526935411680

--------------------
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-00020 as instance name.
Using RobotManipulation as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', '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}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 363645, 'Memory': 13793.18, 'Tool': 'lola'}, {'Time': 547533, 'Memory': 14191.02, 'Tool': 'marcie'}, {'Time': 702655, 'Memory': 1113.44, 'Tool': 'gspn'}, {'Time': 843967, 'Memory': 3262.31, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola RobotManipulation-PT-00020...

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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-00020: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ RobotManipulation-PT-00020 @ 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-00020-CTLFireability.task
lola: (A ((E (X (FIREABLE(p_move))) U E (F (FIREABLE(p_start))))) AND NOT(E ((NOT FIREABLE(p_intoSC) U (FIREABLE(r_starts) AND FIREABLE(p_moved)))))) : A (G (E (F ((NOT FIREABLE(p_moved) AND FIREABLE(r_stops)))))) : E (X (NOT((E (G (FIREABLE(p_start))) AND A (F (FIREABLE(p_sop))))))) : A (X (((E (X (FIREABLE(r_starts))) AND E (G (FIREABLE(p_relSC)))) OR E (F (NOT FIREABLE(p_start)))))) : A (G (())) : (((A ((FIREABLE(p_move) U FIREABLE(r_stops))) AND FIREABLE(r_starts)) AND E (X (FIREABLE(r_starts)))) OR ((A ((FIREABLE(p_relSC) U FIREABLE(r_starts))) OR NOT FIREABLE(r_starts)) AND NOT(A (G ((FIREABLE(p_start))))))) : E (X ((A (G ((FIREABLE(p_move) OR FIREABLE(p_start)))) AND E (G (FIREABLE(r_starts)))))) : E (((A (F (FIREABLE(p_intoSC))) OR FIREABLE(p_intoSC)) U A (F ((FIREABLE(r_stops) AND FIREABLE(p_intoSC)))))) : A (G (E (F (FIREABLE(r_starts))))) : (((FIREABLE(r_end_move) OR A (F (FIREABLE(r_stops)))) OR (A (G (NOT FIREABLE(p_sop))) OR A (F ((FIREABLE(p_start) AND FIREABLE(p_sop)))))) OR NOT(NOT((A (X (FIREABLE(p_move))) AND A (G (FIREABLE(p_start))))))) : NOT((A ((NOT FIREABLE(p_start) U FIREABLE(p_intoSC))) OR (A (F (FIREABLE(p_started))) OR A (X ((FIREABLE(p_sop) AND FIREABLE(p_started))))))) : A (F ((A (G ((FIREABLE(p_started) AND FIREABLE(p_intoSC)))) OR (E (X (FIREABLE(p_sop))) OR A (X (FIREABLE(p_move))))))) : E (X ((A (F ((FIREABLE(p_intoSC) OR FIREABLE(r_end_move)))) OR (A (F (FIREABLE(p_intoSC))) AND NOT FIREABLE(r_begin_move))))) : (E (G ((NOT FIREABLE(p_started) AND NOT FIREABLE(p_move)))) OR A (G (NOT(A (X (FIREABLE(p_moved))))))) : NOT(((E ((FIREABLE(p_relSC) U FIREABLE(r_starts))) OR E (F ((FIREABLE(p_moved) OR FIREABLE(p_intoSC))))) AND A (((FIREABLE(p_start) OR FIREABLE(p_intoSC)) U FIREABLE(p_intoSC))))) : NOT(E (F (A (G (NOT FIREABLE(p_moved))))))
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 ((E (X (FIREABLE(p_move))) U E (F (FIREABLE(p_start))))) AND NOT(E ((NOT FIREABLE(p_intoSC) U (FIREABLE(r_starts) AND FIREABLE(p_moved))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X (FIREABLE(p_move))) U E (F (FIREABLE(p_start)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX(FIREABLE(p_move)) U E(TRUE U FIREABLE(p_start)))
lola: processed formula length: 53
lola: 7 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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 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: 1 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(p_intoSC) R (NOT FIREABLE(r_starts) OR NOT FIREABLE(p_moved))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(p_intoSC) R (NOT FIREABLE(r_starts) OR NOT FIREABLE(p_moved))))
lola: processed formula: A ((FIREABLE(p_intoSC) R (NOT FIREABLE(r_starts) OR NOT FIREABLE(p_moved))))
lola: processed formula length: 77
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1762 markings, 2581 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((NOT FIREABLE(p_moved) AND FIREABLE(r_stops))))))
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 (NOT FIREABLE(p_moved) AND FIREABLE(r_stops))))))
lola: processed formula length: 75
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: 1244477 markings, 4686947 edges, 248895 markings/sec, 0 secs
lola: 2397278 markings, 9125551 edges, 230560 markings/sec, 5 secs
lola: 3487938 markings, 13374857 edges, 218132 markings/sec, 10 secs
lola: 4542223 markings, 17511323 edges, 210857 markings/sec, 15 secs
lola: 5565008 markings, 21553676 edges, 204557 markings/sec, 20 secs
lola: 6559045 markings, 25505896 edges, 198807 markings/sec, 25 secs
lola: 7544192 markings, 29425819 edges, 197029 markings/sec, 30 secs
lola: 8513181 markings, 33296253 edges, 193798 markings/sec, 35 secs
lola: 9467178 markings, 37118697 edges, 190799 markings/sec, 40 secs
lola: 10403363 markings, 40884968 edges, 187237 markings/sec, 45 secs
lola: 11329344 markings, 44619736 edges, 185196 markings/sec, 50 secs
lola: 12250033 markings, 48333419 edges, 184138 markings/sec, 55 secs
lola: 13128499 markings, 51883170 edges, 175693 markings/sec, 60 secs
lola: 13947849 markings, 55200086 edges, 163870 markings/sec, 65 secs
lola: 14809965 markings, 58698165 edges, 172423 markings/sec, 70 secs
lola: 15673275 markings, 62199149 edges, 172662 markings/sec, 75 secs
lola: 16557215 markings, 65791491 edges, 176788 markings/sec, 80 secs
lola: 17439193 markings, 69379281 edges, 176396 markings/sec, 85 secs
lola: 18313588 markings, 72938931 edges, 174879 markings/sec, 90 secs
lola: 19181320 markings, 76473859 edges, 173546 markings/sec, 95 secs
lola: 20040651 markings, 79978246 edges, 171866 markings/sec, 100 secs
lola: 20897195 markings, 83471089 edges, 171309 markings/sec, 105 secs
lola: 21746404 markings, 86934018 edges, 169842 markings/sec, 110 secs
lola: 22589660 markings, 90370635 edges, 168651 markings/sec, 115 secs
lola: 23427010 markings, 93775718 edges, 167470 markings/sec, 120 secs
lola: 24285202 markings, 97247643 edges, 171638 markings/sec, 125 secs
lola: 25044335 markings, 101094398 edges, 151827 markings/sec, 130 secs
lola: 25670017 markings, 104752852 edges, 125136 markings/sec, 135 secs
lola: 26296274 markings, 108432847 edges, 125251 markings/sec, 140 secs
lola: 26905395 markings, 112015882 edges, 121824 markings/sec, 145 secs
lola: 27535843 markings, 115736137 edges, 126090 markings/sec, 150 secs
lola: 28167129 markings, 119471429 edges, 126257 markings/sec, 155 secs
lola: 28794592 markings, 123197082 edges, 125493 markings/sec, 160 secs
lola: 29424110 markings, 126940514 edges, 125904 markings/sec, 165 secs
lola: 30054683 markings, 130696217 edges, 126115 markings/sec, 170 secs
lola: 30688111 markings, 134470677 edges, 126686 markings/sec, 175 secs
lola: 31321188 markings, 138248528 edges, 126615 markings/sec, 180 secs
lola: 31946046 markings, 141985426 edges, 124972 markings/sec, 185 secs
lola: 32562793 markings, 145676022 edges, 123349 markings/sec, 190 secs
lola: 33167560 markings, 149303088 edges, 120953 markings/sec, 195 secs
lola: 33802040 markings, 153102584 edges, 126896 markings/sec, 200 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33802040 markings, 153102584 edges
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT((E (G (FIREABLE(p_start))) AND A (F (FIREABLE(p_sop)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (NOT FIREABLE(p_start)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U NOT FIREABLE(p_start)))
lola: processed formula length: 35
lola: 10 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: 366 markings, 366 edges
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (NOT FIREABLE(p_sop)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U FIREABLE(p_sop))))
lola: processed formula length: 34
lola: 11 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: 1761 markings, 2580 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((E (X (FIREABLE(r_starts))) AND E (G (FIREABLE(p_relSC)))) OR E (F (NOT FIREABLE(p_start))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((EX(FIREABLE(r_starts)) AND NOT(A(TRUE U NOT FIREABLE(p_relSC)))) OR E(TRUE U NOT FIREABLE(p_start))))
lola: processed formula length: 106
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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 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: 41 markings, 41 edges
lola: ========================================
lola: subprocess 4 will run for 277 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-00020-CTLFireability.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 5 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A ((FIREABLE(p_move) U FIREABLE(r_stops))) AND FIREABLE(r_starts)) AND E (X (FIREABLE(r_starts)))) OR ((A ((FIREABLE(p_relSC) U FIREABLE(r_starts))) OR NOT FIREABLE(r_starts)) AND NOT(A (G ((FIREABLE(p_start)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(p_move) U FIREABLE(r_stops)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(p_move) U FIREABLE(r_stops)))
lola: processed formula: A ((FIREABLE(p_move) U FIREABLE(r_stops)))
lola: processed formula length: 42
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 205 markings, 205 edges
lola: ========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(p_relSC) U FIREABLE(r_starts)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(p_relSC) U FIREABLE(r_starts)))
lola: processed formula: A ((FIREABLE(p_relSC) U FIREABLE(r_starts)))
lola: processed formula length: 44
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 205 markings, 205 edges
lola: ========================================
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(r_starts)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(r_starts)
lola: processed formula length: 22
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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 8 will run for 416 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(p_start))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((FIREABLE(p_move) OR FIREABLE(p_start)))) AND E (G (FIREABLE(r_starts))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((NOT(E(TRUE U (NOT FIREABLE(p_move) AND NOT FIREABLE(p_start)))) AND NOT(A(TRUE U NOT FIREABLE(r_starts)))))
lola: processed formula length: 111
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 41 markings, 40 edges
lola: ========================================
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((A (F (FIREABLE(p_intoSC))) OR FIREABLE(p_intoSC)) U A (F ((FIREABLE(r_stops) AND FIREABLE(p_intoSC))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((A(TRUE U FIREABLE(p_intoSC)) OR FIREABLE(p_intoSC)) U A(TRUE U (FIREABLE(r_stops) AND FIREABLE(p_intoSC))))
lola: processed formula length: 110
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: 109188 markings, 250322 edges
lola: ========================================
lola: subprocess 8 will run for 416 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(r_starts)))))
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 FIREABLE(r_starts)))))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: 1505602 markings, 4383926 edges
lola: ========================================
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(r_end_move) OR A (F (FIREABLE(r_stops)))) OR (A (G (NOT FIREABLE(p_sop))) OR A (F ((FIREABLE(p_start) AND FIREABLE(p_sop)))))) OR NOT(NOT((A (X (FIREABLE(p_move))) AND A (G (FIREABLE(p_start)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(r_end_move)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(r_end_move)
lola: processed formula length: 20
lola: 18 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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 555 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(r_stops)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(r_stops)))
lola: processed formula: A (F (FIREABLE(r_stops)))
lola: processed formula length: 25
lola: 18 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 205 markings, 205 edges
lola: ========================================
lola: subprocess 11 will run for 666 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(p_sop)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 12 will run for 832 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(p_start) AND FIREABLE(p_sop))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(p_start) AND FIREABLE(p_sop))))
lola: processed formula: A (F ((FIREABLE(p_start) AND FIREABLE(p_sop))))
lola: processed formula length: 47
lola: 18 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 205 markings, 205 edges
lola: ========================================
lola: subprocess 13 will run for 1110 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(p_move)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(p_move)))
lola: processed formula: A (X (FIREABLE(p_move)))
lola: processed formula length: 24
lola: 18 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: 205 markings, 205 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 555 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A ((NOT FIREABLE(p_start) U FIREABLE(p_intoSC))) OR (A (F (FIREABLE(p_started))) OR A (X ((FIREABLE(p_sop) AND FIREABLE(p_started)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 555 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(p_start) R NOT FIREABLE(p_intoSC)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(NOT FIREABLE(p_start) U FIREABLE(p_intoSC)))
lola: processed formula length: 50
lola: 15 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 666 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(p_started)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(p_started)))
lola: processed formula length: 34
lola: 14 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 83 markings, 82 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 666 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((FIREABLE(p_started) AND FIREABLE(p_intoSC)))) OR (E (X (FIREABLE(p_sop))) OR A (X (FIREABLE(p_move)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (NOT FIREABLE(p_started) OR NOT FIREABLE(p_intoSC)))) OR (EX(FIREABLE(p_sop)) OR AX(FIREABLE(p_move)))))
lola: processed formula length: 128
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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 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: 83 markings, 165 edges
lola: ========================================
lola: subprocess 12 will run for 832 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (F ((FIREABLE(p_intoSC) OR FIREABLE(r_end_move)))) OR (A (F (FIREABLE(p_intoSC))) AND NOT FIREABLE(r_begin_move)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 832 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((FIREABLE(p_intoSC) OR FIREABLE(r_end_move))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (FIREABLE(p_intoSC) OR FIREABLE(r_end_move))))
lola: processed formula length: 59
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: 1761 markings, 2580 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1110 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((NOT FIREABLE(p_started) AND NOT FIREABLE(p_move)))) OR A (G (NOT(A (X (FIREABLE(p_moved)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1110 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(p_started) AND NOT FIREABLE(p_move))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(p_started) OR FIREABLE(p_move))))
lola: processed formula length: 57
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 83 markings, 82 edges
lola: ========================================
lola: subprocess 14 will run for 1665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(p_moved)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(p_moved)))))
lola: processed formula length: 45
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: 223 markings, 234 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E ((FIREABLE(p_relSC) U FIREABLE(r_starts))) OR E (F ((FIREABLE(p_moved) OR FIREABLE(p_intoSC))))) AND A (((FIREABLE(p_start) OR FIREABLE(p_intoSC)) U FIREABLE(p_intoSC)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(p_relSC) R NOT FIREABLE(r_starts)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((NOT FIREABLE(p_relSC) R NOT FIREABLE(r_starts)))
lola: processed formula: A ((NOT FIREABLE(p_relSC) R NOT FIREABLE(r_starts)))
lola: processed formula length: 52
lola: 13 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(p_moved) AND NOT FIREABLE(p_intoSC))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
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: '\ufffd'
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (G (NOT FIREABLE(p_moved))))))
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 FIREABLE(p_moved)))))
lola: processed formula length: 47
lola: 7 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00020-CTLFireability.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: 1965449 markings, 5784229 edges, 393090 markings/sec, 0 secs
lola: 3846078 markings, 11381353 edges, 376126 markings/sec, 5 secs
lola: 5011177 markings, 15888746 edges, 233020 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5565912 markings, 18141633 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes no yes yes no no yes yes no unknown yes
FORMULA RobotManipulation-PT-00020-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00020-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- 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-00020"
export BK_EXAMINATION="CTLFireability"
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-00020.tgz
mv RobotManipulation-PT-00020 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-00020, examination is CTLFireability"
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-152685551600032"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;