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 240K
-rw-r--r-- 1 mcc users 3.6K 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 2.8K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 69K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Solitaire-PT-EngNC7x7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-152705516900144
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527084548384


BK_STOP 1527085099916

--------------------
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 Solitaire-PT-EngNC7x7 as instance name.
Using Solitaire 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': None, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': None, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
/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': 570475, 'Memory': 2517.69, 'Tool': 'lola'}, {'Time': 570571, 'Memory': 2529.97, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola Solitaire-PT-EngNC7x7...

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


checking for too many tokens
===========================================================================================
Solitaire-PT-EngNC7x7: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ Solitaire-PT-EngNC7x7 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 66 places, 76 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 152 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-EngNC7x7-CTLFireability.task
lola: ((A (F ((FIREABLE(up25) OR FIREABLE(left54) OR FIREABLE(down45) OR FIREABLE(up23)))) AND NOT(A (G (NOT FIREABLE(right44))))) OR (FIREABLE(left56) AND E (F (FIREABLE(left74))))) : NOT(((E (G ((FIREABLE(up54) OR FIREABLE(right45)))) OR (A (F (FIREABLE(up41))) AND (FIREABLE(left52) OR NOT FIREABLE(up54)))) AND E (F (A (G (FIREABLE(down45))))))) : A ((E (X (NOT FIREABLE(right55))) U ((FIREABLE(up65) OR FIREABLE(right74)) OR A (X (FIREABLE(up23)))))) : ((A (G (A (F (FIREABLE(down41))))) OR (A (G ((FIREABLE(up45) AND FIREABLE(up65)))) AND E (G ((FIREABLE(left52) OR FIREABLE(down23)))))) AND NOT(A (G ((NOT FIREABLE(right45) OR NOT FIREABLE(down41)))))) : A (F (FIREABLE(left55))) : NOT(E (G (((NOT FIREABLE(right56) OR NOT FIREABLE(left64)) OR A (G (FIREABLE(left74))))))) : A (F (((NOT FIREABLE(left55) AND NOT FIREABLE(down23) AND (NOT FIREABLE(left32) OR NOT FIREABLE(right64))) AND (E (G (FIREABLE(left56))) OR A (F (FIREABLE(left56))))))) : A ((A (F ((FIREABLE(right53) OR FIREABLE(down46)))) U A (G (NOT FIREABLE(left24))))) : NOT(E (G ((NOT FIREABLE(right56) OR FIREABLE(left52) OR FIREABLE(down35) OR NOT FIREABLE(up47))))) : A (G (E (F ((NOT FIREABLE(right33) OR NOT FIREABLE(left24)))))) : ((A (F (FIREABLE(down23))) AND E (G (E (F (FIREABLE(down41)))))) AND ((E ((FIREABLE(up47) U FIREABLE(left34))) OR ((FIREABLE(down33) OR FIREABLE(right35) OR NOT FIREABLE(right53)) AND E (X (FIREABLE(up53))))) OR E (G (NOT FIREABLE(up43))))) : A (X (E (F (FIREABLE(left46))))) : A (F (FIREABLE(up25))) : ((A (F (A (F (FIREABLE(up34))))) OR FIREABLE(left46)) AND A (F (E (G (NOT FIREABLE(right74)))))) : E (((E (X (FIREABLE(left45))) OR (FIREABLE(up25) AND FIREABLE(down44) AND FIREABLE(left74))) U (((FIREABLE(right24) AND FIREABLE(right56)) OR NOT FIREABLE(up23)) AND A (F (FIREABLE(up44)))))) : NOT(A ((A (G (FIREABLE(down24))) U A (F (FIREABLE(down41))))))
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 (F ((FIREABLE(up25) OR FIREABLE(left54) OR FIREABLE(down45) OR FIREABLE(up23)))) AND NOT(A (G (NOT FIREABLE(right44))))) OR (FIREABLE(left56) AND E (F (FIREABLE(left74)))))
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 (F ((FIREABLE(up25) OR FIREABLE(left54) OR FIREABLE(down45) OR FIREABLE(up23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(up25) OR FIREABLE(left54) OR FIREABLE(down45) OR FIREABLE(up23))))
lola: processed formula: A (F ((FIREABLE(up25) OR FIREABLE(left54) OR FIREABLE(down45) OR FIREABLE(up23))))
lola: processed formula length: 85
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 45 markings, 48 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(left56)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(left56)
lola: processed formula length: 16
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((FIREABLE(up54) OR FIREABLE(right45)))) OR (A (F (FIREABLE(up41))) AND (FIREABLE(left52) OR NOT FIREABLE(up54)))) AND E (F (A (G (FIREABLE(down45)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(up54) AND NOT FIREABLE(right45))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NOT FIREABLE(up54) AND NOT FIREABLE(right45))))
lola: processed formula: A (F ((NOT FIREABLE(up54) AND NOT FIREABLE(right45))))
lola: processed formula length: 54
lola: 15 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(up41)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(up41)))
lola: processed formula length: 29
lola: 17 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X (NOT FIREABLE(right55))) U ((FIREABLE(up65) OR FIREABLE(right74)) OR A (X (FIREABLE(up23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX(NOT FIREABLE(right55)) U ((FIREABLE(up65) OR FIREABLE(right74)) OR AX(FIREABLE(up23))))
lola: processed formula length: 93
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 36 markings, 39 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (A (F (FIREABLE(down41))))) OR (A (G ((FIREABLE(up45) AND FIREABLE(up65)))) AND E (G ((FIREABLE(left52) OR FIREABLE(down23)))))) AND NOT(A (G ((NOT FIREABLE(right45) OR NOT FIREABLE(down41))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (FIREABLE(down41)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U FIREABLE(down41)))))
lola: processed formula length: 46
lola: 5 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(up45) AND FIREABLE(up65))))
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 132 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(left55)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(left55)))
lola: processed formula: A (F (FIREABLE(left55)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((NOT FIREABLE(right56) OR NOT FIREABLE(left64)) OR A (G (FIREABLE(left74)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((FIREABLE(right56) AND FIREABLE(left64)) AND E(TRUE U NOT FIREABLE(left74))))
lola: processed formula length: 87
lola: 9 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((NOT FIREABLE(left55) AND NOT FIREABLE(down23) AND (NOT FIREABLE(left32) OR NOT FIREABLE(right64))) AND (E (G (FIREABLE(left56))) OR A (F (FIREABLE(left56)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((NOT FIREABLE(left55) AND NOT FIREABLE(down23) AND (NOT FIREABLE(left32) OR NOT FIREABLE(right64))) AND (NOT(A(TRUE U NOT FIREABLE(left56))) OR A(TRUE U FIREABLE(left56)))))
lola: processed formula length: 184
lola: 4 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 23 markings, 90 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((FIREABLE(right53) OR FIREABLE(down46)))) U A (G (NOT FIREABLE(left24)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (FIREABLE(right53) OR FIREABLE(down46))) U NOT(E(TRUE U FIREABLE(left24))))
lola: processed formula length: 87
lola: 4 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 171 markings, 342 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((NOT FIREABLE(right56) OR FIREABLE(left52) OR FIREABLE(down35) OR NOT FIREABLE(up47)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(right56) AND NOT FIREABLE(left52) AND NOT FIREABLE(down35) AND FIREABLE(up47))))
lola: processed formula: A (F ((FIREABLE(right56) AND NOT FIREABLE(left52) AND NOT FIREABLE(down35) AND FIREABLE(up47))))
lola: processed formula length: 96
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((NOT FIREABLE(right33) OR NOT FIREABLE(left24))))))
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(right33) OR NOT FIREABLE(left24))))))
lola: processed formula length: 78
lola: 2 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 825637 markings, 4514858 edges, 3689330178019819520 markings/sec, 0 secs
lola: 1564095 markings, 8836702 edges, 147692 markings/sec, 5 secs
lola: 2193422 markings, 12934735 edges, 125865 markings/sec, 10 secs
lola: 2801176 markings, 16925806 edges, 121551 markings/sec, 15 secs
lola: 3424960 markings, 20992606 edges, 124757 markings/sec, 20 secs
lola: 4002545 markings, 25029015 edges, 115517 markings/sec, 25 secs
lola: 4538735 markings, 28919517 edges, 107238 markings/sec, 30 secs
lola: 5083013 markings, 32840697 edges, 108856 markings/sec, 35 secs
lola: 5605418 markings, 36722088 edges, 104481 markings/sec, 40 secs
lola: 6091282 markings, 40489234 edges, 97173 markings/sec, 45 secs
lola: 6641233 markings, 44238298 edges, 109990 markings/sec, 50 secs
lola: 7225003 markings, 48023264 edges, 116754 markings/sec, 55 secs
lola: 7768613 markings, 51757250 edges, 108722 markings/sec, 60 secs
lola: 8265685 markings, 55241378 edges, 99414 markings/sec, 65 secs
lola: 8772193 markings, 58794278 edges, 101302 markings/sec, 70 secs
lola: 9288510 markings, 62448805 edges, 103263 markings/sec, 75 secs
lola: 9857421 markings, 66366559 edges, 113782 markings/sec, 80 secs
lola: 10375020 markings, 70108434 edges, 103520 markings/sec, 85 secs
lola: 10822129 markings, 73665519 edges, 89422 markings/sec, 90 secs
lola: 11286939 markings, 77224660 edges, 92962 markings/sec, 95 secs
lola: 11742374 markings, 80750580 edges, 91087 markings/sec, 100 secs
lola: 12222718 markings, 84388337 edges, 96069 markings/sec, 105 secs
lola: 12688120 markings, 88024953 edges, 93080 markings/sec, 110 secs
lola: 13090617 markings, 91317602 edges, 80499 markings/sec, 115 secs
lola: 13514529 markings, 94711845 edges, 84782 markings/sec, 120 secs
lola: 13895125 markings, 97945135 edges, 76119 markings/sec, 125 secs
lola: 14221885 markings, 100748308 edges, 65352 markings/sec, 130 secs
lola: 14522901 markings, 103374773 edges, 60203 markings/sec, 135 secs
lola: 14994517 markings, 106431856 edges, 94323 markings/sec, 140 secs
lola: 15435490 markings, 109388108 edges, 88195 markings/sec, 145 secs
lola: 15842920 markings, 112296163 edges, 81486 markings/sec, 150 secs
lola: 16316329 markings, 115466766 edges, 94682 markings/sec, 155 secs
lola: 16763658 markings, 118455540 edges, 89466 markings/sec, 160 secs
lola: 17179418 markings, 121387805 edges, 83152 markings/sec, 165 secs
lola: 17583902 markings, 124424107 edges, 80897 markings/sec, 170 secs
lola: 18052519 markings, 127639164 edges, 93723 markings/sec, 175 secs
lola: 18456799 markings, 130690644 edges, 80856 markings/sec, 180 secs
lola: 18859327 markings, 133687263 edges, 80506 markings/sec, 185 secs
lola: 19239395 markings, 136552727 edges, 76014 markings/sec, 190 secs
lola: 19610522 markings, 139330017 edges, 74225 markings/sec, 195 secs
lola: 20009507 markings, 142194713 edges, 79797 markings/sec, 200 secs
lola: 20389674 markings, 145085769 edges, 76033 markings/sec, 205 secs
lola: 20749868 markings, 147782041 edges, 72039 markings/sec, 210 secs
lola: 21077125 markings, 150430982 edges, 65451 markings/sec, 215 secs
lola: 21359399 markings, 152849552 edges, 56455 markings/sec, 220 secs
lola: 21677803 markings, 155386809 edges, 63681 markings/sec, 225 secs
lola: 21992272 markings, 158024785 edges, 62894 markings/sec, 230 secs
lola: 22346325 markings, 160638992 edges, 70811 markings/sec, 235 secs
lola: 22662058 markings, 163053298 edges, 63147 markings/sec, 240 secs
lola: 22975206 markings, 165686016 edges, 62630 markings/sec, 245 secs
lola: 23311371 markings, 168333090 edges, 67233 markings/sec, 250 secs
lola: 23631026 markings, 170873883 edges, 63931 markings/sec, 255 secs
lola: 23984522 markings, 173617009 edges, 70699 markings/sec, 260 secs
lola: 24363259 markings, 176489714 edges, 75747 markings/sec, 265 secs
lola: 24787463 markings, 179475812 edges, 84841 markings/sec, 270 secs
lola: 25168046 markings, 182348726 edges, 76117 markings/sec, 275 secs
lola: 25521178 markings, 185093394 edges, 70626 markings/sec, 280 secs
lola: 25917673 markings, 188070509 edges, 79299 markings/sec, 285 secs
lola: 26267471 markings, 190694138 edges, 69960 markings/sec, 290 secs
lola: 26581437 markings, 193132749 edges, 62793 markings/sec, 295 secs
lola: 26906646 markings, 195689985 edges, 65042 markings/sec, 300 secs
lola: 27246810 markings, 198337140 edges, 68033 markings/sec, 305 secs
lola: 27590603 markings, 201053839 edges, 68759 markings/sec, 310 secs
lola: 27925938 markings, 203805427 edges, 67067 markings/sec, 315 secs
lola: 28302595 markings, 206733238 edges, 75331 markings/sec, 320 secs
lola: 28655123 markings, 209508630 edges, 70506 markings/sec, 325 secs
lola: 29068589 markings, 212617386 edges, 82693 markings/sec, 330 secs
lola: 29421297 markings, 215435290 edges, 70542 markings/sec, 335 secs
lola: 29784927 markings, 218200719 edges, 72726 markings/sec, 340 secs
lola: 30101873 markings, 220916309 edges, 63389 markings/sec, 345 secs
lola: 30395479 markings, 223549743 edges, 58721 markings/sec, 350 secs
lola: 30695340 markings, 226169314 edges, 59972 markings/sec, 355 secs
lola: 30994938 markings, 228679351 edges, 59920 markings/sec, 360 secs
lola: 31368192 markings, 231617895 edges, 74651 markings/sec, 365 secs
lola: 31715905 markings, 234525143 edges, 69543 markings/sec, 370 secs
lola: 32103883 markings, 237452180 edges, 77596 markings/sec, 375 secs
lola: 32477324 markings, 240352469 edges, 74688 markings/sec, 380 secs
lola: 32850248 markings, 243213084 edges, 74585 markings/sec, 385 secs
lola: 33176646 markings, 245940548 edges, 65280 markings/sec, 390 secs
lola: 33465936 markings, 248633004 edges, 57858 markings/sec, 395 secs
lola: 33826510 markings, 251450257 edges, 72115 markings/sec, 400 secs
lola: 34189936 markings, 254318035 edges, 72685 markings/sec, 405 secs
lola: 34517417 markings, 257065264 edges, 65496 markings/sec, 410 secs
lola: 34827707 markings, 259572913 edges, 62058 markings/sec, 415 secs
lola: 35132538 markings, 262133936 edges, 60966 markings/sec, 420 secs
lola: 35443303 markings, 264649747 edges, 62153 markings/sec, 425 secs
lola: 35744504 markings, 267214357 edges, 60240 markings/sec, 430 secs
lola: 36032738 markings, 269705597 edges, 57647 markings/sec, 435 secs
lola: 36335127 markings, 272132915 edges, 60478 markings/sec, 440 secs
lola: 36606054 markings, 274572375 edges, 54185 markings/sec, 445 secs
lola: 36891706 markings, 277108096 edges, 57130 markings/sec, 450 secs
lola: 37161534 markings, 279605643 edges, 53966 markings/sec, 455 secs
lola: 37401466 markings, 282133610 edges, 47986 markings/sec, 460 secs
lola: 37783815 markings, 285024758 edges, 76470 markings/sec, 465 secs
lola: 38142892 markings, 287786530 edges, 71815 markings/sec, 470 secs
lola: 38471936 markings, 290398674 edges, 65809 markings/sec, 475 secs
lola: 38805680 markings, 293034277 edges, 66749 markings/sec, 480 secs
lola: 39137056 markings, 295691637 edges, 66275 markings/sec, 485 secs
lola: 39477386 markings, 298387134 edges, 68066 markings/sec, 490 secs
lola: 39866061 markings, 301236701 edges, 77735 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (FIREABLE(down23))) AND E (G (E (F (FIREABLE(down41)))))) AND ((E ((FIREABLE(up47) U FIREABLE(left34))) OR ((FIREABLE(down33) OR FIREABLE(right35) OR NOT FIREABLE(right53)) AND E (X (FIREABLE(up53))))) OR E (G (NOT FIREABLE(up43)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(down23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(down23)))
lola: processed formula: A (F (FIREABLE(down23)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 22 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (FIREABLE(left46)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U FIREABLE(left46)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 2638 markings, 6319 edges
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(up25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(up25)))
lola: processed formula: A (F (FIREABLE(up25)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (A (F (FIREABLE(up34))))) OR FIREABLE(left46)) AND A (F (E (G (NOT FIREABLE(right74))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(up34)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(up34)))
lola: processed formula: A (F (FIREABLE(up34)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (NOT FIREABLE(right74)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U FIREABLE(right74))))
lola: processed formula length: 42
lola: 4 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: ========================================
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: 24 markings, 24 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((E (X (FIREABLE(left45))) OR (FIREABLE(up25) AND FIREABLE(down44) AND FIREABLE(left74))) U (((FIREABLE(right24) AND FIREABLE(right56)) OR NOT FIREABLE(up23)) AND A (F (FIREABLE(up44))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((EX(FIREABLE(left45)) OR (FIREABLE(up25) AND FIREABLE(down44) AND FIREABLE(left74))) U (((FIREABLE(right24) AND FIREABLE(right56)) OR NOT FIREABLE(up23)) AND A(TRUE U FIREABLE(up44))))
lola: processed formula length: 187
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 15 will run for 3034 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A ((A (G (FIREABLE(down24))) U A (F (FIREABLE(down41))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(NOT(E(TRUE U NOT FIREABLE(down24))) U A(TRUE U FIREABLE(down41))))
lola: processed formula length: 72
lola: 13 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 23 markings, 24 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no unknown no yes no yes no yes
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-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="Solitaire-PT-EngNC7x7"
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/Solitaire-PT-EngNC7x7.tgz
mv Solitaire-PT-EngNC7x7 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 Solitaire-PT-EngNC7x7, 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 r166-smll-152705516900144"
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 ;