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 S_AutoFlight-PT-96b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074300286
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496339643548


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


checking for too many tokens
===========================================================================================
S_AutoFlight-PT-96b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_AutoFlight-PT-96b @ 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: 15762/65536 symbol table entries, 5176 collisions
lola: preprocessing...
lola: finding significant places
lola: 7894 places, 7868 transitions, 7380 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 8694 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-96b-ReachabilityCardinality.task
lola: E (F ((((p6509 <= p7740) OR (p2895 <= p7865) OR (p4531 <= p4182)) AND (3 <= p7588)))) : E (F (((2 <= p6978) AND ((p4773 <= p1316) OR (2 <= p4405) OR ((2 <= p7063) AND (2 <= p4052)))))) : A (G (((p6242 <= p5285) OR (p7876 <= p6000) OR (3 <= p3576)))) : A (G (((p6117 <= 0) OR ((1 <= p1269) AND (3 <= p3923)) OR ((p2061 <= p4281) AND (p1669 <= p7208)) OR (3 <= p6956)))) : A (G ((p2193 <= 1))) : E (F ((((p4274 + 1 <= p1450) OR (p4840 <= 2)) AND ((3 <= p7515) OR (1 <= p318) OR (2 <= p6666))))) : E (F (((p5570 + 1 <= p5577) AND (p4841 + 1 <= p5312) AND (p6389 <= 2)))) : A (G (((p4698 <= p5468) OR (p2161 <= p5138)))) : E (F (((2 <= p6908) AND (p3720 <= p5620) AND (1 <= p470) AND (p6806 <= p1247)))) : A (G (((p2830 <= p4825) OR (1 <= p1169) OR ((3 <= p4135) AND (2 <= p7003)) OR (p2864 <= p1185)))) : A (G (((p1457 + 1 <= p5480) OR (p5713 <= 0) OR (p2757 + 1 <= p4313)))) : A (G ((p3526 <= p6589))) : A (G ((p4173 <= p2183))) : A (G ((p2448 <= p3549))) : E (F (((p4733 + 1 <= p1528) OR (p297 + 1 <= p3256) OR (p453 + 1 <= p6563)))) : A (G ((p3247 <= p5184)))
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 ((((p6509 <= p7740) OR (p2895 <= p7865) OR (p4531 <= p4182)) AND (3 <= p7588))))
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 924 bytes per marking, with 12 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 3 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-96b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 58598 markings, 76129 edges, 11720 markings/sec, 0 secs
lola: sara is running 5 secs || 117162 markings, 152652 edges, 11713 markings/sec, 5 secs
lola: sara is running 10 secs || 174794 markings, 247722 edges, 11526 markings/sec, 10 secs
lola: sara is running 15 secs || 223943 markings, 361084 edges, 9830 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 273834 markings, 476182 edges, 9978 markings/sec, 20 secs
lola: sara is running 25 secs || 323977 markings, 591844 edges, 10029 markings/sec, 25 secs
lola: sara is running 30 secs || 373724 markings, 706583 edges, 9949 markings/sec, 30 secs
lola: sara is running 35 secs || 423261 markings, 820860 edges, 9907 markings/sec, 35 secs
lola: sara is running 40 secs || 470311 markings, 937455 edges, 9410 markings/sec, 40 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p6978) AND ((p4773 <= p1316) OR (2 <= p4405) OR ((2 <= p7063) AND (2 <= p4052))))))
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 924 bytes per marking, with 12 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 AutoFlight-PT-96b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 65488 markings, 85136 edges, 13098 markings/sec, 0 secs
lola: sara is running 5 secs || 131130 markings, 170902 edges, 13128 markings/sec, 5 secs
lola: sara is running 10 secs || 189045 markings, 280602 edges, 11583 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 237204 markings, 391683 edges, 9632 markings/sec, 15 secs
lola: sara is running 20 secs || 287344 markings, 507338 edges, 10028 markings/sec, 20 secs
lola: sara is running 25 secs || 338990 markings, 626463 edges, 10329 markings/sec, 25 secs
lola: sara is running 30 secs || 389840 markings, 743752 edges, 10170 markings/sec, 30 secs
lola: sara is running 35 secs || 441437 markings, 862771 edges, 10319 markings/sec, 35 secs

lola: sara is running 40 secs || 488256 markings, 996817 edges, 9364 markings/sec, 40 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p6242 <= p5285) OR (p7876 <= p6000) OR (3 <= p3576))))
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 924 bytes per marking, with 12 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 AutoFlight-PT-96b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-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 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p6117 <= 0) OR ((1 <= p1269) AND (3 <= p3923)) OR ((p2061 <= p4281) AND (p1669 <= p7208)) OR (3 <= p6956))))
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 924 bytes per marking, with 12 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-96b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-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 287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2193 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 924 bytes per marking, with 12 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 AutoFlight-PT-96b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 59518 markings, 77124 edges, 11904 markings/sec, 0 secs
lola: sara is running 5 secs || 122095 markings, 158884 edges, 12515 markings/sec, 5 secs
lola: sara is running 10 secs || 176812 markings, 251488 edges, 10943 markings/sec, 10 secs
lola: sara is running 15 secs || 226126 markings, 365249 edges, 9863 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 275534 markings, 479208 edges, 9882 markings/sec, 20 secs

lola: sara is running 25 secs || 324791 markings, 592837 edges, 9851 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p4274 + 1 <= p1450) OR (p4840 <= 2)) AND ((3 <= p7515) OR (1 <= p318) OR (2 <= p6666)))))
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 924 bytes per marking, with 12 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 6 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-96b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p5570 + 1 <= p5577) AND (p4841 + 1 <= p5312) AND (p6389 <= 2))))
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 924 bytes per marking, with 12 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 AutoFlight-PT-96b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 50957 markings, 114888 edges, 10191 markings/sec, 0 secs
lola: sara is running 5 secs || 101739 markings, 231770 edges, 10156 markings/sec, 5 secs
lola: sara is running 10 secs || 152464 markings, 348306 edges, 10145 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 204330 markings, 467563 edges, 10373 markings/sec, 15 secs
lola: sara is running 20 secs || 257207 markings, 588991 edges, 10575 markings/sec, 20 secs
lola: sara is running 25 secs || 306089 markings, 701552 edges, 9776 markings/sec, 25 secs
lola: sara is running 30 secs || 356971 markings, 818736 edges, 10176 markings/sec, 30 secs
lola: sara is running 35 secs || 406576 markings, 932730 edges, 9921 markings/sec, 35 secs
lola: sara is running 40 secs || 454941 markings, 1043913 edges, 9673 markings/sec, 40 secs
lola: sara is running 45 secs || 506628 markings, 1162579 edges, 10337 markings/sec, 45 secs
lola: sara is running 50 secs || 557849 markings, 1280485 edges, 10244 markings/sec, 50 secs
lola: sara is running 55 secs || 607394 markings, 1394317 edges, 9909 markings/sec, 55 secs
lola: sara is running 60 secs || 657017 markings, 1508587 edges, 9925 markings/sec, 60 secs
lola: sara is running 65 secs || 708821 markings, 1627805 edges, 10361 markings/sec, 65 secs
lola: sara is running 70 secs || 761676 markings, 1749351 edges, 10571 markings/sec, 70 secs
lola: sara is running 75 secs || 814492 markings, 1870748 edges, 10563 markings/sec, 75 secs
lola: sara is running 80 secs || 867072 markings, 1991484 edges, 10516 markings/sec, 80 secs
lola: sara is running 85 secs || 918447 markings, 2109979 edges, 10275 markings/sec, 85 secs
lola: sara is running 90 secs || 968276 markings, 2224522 edges, 9966 markings/sec, 90 secs
lola: sara is running 95 secs || 1017918 markings, 2338377 edges, 9928 markings/sec, 95 secs
lola: sara is running 100 secs || 1067570 markings, 2452762 edges, 9930 markings/sec, 100 secs
lola: sara is running 105 secs || 1117434 markings, 2567326 edges, 9973 markings/sec, 105 secs
lola: sara is running 110 secs || 1167085 markings, 2681518 edges, 9930 markings/sec, 110 secs
lola: sara is running 115 secs || 1216580 markings, 2795250 edges, 9899 markings/sec, 115 secs
lola: sara is running 120 secs || 1266082 markings, 2909346 edges, 9900 markings/sec, 120 secs
lola: sara is running 125 secs || 1315712 markings, 3023426 edges, 9926 markings/sec, 125 secs
lola: sara is running 130 secs || 1365010 markings, 3136752 edges, 9860 markings/sec, 130 secs
lola: sara is running 135 secs || 1412242 markings, 3245540 edges, 9446 markings/sec, 135 secs
lola: sara is running 140 secs || 1461157 markings, 3357969 edges, 9783 markings/sec, 140 secs
lola: sara is running 145 secs || 1509948 markings, 3470150 edges, 9758 markings/sec, 145 secs
lola: sara is running 150 secs || 1557868 markings, 3580267 edges, 9584 markings/sec, 150 secs
lola: sara is running 155 secs || 1607441 markings, 3694282 edges, 9915 markings/sec, 155 secs
lola: sara is running 160 secs || 1657004 markings, 3808414 edges, 9913 markings/sec, 160 secs
lola: sara is running 165 secs || 1707138 markings, 3923640 edges, 10027 markings/sec, 165 secs
lola: sara is running 170 secs || 1756658 markings, 4037615 edges, 9904 markings/sec, 170 secs
lola: sara is running 175 secs || 1806272 markings, 4151506 edges, 9923 markings/sec, 175 secs
lola: sara is running 180 secs || 1855709 markings, 4265126 edges, 9887 markings/sec, 180 secs
lola: sara is running 185 secs || 1904954 markings, 4378360 edges, 9849 markings/sec, 185 secs
lola: sara is running 190 secs || 1954242 markings, 4491731 edges, 9858 markings/sec, 190 secs
lola: sara is running 195 secs || 2002496 markings, 4602790 edges, 9651 markings/sec, 195 secs
lola: sara is running 200 secs || 2051861 markings, 4716257 edges, 9873 markings/sec, 200 secs
lola: sara is running 205 secs || 2104079 markings, 4836580 edges, 10444 markings/sec, 205 secs
lola: sara is running 210 secs || 2155371 markings, 4954457 edges, 10258 markings/sec, 210 secs
lola: sara is running 215 secs || 2206236 markings, 5071364 edges, 10173 markings/sec, 215 secs
lola: sara is running 220 secs || 2257224 markings, 5188346 edges, 10198 markings/sec, 220 secs
lola: sara is running 225 secs || 2309835 markings, 5309746 edges, 10522 markings/sec, 225 secs
lola: sara is running 230 secs || 2361807 markings, 5429128 edges, 10394 markings/sec, 230 secs
lola: sara is running 235 secs || 2415160 markings, 5551701 edges, 10671 markings/sec, 235 secs
lola: sara is running 240 secs || 2468682 markings, 5674974 edges, 10704 markings/sec, 240 secs
lola: sara is running 245 secs || 2518646 markings, 5789576 edges, 9993 markings/sec, 245 secs
lola: sara is running 250 secs || 2569439 markings, 5906623 edges, 10159 markings/sec, 250 secs
lola: sara is running 255 secs || 2619382 markings, 6021536 edges, 9989 markings/sec, 255 secs
lola: sara is running 260 secs || 2669393 markings, 6136516 edges, 10002 markings/sec, 260 secs
lola: sara is running 265 secs || 2719425 markings, 6251427 edges, 10006 markings/sec, 265 secs
lola: sara is running 270 secs || 2769082 markings, 6365542 edges, 9931 markings/sec, 270 secs
lola: sara is running 275 secs || 2818312 markings, 6479060 edges, 9846 markings/sec, 275 secs
lola: sara is running 280 secs || 2867247 markings, 6591499 edges, 9787 markings/sec, 280 secs
lola: sara is running 285 secs || 2918557 markings, 6709733 edges, 10262 markings/sec, 285 secs
lola: sara is running 290 secs || 2969550 markings, 6827136 edges, 10199 markings/sec, 290 secs
lola: sara is running 295 secs || 3021319 markings, 6945888 edges, 10354 markings/sec, 295 secs
lola: sara is running 300 secs || 3071014 markings, 7060305 edges, 9939 markings/sec, 300 secs
lola: sara is running 305 secs || 3121941 markings, 7177166 edges, 10185 markings/sec, 305 secs
lola: sara is running 310 secs || 3173103 markings, 7294950 edges, 10232 markings/sec, 310 secs
lola: sara is running 315 secs || 3224150 markings, 7412508 edges, 10209 markings/sec, 315 secs
lola: sara is running 320 secs || 3274147 markings, 7527218 edges, 9999 markings/sec, 320 secs
lola: sara is running 325 secs || 3324885 markings, 7644013 edges, 10148 markings/sec, 325 secs
lola: sara is running 330 secs || 3376724 markings, 7763199 edges, 10368 markings/sec, 330 secs
lola: sara is running 335 secs || 3428670 markings, 7882624 edges, 10389 markings/sec, 335 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p4698 <= p5468) OR (p2161 <= p5138))))
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 924 bytes per marking, with 12 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 AutoFlight-PT-96b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 48983 markings, 107882 edges, 9797 markings/sec, 0 secs
lola: sara is running 5 secs || 102869 markings, 229117 edges, 10777 markings/sec, 5 secs
lola: sara is running 10 secs || 152047 markings, 339620 edges, 9836 markings/sec, 10 secs
lola: sara is running 15 secs || 200682 markings, 448887 edges, 9727 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 20 secs || 250043 markings, 559801 edges, 9872 markings/sec, 20 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 380 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p6908) AND (p3720 <= p5620) AND (1 <= p470) AND (p6806 <= p1247))))
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 924 bytes per marking, with 12 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 AutoFlight-PT-96b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 59950 markings, 77523 edges, 11990 markings/sec, 0 secs
lola: sara is running 5 secs || 118621 markings, 154184 edges, 11734 markings/sec, 5 secs
lola: sara is running 10 secs || 173839 markings, 243771 edges, 11044 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 224356 markings, 360308 edges, 10103 markings/sec, 15 secs
lola: sara is running 20 secs || 274291 markings, 475473 edges, 9987 markings/sec, 20 secs

lola: sara is running 25 secs || 321137 markings, 583545 edges, 9369 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 9 will run for 430 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2830 <= p4825) OR (1 <= p1169) OR ((3 <= p4135) AND (2 <= p7003)) OR (p2864 <= p1185))))
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 924 bytes per marking, with 12 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-96b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-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 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1457 + 1 <= p5480) OR (p5713 <= 0) OR (p2757 + 1 <= p4313))))
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 924 bytes per marking, with 12 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 AutoFlight-PT-96b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 603 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3526 <= p6589)))
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 924 bytes per marking, with 12 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 AutoFlight-PT-96b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 754 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p4173 <= p2183)))
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 924 bytes per marking, with 12 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 AutoFlight-PT-96b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1005 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2448 <= p3549)))
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 924 bytes per marking, with 12 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 AutoFlight-PT-96b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-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 1508 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p4733 + 1 <= p1528) OR (p297 + 1 <= p3256) OR (p453 + 1 <= p6563))))
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 924 bytes per marking, with 12 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 3 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-96b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3015 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3247 <= p5184)))
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 924 bytes per marking, with 12 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 AutoFlight-PT-96b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-96b-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes unknown no no no no no no no yes no
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-96b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496340168103

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_AutoFlight-PT-96b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_AutoFlight-PT-96b.tgz
mv S_AutoFlight-PT-96b 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 S_AutoFlight-PT-96b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-csrt-149441074300286"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;