fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r178-csrt-149580961900360
Last Updated
June 27, 2017

About the Execution of LoLA for DLCround-PT-11b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2075.660 120876.00 240102.00 19.90 TFTTTFTTFTFFTFTT 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-3254
Executing tool lola
Input is DLCround-PT-11b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961900360
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496544291860


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DLCround-PT-11b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DLCround-PT-11b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ DLCround-PT-11b @ 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: 11366/65536 symbol table entries, 3163 collisions
lola: preprocessing...
lola: finding significant places
lola: 4375 places, 6991 transitions, 4131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10066 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-11b-ReachabilityFireability.task
lola: E (F ((FIREABLE(t949) AND FIREABLE(t4476)))) : A (G (((NOT FIREABLE(t4310) AND NOT FIREABLE(t4952)) OR FIREABLE(t584) OR NOT FIREABLE(t4586)))) : A (G (((FIREABLE(t4840) AND FIREABLE(t6696)) OR NOT FIREABLE(t5359)))) : E (F (((FIREABLE(t5128) AND FIREABLE(t234)) OR FIREABLE(t4791) OR ((FIREABLE(t6323) OR FIREABLE(t2257) OR NOT FIREABLE(t3341)) AND (FIREABLE(t2505) OR FIREABLE(t3278) OR FIREABLE(t81)))))) : A (G ((NOT FIREABLE(t4178) OR FIREABLE(t2633) OR FIREABLE(t628) OR FIREABLE(t2715)))) : A (G (((FIREABLE(t489) AND FIREABLE(t3879) AND (FIREABLE(t1445) OR FIREABLE(t513))) OR (FIREABLE(t6077) AND FIREABLE(t6278) AND (FIREABLE(t1393) OR FIREABLE(t1191))) OR (NOT FIREABLE(t6108) AND (NOT FIREABLE(t5886) OR FIREABLE(t4681)))))) : E (F (FIREABLE(t4860))) : A (G ((FIREABLE(t3172) OR NOT FIREABLE(t4557) OR (NOT FIREABLE(t4200) AND NOT FIREABLE(t6260)) OR FIREABLE(t571)))) : E (F ((FIREABLE(t1015) AND FIREABLE(t1329) AND NOT FIREABLE(t5281)))) : E (F (FIREABLE(t5441))) : E (F (FIREABLE(t5437))) : E (F ((((NOT FIREABLE(t1341) OR (FIREABLE(t6303) AND FIREABLE(t4159))) AND (FIREABLE(t1192) OR FIREABLE(t5625) OR FIREABLE(t6926))) OR (FIREABLE(t6001) AND (FIREABLE(t1333) OR FIREABLE(t3925)) AND FIREABLE(t4090))))) : E (F ((FIREABLE(t988) OR (FIREABLE(t5071) AND (NOT FIREABLE(t2684) OR NOT FIREABLE(t3833)))))) : A (G (((FIREABLE(t5749) AND FIREABLE(t4089) AND NOT FIREABLE(t3777)) OR (NOT FIREABLE(t1504) AND NOT FIREABLE(t3493)) OR FIREABLE(t3777)))) : E (F ((FIREABLE(t2132) OR FIREABLE(t5326)))) : E (F (FIREABLE(t1656)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t949) AND FIREABLE(t4476))))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t4310) AND NOT FIREABLE(t4952)) OR FIREABLE(t584) OR NOT FIREABLE(t4586))))
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 520 bytes per marking, with 29 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t4840) AND FIREABLE(t6696)) OR NOT FIREABLE(t5359))))
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 520 bytes per marking, with 29 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t5128) AND FIREABLE(t234)) OR FIREABLE(t4791) OR ((FIREABLE(t6323) OR FIREABLE(t2257) OR NOT FIREABLE(t3341)) AND (FIREABLE(t2505) OR FIREABLE(t3278) OR FIREABLE(t81))))))
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 520 bytes per marking, with 29 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 26 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t4178) OR FIREABLE(t2633) OR FIREABLE(t628) OR FIREABLE(t2715))))
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 520 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t489) AND FIREABLE(t3879) AND (FIREABLE(t1445) OR FIREABLE(t513))) OR (FIREABLE(t6077) AND FIREABLE(t6278) AND (FIREABLE(t1393) OR FIREABLE(t1191))) OR (NOT FIREABLE(t6108) AND (NOT FIREABLE(t5886) OR FIREABLE(t4681))))))
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 520 bytes per marking, with 29 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 234 literals and 45 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4860)))
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 520 bytes per marking, with 29 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: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t3172) OR NOT FIREABLE(t4557) OR (NOT FIREABLE(t4200) AND NOT FIREABLE(t6260)) OR FIREABLE(t571))))
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 520 bytes per marking, with 29 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 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-7.sara.
lola: sara is running 0 secs || 28117 markings, 33446 edges, 5623 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 57152 markings, 68456 edges, 5807 markings/sec, 5 secs
lola: sara is running 10 secs || 84765 markings, 101845 edges, 5523 markings/sec, 10 secs
lola: sara is running 15 secs || 111545 markings, 133978 edges, 5356 markings/sec, 15 secs
lola: sara is running 20 secs || 138836 markings, 167135 edges, 5458 markings/sec, 20 secs
lola: sara is running 25 secs || 165683 markings, 199361 edges, 5369 markings/sec, 25 secs
lola: sara is running 30 secs || 193170 markings, 232737 edges, 5497 markings/sec, 30 secs
lola: sara is running 35 secs || 220061 markings, 265038 edges, 5378 markings/sec, 35 secs
lola: sara is running 40 secs || 247340 markings, 298179 edges, 5456 markings/sec, 40 secs
lola: sara is running 45 secs || 274029 markings, 330200 edges, 5338 markings/sec, 45 secs
lola: sara is running 50 secs || 299594 markings, 362258 edges, 5113 markings/sec, 50 secs
lola: sara is running 55 secs || 325611 markings, 395005 edges, 5203 markings/sec, 55 secs
lola: sara is running 60 secs || 354163 markings, 430953 edges, 5710 markings/sec, 60 secs
lola: sara is running 65 secs || 381599 markings, 465333 edges, 5487 markings/sec, 65 secs
lola: sara is running 70 secs || 409321 markings, 502116 edges, 5544 markings/sec, 70 secs
lola: sara is running 75 secs || 436623 markings, 537257 edges, 5460 markings/sec, 75 secs
lola: sara is running 80 secs || 463509 markings, 572022 edges, 5377 markings/sec, 80 secs
lola: sara is running 85 secs || 488788 markings, 604030 edges, 5056 markings/sec, 85 secs
lola: sara is running 90 secs || 514897 markings, 637385 edges, 5222 markings/sec, 90 secs
lola: sara is running 95 secs || 542302 markings, 672236 edges, 5481 markings/sec, 95 secs
lola: sara is running 100 secs || 570827 markings, 709613 edges, 5705 markings/sec, 100 secs
lola: sara is running 105 secs || 599300 markings, 746527 edges, 5695 markings/sec, 105 secs
lola: sara is running 110 secs || 628451 markings, 784526 edges, 5830 markings/sec, 110 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1015) AND FIREABLE(t1329) AND NOT FIREABLE(t5281))))
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 520 bytes per marking, with 29 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5441)))
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 520 bytes per marking, with 29 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: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 569 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5437)))
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 520 bytes per marking, with 29 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: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 683 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(t1341) OR (FIREABLE(t6303) AND FIREABLE(t4159))) AND (FIREABLE(t1192) OR FIREABLE(t5625) OR FIREABLE(t6926))) OR (FIREABLE(t6001) AND (FIREABLE(t1333) OR FIREABLE(t3925)) AND FIREABLE(t4090)))))
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 520 bytes per marking, with 29 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 30 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 854 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t988) OR (FIREABLE(t5071) AND (NOT FIREABLE(t2684) OR NOT FIREABLE(t3833))))))
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 520 bytes per marking, with 29 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1139 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t5749) AND FIREABLE(t4089) AND NOT FIREABLE(t3777)) OR (NOT FIREABLE(t1504) AND NOT FIREABLE(t3493)) OR FIREABLE(t3777))))
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 520 bytes per marking, with 29 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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1709 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2132) OR FIREABLE(t5326))))
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 520 bytes per marking, with 29 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1656)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: yes no no yes no no yes no yes yes yes yes yes no yes yes
lola: ========================================
FORMULA DLCround-PT-11b-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496544412736

--------------------
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="DLCround-PT-11b"
export BK_EXAMINATION="ReachabilityFireability"
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/DLCround-PT-11b.tgz
mv DLCround-PT-11b execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is DLCround-PT-11b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-csrt-149580961900360"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;