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 PhaseVariation-PT-D20CS100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440869600133
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494536017784


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ PhaseVariation-PT-D20CS100 @ 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: 14659/65536 symbol table entries, 2626 collisions
lola: preprocessing...
lola: finding significant places
lola: 1202 places, 13457 transitions, 801 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D20CS100-ReachabilityCardinality.task
lola: A (G (((((cell___19_11__B_ <= cell___9_6__A_) OR (3 <= cell___4_3__A_)) AND (cell___14_19__A_ <= pool__6_12_)) OR (cell___4_18__B_ <= pool__5_9_)))) : E (F (((cell___4_8__B_ + 1 <= cell___5_7__A_) AND (pool__12_9_ <= 0) AND ((pool__14_20_ <= 0) OR (cell___3_19__A_ <= 1))))) : A (G (((pool__2_14_ <= cell___16_3__A_) OR (cell___18_3__A_ <= cell___8_12__B_) OR (pool__17_2_ <= cell___3_19__B_) OR (2 <= pool__4_13_) OR (cell___13_20__A_ <= pool__13_3_) OR (cell___11_7__B_ <= cell___11_11__B_) OR ((2 <= pool__10_3_) AND (cell___8_8__A_ <= cell___18_3__A_))))) : E (F ((3 <= cell___1_2__A_))) : A (G (((cell___13_10__B_ <= cell___20_5__A_) AND (((cell___8_12__A_ <= pool__20_17_) AND (1 <= pool__10_8_)) OR (cell___18_1__B_ <= 1))))) : A (G (((1 <= pool__18_7_) AND (cell___18_15__B_ + 1 <= pool__3_20_) AND (cell___9_19__B_ <= cell___3_9__A_)))) : A (G (((pool__16_12_ <= cell___1_19__B_) OR (cell___19_4__B_ <= pool__7_8_) OR (cell___6_7__B_ <= cell___17_14__A_) OR (pool__11_4_ <= cell___20_10__A_) OR (2 <= pool__15_7_) OR ((pool__9_9_ <= cell___7_18__A_) AND (2 <= cell___19_9__B_))))) : A (G (((cell___8_16__B_ + 1 <= cell___15_1__B_) OR (cell___4_14__B_ <= cell___12_20__B_)))) : E (F (((pool__15_18_ <= cell___6_19__B_) AND (1 <= cell___12_15__B_) AND (pool__5_7_ + 1 <= pool__6_16_) AND ((pool__2_19_ <= 1) OR (cell___20_14__B_ <= 1))))) : A (G (((3 <= cell___15_8__A_) OR (1 <= pool__7_8_) OR ((1 <= cell___1_3__B_) AND (pool__16_4_ <= cell___18_13__A_)) OR (pool__13_15_ + 1 <= pool__10_3_) OR (cell___14_18__B_ <= 0)))) : A (G (((pool__6_12_ <= pool__20_3_) OR (cell___14_3__A_ <= cell___3_18__A_) OR (pool__6_4_ <= cell___7_15__A_) OR (2 <= pool__17_18_)))) : A (G (((cell___17_15__B_ <= 1) OR (pool__1_3_ <= 0)))) : A (G ((1 <= pool__16_9_))) : A (G ((cell___2_13__A_ <= pool__11_8_))) : E (F (((cell___5_14__B_ + 1 <= cell___3_8__A_) AND (cell___13_18__B_ + 1 <= pool__2_16_) AND ((pool__10_16_ <= 1) OR (pool__9_12_ <= 2))))) : A (G ((cell___4_17__A_ <= cell___18_2__B_)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((cell___19_11__B_ <= cell___9_6__A_) OR (3 <= cell___4_3__A_)) AND (cell___14_19__A_ <= pool__6_12_)) OR (cell___4_18__B_ <= pool__5_9_))))
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 3204 bytes per marking, with 0 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cell___4_8__B_ + 1 <= cell___5_7__A_) AND (pool__12_9_ <= 0) AND ((pool__14_20_ <= 0) OR (cell___3_19__A_ <= 1)))))
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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pool__2_14_ <= cell___16_3__A_) OR (cell___18_3__A_ <= cell___8_12__B_) OR (pool__17_2_ <= cell___3_19__B_) OR (2 <= pool__4_13_) OR (cell___13_20__A_ <= pool__13_3_) OR (cell___11_7__B_ <= cell___11_11__B_) OR ((2 <= pool__10_3_) AND (cell___8_8__A_ <= cell___18_3__A_)))))
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 3204 bytes per marking, with 0 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 2147 markings, 10970 edges, 429 markings/sec, 0 secs
lola: sara is running 5 secs || 8831 markings, 70948 edges, 1337 markings/sec, 5 secs
lola: sara is running 10 secs || 15375 markings, 133273 edges, 1309 markings/sec, 10 secs
lola: sara is running 15 secs || 21913 markings, 197671 edges, 1308 markings/sec, 15 secs
lola: sara is running 20 secs || 28528 markings, 259282 edges, 1323 markings/sec, 20 secs
lola: sara is running 25 secs || 35053 markings, 323690 edges, 1305 markings/sec, 25 secs
lola: sara is running 30 secs || 41435 markings, 393363 edges, 1276 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 47732 markings, 465375 edges, 1259 markings/sec, 35 secs
lola: sara is running 40 secs || 53880 markings, 542386 edges, 1230 markings/sec, 40 secs
lola: sara is running 45 secs || 60519 markings, 603262 edges, 1328 markings/sec, 45 secs
lola: sara is running 50 secs || 67065 markings, 667247 edges, 1309 markings/sec, 50 secs
lola: sara is running 55 secs || 73472 markings, 735929 edges, 1281 markings/sec, 55 secs
lola: sara is running 60 secs || 80073 markings, 797278 edges, 1320 markings/sec, 60 secs
lola: sara is running 65 secs || 86496 markings, 864446 edges, 1285 markings/sec, 65 secs
lola: sara is running 70 secs || 92936 markings, 931520 edges, 1288 markings/sec, 70 secs
lola: sara is running 75 secs || 99424 markings, 996599 edges, 1298 markings/sec, 75 secs
lola: sara is running 80 secs || 105695 markings, 1069819 edges, 1254 markings/sec, 80 secs
lola: sara is running 85 secs || 112096 markings, 1138888 edges, 1280 markings/sec, 85 secs
lola: sara is running 90 secs || 118455 markings, 1208947 edges, 1272 markings/sec, 90 secs
lola: sara is running 95 secs || 124730 markings, 1281475 edges, 1255 markings/sec, 95 secs
lola: sara is running 100 secs || 131148 markings, 1349115 edges, 1284 markings/sec, 100 secs
lola: sara is running 105 secs || 137485 markings, 1419211 edges, 1267 markings/sec, 105 secs
lola: sara is running 110 secs || 143673 markings, 1494122 edges, 1238 markings/sec, 110 secs
lola: sara is running 115 secs || 149805 markings, 1571185 edges, 1226 markings/sec, 115 secs
lola: sara is running 120 secs || 155832 markings, 1651362 edges, 1205 markings/sec, 120 secs
lola: sara is running 125 secs || 162112 markings, 1723462 edges, 1256 markings/sec, 125 secs
lola: sara is running 130 secs || 168726 markings, 1784398 edges, 1323 markings/sec, 130 secs
lola: sara is running 135 secs || 175224 markings, 1848971 edges, 1300 markings/sec, 135 secs
lola: sara is running 140 secs || 181808 markings, 1910687 edges, 1317 markings/sec, 140 secs
lola: sara is running 145 secs || 188371 markings, 1972938 edges, 1313 markings/sec, 145 secs
lola: sara is running 150 secs || 194795 markings, 2039734 edges, 1285 markings/sec, 150 secs
lola: sara is running 155 secs || 201133 markings, 2109659 edges, 1268 markings/sec, 155 secs
lola: sara is running 160 secs || 207397 markings, 2181801 edges, 1253 markings/sec, 160 secs
lola: sara is running 165 secs || 213624 markings, 2255667 edges, 1245 markings/sec, 165 secs
lola: sara is running 170 secs || 220000 markings, 2325359 edges, 1275 markings/sec, 170 secs
lola: sara is running 175 secs || 226264 markings, 2398403 edges, 1253 markings/sec, 175 secs
lola: sara is running 180 secs || 232553 markings, 2470494 edges, 1258 markings/sec, 180 secs
lola: sara is running 185 secs || 238882 markings, 2541064 edges, 1266 markings/sec, 185 secs
lola: sara is running 190 secs || 245115 markings, 2614667 edges, 1247 markings/sec, 190 secs
lola: sara is running 195 secs || 251231 markings, 2692568 edges, 1223 markings/sec, 195 secs
lola: sara is running 200 secs || 257276 markings, 2772438 edges, 1209 markings/sec, 200 secs
lola: sara is running 205 secs || 263208 markings, 2855934 edges, 1186 markings/sec, 205 secs
lola: sara is running 210 secs || 269681 markings, 2921181 edges, 1295 markings/sec, 210 secs
lola: sara is running 215 secs || 276243 markings, 2983061 edges, 1312 markings/sec, 215 secs
lola: sara is running 220 secs || 282590 markings, 3052130 edges, 1269 markings/sec, 220 secs
lola: sara is running 225 secs || 289157 markings, 3113966 edges, 1313 markings/sec, 225 secs
lola: sara is running 230 secs || 295623 markings, 3179024 edges, 1293 markings/sec, 230 secs
lola: sara is running 235 secs || 301992 markings, 3247373 edges, 1274 markings/sec, 235 secs
lola: sara is running 240 secs || 308488 markings, 3311447 edges, 1299 markings/sec, 240 secs
lola: sara is running 245 secs || 314769 markings, 3382512 edges, 1256 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cell___1_2__A_)))
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 3204 bytes per marking, with 0 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 2662 markings, 14207 edges, 532 markings/sec, 0 secs
lola: sara is running 5 secs || 8750 markings, 71989 edges, 1218 markings/sec, 5 secs
lola: sara is running 10 secs || 14822 markings, 129885 edges, 1214 markings/sec, 10 secs
lola: sara is running 15 secs || 20698 markings, 195713 edges, 1175 markings/sec, 15 secs
lola: sara is running 20 secs || 26292 markings, 271573 edges, 1119 markings/sec, 20 secs
lola: sara is running 25 secs || 32288 markings, 333337 edges, 1199 markings/sec, 25 secs
lola: sara is running 30 secs || 38168 markings, 399032 edges, 1176 markings/sec, 30 secs
lola: sara is running 35 secs || 43931 markings, 477437 edges, 1153 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 50282 markings, 540623 edges, 1270 markings/sec, 40 secs
lola: sara is running 45 secs || 56396 markings, 612295 edges, 1223 markings/sec, 45 secs
lola: sara is running 50 secs || 62204 markings, 694631 edges, 1162 markings/sec, 50 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___13_10__B_ <= cell___20_5__A_) AND (((cell___8_12__A_ <= pool__20_17_) AND (1 <= pool__10_8_)) OR (cell___18_1__B_ <= 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 3204 bytes per marking, with 0 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 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= pool__18_7_) AND (cell___18_15__B_ + 1 <= pool__3_20_) AND (cell___9_19__B_ <= cell___3_9__A_))))
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 3204 bytes per marking, with 0 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-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 323 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pool__16_12_ <= cell___1_19__B_) OR (cell___19_4__B_ <= pool__7_8_) OR (cell___6_7__B_ <= cell___17_14__A_) OR (pool__11_4_ <= cell___20_10__A_) OR (2 <= pool__15_7_) OR ((pool__9_9_ <= cell___7_18__A_) AND (2 <= cell___19_9__B_)))))
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 3204 bytes per marking, with 0 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___8_16__B_ + 1 <= cell___15_1__B_) OR (cell___4_14__B_ <= cell___12_20__B_))))
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 3204 bytes per marking, with 0 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pool__15_18_ <= cell___6_19__B_) AND (1 <= cell___12_15__B_) AND (pool__5_7_ + 1 <= pool__6_16_) AND ((pool__2_19_ <= 1) OR (cell___20_14__B_ <= 1)))))
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 3204 bytes per marking, with 0 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= cell___15_8__A_) OR (1 <= pool__7_8_) OR ((1 <= cell___1_3__B_) AND (pool__16_4_ <= cell___18_13__A_)) OR (pool__13_15_ + 1 <= pool__10_3_) OR (cell___14_18__B_ <= 0))))
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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-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 538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pool__6_12_ <= pool__20_3_) OR (cell___14_3__A_ <= cell___3_18__A_) OR (pool__6_4_ <= cell___7_15__A_) OR (2 <= pool__17_18_))))
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 3204 bytes per marking, with 0 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-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 646 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___17_15__B_ <= 1) OR (pool__1_3_ <= 0))))
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 3204 bytes per marking, with 0 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 2022 markings, 9896 edges, 404 markings/sec, 0 secs
lola: sara is running 5 secs || 8687 markings, 64308 edges, 1333 markings/sec, 5 secs
lola: sara is running 10 secs || 15061 markings, 128613 edges, 1275 markings/sec, 10 secs
lola: sara is running 15 secs || 21522 markings, 190013 edges, 1292 markings/sec, 15 secs
lola: sara is running 20 secs || 28032 markings, 249302 edges, 1302 markings/sec, 20 secs
lola: sara is running 25 secs || 34298 markings, 316688 edges, 1253 markings/sec, 25 secs
lola: sara is running 30 secs || 40249 markings, 394955 edges, 1190 markings/sec, 30 secs
lola: sara is running 35 secs || 46863 markings, 450830 edges, 1323 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 53293 markings, 513083 edges, 1286 markings/sec, 40 secs
lola: sara is running 45 secs || 59675 markings, 576996 edges, 1276 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 794 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pool__16_9_)))
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 3204 bytes per marking, with 0 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-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 1059 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cell___2_13__A_ <= pool__11_8_)))
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 3204 bytes per marking, with 0 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-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 1589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cell___5_14__B_ + 1 <= cell___3_8__A_) AND (cell___13_18__B_ + 1 <= pool__2_16_) AND ((pool__10_16_ <= 1) OR (pool__9_12_ <= 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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-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 3178 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cell___4_17__A_ <= cell___18_2__B_)))
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 3204 bytes per marking, with 0 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-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 yes unknown no no no no no yes no no yes no no yes no
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494536379127

--------------------
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="PhaseVariation-PT-D20CS100"
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/PhaseVariation-PT-D20CS100.tgz
mv PhaseVariation-PT-D20CS100 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 PhaseVariation-PT-D20CS100, 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 r048-smll-149440869600133"
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 ;