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 FlexibleBarrier-PT-18b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034400144
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496496651805


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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-18b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ FlexibleBarrier-PT-18b @ 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: 9407/65536 symbol table entries, 2286 collisions
lola: preprocessing...
lola: finding significant places
lola: 4370 places, 5037 transitions, 4350 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5075 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-18b-ReachabilityFireability.task
lola: A (G (((FIREABLE(t2217) AND ((FIREABLE(t2344) AND FIREABLE(t1525)) OR NOT FIREABLE(t4710))) OR NOT FIREABLE(t2238)))) : E (F ((FIREABLE(t658) OR (FIREABLE(t3848) AND FIREABLE(t4003))))) : E (F (FIREABLE(t3743))) : E (F ((NOT FIREABLE(t3314) AND NOT FIREABLE(t1561) AND FIREABLE(t3178)))) : E (F (((NOT FIREABLE(t2271) OR NOT FIREABLE(t4736) OR NOT FIREABLE(t2120)) AND FIREABLE(t2563)))) : E (F (FIREABLE(t3397))) : E (F (FIREABLE(t2099))) : E (F (FIREABLE(t1420))) : E (F (FIREABLE(t1026))) : E (F ((FIREABLE(t2238) AND FIREABLE(t3351) AND FIREABLE(t4327) AND (FIREABLE(t2908) OR FIREABLE(t1917) OR FIREABLE(t3478)) AND (FIREABLE(t1125) OR FIREABLE(t2000) OR NOT FIREABLE(t3363) OR (NOT FIREABLE(t147) AND (FIREABLE(t3171) OR FIREABLE(t2946))))))) : E (F (FIREABLE(t4575))) : E (F (((FIREABLE(t1617) OR (FIREABLE(t923) AND FIREABLE(t4255) AND FIREABLE(t1310))) AND FIREABLE(t3050)))) : E (F (FIREABLE(t1153))) : E (F (FIREABLE(t4199))) : E (F (((FIREABLE(t516) OR (FIREABLE(t4222) AND FIREABLE(t411))) AND FIREABLE(t1100) AND (FIREABLE(t3724) OR FIREABLE(t3748)) AND NOT FIREABLE(t904) AND NOT FIREABLE(t363) AND NOT FIREABLE(t4798)))) : E (F ((FIREABLE(t4354) AND FIREABLE(t366) AND FIREABLE(t1374) AND FIREABLE(t1729) AND (FIREABLE(t4599) OR (NOT FIREABLE(t3867) AND (FIREABLE(t4467) OR FIREABLE(t5026)))))))
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 (G (((FIREABLE(t2217) AND ((FIREABLE(t2344) AND FIREABLE(t1525)) OR NOT FIREABLE(t4710))) OR NOT FIREABLE(t2238))))
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 544 bytes per marking, with 2 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 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability.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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t658) OR (FIREABLE(t3848) AND FIREABLE(t4003)))))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3743)))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 45511 markings, 82241 edges, 9102 markings/sec, 0 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t3314) AND NOT FIREABLE(t1561) AND FIREABLE(t3178))))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-3.sara.
lola: sara is running 0 secs || 48094 markings, 87591 edges, 9619 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 95245 markings, 173942 edges, 9430 markings/sec, 5 secs
lola: sara is running 10 secs || 141700 markings, 260327 edges, 9291 markings/sec, 10 secs
lola: sara is running 15 secs || 189040 markings, 346654 edges, 9468 markings/sec, 15 secs
lola: sara is running 20 secs || 235059 markings, 432581 edges, 9204 markings/sec, 20 secs
lola: sara is running 25 secs || 278732 markings, 527666 edges, 8735 markings/sec, 25 secs
lola: sara is running 30 secs || 315608 markings, 658943 edges, 7375 markings/sec, 30 secs
lola: sara is running 35 secs || 352746 markings, 791729 edges, 7428 markings/sec, 35 secs
lola: sara is running 40 secs || 387767 markings, 929038 edges, 7004 markings/sec, 40 secs
lola: sara is running 45 secs || 419183 markings, 1026331 edges, 6283 markings/sec, 45 secs
lola: sara is running 50 secs || 453754 markings, 1170185 edges, 6914 markings/sec, 50 secs
lola: sara is running 55 secs || 487686 markings, 1311031 edges, 6786 markings/sec, 55 secs
lola: sara is running 60 secs || 524791 markings, 1418730 edges, 7421 markings/sec, 60 secs
lola: sara is running 65 secs || 569598 markings, 1509339 edges, 8961 markings/sec, 65 secs
lola: sara is running 70 secs || 614720 markings, 1600556 edges, 9024 markings/sec, 70 secs
lola: sara is running 75 secs || 659698 markings, 1691455 edges, 8996 markings/sec, 75 secs
lola: sara is running 80 secs || 705132 markings, 1783373 edges, 9087 markings/sec, 80 secs
lola: sara is running 85 secs || 750513 markings, 1875214 edges, 9076 markings/sec, 85 secs
lola: sara is running 90 secs || 795327 markings, 1965954 edges, 8963 markings/sec, 90 secs
lola: sara is running 95 secs || 834689 markings, 2069296 edges, 7872 markings/sec, 95 secs
lola: sara is running 100 secs || 868642 markings, 2189640 edges, 6791 markings/sec, 100 secs
lola: sara is running 105 secs || 898119 markings, 2294257 edges, 5895 markings/sec, 105 secs
lola: sara is running 110 secs || 930622 markings, 2428446 edges, 6501 markings/sec, 110 secs
lola: sara is running 115 secs || 963895 markings, 2570542 edges, 6655 markings/sec, 115 secs
lola: sara is running 120 secs || 996331 markings, 2709807 edges, 6487 markings/sec, 120 secs
lola: sara is running 125 secs || 1033568 markings, 2833775 edges, 7447 markings/sec, 125 secs
lola: sara is running 130 secs || 1078446 markings, 2924480 edges, 8976 markings/sec, 130 secs
lola: sara is running 135 secs || 1122479 markings, 3013848 edges, 8807 markings/sec, 135 secs
lola: sara is running 140 secs || 1166462 markings, 3104156 edges, 8797 markings/sec, 140 secs
lola: sara is running 145 secs || 1210630 markings, 3193224 edges, 8834 markings/sec, 145 secs
lola: sara is running 150 secs || 1254949 markings, 3281943 edges, 8864 markings/sec, 150 secs
lola: sara is running 155 secs || 1299578 markings, 3372298 edges, 8926 markings/sec, 155 secs
lola: sara is running 160 secs || 1337029 markings, 3474867 edges, 7490 markings/sec, 160 secs
lola: sara is running 165 secs || 1370098 markings, 3592294 edges, 6614 markings/sec, 165 secs
lola: sara is running 170 secs || 1403475 markings, 3710574 edges, 6675 markings/sec, 170 secs
lola: sara is running 175 secs || 1435708 markings, 3847681 edges, 6447 markings/sec, 175 secs
lola: sara is running 180 secs || 1468014 markings, 3986117 edges, 6461 markings/sec, 180 secs
lola: sara is running 185 secs || 1498556 markings, 4127524 edges, 6108 markings/sec, 185 secs
lola: sara is running 190 secs || 1536337 markings, 4236903 edges, 7556 markings/sec, 190 secs
lola: sara is running 195 secs || 1581125 markings, 4327474 edges, 8958 markings/sec, 195 secs
lola: sara is running 200 secs || 1625720 markings, 4417647 edges, 8919 markings/sec, 200 secs
lola: sara is running 205 secs || 1670556 markings, 4508303 edges, 8967 markings/sec, 205 secs
lola: sara is running 210 secs || 1716261 markings, 4600791 edges, 9141 markings/sec, 210 secs
lola: sara is running 215 secs || 1762079 markings, 4693523 edges, 9164 markings/sec, 215 secs
lola: sara is running 220 secs || 1806888 markings, 4784261 edges, 8962 markings/sec, 220 secs
lola: sara is running 225 secs || 1844415 markings, 4898379 edges, 7505 markings/sec, 225 secs
lola: sara is running 230 secs || 1878683 markings, 5020360 edges, 6854 markings/sec, 230 secs
lola: sara is running 235 secs || 1912602 markings, 5147193 edges, 6784 markings/sec, 235 secs
lola: sara is running 240 secs || 1945087 markings, 5284532 edges, 6497 markings/sec, 240 secs
lola: sara is running 245 secs || 1978057 markings, 5423380 edges, 6594 markings/sec, 245 secs
lola: sara is running 250 secs || 2010306 markings, 5571457 edges, 6450 markings/sec, 250 secs
lola: sara is running 255 secs || 2052678 markings, 5667137 edges, 8474 markings/sec, 255 secs
lola: sara is running 260 secs || 2096892 markings, 5756490 edges, 8843 markings/sec, 260 secs
lola: sara is running 265 secs || 2142164 markings, 5848102 edges, 9054 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t2271) OR NOT FIREABLE(t4736) OR NOT FIREABLE(t2120)) AND FIREABLE(t2563))))
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 544 bytes per marking, with 2 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 5 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3397)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2099)))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-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 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1420)))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1026)))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2238) AND FIREABLE(t3351) AND FIREABLE(t4327) AND (FIREABLE(t2908) OR FIREABLE(t1917) OR FIREABLE(t3478)) AND (FIREABLE(t1125) OR FIREABLE(t2000) OR NOT FIREABLE(t3363) OR (NOT FIREABLE(t147) AND (FIREABLE(t3171) OR FIREABLE(t2946)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 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 96 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-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 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4575)))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1617) OR (FIREABLE(t923) AND FIREABLE(t4255) AND FIREABLE(t1310))) AND FIREABLE(t3050))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-11.sara.
lola: sara is running 0 secs || 44485 markings, 87901 edges, 8897 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 813 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1153)))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 43864 markings, 85916 edges, 8773 markings/sec, 0 secs
lola: sara is running 5 secs || 85884 markings, 180725 edges, 8404 markings/sec, 5 secs
lola: sara is running 10 secs || 127743 markings, 274949 edges, 8372 markings/sec, 10 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1078 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4199)))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1617 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t516) OR (FIREABLE(t4222) AND FIREABLE(t411))) AND FIREABLE(t1100) AND (FIREABLE(t3724) OR FIREABLE(t3748)) AND NOT FIREABLE(t904) AND NOT FIREABLE(t363) AND NOT FIREABLE(t4798))))
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 544 bytes per marking, with 2 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 78 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-14.sara.
lola: sara is running 0 secs || 43120 markings, 84110 edges, 8624 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 85671 markings, 180082 edges, 8510 markings/sec, 5 secs
lola: sara is running 10 secs || 127937 markings, 275296 edges, 8453 markings/sec, 10 secs
lola: sara is running 15 secs || 171898 markings, 361940 edges, 8792 markings/sec, 15 secs
lola: sara is running 20 secs || 216035 markings, 449010 edges, 8827 markings/sec, 20 secs
lola: sara is running 25 secs || 259928 markings, 535792 edges, 8779 markings/sec, 25 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3202 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4354) AND FIREABLE(t366) AND FIREABLE(t1374) AND FIREABLE(t1729) AND (FIREABLE(t4599) OR (NOT FIREABLE(t3867) AND (FIREABLE(t4467) OR FIREABLE(t5026)))))))
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 544 bytes per marking, with 2 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 24 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-15.sara.
lola: sara is running 0 secs || 41519 markings, 105255 edges, 8304 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 81555 markings, 214882 edges, 8007 markings/sec, 5 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes unknown yes yes yes yes yes yes yes yes yes yes no no
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496497004243

--------------------
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="FlexibleBarrier-PT-18b"
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/FlexibleBarrier-PT-18b.tgz
mv FlexibleBarrier-PT-18b 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 FlexibleBarrier-PT-18b, 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 r188-blw3-149581034400144"
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 ;