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 644K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K 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.1K 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.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 469K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is NeighborGrid-PT-d4n3m2c23, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472400227
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527139682049


BK_STOP 1527140214170

--------------------
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 NeighborGrid-PT-d4n3m2c23 as instance name.
Using NeighborGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': True, 'Extended Free Choice': True, 'State Machine': True, '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': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 340786, 'Memory': 15952.82, 'Tool': 'lola'}, {'Time': 2927146, 'Memory': 15950.84, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola NeighborGrid-PT-d4n3m2c23...

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


checking for too many tokens
===========================================================================================
NeighborGrid-PT-d4n3m2c23: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ NeighborGrid-PT-d4n3m2c23 @ 3539 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- 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: 1713/65536 symbol table entries, 509 collisions
lola: preprocessing...
lola: finding significant places
lola: 81 places, 1632 transitions, 80 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 81 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: A (((1 <= p_0_1_1_0) U ((p_1_2_0_1 <= 0) OR ((3 <= p_0_0_1_1) AND (p_2_2_1_0 <= p_2_0_2_1))))) : E (X (NOT(E (X ((p_1_2_1_2 <= p_0_2_2_0)))))) : (E (F (A (X ((p_0_2_0_1 <= p_1_1_1_1))))) AND E (G (((p_1_1_1_0 <= p_1_0_2_0) AND (2 <= p_0_2_1_1) AND ((p_0_2_2_0 <= p_2_0_0_1) OR (3 <= p_0_1_0_0)))))) : E (G (E (F (((p_1_1_0_0 <= p_1_2_1_2) OR (p_1_2_0_0 <= p_2_2_2_0)))))) : A (X (E (X ((1 <= p_2_1_2_2))))) : A (G (((p_0_2_1_1 <= p_2_0_0_2) OR (p_1_0_2_1 <= p_0_0_0_1) OR (p_2_0_0_0 <= p_0_1_1_2) OR (1 <= p_2_2_2_0)))) : NOT(E (X (A (G ((p_2_2_1_1 <= p_1_1_1_1)))))) : A (G (A (F ((p_0_0_1_0 <= 2))))) : E (G ((2 <= p_2_0_1_1))) : (E (G (E (X ((3 <= p_0_0_0_0))))) AND E (G (((p_2_2_2_0 <= p_1_0_1_1) OR (p_1_1_2_2 <= p_1_2_2_0) OR (p_0_0_0_0 <= 1))))) : (A (F (A (X ((3 <= p_1_0_2_0))))) OR NOT(A (((2 <= p_1_2_1_2) U (p_2_1_1_1 <= p_1_0_1_2))))) : (NOT((E (G ((p_0_1_0_1 <= p_1_1_0_0))) OR (((p_2_1_1_1 <= p_0_1_1_2) OR (p_0_1_2_1 <= p_1_2_2_2)) AND (p_0_2_2_2 <= 0)))) AND ((E (F ((p_0_0_1_1 <= p_2_1_2_1))) AND (p_0_0_0_1 <= p_1_0_0_1)) OR (2 <= p_1_1_0_2))) : A (G ((1 <= p_0_0_0_2))) : ((E (G ((2 <= p_0_1_1_2))) AND A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))) AND A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))) : A (G (E (F (((2 <= p_2_0_2_1) AND (1 <= p_1_2_0_1)))))) : A (F (A (F (((2 <= p_0_0_0_0) AND (3 <= p_0_2_0_0))))))
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 (((1 <= p_0_1_1_0) U ((p_1_2_0_1 <= 0) OR ((3 <= p_0_0_1_1) AND (p_2_2_1_0 <= p_2_0_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= p_0_1_1_0) U ((p_1_2_0_1 <= 0) OR ((3 <= p_0_0_1_1) AND (p_2_2_1_0 <= p_2_0_2_1)))))
lola: processed formula: A (((1 <= p_0_1_1_0) U ((p_1_2_0_1 <= 0) OR ((3 <= p_0_0_1_1) AND (p_2_2_1_0 <= p_2_0_2_1)))))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 140 markings, 140 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(E (X ((p_1_2_1_2 <= p_0_2_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((p_0_2_2_0 + 1 <= p_1_2_1_2)))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((p_0_2_0_1 <= p_1_1_1_1))))) AND E (G (((p_1_1_1_0 <= p_1_0_2_0) AND (2 <= p_0_2_1_1) AND ((p_0_2_2_0 <= p_2_0_0_1) OR (3 <= p_0_1_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p_0_2_0_1 <= p_1_1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p_0_2_0_1 <= p_1_1_1_1)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 75 markings, 74 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p_1_1_1_0 <= p_1_0_2_0) AND (2 <= p_0_2_1_1) AND ((p_0_2_2_0 <= p_2_0_0_1) OR (3 <= p_0_1_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p_1_0_2_0 + 1 <= p_1_1_1_0) OR (p_0_2_1_1 <= 1) OR ((p_2_0_0_1 + 1 <= p_0_2_2_0) AND (p_0_1_0_0 <= 2)))))
lola: processed formula length: 122
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 451 markings, 451 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p_1_1_0_0 <= p_1_2_1_2) OR (p_1_2_0_0 <= p_2_2_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((p_1_1_0_0 <= p_1_2_1_2) OR (p_1_2_0_0 <= p_2_2_2_0))))))
lola: processed formula length: 85
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 263 markings, 526 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((1 <= p_2_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((1 <= p_2_1_2_2)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_0_2_1_1 <= p_2_0_0_2) OR (p_1_0_2_1 <= p_0_0_0_1) OR (p_2_0_0_0 <= p_0_1_1_2) OR (1 <= p_2_2_2_0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (G ((p_2_2_1_1 <= p_1_1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p_1_1_1_1 + 1 <= p_2_2_1_1)))
lola: processed formula length: 42
lola: 7 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 133647 markings, 134467 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p_0_0_1_0 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p_0_0_1_0 <= 2)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 791370 markings, 2064649 edges, 158274 markings/sec, 0 secs
lola: 1477427 markings, 3849317 edges, 137211 markings/sec, 5 secs
lola: 2023435 markings, 5296380 edges, 109202 markings/sec, 10 secs
lola: 2739149 markings, 7195125 edges, 143143 markings/sec, 15 secs
lola: 3347999 markings, 8785760 edges, 121770 markings/sec, 20 secs
lola: 4037178 markings, 10610106 edges, 137836 markings/sec, 25 secs
lola: 4641476 markings, 12249088 edges, 120860 markings/sec, 30 secs
lola: 5270122 markings, 13911964 edges, 125729 markings/sec, 35 secs
lola: 5879440 markings, 15518464 edges, 121864 markings/sec, 40 secs
lola: 6489659 markings, 17137777 edges, 122044 markings/sec, 45 secs
lola: 7140361 markings, 18895393 edges, 130140 markings/sec, 50 secs
lola: 7797334 markings, 20623362 edges, 131395 markings/sec, 55 secs
lola: 8423649 markings, 22282351 edges, 125263 markings/sec, 60 secs
lola: 9027603 markings, 23926830 edges, 120791 markings/sec, 65 secs
lola: 9629026 markings, 25513509 edges, 120285 markings/sec, 70 secs
lola: 10213480 markings, 27074240 edges, 116891 markings/sec, 75 secs
lola: 10825265 markings, 28731040 edges, 122357 markings/sec, 80 secs
lola: 11413188 markings, 30282858 edges, 117585 markings/sec, 85 secs
lola: 11962727 markings, 31782712 edges, 109908 markings/sec, 90 secs
lola: 12543326 markings, 33321215 edges, 116120 markings/sec, 95 secs
lola: 13111921 markings, 34872203 edges, 113719 markings/sec, 100 secs
lola: 13708711 markings, 36456870 edges, 119358 markings/sec, 105 secs
lola: 14268488 markings, 37997314 edges, 111955 markings/sec, 110 secs
lola: 14808502 markings, 39451491 edges, 108003 markings/sec, 115 secs
lola: 15332332 markings, 40885923 edges, 104766 markings/sec, 120 secs
lola: 15837428 markings, 42287404 edges, 101019 markings/sec, 125 secs
lola: 16336720 markings, 43686575 edges, 99858 markings/sec, 130 secs
lola: 16825123 markings, 45071148 edges, 97681 markings/sec, 135 secs
lola: 17286791 markings, 46458896 edges, 92334 markings/sec, 140 secs
lola: 17693980 markings, 47729088 edges, 81438 markings/sec, 145 secs
lola: 18070413 markings, 48953867 edges, 75287 markings/sec, 150 secs
lola: 18419384 markings, 50123159 edges, 69794 markings/sec, 155 secs
lola: 18785502 markings, 51292584 edges, 73224 markings/sec, 160 secs
lola: 19146489 markings, 52448582 edges, 72197 markings/sec, 165 secs
lola: 19507184 markings, 53584742 edges, 72139 markings/sec, 170 secs
lola: 19833333 markings, 54684220 edges, 65230 markings/sec, 175 secs
lola: 20261061 markings, 55982998 edges, 85546 markings/sec, 180 secs
lola: 21070071 markings, 58011290 edges, 161802 markings/sec, 185 secs
lola: 21884345 markings, 60164324 edges, 162855 markings/sec, 190 secs
lola: 22674188 markings, 62260050 edges, 157969 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 416 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p_2_0_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_2_0_1_1 <= 1)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 367 markings, 367 edges
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((3 <= p_0_0_0_0))))) AND E (G (((p_2_2_2_0 <= p_1_0_1_1) OR (p_1_1_2_2 <= p_1_2_2_0) OR (p_0_0_0_0 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: lola: ========================================subprocess 9 will run for 476 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: E (G (E (X ((3 <= p_0_0_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((3 <= p_0_0_0_0)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 263 markings, 263 edges
lola: ========================================
lola: subprocess 10 will run for 555 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p_2_2_2_0 <= p_1_0_1_1) OR (p_1_1_2_2 <= p_1_2_2_0) OR (p_0_0_0_0 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p_1_0_1_1 + 1 <= p_2_2_2_0) AND (p_1_2_2_0 + 1 <= p_1_1_2_2) AND (2 <= p_0_0_0_0))))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 263 markings, 263 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 555 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= p_1_0_2_0))))) OR NOT(A (((2 <= p_1_2_1_2) U (p_2_1_1_1 <= p_1_0_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 555 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= p_1_0_2_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= p_1_0_2_0)))
lola: processed formula length: 30
lola: 6 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 315 markings, 315 edges
lola: ========================================
lola: subprocess 11 will run for 666 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p_1_2_1_2 <= 1) R (p_1_0_1_2 + 1 <= p_2_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((2 <= p_1_2_1_2) U (p_2_1_1_1 <= p_1_0_1_2)))
lola: processed formula length: 51
lola: 7 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 666 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (G ((p_0_1_0_1 <= p_1_1_0_0))) OR (((p_2_1_1_1 <= p_0_1_1_2) OR (p_0_1_2_1 <= p_1_2_2_2)) AND (p_0_2_2_2 <= 0)))) AND ((E (F ((p_0_0_1_1 <= p_2_1_2_1))) AND (p_0_0_0_1 <= p_1_0_0_1)) OR (2 <= p_1_1_0_2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 666 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p_1_1_0_0 + 1 <= p_0_1_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p_1_1_0_0 + 1 <= p_0_1_0_1)))
lola: processed formula: A (F ((p_1_1_0_0 + 1 <= p_0_1_0_1)))
lola: processed formula length: 36
lola: 6 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 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: 120 markings, 120 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 833 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p_0_0_0_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 13 will run for 1111 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G ((2 <= p_0_1_1_2))) AND A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))) AND A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1111 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p_0_1_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_0_1_1_2 <= 1)))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 263 markings, 263 edges
lola: subprocess 14 will run for 1666 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))
lola: processed formula: A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))
lola: processed formula length: 55
lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 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 15 will run for 3333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))
lola: lola: processed formula: A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))
lola: ========================================processed formula length: 95

lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1666 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((2 <= p_2_0_2_1) AND (1 <= p_1_2_0_1))))))
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 ((2 <= p_2_0_2_1) AND (1 <= p_1_2_0_1))))))
lola: processed formula length: 69
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 817949 markings, 1354424 edges, 163590 markings/sec, 0 secs
lola: 859805 markings, 3604450 edges, 8371 markings/sec, 5 secs
lola: 1268876 markings, 5176892 edges, 81814 markings/sec, 10 secs
lola: 1643946 markings, 6719400 edges, 75014 markings/sec, 15 secs
lola: 1988669 markings, 8010831 edges, 68945 markings/sec, 20 secs
lola: 2379082 markings, 9653139 edges, 78083 markings/sec, 25 secs
lola: 2818098 markings, 11321477 edges, 87803 markings/sec, 30 secs
lola: 3144161 markings, 12752585 edges, 65213 markings/sec, 35 secs
lola: 3539452 markings, 14374653 edges, 79058 markings/sec, 40 secs
lola: 4017572 markings, 16088595 edges, 95624 markings/sec, 45 secs
lola: 4349887 markings, 17730296 edges, 66463 markings/sec, 50 secs
lola: 4767661 markings, 19438746 edges, 83555 markings/sec, 55 secs
lola: 5203301 markings, 21020767 edges, 87128 markings/sec, 60 secs
lola: 5516076 markings, 22553732 edges, 62555 markings/sec, 65 secs
lola: 5891634 markings, 24086551 edges, 75112 markings/sec, 70 secs
lola: 6320923 markings, 25618312 edges, 85858 markings/sec, 75 secs
lola: 6628193 markings, 27101983 edges, 61454 markings/sec, 80 secs
lola: 7041172 markings, 28654794 edges, 82596 markings/sec, 85 secs
lola: 7385441 markings, 30265725 edges, 68854 markings/sec, 90 secs
lola: 7778507 markings, 31625722 edges, 78613 markings/sec, 95 secs
lola: 8167396 markings, 33252266 edges, 77778 markings/sec, 100 secs
lola: 8488171 markings, 34704245 edges, 64155 markings/sec, 105 secs
lola: 8863100 markings, 36261493 edges, 74986 markings/sec, 110 secs
lola: 9236923 markings, 37837469 edges, 74765 markings/sec, 115 secs
lola: 9604175 markings, 39241815 edges, 73450 markings/sec, 120 secs
lola: 9965881 markings, 40767767 edges, 72341 markings/sec, 125 secs
lola: 10330088 markings, 42193138 edges, 72841 markings/sec, 130 secs
lola: 10718598 markings, 43689117 edges, 77702 markings/sec, 135 secs
lola: 11045693 markings, 45148423 edges, 65419 markings/sec, 140 secs
lola: 11413541 markings, 46657256 edges, 73570 markings/sec, 145 secs
lola: 11767863 markings, 48032056 edges, 70864 markings/sec, 150 secs
lola: 12137114 markings, 49531195 edges, 73850 markings/sec, 155 secs
lola: 12476100 markings, 50926969 edges, 67797 markings/sec, 160 secs
lola: 12848107 markings, 52414314 edges, 74401 markings/sec, 165 secs
lola: 13217858 markings, 53916041 edges, 73950 markings/sec, 170 secs
lola: 13587079 markings, 55388679 edges, 73844 markings/sec, 175 secs
lola: 13959548 markings, 56876914 edges, 74494 markings/sec, 180 secs
lola: 14331106 markings, 58385661 edges, 74312 markings/sec, 185 secs
lola: 14696906 markings, 59816945 edges, 73160 markings/sec, 190 secs
lola: 15053953 markings, 61253843 edges, 71409 markings/sec, 195 secs
lola: 15410949 markings, 62639955 edges, 71399 markings/sec, 200 secs
lola: 15765659 markings, 64051529 edges, 70942 markings/sec, 205 secs
lola: 16103714 markings, 65364152 edges, 67611 markings/sec, 210 secs
lola: 16444389 markings, 66701698 edges, 68135 markings/sec, 215 secs
lola: 16765371 markings, 67965028 edges, 64196 markings/sec, 220 secs
lola: 17084603 markings, 69230331 edges, 63846 markings/sec, 225 secs
lola: 17398824 markings, 70522084 edges, 62844 markings/sec, 230 secs
lola: 17701229 markings, 71781501 edges, 60481 markings/sec, 235 secs
lola: 17986072 markings, 72994915 edges, 56969 markings/sec, 240 secs
lola: 18254988 markings, 74172092 edges, 53783 markings/sec, 245 secs
lola: 18519265 markings, 75320668 edges, 52855 markings/sec, 250 secs
lola: 18790642 markings, 76457412 edges, 54275 markings/sec, 255 secs
lola: 19051698 markings, 77566427 edges, 52211 markings/sec, 260 secs
lola: 19325456 markings, 78693362 edges, 54752 markings/sec, 265 secs
lola: 19585984 markings, 79816930 edges, 52106 markings/sec, 270 secs
lola: 19836070 markings, 80915065 edges, 50017 markings/sec, 275 secs
lola: 20091675 markings, 82023428 edges, 51121 markings/sec, 280 secs
lola: 21018747 markings, 83472647 edges, 185414 markings/sec, 285 secs
lola: 21579414 markings, 85006258 edges, 112133 markings/sec, 290 secs
lola: 21579414 markings, 87220556 edges, 0 markings/sec, 295 secs
lola: 21934761 markings, 89323050 edges, 71069 markings/sec, 300 secs
lola: 22329475 markings, 91169187 edges, 78943 markings/sec, 305 secs
lola: 22847710 markings, 92993793 edges, 103647 markings/sec, 310 secs
lola: 23155719 markings, 94714256 edges, 61602 markings/sec, 315 secs
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 NeighborGrid-PT-d4n3m2c23-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-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="NeighborGrid-PT-d4n3m2c23"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d4n3m2c23.tgz
mv NeighborGrid-PT-d4n3m2c23 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is NeighborGrid-PT-d4n3m2c23, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-csrt-152666472400227"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;