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-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961900342
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496543129398


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


checking for too many tokens
===========================================================================================
DLCround-PT-10b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ DLCround-PT-10b @ 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: 10116/65536 symbol table entries, 2628 collisions
lola: preprocessing...
lola: finding significant places
lola: 3924 places, 6192 transitions, 3711 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 8844 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-10b-ReachabilityFireability.task
lola: E (F (FIREABLE(t4905))) : A (G (((FIREABLE(t1654) AND FIREABLE(t6008)) OR NOT FIREABLE(t5521) OR (FIREABLE(t2351) AND FIREABLE(t2362) AND NOT FIREABLE(t933)) OR (NOT FIREABLE(t2479) AND NOT FIREABLE(t4699) AND FIREABLE(t336) AND FIREABLE(t12) AND NOT FIREABLE(t3597))))) : A (G ((NOT FIREABLE(t2690) OR NOT FIREABLE(t2703) OR (NOT FIREABLE(t3713) AND NOT FIREABLE(t1413)) OR (NOT FIREABLE(t4874) AND NOT FIREABLE(t5104) AND FIREABLE(t289))))) : A (G ((NOT FIREABLE(t184) OR NOT FIREABLE(t1391) OR (NOT FIREABLE(t4694) AND NOT FIREABLE(t3524)) OR NOT FIREABLE(t1346)))) : E (F (FIREABLE(t3986))) : A (G ((NOT FIREABLE(t4818) AND NOT FIREABLE(t3225) AND (NOT FIREABLE(t5577) OR NOT FIREABLE(t608)) AND (NOT FIREABLE(t3661) OR NOT FIREABLE(t5771) OR NOT FIREABLE(t4181))))) : E (F ((FIREABLE(t1613) OR FIREABLE(t2165) OR (NOT FIREABLE(t2506) AND NOT FIREABLE(t2965) AND ((FIREABLE(t4158) AND FIREABLE(t4073)) OR FIREABLE(t1484)))))) : E (F (FIREABLE(t3401))) : A (G (NOT FIREABLE(t4840))) : A (G (((((FIREABLE(t4423) OR FIREABLE(t4713)) AND (FIREABLE(t4162) OR FIREABLE(t2773))) OR (NOT FIREABLE(t372) AND NOT FIREABLE(t4700))) AND (FIREABLE(t2840) OR FIREABLE(t5228) OR NOT FIREABLE(t3289))))) : E (F (FIREABLE(t5488))) : E (F ((NOT FIREABLE(t302) AND NOT FIREABLE(t829) AND FIREABLE(t3868) AND NOT FIREABLE(t680) AND NOT FIREABLE(t3840) AND NOT FIREABLE(t419)))) : E (F ((FIREABLE(t2965) AND (FIREABLE(t2044) OR (FIREABLE(t2481) AND FIREABLE(t4195))) AND (NOT FIREABLE(t2816) OR (FIREABLE(t3732) AND FIREABLE(t73))) AND NOT FIREABLE(t1054)))) : E (F (FIREABLE(t5185))) : E (F ((FIREABLE(t4332) AND FIREABLE(t3963) AND FIREABLE(t684) AND FIREABLE(t44) AND (NOT FIREABLE(t2921) OR (FIREABLE(t2129) AND FIREABLE(t5515))) AND (FIREABLE(t4625) OR FIREABLE(t6007))))) : E (F (FIREABLE(t3330)))
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(t4905)))
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 464 bytes per marking, with 1 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-10b-ReachabilityFireability.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t1654) AND FIREABLE(t6008)) OR NOT FIREABLE(t5521) OR (FIREABLE(t2351) AND FIREABLE(t2362) AND NOT FIREABLE(t933)) OR (NOT FIREABLE(t2479) AND NOT FIREABLE(t4699) AND FIREABLE(t336) AND FIREABLE(t12) AND NOT FIREABLE(t3597)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 464 bytes per marking, with 1 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-10b-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2690) OR NOT FIREABLE(t2703) OR (NOT FIREABLE(t3713) AND NOT FIREABLE(t1413)) OR (NOT FIREABLE(t4874) AND NOT FIREABLE(t5104) AND FIREABLE(t289)))))
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 464 bytes per marking, with 1 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 28 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-2.sara.
lola: sara is running 0 secs || 69727 markings, 76138 edges, 13945 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 129112 markings, 140989 edges, 11877 markings/sec, 5 secs
lola: sara is running 10 secs || 189801 markings, 207088 edges, 12138 markings/sec, 10 secs

lola: sara is running 15 secs || 253543 markings, 276516 edges, 12748 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t184) OR NOT FIREABLE(t1391) OR (NOT FIREABLE(t4694) AND NOT FIREABLE(t3524)) OR NOT FIREABLE(t1346))))
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 464 bytes per marking, with 1 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 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3986)))
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 464 bytes per marking, with 1 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-10b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t4818) AND NOT FIREABLE(t3225) AND (NOT FIREABLE(t5577) OR NOT FIREABLE(t608)) AND (NOT FIREABLE(t3661) OR NOT FIREABLE(t5771) OR NOT FIREABLE(t4181)))))
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 464 bytes per marking, with 1 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-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 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1613) OR FIREABLE(t2165) OR (NOT FIREABLE(t2506) AND NOT FIREABLE(t2965) AND ((FIREABLE(t4158) AND FIREABLE(t4073)) OR FIREABLE(t1484))))))
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 464 bytes per marking, with 1 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-6.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3401)))
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 464 bytes per marking, with 1 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-10b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-7.sara.
lola: sara is running 0 secs || 34074 markings, 43791 edges, 6815 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 69021 markings, 89276 edges, 6989 markings/sec, 5 secs
lola: sara is running 10 secs || 105070 markings, 136475 edges, 7210 markings/sec, 10 secs
lola: sara is running 15 secs || 140260 markings, 182593 edges, 7038 markings/sec, 15 secs
lola: sara is running 20 secs || 175375 markings, 229755 edges, 7023 markings/sec, 20 secs
lola: sara is running 25 secs || 208646 markings, 272823 edges, 6654 markings/sec, 25 secs
lola: sara is running 30 secs || 241643 markings, 315847 edges, 6599 markings/sec, 30 secs
lola: sara is running 35 secs || 274903 markings, 360093 edges, 6652 markings/sec, 35 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t4840)))
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 464 bytes per marking, with 1 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-10b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((FIREABLE(t4423) OR FIREABLE(t4713)) AND (FIREABLE(t4162) OR FIREABLE(t2773))) OR (NOT FIREABLE(t372) AND NOT FIREABLE(t4700))) AND (FIREABLE(t2840) OR FIREABLE(t5228) OR NOT FIREABLE(t3289)))))
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 464 bytes per marking, with 1 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 48 literals and 14 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5488)))
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 464 bytes per marking, with 1 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-10b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-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 695 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t302) AND NOT FIREABLE(t829) AND FIREABLE(t3868) AND NOT FIREABLE(t680) AND NOT FIREABLE(t3840) AND NOT FIREABLE(t419))))
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 464 bytes per marking, with 1 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 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-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 869 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2965) AND (FIREABLE(t2044) OR (FIREABLE(t2481) AND FIREABLE(t4195))) AND (NOT FIREABLE(t2816) OR (FIREABLE(t3732) AND FIREABLE(t73))) AND NOT FIREABLE(t1054))))
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 464 bytes per marking, with 1 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 22 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-12.sara.
lola: sara is running 0 secs || 35731 markings, 39918 edges, 7146 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 5)
lola: sara is running 5 secs || 70358 markings, 78760 edges, 6925 markings/sec, 5 secs
lola: sara is running 10 secs || 103763 markings, 116167 edges, 6681 markings/sec, 10 secs
lola: sara is running 15 secs || 139402 markings, 156428 edges, 7128 markings/sec, 15 secs
lola: sara is running 20 secs || 171722 markings, 192840 edges, 6464 markings/sec, 20 secs
lola: sara is running 25 secs || 204015 markings, 229656 edges, 6459 markings/sec, 25 secs
lola: sara is running 30 secs || 234791 markings, 264904 edges, 6155 markings/sec, 30 secs
lola: sara is running 35 secs || 269900 markings, 304685 edges, 7022 markings/sec, 35 secs
lola: sara is running 40 secs || 301332 markings, 340068 edges, 6286 markings/sec, 40 secs
lola: sara is running 45 secs || 336706 markings, 380500 edges, 7075 markings/sec, 45 secs
lola: sara is running 50 secs || 370830 markings, 419159 edges, 6825 markings/sec, 50 secs
lola: sara is running 55 secs || 404775 markings, 457180 edges, 6789 markings/sec, 55 secs
lola: sara is running 60 secs || 438090 markings, 494653 edges, 6663 markings/sec, 60 secs
lola: sara is running 65 secs || 471484 markings, 532736 edges, 6679 markings/sec, 65 secs
lola: sara is running 70 secs || 505314 markings, 571542 edges, 6766 markings/sec, 70 secs
lola: sara is running 75 secs || 538560 markings, 609174 edges, 6649 markings/sec, 75 secs
lola: sara is running 80 secs || 574974 markings, 650067 edges, 7283 markings/sec, 80 secs
lola: sara is running 85 secs || 610439 markings, 689913 edges, 7093 markings/sec, 85 secs
lola: sara is running 90 secs || 642776 markings, 726526 edges, 6467 markings/sec, 90 secs
lola: sara is running 95 secs || 678452 markings, 766939 edges, 7135 markings/sec, 95 secs
lola: sara is running 100 secs || 716044 markings, 809942 edges, 7518 markings/sec, 100 secs
lola: sara is running 105 secs || 750681 markings, 849988 edges, 6927 markings/sec, 105 secs
lola: sara is running 110 secs || 786747 markings, 891886 edges, 7213 markings/sec, 110 secs
lola: sara is running 115 secs || 822942 markings, 933753 edges, 7239 markings/sec, 115 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1117 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5185)))
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 464 bytes per marking, with 1 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-10b-ReachabilityFireability-13.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 14 will run for 1676 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4332) AND FIREABLE(t3963) AND FIREABLE(t684) AND FIREABLE(t44) AND (NOT FIREABLE(t2921) OR (FIREABLE(t2129) AND FIREABLE(t5515))) AND (FIREABLE(t4625) OR FIREABLE(t6007)))))
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 464 bytes per marking, with 1 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 40 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-14.sara.
lola: sara is running 0 secs || 127366 markings, 143707 edges, 25473 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 248932 markings, 280983 edges, 24313 markings/sec, 5 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3330)))
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 464 bytes per marking, with 1 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-10b-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: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes no yes yes no no yes yes yes yes yes yes
FORMULA DLCround-PT-10b-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496543331309

--------------------
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-10b"
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-10b.tgz
mv DLCround-PT-10b 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-10b, 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-149580961900342"
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 ;