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 700K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K 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.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.3K 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.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 522K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is HypertorusGrid-PT-d3k3p2b06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-smll-152658636700151
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526768865409


BK_STOP 1526769392112

--------------------
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 HypertorusGrid-PT-d3k3p2b06 as instance name.
Using HypertorusGrid 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': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, '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': 1574030, 'Memory': 15951.08, 'Tool': 'lola'}, {'Time': 1604960, 'Memory': 15952.65, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola HypertorusGrid-PT-d3k3p2b06...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
HypertorusGrid-PT-d3k3p2b06: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ HypertorusGrid-PT-d3k3p2b06 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1485/65536 symbol table entries, 20 collisions
lola: preprocessing...
lola: finding significant places
lola: 513 places, 972 transitions, 323 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1161 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: E (X (A (G (A (F (FIREABLE(ti_d3_n2_d2_n1_2_3_2))))))) : (A (G (NOT(E (F (FIREABLE(ti_d1_n2_d3_n1_3_3_3)))))) OR (((FIREABLE(ti_d3_n1_d1_n2_3_2_3) OR FIREABLE(to_d1_n2_2_1_1) OR NOT FIREABLE(ti_d3_n2_d2_n1_3_3_2)) AND (NOT FIREABLE(ti_d1_n2_d1_n1_1_2_2) OR NOT FIREABLE(ti_d1_n2_d1_n1_3_3_3)) AND NOT FIREABLE(ti_d3_n2_d2_n1_2_3_3)) AND E (G (E (F (FIREABLE(ti_d1_n1_d2_n2_2_2_1))))))) : E (X (A (X ((FIREABLE(ti_d1_n1_d1_n2_2_1_2) OR FIREABLE(ti_d3_n2_d1_n1_2_3_3) OR (FIREABLE(ti_d3_n1_d1_n2_1_3_3) AND FIREABLE(ti_d1_n2_d2_n1_1_1_2))))))) : NOT(A (((NOT FIREABLE(ti_d3_n1_d1_n1_1_1_1) OR NOT FIREABLE(to_d1_n1_1_3_3)) U A (X (FIREABLE(ti_d3_n2_d1_n1_2_2_1)))))) : E (G (A (F ((FIREABLE(ti_d2_n1_d2_n2_3_2_3) OR FIREABLE(ti_d2_n2_d1_n2_2_1_1)))))) : ((A (F (((FIREABLE(ti_d3_n2_d2_n1_3_3_1) OR FIREABLE(ti_d3_n1_d2_n2_1_3_3)) AND (FIREABLE(ti_d3_n1_d2_n2_3_1_2) OR FIREABLE(ti_d1_n1_d2_n2_3_1_2))))) OR ((((FIREABLE(ti_d3_n1_d2_n2_1_1_3) AND FIREABLE(ti_d3_n1_d3_n2_3_1_2)) OR FIREABLE(ti_d3_n1_d1_n1_3_2_2)) OR E (G (FIREABLE(to_d2_n1_1_1_2)))) OR A (F (FIREABLE(ti_d2_n2_d1_n1_1_2_3))))) AND ((E (F (NOT FIREABLE(ti_d1_n1_d3_n2_3_3_1))) OR (FIREABLE(ti_d1_n1_d1_n2_1_2_2) AND A (X (FIREABLE(ti_d2_n1_d2_n2_2_1_3))))) OR NOT(E (G (FIREABLE(ti_d2_n1_d3_n1_2_1_3)))))) : (A (G (A (X ((FIREABLE(ti_d3_n2_d1_n2_1_2_1) AND FIREABLE(to_d1_n1_3_2_1)))))) OR A (F (FIREABLE(ti_d1_n2_d1_n1_3_3_1)))) : ((((NOT FIREABLE(ti_d3_n1_d3_n2_1_1_1) OR NOT FIREABLE(ti_d2_n2_d2_n1_2_3_3)) OR E (G (NOT FIREABLE(ti_d2_n1_d1_n2_1_3_1)))) AND A ((NOT FIREABLE(ti_d3_n1_d1_n1_1_2_1) U NOT FIREABLE(ti_d2_n1_d3_n1_3_1_3)))) AND A (G ((A (G (FIREABLE(ti_d2_n1_d3_n1_2_2_3))) OR E (X (FIREABLE(ti_d1_n2_d3_n1_3_1_1))))))) : NOT((FIREABLE(to_d1_n1_3_3_3) AND A (F ((FIREABLE(ti_d1_n1_d2_n1_1_3_2) AND FIREABLE(ti_d3_n2_d3_n1_1_3_1) AND (FIREABLE(ti_d2_n1_d1_n2_2_3_3) OR FIREABLE(ti_d2_n2_d1_n2_2_1_2))))))) : A (G ((E ((FIREABLE(ti_d1_n1_d3_n2_1_2_2) U FIREABLE(ti_d2_n1_d3_n2_3_3_3))) OR (A (G (FIREABLE(to_d1_n2_1_3_3))) OR (NOT FIREABLE(ti_d1_n1_d2_n2_3_1_2) OR NOT FIREABLE(to_d2_n2_1_1_3)))))) : A (((NOT FIREABLE(ti_d2_n1_d1_n1_3_1_1) OR FIREABLE(to_d2_n1_1_2_1)) U E (G (NOT FIREABLE(ti_d1_n2_d2_n2_2_3_1))))) : (A (F ((NOT FIREABLE(to_d2_n1_2_1_3) AND FIREABLE(ti_d2_n1_d2_n2_1_1_1)))) OR NOT((NOT(A (X (FIREABLE(to_d2_n2_1_3_2)))) OR (NOT FIREABLE(ti_d3_n1_d1_n2_1_1_1) OR NOT FIREABLE(ti_d2_n1_d1_n1_1_1_1) OR (NOT FIREABLE(ti_d2_n2_d1_n1_1_3_1) AND NOT FIREABLE(ti_d3_n1_d2_n2_1_2_2)))))) : A (F ((FIREABLE(ti_d3_n2_d3_n1_1_1_3) OR A (X (NOT FIREABLE(ti_d1_n1_d3_n2_1_3_2)))))) : A (G (A (G ((NOT FIREABLE(ti_d2_n2_d3_n1_3_3_3) OR NOT FIREABLE(ti_d3_n1_d3_n2_2_2_1)))))) : A (F (A (G (NOT FIREABLE(ti_d3_n2_d2_n1_2_3_1))))) : ((FIREABLE(ti_d2_n2_d3_n1_3_2_2) AND (FIREABLE(ti_d1_n1_d1_n2_1_3_1) OR A (F (FIREABLE(to_d2_n1_1_3_1))))) OR NOT(E (G (E (X (FIREABLE(ti_d2_n2_d1_n2_1_2_3)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (A (F (FIREABLE(ti_d3_n2_d2_n1_2_3_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U NOT(A(TRUE U FIREABLE(ti_d3_n2_d2_n1_2_3_2))))))
lola: processed formula length: 64
lola: 3 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 47762 markings, 48280 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (NOT(E (F (FIREABLE(ti_d1_n2_d3_n1_3_3_3)))))) OR (((FIREABLE(ti_d3_n1_d1_n2_3_2_3) OR FIREABLE(to_d1_n2_2_1_1) OR NOT FIREABLE(ti_d3_n2_d2_n1_3_3_2)) AND (NOT FIREABLE(ti_d1_n2_d1_n1_1_2_2) OR NOT FIREABLE(ti_d1_n2_d1_n1_3_3_3)) AND NOT FIREABLE(ti_d3_n2_d2_n1_2_3_3)) AND E (G (E (F (FIREABLE(ti_d1_n1_d2_n2_2_2_1)))))))
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 (G (NOT FIREABLE(ti_d1_n2_d3_n1_3_3_3)))
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 1292 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(ti_d3_n1_d1_n2_3_2_3) OR FIREABLE(to_d1_n2_2_1_1) OR NOT FIREABLE(ti_d3_n2_d2_n1_3_3_2)) AND (NOT FIREABLE(ti_d1_n2_d1_n1_1_2_2) OR NOT FIREABLE(ti_d1_n2_d1_n1_3_3_3)) AND NOT FIREABLE(ti_d3_n2_d2_n1_2_3_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(ti_d3_n1_d1_n2_3_2_3) OR FIREABLE(to_d1_n2_2_1_1) OR NOT FIREABLE(ti_d3_n2_d2_n1_3_3_2)) AND (NOT FIREABLE(ti_d1_n2_d1_n1_1_2_2) OR NOT FIREABLE(ti_d1_n2_d1_n1_3_3_3)) AND NOT FIREABLE(ti_d3_n2_d2_n1_2_3_3))
lola: processed formula length: 221
lola: 4 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (FIREABLE(ti_d1_n1_d2_n2_2_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U FIREABLE(ti_d1_n1_d2_n2_2_2_1)))))
lola: processed formula length: 60
lola: 6 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 1084802 markings, 1408786 edges, 2285835196123054080 markings/sec, 0 secs
lola: 2155673 markings, 2799760 edges, 214174 markings/sec, 5 secs
lola: 3255873 markings, 4228887 edges, 220040 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3887709 markings, 5050163 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((FIREABLE(ti_d1_n1_d1_n2_2_1_2) OR FIREABLE(ti_d3_n2_d1_n1_2_3_3) OR (FIREABLE(ti_d3_n1_d1_n2_1_3_3) AND FIREABLE(ti_d1_n2_d2_n1_1_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((FIREABLE(ti_d1_n1_d1_n2_2_1_2) OR FIREABLE(ti_d3_n2_d1_n1_2_3_3) OR (FIREABLE(ti_d3_n1_d1_n2_1_3_3) AND FIREABLE(ti_d1_n2_d2_n1_1_1_2)))))
lola: processed formula length: 147
lola: 2 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (((NOT FIREABLE(ti_d3_n1_d1_n1_1_1_1) OR NOT FIREABLE(to_d1_n1_1_3_3)) U A (X (FIREABLE(ti_d3_n2_d1_n1_2_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((NOT FIREABLE(ti_d3_n1_d1_n1_1_1_1) OR NOT FIREABLE(to_d1_n1_1_3_3)) U NOT(EX(NOT FIREABLE(ti_d3_n2_d1_n1_2_2_1)))))
lola: processed formula length: 123
lola: 9 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 299 markings, 299 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((FIREABLE(ti_d2_n1_d2_n2_3_2_3) OR FIREABLE(ti_d2_n2_d1_n2_2_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (FIREABLE(ti_d2_n1_d2_n2_3_2_3) OR FIREABLE(ti_d2_n2_d1_n2_2_1_1))))))
lola: processed formula length: 97
lola: 2 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 547 markings, 548 edges
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (((FIREABLE(ti_d3_n2_d2_n1_3_3_1) OR FIREABLE(ti_d3_n1_d2_n2_1_3_3)) AND (FIREABLE(ti_d3_n1_d2_n2_3_1_2) OR FIREABLE(ti_d1_n1_d2_n2_3_1_2))))) OR ((((FIREABLE(ti_d3_n1_d2_n2_1_1_3) AND FIREABLE(ti_d3_n1_d3_n2_3_1_2)) OR FIREABLE(ti_d3_n1_d1_n1_3_2_2)) OR E (G (FIREABLE(to_d2_n1_1_1_2)))) OR A (F (FIREABLE(ti_d2_n2_d1_n1_1_2_3))))) AND ((E (F (NOT FIREABLE(ti_d1_n1_d3_n2_3_3_1))) OR (FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(ti_d3_n2_d2_n1_3_3_1) OR FIREABLE(ti_d3_n1_d2_n2_1_3_3)) AND (FIREABLE(ti_d3_n1_d2_n2_3_1_2) OR FIREABLE(ti_d1_n1_d2_n2_3_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((FIREABLE(ti_d3_n2_d2_n1_3_3_1) OR FIREABLE(ti_d3_n1_d2_n2_1_3_3)) AND (FIREABLE(ti_d3_n1_d2_n2_3_1_2) OR FIREABLE(ti_d1_n1_d2_n2_3_1_2)))))
lola: processed formula: A (F (((FIREABLE(ti_d3_n2_d2_n1_3_3_1) OR FIREABLE(ti_d3_n1_d2_n2_1_3_3)) AND (FIREABLE(ti_d3_n1_d2_n2_3_1_2) OR FIREABLE(ti_d1_n1_d2_n2_3_1_2)))))
lola: processed formula length: 149
lola: 5 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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: 310 markings, 310 edges
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(ti_d3_n1_d2_n2_1_1_3) AND FIREABLE(ti_d3_n1_d3_n2_3_1_2)) OR FIREABLE(ti_d3_n1_d1_n1_3_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(ti_d3_n1_d2_n2_1_1_3) AND FIREABLE(ti_d3_n1_d3_n2_3_1_2)) OR FIREABLE(ti_d3_n1_d1_n1_3_2_2))
lola: processed formula length: 104
lola: 5 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(to_d2_n1_1_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(to_d2_n1_1_1_2)))
lola: processed formula length: 43
lola: 7 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 270 markings, 270 edges
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(ti_d1_n1_d3_n2_3_3_1)))
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 1292 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (X ((FIREABLE(ti_d3_n2_d1_n2_1_2_1) AND FIREABLE(to_d1_n1_3_2_1)))))) OR A (F (FIREABLE(ti_d1_n2_d1_n1_3_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((FIREABLE(ti_d3_n2_d1_n2_1_2_1) AND FIREABLE(to_d1_n1_3_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((FIREABLE(ti_d3_n2_d1_n2_1_2_1) AND FIREABLE(to_d1_n1_3_2_1))))))
lola: processed formula length: 85
lola: 2 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(ti_d1_n2_d1_n1_3_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(ti_d1_n2_d1_n1_3_3_1)))
lola: processed formula: A (F (FIREABLE(ti_d1_n2_d1_n1_3_3_1)))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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: 369 markings, 369 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((NOT FIREABLE(ti_d3_n1_d3_n2_1_1_1) OR NOT FIREABLE(ti_d2_n2_d2_n1_2_3_3)) OR E (G (NOT FIREABLE(ti_d2_n1_d1_n2_1_3_1)))) AND A ((NOT FIREABLE(ti_d3_n1_d1_n1_1_2_1) U NOT FIREABLE(ti_d2_n1_d3_n1_3_1_3)))) AND A (G ((A (G (FIREABLE(ti_d2_n1_d3_n1_2_2_3))) OR E (X (FIREABLE(ti_d1_n2_d3_n1_3_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(ti_d3_n1_d3_n2_1_1_1) OR NOT FIREABLE(ti_d2_n2_d2_n1_2_3_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(ti_d3_n1_d3_n2_1_1_1) OR NOT FIREABLE(ti_d2_n2_d2_n1_2_3_3))
lola: processed formula length: 75
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(ti_d3_n1_d1_n1_1_2_1) U NOT FIREABLE(ti_d2_n1_d3_n1_3_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((NOT FIREABLE(ti_d3_n1_d1_n1_1_2_1) U NOT FIREABLE(ti_d2_n1_d3_n1_3_1_3)))
lola: processed formula: A ((NOT FIREABLE(ti_d3_n1_d1_n1_1_2_1) U NOT FIREABLE(ti_d2_n1_d3_n1_3_1_3)))
lola: processed formula length: 77
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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 9 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G (FIREABLE(ti_d2_n1_d3_n1_2_2_3))) OR E (X (FIREABLE(ti_d1_n2_d3_n1_3_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (E(TRUE U NOT FIREABLE(ti_d2_n1_d3_n1_2_2_3)) AND NOT(EX(FIREABLE(ti_d1_n2_d3_n1_3_1_1))))))
lola: processed formula length: 105
lola: 7 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 163 markings, 365 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((FIREABLE(to_d1_n1_3_3_3) AND A (F ((FIREABLE(ti_d1_n1_d2_n1_1_3_2) AND FIREABLE(ti_d3_n2_d3_n1_1_3_1) AND (FIREABLE(ti_d2_n1_d1_n2_2_3_3) OR FIREABLE(ti_d2_n2_d1_n2_2_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(to_d1_n1_3_3_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(to_d1_n1_3_3_3)
lola: processed formula length: 28
lola: 5 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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 9 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(ti_d1_n1_d2_n1_1_3_2) OR NOT FIREABLE(ti_d3_n2_d3_n1_1_3_1) OR (NOT FIREABLE(ti_d2_n1_d1_n2_2_3_3) AND NOT FIREABLE(ti_d2_n2_d1_n2_2_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(ti_d1_n1_d2_n1_1_3_2) AND FIREABLE(ti_d3_n2_d3_n1_1_3_1) AND (FIREABLE(ti_d2_n1_d1_n2_2_3_3) OR FIREABLE(ti_d2_n2_d1_n2_2_1_2)))))
lola: processed formula length: 154
lola: 7 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 674 markings, 674 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E ((FIREABLE(ti_d1_n1_d3_n2_1_2_2) U FIREABLE(ti_d2_n1_d3_n2_3_3_3))) OR (A (G (FIREABLE(to_d1_n2_1_3_3))) OR (NOT FIREABLE(ti_d1_n1_d2_n2_3_1_2) OR NOT FIREABLE(to_d2_n2_1_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(FIREABLE(ti_d1_n1_d3_n2_1_2_2) U FIREABLE(ti_d2_n1_d3_n2_3_3_3))) AND (E(TRUE U NOT FIREABLE(to_d1_n2_1_3_3)) AND (FIREABLE(ti_d1_n1_d2_n2_3_1_2) AND FIREABLE(to_d2_n2_1_1_3))))))
lola: processed formula length: 199
lola: 8 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 477471 markings, 2016557 edges, 95473 markings/sec, 0 secs
lola: 718117 markings, 3520044 edges, 48129 markings/sec, 5 secs
lola: 1009210 markings, 4790383 edges, 58219 markings/sec, 10 secs
lola: 1146021 markings, 5759970 edges, 27362 markings/sec, 15 secs
lola: 1201748 markings, 6744625 edges, 11145 markings/sec, 20 secs
lola: 1451627 markings, 8269764 edges, 49976 markings/sec, 25 secs
lola: 1696988 markings, 9468865 edges, 49072 markings/sec, 30 secs
lola: 1914689 markings, 10525311 edges, 43540 markings/sec, 35 secs
lola: 1963027 markings, 11356475 edges, 9668 markings/sec, 40 secs
lola: 2126398 markings, 12646850 edges, 32674 markings/sec, 45 secs
lola: 2341017 markings, 13954070 edges, 42924 markings/sec, 50 secs
lola: 2609137 markings, 15111085 edges, 53624 markings/sec, 55 secs
lola: 2730410 markings, 16022729 edges, 24255 markings/sec, 60 secs
lola: 2770654 markings, 16896648 edges, 8049 markings/sec, 65 secs
lola: 2974872 markings, 18117598 edges, 40844 markings/sec, 70 secs
lola: 3162545 markings, 19176108 edges, 37535 markings/sec, 75 secs
lola: 3401862 markings, 20211430 edges, 47863 markings/sec, 80 secs
lola: 3499478 markings, 21017060 edges, 19523 markings/sec, 85 secs
lola: 3537022 markings, 21872453 edges, 7509 markings/sec, 90 secs
lola: 3725580 markings, 22997733 edges, 37712 markings/sec, 95 secs
lola: 3895334 markings, 23996340 edges, 33951 markings/sec, 100 secs
lola: 4129283 markings, 24993207 edges, 46790 markings/sec, 105 secs
lola: 4242528 markings, 25748971 edges, 22649 markings/sec, 110 secs
lola: 4273870 markings, 26472816 edges, 6268 markings/sec, 115 secs
lola: 4455637 markings, 27764727 edges, 36353 markings/sec, 120 secs
lola: 4691848 markings, 29045142 edges, 47242 markings/sec, 125 secs
lola: 4930914 markings, 30103932 edges, 47813 markings/sec, 130 secs
lola: 5000583 markings, 30907889 edges, 13934 markings/sec, 135 secs
lola: 5090426 markings, 31971562 edges, 17969 markings/sec, 140 secs
lola: 5335161 markings, 33446562 edges, 48947 markings/sec, 145 secs
lola: 5619065 markings, 34661544 edges, 56781 markings/sec, 150 secs
lola: 5719849 markings, 35547614 edges, 20157 markings/sec, 155 secs
lola: 5797241 markings, 36587685 edges, 15478 markings/sec, 160 secs
lola: 6036201 markings, 38039606 edges, 47792 markings/sec, 165 secs
lola: 6319142 markings, 39263887 edges, 56588 markings/sec, 170 secs
lola: 6429642 markings, 40191173 edges, 22100 markings/sec, 175 secs
lola: 6505911 markings, 41229639 edges, 15254 markings/sec, 180 secs
lola: 6721104 markings, 42544524 edges, 43039 markings/sec, 185 secs
lola: 7000229 markings, 43729573 edges, 55825 markings/sec, 190 secs
lola: 7109880 markings, 44646916 edges, 21930 markings/sec, 195 secs
lola: 7173794 markings, 45627159 edges, 12783 markings/sec, 200 secs
lola: 7354136 markings, 46747382 edges, 36068 markings/sec, 205 secs
lola: 7599251 markings, 47838348 edges, 49023 markings/sec, 210 secs
lola: 7767835 markings, 48761957 edges, 33717 markings/sec, 215 secs
lola: 7807201 markings, 49553754 edges, 7873 markings/sec, 220 secs
lola: 7963964 markings, 50795563 edges, 31353 markings/sec, 225 secs
lola: 8227930 markings, 52067576 edges, 52793 markings/sec, 230 secs
lola: 8431487 markings, 53119250 edges, 40711 markings/sec, 235 secs
lola: 8475759 markings, 54014487 edges, 8854 markings/sec, 240 secs
lola: 8650054 markings, 55323747 edges, 34859 markings/sec, 245 secs
lola: 8929247 markings, 56591617 edges, 55839 markings/sec, 250 secs
lola: 9098012 markings, 57595978 edges, 33753 markings/sec, 255 secs
lola: 9133354 markings, 58517337 edges, 7068 markings/sec, 260 secs
lola: 9300768 markings, 59605769 edges, 33483 markings/sec, 265 secs
lola: 9529634 markings, 60656989 edges, 45773 markings/sec, 270 secs
lola: 9718645 markings, 61594594 edges, 37802 markings/sec, 275 secs
lola: 9764633 markings, 62360040 edges, 9198 markings/sec, 280 secs
lola: 9877722 markings, 63437599 edges, 22618 markings/sec, 285 secs
lola: 10129005 markings, 64698209 edges, 50257 markings/sec, 290 secs
lola: 10345911 markings, 65754034 edges, 43381 markings/sec, 295 secs
lola: 10395270 markings, 66625780 edges, 9872 markings/sec, 300 secs
lola: 10517668 markings, 67694949 edges, 24480 markings/sec, 305 secs
lola: 10747254 markings, 68797520 edges, 45917 markings/sec, 310 secs
lola: 10953379 markings, 69774688 edges, 41225 markings/sec, 315 secs
lola: 11004594 markings, 70557129 edges, 10243 markings/sec, 320 secs
lola: 11083242 markings, 71473116 edges, 15730 markings/sec, 325 secs
lola: 11271916 markings, 72483300 edges, 37735 markings/sec, 330 secs
lola: 11491729 markings, 73437920 edges, 43963 markings/sec, 335 secs
lola: 11590754 markings, 74224741 edges, 19805 markings/sec, 340 secs
lola: 11615962 markings, 74944333 edges, 5042 markings/sec, 345 secs
lola: 11768965 markings, 75994359 edges, 30601 markings/sec, 350 secs
lola: 12017577 markings, 77081353 edges, 49722 markings/sec, 355 secs
lola: 12167008 markings, 77972632 edges, 29886 markings/sec, 360 secs
lola: 12201913 markings, 78756493 edges, 6981 markings/sec, 365 secs
lola: 12317727 markings, 79675681 edges, 23163 markings/sec, 370 secs
lola: 12533486 markings, 80616902 edges, 43152 markings/sec, 375 secs
lola: 12705970 markings, 81471484 edges, 34497 markings/sec, 380 secs
lola: 12750547 markings, 82148211 edges, 8915 markings/sec, 385 secs
lola: 12795840 markings, 82932999 edges, 9059 markings/sec, 390 secs
lola: 12934272 markings, 83924608 edges, 27686 markings/sec, 395 secs
lola: 13124843 markings, 84999191 edges, 38114 markings/sec, 400 secs
lola: 13300723 markings, 85916513 edges, 35176 markings/sec, 405 secs
lola: 13459426 markings, 86790921 edges, 31741 markings/sec, 410 secs
lola: 13581017 markings, 87602504 edges, 24318 markings/sec, 415 secs
lola: 13618629 markings, 88288580 edges, 7522 markings/sec, 420 secs
lola: 13638948 markings, 88970302 edges, 4064 markings/sec, 425 secs
lola: 13647271 markings, 89675494 edges, 1665 markings/sec, 430 secs
lola: 13755368 markings, 90661639 edges, 21619 markings/sec, 435 secs
lola: 13963994 markings, 91717496 edges, 41725 markings/sec, 440 secs
lola: 14147035 markings, 92637388 edges, 36608 markings/sec, 445 secs
lola: 14266427 markings, 93493886 edges, 23878 markings/sec, 450 secs
lola: 14307581 markings, 94286917 edges, 8231 markings/sec, 455 secs
lola: 14331498 markings, 95132839 edges, 4783 markings/sec, 460 secs
lola: 14479283 markings, 96122609 edges, 29557 markings/sec, 465 secs
lola: 14606941 markings, 97114615 edges, 25532 markings/sec, 470 secs
lola: 14756522 markings, 97961519 edges, 29916 markings/sec, 475 secs
lola: 14888893 markings, 98753482 edges, 26474 markings/sec, 480 secs
lola: 15009988 markings, 99546721 edges, 24219 markings/sec, 485 secs
lola: 15121447 markings, 100349731 edges, 22292 markings/sec, 490 secs
lola: 15221841 markings, 101175267 edges, 20079 markings/sec, 495 secs
lola: local time limit reached - aborting
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: '
'
Aborted (core dumped)
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HypertorusGrid-PT-d3k3p2b06"
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/HypertorusGrid-PT-d3k3p2b06.tgz
mv HypertorusGrid-PT-d3k3p2b06 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 HypertorusGrid-PT-d3k3p2b06, 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 r106-smll-152658636700151"
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 ;