About the Execution of LoLA for S_TriangularGrid-PT-5046
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7726.370 | 590250.00 | 593085.00 | 130.40 | FT?FTTTTFFTTFTTT | normal |
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 S_TriangularGrid-PT-5046, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464300363
=====================================================================
--------------------
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 1496575261942
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_TriangularGrid-PT-5046: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_TriangularGrid-PT-5046: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_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: lola: SUBRESULT
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: state equation: write sara problem file to TriangularGrid-PT-5046-CTLCardinality-9.sara
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: lola: ========================================The Boolean predicate is true.
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: 768792 markings, 1487482 edges, 2822845196343967744 markings/sec, 0 secs
lola: 1351959 markings, 2861313 edges, 116633 markings/sec, 5 secs
lola: 1919806 markings, 4157145 edges, 113569 markings/sec, 10 secs
lola: 2383703 markings, 5355649 edges, 92779 markings/sec, 15 secs
lola: 2856134 markings, 6581440 edges, 94486 markings/sec, 20 secs
lola: 3369429 markings, 7860809 edges, 102659 markings/sec, 25 secs
lola: 3859934 markings, 9040149 edges, 98101 markings/sec, 30 secs
lola: 4255393 markings, 10182512 edges, 79092 markings/sec, 35 secs
lola: 4755459 markings, 11534304 edges, 100013 markings/sec, 40 secs
lola: 5252232 markings, 12794813 edges, 99355 markings/sec, 45 secs
lola: 5672800 markings, 13962929 edges, 84114 markings/sec, 50 secs
lola: 5985888 markings, 15055523 edges, 62618 markings/sec, 55 secs
lola: 6515065 markings, 16252012 edges, 105835 markings/sec, 60 secs
lola: 6969185 markings, 17351444 edges, 90824 markings/sec, 65 secs
lola: 7415425 markings, 18422309 edges, 89248 markings/sec, 70 secs
lola: 7756467 markings, 19439073 edges, 68208 markings/sec, 75 secs
lola: 8324983 markings, 20807105 edges, 113703 markings/sec, 80 secs
lola: 8746299 markings, 22094022 edges, 84263 markings/sec, 85 secs
lola: 9288309 markings, 23335216 edges, 108402 markings/sec, 90 secs
lola: 9778776 markings, 24577954 edges, 98093 markings/sec, 95 secs
lola: 10192957 markings, 25765400 edges, 82836 markings/sec, 100 secs
lola: 10606253 markings, 26948108 edges, 82659 markings/sec, 105 secs
lola: 10945103 markings, 28097858 edges, 67770 markings/sec, 110 secs
lola: 11302478 markings, 29221360 edges, 71475 markings/sec, 115 secs
lola: 11678015 markings, 30307092 edges, 75107 markings/sec, 120 secs
lola: 11951486 markings, 31384688 edges, 54694 markings/sec, 125 secs
lola: 12425137 markings, 32511490 edges, 94730 markings/sec, 130 secs
lola: 12811729 markings, 33562534 edges, 77318 markings/sec, 135 secs
lola: 13104175 markings, 34563434 edges, 58489 markings/sec, 140 secs
lola: 13618030 markings, 35608600 edges, 102771 markings/sec, 145 secs
lola: 14049308 markings, 36651508 edges, 86256 markings/sec, 150 secs
lola: 14352056 markings, 37576788 edges, 60550 markings/sec, 155 secs
lola: 14769062 markings, 38603767 edges, 83401 markings/sec, 160 secs
lola: 15263353 markings, 39699105 edges, 98858 markings/sec, 165 secs
lola: 15721268 markings, 40773896 edges, 91583 markings/sec, 170 secs
lola: 16159109 markings, 41842751 edges, 87568 markings/sec, 175 secs
lola: 16515604 markings, 42940729 edges, 71299 markings/sec, 180 secs
lola: 16775197 markings, 43905267 edges, 51919 markings/sec, 185 secs
lola: 17151342 markings, 44899699 edges, 75229 markings/sec, 190 secs
lola: 17536752 markings, 45884156 edges, 77082 markings/sec, 195 secs
lola: 17865778 markings, 46802046 edges, 65805 markings/sec, 200 secs
lola: 18180314 markings, 47747764 edges, 62907 markings/sec, 205 secs
lola: 18488922 markings, 48780271 edges, 61722 markings/sec, 210 secs
lola: 18716794 markings, 49799225 edges, 45574 markings/sec, 215 secs
lola: 18880782 markings, 50723133 edges, 32798 markings/sec, 220 secs
lola: 19171139 markings, 51645664 edges, 58071 markings/sec, 225 secs
lola: 19494164 markings, 52534429 edges, 64605 markings/sec, 230 secs
lola: 19707243 markings, 53263921 edges, 42616 markings/sec, 235 secs
lola: 19898224 markings, 54010630 edges, 38196 markings/sec, 240 secs
lola: 20106122 markings, 54776529 edges, 41580 markings/sec, 245 secs
lola: 20579299 markings, 55855840 edges, 94635 markings/sec, 250 secs
lola: 20928734 markings, 56718121 edges, 69887 markings/sec, 255 secs
lola: 21284311 markings, 57551389 edges, 71115 markings/sec, 260 secs
lola: 21585951 markings, 58365726 edges, 60328 markings/sec, 265 secs
lola: 21923138 markings, 59323525 edges, 67437 markings/sec, 270 secs
lola: 22359914 markings, 60489649 edges, 87355 markings/sec, 275 secs
lola: 22728120 markings, 61543516 edges, 73641 markings/sec, 280 secs
lola: 23201734 markings, 62622091 edges, 94723 markings/sec, 285 secs
lola: 23529931 markings, 63611805 edges, 65639 markings/sec, 290 secs
lola: 23897455 markings, 64651911 edges, 73505 markings/sec, 295 secs
lola: 24273014 markings, 65687804 edges, 75112 markings/sec, 300 secs
lola: 24567075 markings, 66718971 edges, 58812 markings/sec, 305 secs
lola: 24915545 markings, 67720402 edges, 69694 markings/sec, 310 secs
lola: 25204852 markings, 68664963 edges, 57861 markings/sec, 315 secs
lola: 25440344 markings, 69595134 edges, 47098 markings/sec, 320 secs
lola: 25899030 markings, 70675127 edges, 91737 markings/sec, 325 secs
lola: 26237724 markings, 71663682 edges, 67739 markings/sec, 330 secs
lola: 26582678 markings, 72601312 edges, 68991 markings/sec, 335 secs
lola: 26936257 markings, 73487269 edges, 70716 markings/sec, 340 secs
lola: 27336573 markings, 74375174 edges, 80063 markings/sec, 345 secs
lola: 27723472 markings, 75285164 edges, 77380 markings/sec, 350 secs
lola: 28102943 markings, 76164232 edges, 75894 markings/sec, 355 secs
lola: 28461996 markings, 77041779 edges, 71811 markings/sec, 360 secs
lola: 28819836 markings, 77984466 edges, 71568 markings/sec, 365 secs
lola: 29015562 markings, 78782914 edges, 39145 markings/sec, 370 secs
lola: 29278942 markings, 79568448 edges, 52676 markings/sec, 375 secs
lola: 29554081 markings, 80329727 edges, 55028 markings/sec, 380 secs
lola: 29851361 markings, 81101559 edges, 59456 markings/sec, 385 secs
lola: 30128255 markings, 81869819 edges, 55379 markings/sec, 390 secs
lola: 30396641 markings, 82663611 edges, 53677 markings/sec, 395 secs
lola: 30655933 markings, 83500678 edges, 51858 markings/sec, 400 secs
lola: 30903717 markings, 84377558 edges, 49557 markings/sec, 405 secs
lola: 31034157 markings, 85134732 edges, 26088 markings/sec, 410 secs
lola: 31175261 markings, 85868584 edges, 28221 markings/sec, 415 secs
lola: 31425074 markings, 86652791 edges, 49963 markings/sec, 420 secs
lola: 31750119 markings, 87561088 edges, 65009 markings/sec, 425 secs
lola: 31933230 markings, 88212572 edges, 36622 markings/sec, 430 secs
lola: 32130990 markings, 88962246 edges, 39552 markings/sec, 435 secs
lola: 32429798 markings, 89896360 edges, 59762 markings/sec, 440 secs
lola: 32856814 markings, 91027544 edges, 85403 markings/sec, 445 secs
lola: 33258352 markings, 92078280 edges, 80308 markings/sec, 450 secs
lola: 33641994 markings, 93104808 edges, 76728 markings/sec, 455 secs
lola: 33973227 markings, 94098453 edges, 66247 markings/sec, 460 secs
lola: 34325764 markings, 95216726 edges, 70507 markings/sec, 465 secs
lola: 34777714 markings, 96512924 edges, 90390 markings/sec, 470 secs
lola: 35132072 markings, 97701769 edges, 70872 markings/sec, 475 secs
lola: 35609190 markings, 98889056 edges, 95424 markings/sec, 480 secs
lola: 36027330 markings, 100052023 edges, 83628 markings/sec, 485 secs
lola: 36367854 markings, 101141367 edges, 68105 markings/sec, 490 secs
lola: 36708805 markings, 102272815 edges, 68190 markings/sec, 495 secs
lola: 37066439 markings, 103336357 edges, 71527 markings/sec, 500 secs
lola: 37328404 markings, 104389366 edges, 52393 markings/sec, 505 secs
lola: 37623677 markings, 105414978 edges, 59055 markings/sec, 510 secs
lola: 37959708 markings, 106446933 edges, 67206 markings/sec, 515 secs
lola: 38201107 markings, 107394592 edges, 48280 markings/sec, 520 secs
lola: 38477802 markings, 108410369 edges, 55339 markings/sec, 525 secs
lola: 38890110 markings, 109499134 edges, 82462 markings/sec, 530 secs
lola: 39227141 markings, 110524938 edges, 67406 markings/sec, 535 secs
lola: 39515507 markings, 111538081 edges, 57673 markings/sec, 540 secs
lola: 39970927 markings, 112578069 edges, 91084 markings/sec, 545 secs
lola: 40335147 markings, 113572184 edges, 72844 markings/sec, 550 secs
lola: 40630083 markings, 114495141 edges, 58987 markings/sec, 555 secs
lola: 40897995 markings, 115457177 edges, 53582 markings/sec, 560 secs
lola: 41366502 markings, 116455782 edges, 93701 markings/sec, 565 secs
lola: 41739750 markings, 117419952 edges, 74650 markings/sec, 570 secs
lola: 42095513 markings, 118360775 edges, 71153 markings/sec, 575 secs
lola: 42433157 markings, 119271432 edges, 67529 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 589 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
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 1474 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: SUBRESULT
lola: result: yes
lola: lola: The Boolean predicate is true.
state equation: write sara problem file to TriangularGrid-PT-5046-CTLCardinality-14.sara
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1474 seconds at most (--localtimelimit=-1)
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 2949 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).
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 1496575852192
--------------------
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="S_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/S_TriangularGrid-PT-5046.tgz
mv S_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 S_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 r158-ebro-149443464300363"
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 '
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 ;