Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r104-oct2-155272225400104.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is NeighborGrid-PT-d4n3m2c23, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272225400104
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 3.4K Feb 12 02:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 12 02:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 8 01:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 8 01:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K Feb 5 00:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 4 06:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 4 06:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 1 00:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 00:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rwxr-xr-x 1 mcc users 469K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552773633217

info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ NeighborGrid-PT-d4n3m2c23 @ 3570 seconds

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
Makefile:16: recipe for target 'verify' failed
vrfy: finished
info: timeLeft: 3239
rslt: Output for CTLFireability @ NeighborGrid-PT-d4n3m2c23
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1713/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2592
lola: finding significant places
lola: 81 places, 1632 transitions, 80 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: NOT(A (G (A (F (NOT FIREABLE(to_1_2_0_0v_2_1_1_0)))))) : A (F (A (G (E (F (FIREABLE(to_0_1_1_1v_1_1_1_0))))))) : (NOT(NOT((A (X (FIREABLE(to_1_1_2_2v_1_2_2_1))) AND E (X (FIREABLE(ti_0_1_1_1v_0_2_1_2)))))) AND E (G ((FIREABLE(ti_2_0_0_2v_2_0_1_1) OR FIREABLE(to_0_1_1_2v_0_2_2_1) OR NOT FIREABLE(to_0_0_1_0v_0_1_2_1) OR FIREABLE(ti_2_1_1_2v_2_2_2_1))))) : A (F (NOT(NOT(E (G (FIREABLE(ti_1_2_1_1v_2_1_1_2))))))) : NOT(A (G (((FIREABLE(to_1_2_2_1v_2_1_2_2) AND FIREABLE(to_1_0_1_2v_2_1_0_2)) OR NOT FIREABLE(ti_0_1_1_0v_1_2_1_0) OR FIREABLE(ti_0_1_0_2v_1_0_1_2))))) : E (F (E (((FIREABLE(to_1_1_2_2v_2_0_1_2) AND FIREABLE(ti_1_1_2_1v_2_1_2_0)) U NOT FIREABLE(ti_1_2_1_2v_2_2_0_2))))) : (E (X (A (X (FIREABLE(to_0_2_0_1v_1_2_0_2))))) OR ((A (X (FIREABLE(ti_1_2_1_1v_2_2_1_0))) AND A (G (NOT FIREABLE(to_0_1_0_2v_1_0_1_2)))) OR NOT(((NOT FIREABLE(to_2_0_1_0v_2_1_1_1) AND FIREABLE(to_1_0_2_1v_2_0_1_1)) OR E (X (FIREABLE(to_2_1_1_1v_2_2_0_2))))))) : (A (X (NOT(E (G (FIREABLE(ti_1_1_2_1v_2_2_1_1)))))) AND (FIREABLE(to_0_1_1_2v_1_2_1_2) OR NOT(E (G ((FIREABLE(ti_1_1_2_2v_2_1_2_1) AND FIREABLE(ti_1_2_0_1v_2_1_1_1))))))) : (A (G (A (G (FIREABLE(ti_2_0_1_2v_2_1_2_1))))) AND E (X (E (F ((FIREABLE(ti_1_1_1_2v_2_2_1_1) OR FIREABLE(ti_1_0_0_0v_2_0_1_1))))))) : NOT(A (G ((NOT FIREABLE(to_1_1_2_2v_2_1_2_1) OR FIREABLE(ti_1_0_2_0v_2_0_1_1))))) : A (G (FIREABLE(to_0_0_1_1v_1_1_1_0))) : E (G (A (F ((NOT FIREABLE(ti_0_1_0_1v_0_2_1_2) AND NOT FIREABLE(to_1_1_0_2v_2_0_0_2)))))) : (NOT(A (F (A (G (FIREABLE(ti_2_0_1_1v_2_1_1_2)))))) AND E (G (A (F ((FIREABLE(ti_1_1_2_2v_2_0_2_1) OR FIREABLE(ti_0_0_2_2v_1_0_1_1))))))) : (A (G (A ((FIREABLE(to_2_1_1_2v_2_2_0_1) U FIREABLE(ti_0_1_2_2v_1_0_1_2))))) OR (E ((FIREABLE(ti_0_1_2_0v_1_2_2_1) U NOT FIREABLE(ti_1_2_2_1v_2_2_1_0))) AND FIREABLE(ti_1_0_0_2v_2_0_1_2))) : A (G ((((NOT FIREABLE(to_2_1_1_1v_2_1_2_0) AND (FIREABLE(ti_1_0_1_0v_2_0_0_1) OR FIREABLE(to_0_2_1_2v_1_1_1_2))) OR A (X (FIREABLE(ti_1_1_1_0v_1_2_0_1)))) OR A ((FIREABLE(ti_1_1_1_1v_2_0_1_0) U FIREABLE(to_1_0_0_1v_2_1_0_1)))))) : E (G (FIREABLE(ti_0_1_1_2v_0_1_2_1)))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:464
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (FIREABLE(to_1_1_2_2v_1_2_2_1))) AND (E (X (FIREABLE(ti_0_1_1_1v_0_2_1_2))) AND E (G ((FIREABLE(ti_2_0_0_2v_2_0_1_1) OR FIREABLE(to_0_1_1_2v_0_2_2_1) OR NOT FIREABLE(to_0_0_1_0v_0_1_2_1) OR FIREABLE(ti_2_1_1_2v_2_2_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(ti_2_0_0_2v_2_0_1_1) OR FIREABLE(to_0_1_1_2v_0_2_2_1) OR NOT FIREABLE(to_0_0_1_0v_0_1_2_1) OR FIREABLE(ti_2_1_1_2v_2_2_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((FIREABLE(ti_2_0_0_2v_2_0_1_1) OR FIREABLE(to_0_1_1_2v_0_2_2_1) OR NOT FIREABLE(to_0_0_1_0v_0_1_2_1) OR FIREABLE(ti_2_1_1_2v_2_2_2_1))))
lola: processed formula length: 145
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(ti_2_0_0_2v_2_0_1_1) AND NOT FIREABLE(to_0_1_1_2v_0_2_2_1) AND FIREABLE(to_0_0_1_0v_0_1_2_1) AND NOT FIREABLE(ti_2_1_1_2v_2_2_2_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 56 markings, 56 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(ti_0_1_1_1v_0_2_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(FIREABLE(ti_0_1_1_1v_0_2_1_2))
lola: processed formula length: 33
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(to_1_1_2_2v_1_2_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(FIREABLE(to_1_1_2_2v_1_2_2_1))
lola: processed formula length: 33
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (X (FIREABLE(to_0_2_0_1v_1_2_0_2))))) OR ((A (X (FIREABLE(ti_1_2_1_1v_2_2_1_0))) AND A (G (NOT FIREABLE(to_0_1_0_2v_1_0_1_2)))) OR ((FIREABLE(to_2_0_1_0v_2_1_1_1) OR NOT FIREABLE(to_1_0_2_1v_2_0_1_1)) AND A (X (NOT FIREABLE(to_2_1_1_1v_2_2_0_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(to_2_0_1_0v_2_1_1_1) OR NOT FIREABLE(to_1_0_2_1v_2_0_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(to_2_0_1_0v_2_1_1_1) OR NOT FIREABLE(to_1_0_2_1v_2_0_1_1))
lola: processed formula length: 69
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(to_0_1_0_2v_1_0_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (NOT FIREABLE(to_0_1_0_2v_1_0_1_2)))
lola: processed formula length: 41
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(to_0_1_0_2v_1_0_1_2)
lola: state equation task get result unparse finished id 0
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: 0 markings, 0 edges
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(to_2_1_1_1v_2_2_0_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: ========================================
lola: processed formula: AX(NOT FIREABLE(to_2_1_1_1v_2_2_0_2))
lola: processed formula length: 37
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (FIREABLE(to_0_2_0_1v_1_2_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AX(FIREABLE(to_0_2_0_1v_1_2_0_2)))
lola: processed formula length: 37
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F (NOT FIREABLE(ti_1_1_2_1v_2_2_1_1))))) AND (FIREABLE(to_0_1_1_2v_1_2_1_2) OR A (F ((NOT FIREABLE(ti_1_1_2_2v_2_1_2_1) OR NOT FIREABLE(ti_1_2_0_1v_2_1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(to_0_1_1_2v_1_2_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_0_1_1_2v_1_2_1_2)
lola: processed formula length: 29
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
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 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (NOT FIREABLE(ti_1_1_2_1v_2_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: FIREABLE(ti_1_1_2_1v_2_2_1_1)
lola: processed formula length: 29
lola: 55 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(ti_1_1_2_1v_2_2_1_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 58 markings, 58 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (FIREABLE(ti_2_0_1_2v_2_1_2_1))) AND E (X (E (F ((FIREABLE(ti_1_1_1_2v_2_2_1_1) OR FIREABLE(ti_1_0_0_0v_2_0_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(ti_2_0_1_2v_2_1_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (FIREABLE(ti_2_0_1_2v_2_1_2_1)))
lola: processed formula length: 37
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(to_2_1_1_1v_2_1_2_0) AND (FIREABLE(ti_1_0_1_0v_2_0_0_1) OR FIREABLE(to_0_2_1_2v_1_1_1_2))) OR (A (X (FIREABLE(ti_1_1_1_0v_1_2_0_1))) OR A ((FIREABLE(ti_1_1_1_1v_2_0_1_0) U FIREABLE(to_1_0_0_1v_2_1_0_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((NOT FIREABLE(to_2_1_1_1v_2_1_2_0) AND (FIREABLE(ti_1_0_1_0v_2_0_0_1) OR FIREABLE(to_0_2_1_2v_1_1_1_2))) OR (AX(FIREABLE(ti_1_1_1_0v_1_2_0_1)) OR A(FIREABLE(ti_1_1_1_1v_2_0_1_0) U FIREABLE(to_1_0_0_1v_2_1_0_1)))))
lola: processed formula length: 218
lola: 55 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 24841 markings, 55047 edges, 4968 markings/sec, 0 secs
lola: 50072 markings, 111941 edges, 5046 markings/sec, 5 secs
lola: 76184 markings, 171532 edges, 5222 markings/sec, 10 secs
lola: 99810 markings, 223539 edges, 4725 markings/sec, 15 secs
lola: 125268 markings, 281098 edges, 5092 markings/sec, 20 secs
lola: 151022 markings, 339374 edges, 5151 markings/sec, 25 secs
lola: 175517 markings, 394056 edges, 4899 markings/sec, 30 secs
lola: 201054 markings, 451670 edges, 5107 markings/sec, 35 secs
lola: 227252 markings, 511296 edges, 5240 markings/sec, 40 secs
lola: 252591 markings, 568365 edges, 5068 markings/sec, 45 secs
lola: 277755 markings, 624726 edges, 5033 markings/sec, 50 secs
lola: 304882 markings, 686723 edges, 5425 markings/sec, 55 secs
lola: 331223 markings, 746599 edges, 5268 markings/sec, 60 secs
lola: 356865 markings, 804488 edges, 5128 markings/sec, 65 secs
lola: 382768 markings, 862533 edges, 5181 markings/sec, 70 secs
lola: 407708 markings, 918105 edges, 4988 markings/sec, 75 secs
lola: 433210 markings, 974971 edges, 5100 markings/sec, 80 secs
lola: 459128 markings, 1033069 edges, 5184 markings/sec, 85 secs
lola: 485002 markings, 1090883 edges, 5175 markings/sec, 90 secs
lola: 511671 markings, 1150997 edges, 5334 markings/sec, 95 secs
lola: 537169 markings, 1207607 edges, 5100 markings/sec, 100 secs
lola: 562066 markings, 1262024 edges, 4979 markings/sec, 105 secs
lola: 587504 markings, 1317384 edges, 5088 markings/sec, 110 secs
lola: 613838 markings, 1375326 edges, 5267 markings/sec, 115 secs
lola: 639241 markings, 1430569 edges, 5081 markings/sec, 120 secs
lola: 665841 markings, 1489416 edges, 5320 markings/sec, 125 secs
lola: 693411 markings, 1550520 edges, 5514 markings/sec, 130 secs
lola: 720729 markings, 1610722 edges, 5464 markings/sec, 135 secs
lola: 748575 markings, 1672462 edges, 5569 markings/sec, 140 secs
lola: 777249 markings, 1736626 edges, 5735 markings/sec, 145 secs
lola: 804302 markings, 1796312 edges, 5411 markings/sec, 150 secs
lola: 831121 markings, 1855488 edges, 5364 markings/sec, 155 secs
lola: 858731 markings, 1916934 edges, 5522 markings/sec, 160 secs
lola: 885610 markings, 1976805 edges, 5376 markings/sec, 165 secs
lola: 913161 markings, 2038604 edges, 5510 markings/sec, 170 secs
lola: 940620 markings, 2100162 edges, 5492 markings/sec, 175 secs
lola: 969351 markings, 2165306 edges, 5746 markings/sec, 180 secs
lola: 996256 markings, 2225212 edges, 5381 markings/sec, 185 secs
lola: 1024468 markings, 2288932 edges, 5642 markings/sec, 190 secs
lola: 1051923 markings, 2350533 edges, 5491 markings/sec, 195 secs
lola: 1078506 markings, 2409558 edges, 5317 markings/sec, 200 secs
lola: 1105312 markings, 2469410 edges, 5361 markings/sec, 205 secs
lola: 1131897 markings, 2528487 edges, 5317 markings/sec, 210 secs
lola: 1160492 markings, 2593324 edges, 5719 markings/sec, 215 secs
lola: 1188103 markings, 2655286 edges, 5522 markings/sec, 220 secs
lola: 1215259 markings, 2715878 edges, 5431 markings/sec, 225 secs
lola: 1244041 markings, 2781415 edges, 5756 markings/sec, 230 secs
lola: 1270667 markings, 2840801 edges, 5325 markings/sec, 235 secs
lola: 1296311 markings, 2897459 edges, 5129 markings/sec, 240 secs
lola: 1325473 markings, 2964368 edges, 5832 markings/sec, 245 secs
lola: 1352341 markings, 3024597 edges, 5374 markings/sec, 250 secs
lola: 1378756 markings, 3083250 edges, 5283 markings/sec, 255 secs
lola: 1405270 markings, 3142060 edges, 5303 markings/sec, 260 secs
lola: 1431073 markings, 3200159 edges, 5161 markings/sec, 265 secs
lola: 1432694 markings, 3203705 edges, 324 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(to_0_0_1_1v_1_1_1_0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (FIREABLE(to_0_0_1_1v_1_1_1_0)))
lola: processed formula length: 37
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(to_0_0_1_1v_1_1_1_0)
lola: state equation task get result unparse finished id 0
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: subprocess 6 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(ti_1_2_1_2v_2_2_0_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (NOT FIREABLE(ti_1_2_1_2v_2_2_0_2)))
lola: processed formula length: 41
lola: 53 rewrites
lola: ========================================
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(ti_1_2_1_2v_2_2_0_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(to_1_1_2_2v_2_1_2_1) AND NOT FIREABLE(ti_1_0_2_0v_2_0_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(to_1_1_2_2v_2_1_2_1) AND NOT FIREABLE(ti_1_0_2_0v_2_0_1_1))))
lola: processed formula length: 77
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(to_1_1_2_2v_2_1_2_1) AND NOT FIREABLE(ti_1_0_2_0v_2_0_1_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(to_1_2_2_1v_2_1_2_2) OR NOT FIREABLE(to_1_0_1_2v_2_1_0_2)) AND FIREABLE(ti_0_1_1_0v_1_2_1_0) AND NOT FIREABLE(ti_0_1_0_2v_1_0_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((NOT FIREABLE(to_1_2_2_1v_2_1_2_2) OR NOT FIREABLE(to_1_0_1_2v_2_1_0_2)) AND FIREABLE(ti_0_1_1_0v_1_2_1_0) AND NOT FIREABLE(ti_0_1_0_2v_1_0_1_2))))
lola: processed formula length: 155
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((NOT FIREABLE(to_1_2_2_1v_2_1_2_2) OR NOT FIREABLE(to_1_0_1_2v_2_1_0_2)) AND FIREABLE(ti_0_1_1_0v_1_2_1_0) AND NOT FIREABLE(ti_0_1_0_2v_1_0_1_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(to_0_1_1_1v_1_1_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: FIREABLE(to_0_1_1_1v_1_1_1_0)
lola: processed formula length: 29
lola: 55 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(to_0_1_1_1v_1_1_1_0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: FIREABLE(to_0_1_1_1v_1_1_1_0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
sara: try reading problem file CTLFireability-9-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 529888 markings, 963198 edges, 105978 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1066841 markings, 1923601 edges, 107391 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1673038 markings, 3006180 edges, 121239 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2302287 markings, 4130328 edges, 125850 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2920798 markings, 5235500 edges, 123702 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3542703 markings, 6348888 edges, 124381 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 4137450 markings, 7412640 edges, 118949 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 4770544 markings, 8543755 edges, 126619 markings/sec, 35 secs
Killed
rslt: finished

BK_STOP 1552773964330

--------------------
content from stderr:

make: [verify] Error 137 (ignored)

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="CTLFireability"
export BK_TOOL="lola"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is NeighborGrid-PT-d4n3m2c23, 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 r104-oct2-155272225400104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d4n3m2c23.tgz
mv NeighborGrid-PT-d4n3m2c23 execution
cd execution
if [ "CTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;