About the Execution of LoLA for S_SquareGrid-PT-040204
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2684.980 | 253323.00 | 238383.00 | 52.70 | F?TTF?FTFTTFFTTF | 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_SquareGrid-PT-040204, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464000130
=====================================================================
--------------------
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 SquareGrid-PT-040204-CTLFireability-0
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-1
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-10
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-11
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-12
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-13
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-14
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-15
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-2
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-3
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-4
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-5
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-6
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-7
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-8
FORMULA_NAME SquareGrid-PT-040204-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1496562303436
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_SquareGrid-PT-040204: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_SquareGrid-PT-040204: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ S_SquareGrid-PT-040204 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 512/65536 symbol table entries, 25 collisions
lola: preprocessing...
lola: finding significant places
lola: 240 places, 272 transitions, 143 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 368 transition conflict sets
lola: TASK
lola: reading formula from SquareGrid-PT-040204-CTLFireability.task
lola: (A (F ((FIREABLE(t3i1_3_3) OR (FIREABLE(t2i4_3_1) AND FIREABLE(t3i4_2_2) AND FIREABLE(t3o_1_1))))) OR NOT(E (X (E (F (FIREABLE(t4i3_4_3))))))) : (NOT FIREABLE(t4i1_2_2) AND E (((NOT FIREABLE(t2i4_2_4) OR NOT FIREABLE(t2i1_4_4)) U A (G (FIREABLE(t2i4_3_2)))))) : (A (F (FIREABLE(t1i2_1_3))) OR (FIREABLE(t4i3_1_1) AND (E (X ((FIREABLE(t3i4_1_2) OR FIREABLE(t2o_3_2)))) OR FIREABLE(t3o_1_1)))) : A (X (E (F (FIREABLE(t4i1_2_1))))) : (NOT(A (F (E (X (FIREABLE(t1i2_1_2)))))) OR (E (G (A (F (FIREABLE(t3i1_2_2))))) OR E ((FIREABLE(t2i3_4_3) U NOT FIREABLE(t3o_3_3))))) : A (X (A (F (((FIREABLE(t3i1_4_3) OR FIREABLE(t1i2_1_3)) AND (FIREABLE(t4i3_1_1) OR FIREABLE(t1o_2_3))))))) : A (F (E (G (A (X (FIREABLE(t3i2_4_2))))))) : A (X ((A (X ((FIREABLE(t3i2_2_1) OR FIREABLE(t4o_4_2)))) OR NOT(A (X (FIREABLE(t4i3_3_2))))))) : ((FIREABLE(t4o_3_4) AND ((E (G (FIREABLE(t1i4_4_4))) AND FIREABLE(t2i1_1_1)) AND A (X ((FIREABLE(t3i1_1_2) AND FIREABLE(t2i4_4_2)))))) OR E (G (E ((FIREABLE(t1i3_4_2) U FIREABLE(t2o_4_1)))))) : NOT(E (X ((E (G (FIREABLE(t1o_4_4))) AND (FIREABLE(t4o_4_4) AND FIREABLE(t1o_2_3) AND NOT FIREABLE(tf_l_1)))))) : E (G (FIREABLE(t2o_1_1))) : (E (F ((E (G (FIREABLE(t3i2_3_2))) AND E (F (FIREABLE(t3i1_3_3)))))) AND (A ((NOT FIREABLE(t3o_2_1) U NOT FIREABLE(tf_u_2))) OR NOT(E (G (FIREABLE(t2i4_1_3)))))) : NOT(E (G (NOT(A (G (FIREABLE(t4i3_4_1))))))) : (((FIREABLE(t3i1_3_2) OR (((FIREABLE(t2o_4_3) OR FIREABLE(t2o_4_4)) AND FIREABLE(t2i3_3_4)) AND E (X (FIREABLE(t4o_3_2))))) OR A (F (FIREABLE(t4i1_2_4)))) OR A ((A (X (FIREABLE(t1i4_4_2))) U E (G (FIREABLE(t4i1_1_2)))))) : ((A (G ((FIREABLE(t4o_1_4) AND FIREABLE(t1i4_4_4) AND (FIREABLE(t1i2_2_2) OR FIREABLE(t2i4_4_2))))) OR A (F (FIREABLE(t4i1_3_4)))) OR (((E (F (FIREABLE(t4i3_4_1))) AND FIREABLE(t2i1_4_4)) AND (NOT FIREABLE(t1o_3_2) OR NOT FIREABLE(t1i4_2_1) OR (NOT FIREABLE(t1i2_3_1) AND NOT FIREABLE(t3o_3_1)))) AND ((FIREABLE(t1i2_4_4) OR (FIREABLE(t3i4_1_1) AND FIREABLE(t2i4_2_2) AND NOT FIREABLE(t1i2_2_2))) OR E ((FIREABLE(t2o_4_1) U FIREABLE(t3i2_2_3)))))) : NOT(A (F ((A (F (FIREABLE(t3i4_1_2))) AND E (G (FIREABLE(t2i3_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: (A (F ((FIREABLE(t3i1_3_3) OR (FIREABLE(t2i4_3_1) AND FIREABLE(t3i4_2_2) AND FIREABLE(t3o_1_1))))) OR NOT(E (X (E (F (FIREABLE(t4i3_4_3)))))))
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: A (F ((FIREABLE(t3i1_3_3) OR (FIREABLE(t2i4_3_1) AND FIREABLE(t3i4_2_2) AND FIREABLE(t3o_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(t3i1_3_3) OR (FIREABLE(t2i4_3_1) AND FIREABLE(t3i4_2_2) AND FIREABLE(t3o_1_1))))
lola: processed formula length: 100
lola: 6 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (NOT FIREABLE(t4i3_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(E(TRUE U FIREABLE(t4i3_4_3))))
lola: processed formula length: 37
lola: 8 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t4i1_2_2) AND E (((NOT FIREABLE(t2i4_2_4) OR NOT FIREABLE(t2i1_4_4)) U A (G (FIREABLE(t2i4_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t4i1_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t4i1_2_2)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(t2i4_2_4) OR NOT FIREABLE(t2i1_4_4)) U A (G (FIREABLE(t2i4_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((NOT FIREABLE(t2i4_2_4) OR NOT FIREABLE(t2i1_4_4)) U NOT(E(TRUE U NOT FIREABLE(t2i4_3_2))))
lola: processed formula length: 94
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 475437 markings, 1748910 edges, 3689348869717491712 markings/sec, 0 secs
lola: 860952 markings, 3122446 edges, 77103 markings/sec, 5 secs
lola: 1161119 markings, 4487208 edges, 60033 markings/sec, 10 secs
lola: 1542435 markings, 5813421 edges, 76263 markings/sec, 15 secs
lola: 1806210 markings, 7100191 edges, 52755 markings/sec, 20 secs
lola: 2202194 markings, 8476447 edges, 79197 markings/sec, 25 secs
lola: 2463063 markings, 9757074 edges, 52174 markings/sec, 30 secs
lola: 2837700 markings, 11066363 edges, 74927 markings/sec, 35 secs
lola: 3080162 markings, 12290501 edges, 48492 markings/sec, 40 secs
lola: 3314550 markings, 13526289 edges, 46878 markings/sec, 45 secs
lola: 3684419 markings, 14833809 edges, 73974 markings/sec, 50 secs
lola: 3913632 markings, 15983821 edges, 45843 markings/sec, 55 secs
lola: 4185717 markings, 17214630 edges, 54417 markings/sec, 60 secs
lola: 4463306 markings, 18645746 edges, 55518 markings/sec, 65 secs
lola: 4756765 markings, 19958757 edges, 58692 markings/sec, 70 secs
lola: 4991957 markings, 21284721 edges, 47038 markings/sec, 75 secs
lola: 5375470 markings, 22567044 edges, 76703 markings/sec, 80 secs
lola: 5647641 markings, 23831615 edges, 54434 markings/sec, 85 secs
lola: 5955010 markings, 25031213 edges, 61474 markings/sec, 90 secs
lola: 6309151 markings, 26212683 edges, 70828 markings/sec, 95 secs
lola: 6634830 markings, 27404814 edges, 65136 markings/sec, 100 secs
lola: 6919890 markings, 28611308 edges, 57012 markings/sec, 105 secs
lola: 7240817 markings, 29717565 edges, 64185 markings/sec, 110 secs
lola: 7553750 markings, 30804317 edges, 62587 markings/sec, 115 secs
lola: 7855697 markings, 31868784 edges, 60389 markings/sec, 120 secs
lola: 8148162 markings, 32918770 edges, 58493 markings/sec, 125 secs
lola: 8426663 markings, 33950158 edges, 55700 markings/sec, 130 secs
lola: 8707418 markings, 34998581 edges, 56151 markings/sec, 135 secs
lola: 8875031 markings, 35952181 edges, 33523 markings/sec, 140 secs
lola: 9022648 markings, 36889815 edges, 29523 markings/sec, 145 secs
lola: 9171131 markings, 37829275 edges, 29697 markings/sec, 150 secs
lola: 9322703 markings, 38774519 edges, 30314 markings/sec, 155 secs
lola: 9478062 markings, 39729202 edges, 31072 markings/sec, 160 secs
lola: 9640157 markings, 40700910 edges, 32419 markings/sec, 165 secs
lola: 9811652 markings, 41692211 edges, 34299 markings/sec, 170 secs
lola: 10002602 markings, 42717119 edges, 38190 markings/sec, 175 secs
lola: 10309409 markings, 43970912 edges, 61361 markings/sec, 180 secs
lola: 10675918 markings, 45250201 edges, 73302 markings/sec, 185 secs
lola: 10907343 markings, 46403322 edges, 46285 markings/sec, 190 secs
lola: 11270695 markings, 47689349 edges, 72670 markings/sec, 195 secs
lola: 11501004 markings, 48781775 edges, 46062 markings/sec, 200 secs
lola: 11852374 markings, 50064054 edges, 70274 markings/sec, 205 secs
lola: 12095222 markings, 51155220 edges, 48570 markings/sec, 210 secs
lola: 12361788 markings, 52345516 edges, 53313 markings/sec, 215 secs
lola: 12598659 markings, 53561414 edges, 47374 markings/sec, 220 secs
lola: 12940483 markings, 54738558 edges, 68365 markings/sec, 225 secs
lola: 13159026 markings, 55860919 edges, 43709 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: 13211556 markings, 56088813 edges, 10506 markings/sec, 235 secs
lola: 13211556 markings, 56088813 edges, 0 markings/sec, 240 secs
lola: 13211556 markings, 56088813 edges, 0 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(t1i2_1_3))) OR (FIREABLE(t4i3_1_1) AND (E (X ((FIREABLE(t3i4_1_2) OR FIREABLE(t2o_3_2)))) OR FIREABLE(t3o_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t1i2_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t1i2_1_3))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t4i3_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t4i3_1_1)
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (F (FIREABLE(t4i1_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U FIREABLE(t4i1_2_1)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (E (X (FIREABLE(t1i2_1_2)))))) OR (E (G (A (F (FIREABLE(t3i1_2_2))))) OR E ((FIREABLE(t2i3_4_3) U NOT FIREABLE(t3o_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (NOT FIREABLE(t1i2_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX(NOT FIREABLE(t1i2_1_2)))))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((FIREABLE(t3i1_4_3) OR FIREABLE(t1i2_1_3)) AND (FIREABLE(t4i3_1_1) OR FIREABLE(t1o_2_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((FIREABLE(t3i1_4_3) OR FIREABLE(t1i2_1_3)) AND (FIREABLE(t4i3_1_1) OR FIREABLE(t1o_2_3)))))
lola: processed formula length: 106
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (A (X (FIREABLE(t3i2_4_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U NOT(AX(FIREABLE(t3i2_4_2))))))
lola: processed formula length: 52
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (X ((FIREABLE(t3i2_2_1) OR FIREABLE(t4o_4_2)))) OR NOT(A (X (FIREABLE(t4i3_3_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((AX((FIREABLE(t3i2_2_1) OR FIREABLE(t4o_4_2))) OR EX(NOT FIREABLE(t4i3_3_2))))
lola: processed formula length: 82
lola: 6 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t4o_3_4) AND ((E (G (FIREABLE(t1i4_4_4))) AND FIREABLE(t2i1_1_1)) AND A (X ((FIREABLE(t3i1_1_2) AND FIREABLE(t2i4_4_2)))))) OR E (G (E ((FIREABLE(t1i3_4_2) U FIREABLE(t2o_4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t4o_3_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t4o_3_4)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t1i4_4_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(t1i4_4_4)))
lola: processed formula length: 37
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E ((FIREABLE(t1i3_4_2) U FIREABLE(t2o_4_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(FIREABLE(t1i3_4_2) U FIREABLE(t2o_4_1)))))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X ((E (G (FIREABLE(t1o_4_4))) AND (FIREABLE(t4o_4_4) AND FIREABLE(t1o_2_3) AND NOT FIREABLE(tf_l_1))))))
lola: ========================================
lola: SUBTASKlola:
========================================
lola: checking CTL
lola: processed formula: AX((A(TRUE U NOT FIREABLE(t1o_4_4)) OR (NOT FIREABLE(t4o_4_4) OR NOT FIREABLE(t1o_2_3) OR FIREABLE(tf_l_1))))
lola: processed formula length: 111
lola: 9 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t2o_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(t2o_1_1)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((E (G (FIREABLE(t3i2_3_2))) AND E (F (FIREABLE(t3i1_3_3)))))) AND (A ((NOT FIREABLE(t3o_2_1) U NOT FIREABLE(tf_u_2))) OR NOT(E (G (FIREABLE(t2i4_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (FIREABLE(t3i2_3_2))) AND E (F (FIREABLE(t3i1_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U NOT FIREABLE(t3i2_3_2))) AND E(TRUE U FIREABLE(t3i1_3_3))))
lola: processed formula length: 82
lola: 7 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t3o_2_1) U NOT FIREABLE(tf_u_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT FIREABLE(t3o_2_1) U NOT FIREABLE(tf_u_2))
lola: processed formula length: 47
lola: 4 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (NOT(A (G (FIREABLE(t4i3_4_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U NOT FIREABLE(t4i3_4_1))))
lola: processed formula length: 47
lola: 11 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 13 will run for 1095 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(t3i1_3_2) OR (((FIREABLE(t2o_4_3) OR FIREABLE(t2o_4_4)) AND FIREABLE(t2i3_3_4)) AND E (X (FIREABLE(t4o_3_2))))) OR A (F (FIREABLE(t4i1_2_4)))) OR A ((A (X (FIREABLE(t1i4_4_2))) U E (G (FIREABLE(t4i1_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1095 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t3i1_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t3i1_3_2)
lola: processed formula length: 18
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t2o_4_3) OR FIREABLE(t2o_4_4)) AND FIREABLE(t2i3_3_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(t2o_4_3) OR FIREABLE(t2o_4_4)) AND FIREABLE(t2i3_3_4))
lola: processed formula length: 66
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t4i1_2_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t4i1_2_4))
lola: processed formula length: 28
lola: 4 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 14 will run for 1643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((FIREABLE(t4o_1_4) AND FIREABLE(t1i4_4_4) AND (FIREABLE(t1i2_2_2) OR FIREABLE(t2i4_4_2))))) OR A (F (FIREABLE(t4i1_3_4)))) OR (((E (F (FIREABLE(t4i3_4_1))) AND FIREABLE(t2i1_4_4)) AND (NOT FIREABLE(t1o_3_2) OR NOT FIREABLE(t1i4_2_1) OR (NOT FIREABLE(t1i2_3_1) AND NOT FIREABLE(t3o_3_1)))) AND ((FIREABLE(t1i2_4_4) OR (FIREABLE(t3i4_1_1) AND FIREABLE(t2i4_2_2) AND NOT FIREABLE(t1i2_2_2)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t4o_1_4) AND FIREABLE(t1i4_4_4) AND (FIREABLE(t1i2_2_2) OR FIREABLE(t2i4_4_2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t4i1_3_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t4i1_3_4))
lola: processed formula length: 28
lola: 5 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t2i1_4_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t2i1_4_4)
lola: processed formula length: 18
lola: 4 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((A (F (FIREABLE(t3i4_1_2))) AND E (G (FIREABLE(t2i3_2_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A(TRUE U FIREABLE(t3i4_1_2)) AND NOT(A(TRUE U NOT FIREABLE(t2i3_2_3))))))
lola: processed formula length: 87
lola: 15 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no yes yes no no yes yes no yes yes no unknown no yes
FORMULA SquareGrid-PT-040204-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496562556759
--------------------
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_SquareGrid-PT-040204"
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
tar xzf /home/mcc/BenchKit/INPUTS/S_SquareGrid-PT-040204.tgz
mv S_SquareGrid-PT-040204 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_SquareGrid-PT-040204, 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 r158-ebro-149443464000130"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;