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

--------------------
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 1494604906714


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ 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 || 60185 markings, 78200 edges, 12037 markings/sec, 0 secs
lola: sara is running 5 secs || 122686 markings, 159872 edges, 12500 markings/sec, 5 secs
lola: sara is running 10 secs || 181049 markings, 262142 edges, 11673 markings/sec, 10 secs
lola: sara is running 15 secs || 232718 markings, 381325 edges, 10334 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 283523 markings, 498520 edges, 10161 markings/sec, 20 secs
lola: sara is running 25 secs || 335870 markings, 619270 edges, 10469 markings/sec, 25 secs
lola: sara is running 30 secs || 388837 markings, 741453 edges, 10593 markings/sec, 30 secs
lola: sara is running 35 secs || 441645 markings, 863266 edges, 10562 markings/sec, 35 secs
lola: sara is running 40 secs || 489516 markings, 1000945 edges, 9574 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 || 62585 markings, 81337 edges, 12517 markings/sec, 0 secs
lola: sara is running 5 secs || 122517 markings, 159647 edges, 11986 markings/sec, 5 secs
lola: sara is running 10 secs || 174438 markings, 246899 edges, 10384 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 223635 markings, 360379 edges, 9839 markings/sec, 15 secs
lola: sara is running 20 secs || 274229 markings, 477079 edges, 10119 markings/sec, 20 secs
lola: sara is running 25 secs || 324599 markings, 593262 edges, 10074 markings/sec, 25 secs
lola: sara is running 30 secs || 374539 markings, 708458 edges, 9988 markings/sec, 30 secs
lola: sara is running 35 secs || 424703 markings, 824182 edges, 10033 markings/sec, 35 secs

lola: sara is running 40 secs || 473007 markings, 946375 edges, 9661 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 || 63939 markings, 82897 edges, 12788 markings/sec, 0 secs
lola: sara is running 5 secs || 123729 markings, 161024 edges, 11958 markings/sec, 5 secs
lola: sara is running 10 secs || 179411 markings, 257493 edges, 11136 markings/sec, 10 secs
lola: sara is running 15 secs || 229024 markings, 371934 edges, 9923 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 278952 markings, 487089 edges, 9986 markings/sec, 20 secs

lola: sara is running 25 secs || 328216 markings, 600734 edges, 9853 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 || 51533 markings, 116211 edges, 10307 markings/sec, 0 secs
lola: sara is running 5 secs || 103268 markings, 235269 edges, 10347 markings/sec, 5 secs
lola: sara is running 10 secs || 155167 markings, 354488 edges, 10380 markings/sec, 10 secs
lola: sara is running 15 secs || 207998 markings, 475922 edges, 10566 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 258729 markings, 592521 edges, 10146 markings/sec, 20 secs
lola: sara is running 25 secs || 310092 markings, 710852 edges, 10273 markings/sec, 25 secs
lola: sara is running 30 secs || 361149 markings, 828255 edges, 10211 markings/sec, 30 secs
lola: sara is running 35 secs || 410702 markings, 942106 edges, 9911 markings/sec, 35 secs
lola: sara is running 40 secs || 462289 markings, 1060886 edges, 10317 markings/sec, 40 secs
lola: sara is running 45 secs || 511849 markings, 1174583 edges, 9912 markings/sec, 45 secs
lola: sara is running 50 secs || 560847 markings, 1287365 edges, 9800 markings/sec, 50 secs
lola: sara is running 55 secs || 609825 markings, 1400330 edges, 9796 markings/sec, 55 secs
lola: sara is running 60 secs || 658749 markings, 1512482 edges, 9785 markings/sec, 60 secs
lola: sara is running 65 secs || 708051 markings, 1626112 edges, 9860 markings/sec, 65 secs
lola: sara is running 70 secs || 757781 markings, 1740296 edges, 9946 markings/sec, 70 secs
lola: sara is running 75 secs || 808022 markings, 1855953 edges, 10048 markings/sec, 75 secs
lola: sara is running 80 secs || 858103 markings, 1971004 edges, 10016 markings/sec, 80 secs
lola: sara is running 85 secs || 908101 markings, 2086120 edges, 10000 markings/sec, 85 secs
lola: sara is running 90 secs || 958110 markings, 2201050 edges, 10002 markings/sec, 90 secs
lola: sara is running 95 secs || 1007943 markings, 2315475 edges, 9967 markings/sec, 95 secs
lola: sara is running 100 secs || 1057711 markings, 2430164 edges, 9954 markings/sec, 100 secs
lola: sara is running 105 secs || 1107796 markings, 2545225 edges, 10017 markings/sec, 105 secs
lola: sara is running 110 secs || 1157713 markings, 2660098 edges, 9983 markings/sec, 110 secs
lola: sara is running 115 secs || 1207559 markings, 2774497 edges, 9969 markings/sec, 115 secs
lola: sara is running 120 secs || 1257305 markings, 2888877 edges, 9949 markings/sec, 120 secs
lola: sara is running 125 secs || 1307036 markings, 3003480 edges, 9946 markings/sec, 125 secs
lola: sara is running 130 secs || 1356688 markings, 3117559 edges, 9930 markings/sec, 130 secs
lola: sara is running 135 secs || 1406395 markings, 3232143 edges, 9941 markings/sec, 135 secs
lola: sara is running 140 secs || 1456831 markings, 3348046 edges, 10087 markings/sec, 140 secs
lola: sara is running 145 secs || 1507155 markings, 3463664 edges, 10065 markings/sec, 145 secs
lola: sara is running 150 secs || 1556846 markings, 3577826 edges, 9938 markings/sec, 150 secs
lola: sara is running 155 secs || 1606395 markings, 3691806 edges, 9910 markings/sec, 155 secs
lola: sara is running 160 secs || 1656428 markings, 3807047 edges, 10007 markings/sec, 160 secs
lola: sara is running 165 secs || 1706311 markings, 3921700 edges, 9977 markings/sec, 165 secs
lola: sara is running 170 secs || 1754907 markings, 4033580 edges, 9719 markings/sec, 170 secs
lola: sara is running 175 secs || 1803400 markings, 4144928 edges, 9699 markings/sec, 175 secs
lola: sara is running 180 secs || 1852373 markings, 4257614 edges, 9795 markings/sec, 180 secs
lola: sara is running 185 secs || 1903020 markings, 4374088 edges, 10129 markings/sec, 185 secs
lola: sara is running 190 secs || 1954203 markings, 4491613 edges, 10237 markings/sec, 190 secs
lola: sara is running 195 secs || 2006442 markings, 4612027 edges, 10448 markings/sec, 195 secs
lola: sara is running 200 secs || 2055374 markings, 4724400 edges, 9786 markings/sec, 200 secs
lola: sara is running 205 secs || 2105270 markings, 4839202 edges, 9979 markings/sec, 205 secs
lola: sara is running 210 secs || 2155607 markings, 4954935 edges, 10067 markings/sec, 210 secs
lola: sara is running 215 secs || 2205331 markings, 5069265 edges, 9945 markings/sec, 215 secs
lola: sara is running 220 secs || 2254960 markings, 5183410 edges, 9926 markings/sec, 220 secs
lola: sara is running 225 secs || 2304554 markings, 5297486 edges, 9919 markings/sec, 225 secs
lola: sara is running 230 secs || 2356922 markings, 5417864 edges, 10474 markings/sec, 230 secs
lola: sara is running 235 secs || 2408861 markings, 5537345 edges, 10388 markings/sec, 235 secs
lola: sara is running 240 secs || 2459186 markings, 5653080 edges, 10065 markings/sec, 240 secs
lola: sara is running 245 secs || 2508500 markings, 5766431 edges, 9863 markings/sec, 245 secs
lola: sara is running 250 secs || 2558142 markings, 5880624 edges, 9928 markings/sec, 250 secs
lola: sara is running 255 secs || 2608632 markings, 5996639 edges, 10098 markings/sec, 255 secs
lola: sara is running 260 secs || 2659562 markings, 6113786 edges, 10186 markings/sec, 260 secs
lola: sara is running 265 secs || 2709363 markings, 6228283 edges, 9960 markings/sec, 265 secs
lola: sara is running 270 secs || 2759560 markings, 6343700 edges, 10039 markings/sec, 270 secs
lola: sara is running 275 secs || 2809604 markings, 6459243 edges, 10009 markings/sec, 275 secs
lola: sara is running 280 secs || 2860338 markings, 6575806 edges, 10147 markings/sec, 280 secs
lola: sara is running 285 secs || 2909797 markings, 6689475 edges, 9892 markings/sec, 285 secs
lola: sara is running 290 secs || 2959415 markings, 6803638 edges, 9924 markings/sec, 290 secs
lola: sara is running 295 secs || 3009071 markings, 6917703 edges, 9931 markings/sec, 295 secs
lola: sara is running 300 secs || 3060502 markings, 7036140 edges, 10286 markings/sec, 300 secs
lola: sara is running 305 secs || 3110862 markings, 7151752 edges, 10072 markings/sec, 305 secs
lola: sara is running 310 secs || 3162162 markings, 7269809 edges, 10260 markings/sec, 310 secs
lola: sara is running 315 secs || 3212658 markings, 7385977 edges, 10099 markings/sec, 315 secs
lola: sara is running 320 secs || 3263062 markings, 7502048 edges, 10081 markings/sec, 320 secs
lola: sara is running 325 secs || 3314174 markings, 7619476 edges, 10222 markings/sec, 325 secs
lola: sara is running 330 secs || 3363940 markings, 7733817 edges, 9953 markings/sec, 330 secs
lola: sara is running 335 secs || 3413574 markings, 7847902 edges, 9927 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 || 49644 markings, 109316 edges, 9929 markings/sec, 0 secs
lola: sara is running 5 secs || 100461 markings, 223421 edges, 10163 markings/sec, 5 secs
lola: sara is running 10 secs || 152070 markings, 339710 edges, 10322 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 203413 markings, 454765 edges, 10269 markings/sec, 15 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 381 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 || 59033 markings, 76322 edges, 11807 markings/sec, 0 secs
lola: sara is running 5 secs || 116802 markings, 151813 edges, 11554 markings/sec, 5 secs
lola: sara is running 10 secs || 171813 markings, 239105 edges, 11002 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 220311 markings, 350974 edges, 9700 markings/sec, 15 secs
lola: sara is running 20 secs || 267694 markings, 460267 edges, 9477 markings/sec, 20 secs

lola: sara is running 25 secs || 314911 markings, 569173 edges, 9443 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 431 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 3017 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: RESULT
lola:
SUMMARY: no no no no yes yes unknown no no no no no no no yes no
lola: ========================================
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 1494605430036

--------------------
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="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/AutoFlight-PT-96b.tgz
mv 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 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 r008-csrt-149436126100286"
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 ;