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)
................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is TriangularGrid-PT-5046, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008700363
=====================================================================

--------------------
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 TriangularGrid-PT-5046-CTLCardinality-0
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-1
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-10
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-11
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-12
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-13
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-14
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-15
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-2
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-3
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-4
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-5
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-6
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-7
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-8
FORMULA_NAME TriangularGrid-PT-5046-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494946666934


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ TriangularGrid-PT-5046 @ 3539 seconds
----- 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: 520/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 280 places, 240 transitions, 164 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 355 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-5046-CTLCardinality.task
lola: ((((((2 <= pol1_4_5) AND (pil3_3_5 <= pb1_3_3)) OR (3 <= pb3_4_4)) AND A (F ((pbl_5_8 <= pb2_4_6)))) OR E (G ((pbl_5_5 + 1 <= pi2_5_3)))) AND NOT(A (G (((pi3_5_3 <= pb1_5_5) AND (pil2_5_5 <= po2_4_1)))))) : E (F ((((pbl_2_1 <= pol3_5_7) AND (pbl_3_2 <= pi1_4_7) AND (pb2_5_9 + 1 <= po1_5_1)) OR A (X ((1 <= po1_5_1)))))) : A (F (A (((3 <= pb3_4_4) U (1 <= pi2_4_3))))) : A (X (A (F (((3 <= pol1_4_3) AND (2 <= pil1_4_7)))))) : E (G (E (X (((pil2_5_7 <= pb2_3_2) AND (po2_2_1 <= pbl_2_2)))))) : ((((((1 <= po3_3_3) OR (po1_4_5 <= pi3_5_1)) AND (po2_1_1 <= pi2_4_7)) OR ((pol3_5_3 <= pi3_4_5) AND (3 <= pbl_5_8) AND (pil3_4_3 + 1 <= pol1_5_1))) OR (((pi2_5_7 + 1 <= pi3_4_1) OR (2 <= pol3_5_9)) AND A (F ((2 <= po3_5_3))))) AND E (F (((pil1_2_1 + 1 <= pol3_3_1) OR (2 <= pil2_3_5))))) : A (F ((pb1_5_1 + 1 <= pil3_4_5))) : E (G (NOT(A (F ((1 <= po3_1_1)))))) : E (G ((pb3_3_4 <= pb3_4_4))) : (E (F (((pol3_5_1 <= 1) AND (pb1_3_4 + 1 <= pi3_3_1)))) AND (E (X (((pb1_2_3 <= pbl_5_7) OR (po1_3_5 <= pb2_4_1)))) AND NOT(E (F ((2 <= po2_3_1)))))) : E ((((2 <= pb3_3_5) OR (3 <= pb1_1_1) OR (po1_1_1 <= pol2_5_5)) U ((1 <= pil3_4_3) AND (1 <= pi3_2_1) AND ((pb2_5_9 <= pol2_2_1) OR (pbl_5_5 <= pol1_4_5))))) : A (F (E (X ((3 <= po2_4_5))))) : NOT((A (F ((3 <= pol1_3_3))) OR A (X ((pb3_4_7 + 1 <= pol2_5_3))))) : ((3 <= pbl_4_4) AND E (F (((pil2_4_7 <= 0) AND ((2 <= pi3_5_7) OR (pb1_5_4 <= pbl_4_3)))))) : A (X (E (X ((1 <= pb3_5_5))))) : A (X ((A (X ((1 <= pbl_5_6))) OR (((3 <= po2_3_5) OR (pol3_5_3 <= pil2_5_1)) AND ((2 <= pi3_2_3) OR (3 <= pil3_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: ((((((2 <= pol1_4_5) AND (pil3_3_5 <= pb1_3_3)) OR (3 <= pb3_4_4)) AND A (F ((pbl_5_8 <= pb2_4_6)))) OR E (G ((pbl_5_5 + 1 <= pi2_5_3)))) AND NOT(A (G (((pi3_5_3 <= pb1_5_5) AND (pil2_5_5 <= po2_4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= pol1_4_5) AND (pil3_3_5 <= pb1_3_3)) OR (3 <= pb3_4_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= pol1_4_5) AND (pil3_3_5 <= pb1_3_3)) OR (3 <= pb3_4_4))
lola: processed formula length: 64
lola: 3 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pbl_5_8 <= pb2_4_6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pbl_5_8 <= pb2_4_6))
lola: processed formula length: 30
lola: 4 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pbl_5_5 + 1 <= pi2_5_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pi2_5_3 <= pbl_5_5)))
lola: processed formula length: 35
lola: 5 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: lola: ========================================SUBRESULT

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pbl_2_1 <= pol3_5_7) AND (pbl_3_2 <= pi1_4_7) AND (pb2_5_9 + 1 <= po1_5_1)) OR A (X ((1 <= po1_5_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: E (F (((pbl_2_1 <= pol3_5_7) AND (pbl_3_2 <= pi1_4_7) AND (pb2_5_9 + 1 <= po1_5_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-5046-CTLCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((3 <= pb3_4_4) U (1 <= pi2_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((3 <= pb3_4_4) U (1 <= pi2_4_3)))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((3 <= pol1_4_3) AND (2 <= pil1_4_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((3 <= pol1_4_3) AND (2 <= pil1_4_7))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((pil2_5_7 <= pb2_3_2) AND (po2_2_1 <= pbl_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX(((pil2_5_7 <= pb2_3_2) AND (po2_2_1 <= pbl_2_2))))))
lola: processed formula length: 72
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((((1 <= po3_3_3) OR (po1_4_5 <= pi3_5_1)) AND (po2_1_1 <= pi2_4_7)) OR ((pol3_5_3 <= pi3_4_5) AND (3 <= pbl_5_8) AND (pil3_4_3 + 1 <= pol1_5_1))) OR (((pi2_5_7 + 1 <= pi3_4_1) OR (2 <= pol3_5_9)) AND A (F ((2 <= po3_5_3))))) AND E (F (((pil1_2_1 + 1 <= pol3_3_1) OR (2 <= pil2_3_5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= po3_3_3) OR (po1_4_5 <= pi3_5_1)) AND (po2_1_1 <= pi2_4_7)) OR ((pol3_5_3 <= pi3_4_5) AND (3 <= pbl_5_8) AND (pil3_4_3 + 1 <= pol1_5_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= po3_3_3) OR (po1_4_5 <= pi3_5_1)) AND (po2_1_1 <= pi2_4_7)) OR ((pol3_5_3 <= pi3_4_5) AND (3 <= pbl_5_8) AND (pil3_4_3 + 1 <= pol1_5_1)))
lola: processed formula length: 148
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: processed formula with 6 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: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pil1_2_1 + 1 <= pol3_3_1) OR (2 <= pil2_3_5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to TriangularGrid-PT-5046-CTLCardinality-6.sara
lola: SUBRESULT
lola: lola: result: yes========================================

lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb1_5_1 + 1 <= pil3_4_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb1_5_1 + 1 <= pil3_4_5))
lola: processed formula length: 35
lola: 1 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (F ((1 <= po3_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (1 <= po3_1_1))))
lola: processed formula length: 39
lola: 7 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pb3_3_4 <= pb3_4_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pb3_4_4 + 1 <= pb3_3_4)))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((pol3_5_1 <= 1) AND (pb1_3_4 + 1 <= pi3_3_1)))) AND (E (X (((pb1_2_3 <= pbl_5_7) OR (po1_3_5 <= pb2_4_1)))) AND NOT(E (F ((2 <= po2_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pol3_5_1 <= 1) AND (pb1_3_4 + 1 <= pi3_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((pb1_2_3 <= pbl_5_7) OR (po1_3_5 <= pb2_4_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((pb1_2_3 <= pbl_5_7) OR (po1_3_5 <= pb2_4_1)))
lola: processed formula length: 51
lola: 4 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((po2_3_1 <= 1)))
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 656 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: state equation: write sara problem file to TriangularGrid-PT-5046-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-5046-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================lola:
========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= pb3_3_5) OR (3 <= pb1_1_1) OR (po1_1_1 <= pol2_5_5)) U ((1 <= pil3_4_3) AND (1 <= pi3_2_1) AND ((pb2_5_9 <= pol2_2_1) OR (pbl_5_5 <= pol1_4_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= pb3_3_5) OR (3 <= pb1_1_1) OR (po1_1_1 <= pol2_5_5)) U ((1 <= pil3_4_3) AND (1 <= pi3_2_1) AND ((pb2_5_9 <= pol2_2_1) OR (pbl_5_5 <= pol1_4_5))))
lola: processed formula length: 157
lola: 1 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 813431 markings, 1579840 edges, 3111068700548005888 markings/sec, 0 secs
lola: 1434298 markings, 3041671 edges, 124173 markings/sec, 5 secs
lola: 2000301 markings, 4355079 edges, 113201 markings/sec, 10 secs
lola: 2444261 markings, 5565076 edges, 88792 markings/sec, 15 secs
lola: 2967664 markings, 6854221 edges, 104681 markings/sec, 20 secs
lola: 3490390 markings, 8123203 edges, 104545 markings/sec, 25 secs
lola: 3959149 markings, 9305009 edges, 93752 markings/sec, 30 secs
lola: 4406958 markings, 10561867 edges, 89562 markings/sec, 35 secs
lola: 4918054 markings, 11937559 edges, 102219 markings/sec, 40 secs
lola: 5397937 markings, 13195591 edges, 95977 markings/sec, 45 secs
lola: 5801830 markings, 14370987 edges, 80779 markings/sec, 50 secs
lola: 6223799 markings, 15560972 edges, 84394 markings/sec, 55 secs
lola: 6730618 markings, 16783033 edges, 101364 markings/sec, 60 secs
lola: 7211176 markings, 17893840 edges, 96112 markings/sec, 65 secs
lola: 7635360 markings, 18998181 edges, 84837 markings/sec, 70 secs
lola: 8115575 markings, 20279529 edges, 96043 markings/sec, 75 secs
lola: 8599674 markings, 21666980 edges, 96820 markings/sec, 80 secs
lola: 9098232 markings, 22946228 edges, 99712 markings/sec, 85 secs
lola: 9656499 markings, 24254909 edges, 111653 markings/sec, 90 secs
lola: 10096749 markings, 25442699 edges, 88050 markings/sec, 95 secs
lola: 10499235 markings, 26663543 edges, 80497 markings/sec, 100 secs
lola: 10875993 markings, 27822988 edges, 75352 markings/sec, 105 secs
lola: 11238192 markings, 28974812 edges, 72440 markings/sec, 110 secs
lola: 11624640 markings, 30112711 edges, 77290 markings/sec, 115 secs
lola: 11918750 markings, 31227431 edges, 58822 markings/sec, 120 secs
lola: 12371216 markings, 32388938 edges, 90493 markings/sec, 125 secs
lola: 12752173 markings, 33416390 edges, 76191 markings/sec, 130 secs
lola: 13090091 markings, 34522315 edges, 67584 markings/sec, 135 secs
lola: 13651545 markings, 35693020 edges, 112291 markings/sec, 140 secs
lola: 14116133 markings, 36849380 edges, 92918 markings/sec, 145 secs
lola: 14473170 markings, 37892271 edges, 71407 markings/sec, 150 secs
lola: 14959118 markings, 38930135 edges, 97190 markings/sec, 155 secs
lola: 15324972 markings, 39839828 edges, 73171 markings/sec, 160 secs
lola: 15717233 markings, 40763496 edges, 78452 markings/sec, 165 secs
lola: 16103620 markings, 41702666 edges, 77277 markings/sec, 170 secs
lola: 16451643 markings, 42695350 edges, 69605 markings/sec, 175 secs
lola: 16668507 markings, 43535683 edges, 43373 markings/sec, 180 secs
lola: 16926349 markings, 44314736 edges, 51568 markings/sec, 185 secs
lola: 17275885 markings, 45193592 edges, 69907 markings/sec, 190 secs
lola: 17586297 markings, 46015629 edges, 62082 markings/sec, 195 secs
lola: 17876826 markings, 46834081 edges, 58106 markings/sec, 200 secs
lola: 18159985 markings, 47684698 edges, 56632 markings/sec, 205 secs
lola: 18437604 markings, 48602120 edges, 55524 markings/sec, 210 secs
lola: 18671798 markings, 49524621 edges, 46839 markings/sec, 215 secs
lola: 18787516 markings, 50310446 edges, 23144 markings/sec, 220 secs
lola: 19015242 markings, 51126312 edges, 45545 markings/sec, 225 secs
lola: 19295014 markings, 51981300 edges, 55954 markings/sec, 230 secs
lola: 19583271 markings, 52818662 edges, 57651 markings/sec, 235 secs
lola: 19776304 markings, 53587989 edges, 38607 markings/sec, 240 secs
lola: 20006015 markings, 54382454 edges, 45942 markings/sec, 245 secs
lola: 20344323 markings, 55293847 edges, 67662 markings/sec, 250 secs
lola: 20750878 markings, 56296120 edges, 81311 markings/sec, 255 secs
lola: 21130517 markings, 57186392 edges, 75928 markings/sec, 260 secs
lola: 21489746 markings, 58088597 edges, 71846 markings/sec, 265 secs
lola: 21799149 markings, 59014115 edges, 61881 markings/sec, 270 secs
lola: 22281302 markings, 60243874 edges, 96431 markings/sec, 275 secs
lola: 22652251 markings, 61371720 edges, 74190 markings/sec, 280 secs
lola: 23143854 markings, 62472265 edges, 98321 markings/sec, 285 secs
lola: 23490063 markings, 63522826 edges, 69242 markings/sec, 290 secs
lola: 23871688 markings, 64569953 edges, 76325 markings/sec, 295 secs
lola: 24226659 markings, 65538870 edges, 70994 markings/sec, 300 secs
lola: 24466994 markings, 66423718 edges, 48067 markings/sec, 305 secs
lola: 24758532 markings, 67323616 edges, 58308 markings/sec, 310 secs
lola: 25080815 markings, 68261456 edges, 64457 markings/sec, 315 secs
lola: 25321358 markings, 69140483 edges, 48109 markings/sec, 320 secs
lola: 25654392 markings, 70084103 edges, 66607 markings/sec, 325 secs
lola: 26031142 markings, 71065556 edges, 75350 markings/sec, 330 secs
lola: 26310289 markings, 71996045 edges, 55829 markings/sec, 335 secs
lola: 26723082 markings, 72914165 edges, 82559 markings/sec, 340 secs
lola: 27030090 markings, 73813559 edges, 61402 markings/sec, 345 secs
lola: 27514722 markings, 74773054 edges, 96926 markings/sec, 350 secs
lola: 27906006 markings, 75700076 edges, 78257 markings/sec, 355 secs
lola: 28295608 markings, 76638826 edges, 77920 markings/sec, 360 secs
lola: 28688484 markings, 77608637 edges, 78575 markings/sec, 365 secs
lola: 28971659 markings, 78569499 edges, 56635 markings/sec, 370 secs
lola: 29200803 markings, 79394147 edges, 45829 markings/sec, 375 secs
lola: 29519692 markings, 80268073 edges, 63778 markings/sec, 380 secs
lola: 29858574 markings, 81120421 edges, 67776 markings/sec, 385 secs
lola: 30165556 markings, 81977224 edges, 61396 markings/sec, 390 secs
lola: 30466591 markings, 82879392 edges, 60207 markings/sec, 395 secs
lola: 30754997 markings, 83836891 edges, 57681 markings/sec, 400 secs
lola: 30981068 markings, 84786005 edges, 45214 markings/sec, 405 secs
lola: 31091961 markings, 85615749 edges, 22179 markings/sec, 410 secs
lola: 31378086 markings, 86501307 edges, 57225 markings/sec, 415 secs
lola: 31723325 markings, 87475189 edges, 69048 markings/sec, 420 secs
lola: 31921024 markings, 88163992 edges, 39540 markings/sec, 425 secs
lola: 32108793 markings, 88891728 edges, 37554 markings/sec, 430 secs
lola: 32356692 markings, 89735180 edges, 49580 markings/sec, 435 secs
lola: 32779940 markings, 90793716 edges, 84650 markings/sec, 440 secs
lola: 33148601 markings, 91777499 edges, 73732 markings/sec, 445 secs
lola: 33498410 markings, 92711317 edges, 69962 markings/sec, 450 secs
lola: 33815158 markings, 93598565 edges, 63350 markings/sec, 455 secs
lola: 34051164 markings, 94446255 edges, 47201 markings/sec, 460 secs
lola: 34483305 markings, 95617527 edges, 86428 markings/sec, 465 secs
lola: 34877957 markings, 96839482 edges, 78930 markings/sec, 470 secs
lola: 35212022 markings, 97939261 edges, 66813 markings/sec, 475 secs
lola: 35677221 markings, 99071077 edges, 93040 markings/sec, 480 secs
lola: 36063365 markings, 100161807 edges, 77229 markings/sec, 485 secs
lola: 36397830 markings, 101214442 edges, 66893 markings/sec, 490 secs
lola: 36726836 markings, 102309055 edges, 65801 markings/sec, 495 secs
lola: 37062488 markings, 103322673 edges, 67130 markings/sec, 500 secs
lola: 37317327 markings, 104358842 edges, 50968 markings/sec, 505 secs
lola: 37615951 markings, 105375057 edges, 59725 markings/sec, 510 secs
lola: 37944488 markings, 106390954 edges, 65707 markings/sec, 515 secs
lola: 38186397 markings, 107331472 edges, 48382 markings/sec, 520 secs
lola: 38441333 markings, 108309853 edges, 50987 markings/sec, 525 secs
lola: 38852378 markings, 109381897 edges, 82209 markings/sec, 530 secs
lola: 39189742 markings, 110398906 edges, 67473 markings/sec, 535 secs
lola: 39435659 markings, 111372306 edges, 49183 markings/sec, 540 secs
lola: 39904511 markings, 112396047 edges, 93770 markings/sec, 545 secs
lola: 40259218 markings, 113381243 edges, 70941 markings/sec, 550 secs
lola: 40581380 markings, 114321878 edges, 64432 markings/sec, 555 secs
lola: 40847634 markings, 115245371 edges, 53251 markings/sec, 560 secs
lola: 41288982 markings, 116240792 edges, 88270 markings/sec, 565 secs
lola: 41655142 markings, 117206608 edges, 73232 markings/sec, 570 secs
lola: 42018328 markings, 118144079 edges, 72637 markings/sec, 575 secs
lola: 42354976 markings, 119060103 edges, 67330 markings/sec, 580 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((3 <= po2_4_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((3 <= po2_4_5)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: subprocess 12 will run for 737 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((3 <= pol1_3_3))) OR A (X ((pb3_4_7 + 1 <= pol2_5_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 737 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pol1_3_3 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= pol1_3_3)))
lola: processed formula length: 30
lola: 9 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: subprocess 13 will run for 983 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((pol2_5_3 <= pb3_4_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((pol2_5_3 <= pb3_4_7))
lola: processed formula length: 25
lola: 8 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 983 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= pbl_4_4) AND E (F (((pil2_4_7 <= 0) AND ((2 <= pi3_5_7) OR (pb1_5_4 <= pbl_4_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 983 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= pbl_4_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pbl_4_4)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 14 will run for 1475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pil2_4_7 <= 0) AND ((2 <= pi3_5_7) OR (pb1_5_4 <= pbl_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
state equation: write sara problem file to TriangularGrid-PT-5046-CTLCardinality-14.saralola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: lola: subprocess 14 will run for 1475 seconds at most (--localtimelimit=-1)
========================================
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((1 <= pb3_5_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((1 <= pb3_5_5)))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: ========================================
lola: subprocess 15 will run for 2950 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (X ((1 <= pbl_5_6))) OR (((3 <= po2_3_5) OR (pol3_5_3 <= pil2_5_1)) AND ((2 <= pi3_2_3) OR (3 <= pil3_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((AX((1 <= pbl_5_6)) OR (((3 <= po2_3_5) OR (pol3_5_3 <= pil2_5_1)) AND ((2 <= pi3_2_3) OR (3 <= pil3_2_3)))))
lola: processed formula length: 114
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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).
sara: try reading problem file TriangularGrid-PT-5046-CTLCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: no yes no no yes yes no yes yes yes unknown no yes yes yes yes
lola: ========================================
FORMULA TriangularGrid-PT-5046-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494947257042

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="TriangularGrid-PT-5046"
export BK_EXAMINATION="CTLCardinality"
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

tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-5046.tgz
mv TriangularGrid-PT-5046 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is TriangularGrid-PT-5046, 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 r078-ebro-149441008700363"
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 ;