fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r108-blw3-149441612400417
Last Updated
June 27, 2017

About the Execution of LoLA for S_FMS-PT-500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15952.800 1109853.00 1109278.00 1028.50 TFFTFFF?F?FF?TFF normal

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_FMS-PT-500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612400417
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496373390402


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


checking for too many tokens
===========================================================================================
S_FMS-PT-500: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_FMS-PT-500 @ 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: 42/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from FMS-PT-500-CTLCardinality.task
lola: E ((E (F ((M3 <= P3))) U A (F ((1 <= P12M3))))) : (NOT(A (((3 <= P12) U (P3s <= P12M3)))) OR (((1 <= P12s) AND (3 <= P1M1) AND (3 <= P3M2)) OR A (G ((P12M3 <= 1))))) : A (G (((P1wP2 <= M3) AND A (X ((P2d <= P3)))))) : (A (G (E (F ((P2d <= P1wP2))))) AND (P12s <= 2)) : ((3 <= P1) AND A (G ((((P1wM1 <= P3) AND (1 <= P1)) OR (P1 <= 0))))) : ((((P1 + 1 <= M2) OR (P2wP1 <= 1)) AND (P2d + 1 <= P1M1) AND ((P2d <= 0) OR (P1s <= P2d))) OR A (G ((2 <= P3)))) : E (F (A (G (((1 <= P3) AND (M2 <= P12wM3)))))) : (E (((P2s <= P2wP1) U ((3 <= P12wM3) OR (P2 <= P1wM1)))) AND (NOT(E (X ((2 <= P12s)))) OR ((((P2s <= P12wM3) AND (1 <= M1)) OR ((P2 <= P12M3) AND (1 <= P2))) AND (3 <= P12)))) : (E (G (E (F ((2 <= P2M2))))) AND NOT(A (((1 <= P12) U (3 <= P3s))))) : A (F ((((M1 <= P1M1) OR (P2s <= M2)) AND A (G ((P1wM1 <= P3)))))) : NOT(NOT(A (G (((P3 <= M2) OR (P12s <= M3)))))) : A (X (E (F (((1 <= P12) AND (2 <= P1)))))) : (A (G (A (X ((1 <= P1))))) AND A (F (((2 <= P1) OR (P12wM3 <= P1M1))))) : A (G ((((P12M3 <= P1wM1) AND (P12 <= P2M2)) OR (P12 <= 2) OR (((M2 <= P1M1) OR (1 <= P1s)) AND ((P2wM2 <= P1M1) OR (P12wM3 <= P2M2)))))) : A (G ((((P12s <= P2M2) AND (P12M3 <= P12s)) OR (P12M3 <= P12s) OR (3 <= P2wP1) OR ((1 <= P3M2) AND (P12wM3 <= P12M3))))) : E (((P12s <= P2d) U A (G ((P1M1 <= P1d)))))
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 ((E (F ((M3 <= P3))) U A (F ((1 <= P12M3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (M3 <= P3)) U A(TRUE U (1 <= P12M3)))
lola: processed formula length: 48
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((3 <= P12) U (P3s <= P12M3)))) OR (((1 <= P12s) AND (3 <= P1M1) AND (3 <= P3M2)) OR A (G ((P12M3 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((P12 <= 2) R (P12M3 + 1 <= P3s)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((3 <= P12) U (P3s <= P12M3)))
lola: processed formula length: 35
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= P12s) AND (3 <= P1M1) AND (3 <= P3M2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= P12s) AND (3 <= P1M1) AND (3 <= P3M2))
lola: processed formula length: 45
lola: 4 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P12M3 <= 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 64 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 FMS-PT-500-CTLCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running saralola:
SUBRESULTlola:
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P1wP2 <= M3) AND A (X ((P2d <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P1wP2 <= M3)))
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 64 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to FMS-PT-500-CTLCardinality-2.saralola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((P2d <= P1wP2))))) AND (P12s <= 2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((P2d <= P1wP2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (P2d <= P1wP2)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file FMS-PT-500-CTLCardinality-3.sara.

lola: 4770402 markings, 10814511 edges, 3223546815924142080 markings/sec, 0 secs
lola: 8871916 markings, 20578140 edges, 820303 markings/sec, 5 secs
lola: 12016801 markings, 28106111 edges, 628977 markings/sec, 10 secs
lola: 16007298 markings, 37687716 edges, 798099 markings/sec, 15 secs
lola: 19953710 markings, 47167928 edges, 789282 markings/sec, 20 secs
lola: 23977622 markings, 56834404 edges, 804782 markings/sec, 25 secs
lola: 27785441 markings, 66002475 edges, 761564 markings/sec, 30 secs
lola: 31619510 markings, 75233646 edges, 766814 markings/sec, 35 secs
lola: 35093636 markings, 83601828 edges, 694825 markings/sec, 40 secs
lola: 38753937 markings, 92447514 edges, 732060 markings/sec, 45 secs
lola: 42429386 markings, 101325136 edges, 735090 markings/sec, 50 secs
lola: 46080063 markings, 110137367 edges, 730135 markings/sec, 55 secs
lola: 49293154 markings, 117932482 edges, 642618 markings/sec, 60 secs
lola: 52782936 markings, 126377103 edges, 697956 markings/sec, 65 secs
lola: 56298119 markings, 134924919 edges, 703037 markings/sec, 70 secs
lola: 59851362 markings, 143518392 edges, 710649 markings/sec, 75 secs
lola: 63341967 markings, 151973492 edges, 698121 markings/sec, 80 secs
lola: 66751935 markings, 160294441 edges, 681994 markings/sec, 85 secs
lola: 70186202 markings, 168597620 edges, 686853 markings/sec, 90 secs
lola: 73561141 markings, 176790030 edges, 674988 markings/sec, 95 secs
lola: 76896297 markings, 184916456 edges, 667031 markings/sec, 100 secs
lola: 80253432 markings, 193058050 edges, 671427 markings/sec, 105 secs
lola: 83592414 markings, 201194646 edges, 667796 markings/sec, 110 secs
lola: 86913533 markings, 209302482 edges, 664224 markings/sec, 115 secs
lola: 90244923 markings, 217394079 edges, 666278 markings/sec, 120 secs
lola: 93652499 markings, 225598376 edges, 681515 markings/sec, 125 secs
lola: 96966856 markings, 233709196 edges, 662871 markings/sec, 130 secs
lola: 100209868 markings, 241641751 edges, 648602 markings/sec, 135 secs
lola: 103321817 markings, 249157187 edges, 622390 markings/sec, 140 secs
lola: 106628226 markings, 257240996 edges, 661282 markings/sec, 145 secs
lola: 109909544 markings, 265286011 edges, 656264 markings/sec, 150 secs
lola: 113287499 markings, 273424607 edges, 675591 markings/sec, 155 secs
lola: 116298555 markings, 280825216 edges, 602211 markings/sec, 160 secs
lola: 119487316 markings, 288709343 edges, 637752 markings/sec, 165 secs
lola: 122795187 markings, 296739913 edges, 661574 markings/sec, 170 secs
lola: 123371787 markings, 298124135 edges, 115320 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P12s <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P12s <= 2)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: ...considering subproblem: ((3 <= P1) AND A (G ((((P1wM1 <= P3) AND (1 <= P1)) OR (P1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: lola: ========================================
subprocess 4 will run for 279 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P1)
lola: processed formula length: 9
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((P1wM1 <= P3) AND (1 <= P1)) OR (P1 <= 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 64 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((P1 + 1 <= M2) OR (P2wP1 <= 1)) AND (P2d + 1 <= P1M1) AND ((P2d <= 0) OR (P1s <= P2d))) OR A (G ((2 <= P3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P1 + 1 <= M2) OR (P2wP1 <= 1)) AND (P2d + 1 <= P1M1) AND ((P2d <= 0) OR (P1s <= P2d)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((P1 + 1 <= M2) OR (P2wP1 <= 1)) AND (P2d + 1 <= P1M1) AND ((P2d <= 0) OR (P1s <= P2d)))
lola: processed formula length: 91
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= P3)))
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 64 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= P3) AND (M2 <= P12wM3))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((P3 <= 0) OR (P12wM3 + 1 <= M2)))))
lola: processed formula length: 59
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2019839 markings, 7529487 edges, 2663864885938487296 markings/sec, 0 secs
lola: 3736234 markings, 13986736 edges, 343279 markings/sec, 5 secs
lola: 5395388 markings, 20248844 edges, 331831 markings/sec, 10 secs
lola: 6990931 markings, 26192786 edges, 319109 markings/sec, 15 secs
lola: 8571036 markings, 32164834 edges, 316021 markings/sec, 20 secs
lola: 10109694 markings, 37930694 edges, 307732 markings/sec, 25 secs
lola: 11627496 markings, 43649875 edges, 303560 markings/sec, 30 secs
lola: 13122432 markings, 49239299 edges, 298987 markings/sec, 35 secs
lola: 14608953 markings, 54811349 edges, 297304 markings/sec, 40 secs
lola: 16096039 markings, 60381101 edges, 297417 markings/sec, 45 secs
lola: 17540516 markings, 65864927 edges, 288895 markings/sec, 50 secs
lola: 18974978 markings, 71243355 edges, 286892 markings/sec, 55 secs
lola: 20399978 markings, 76571015 edges, 285000 markings/sec, 60 secs
lola: 21813819 markings, 81892933 edges, 282768 markings/sec, 65 secs
lola: 23242299 markings, 87239770 edges, 285696 markings/sec, 70 secs
lola: 24674907 markings, 92618832 edges, 286522 markings/sec, 75 secs
lola: 26086498 markings, 97943397 edges, 282318 markings/sec, 80 secs
lola: 27497754 markings, 103199112 edges, 282251 markings/sec, 85 secs
lola: 28853997 markings, 108282363 edges, 271249 markings/sec, 90 secs
lola: 30231370 markings, 113437978 edges, 275475 markings/sec, 95 secs
lola: 31606382 markings, 118601069 edges, 275002 markings/sec, 100 secs
lola: 32986465 markings, 123701576 edges, 276017 markings/sec, 105 secs
lola: 34332011 markings, 128726249 edges, 269109 markings/sec, 110 secs
lola: 35654839 markings, 133664836 edges, 264566 markings/sec, 115 secs
lola: 36991749 markings, 138647089 edges, 267382 markings/sec, 120 secs
lola: 38335206 markings, 143643379 edges, 268691 markings/sec, 125 secs
lola: 39649505 markings, 148563988 edges, 262860 markings/sec, 130 secs
lola: 40948614 markings, 153404981 edges, 259822 markings/sec, 135 secs
lola: 42267884 markings, 158350568 edges, 263854 markings/sec, 140 secs
lola: 43546709 markings, 163149651 edges, 255765 markings/sec, 145 secs
lola: 44882744 markings, 168124003 edges, 267207 markings/sec, 150 secs
lola: 46173401 markings, 173002615 edges, 258131 markings/sec, 155 secs
lola: 47481930 markings, 177893012 edges, 261706 markings/sec, 160 secs
lola: 48755047 markings, 182645561 edges, 254623 markings/sec, 165 secs
lola: 50066053 markings, 187545029 edges, 262201 markings/sec, 170 secs
lola: 51387447 markings, 192495157 edges, 264279 markings/sec, 175 secs
lola: 52653279 markings, 197264833 edges, 253166 markings/sec, 180 secs
lola: 53939323 markings, 202089121 edges, 257209 markings/sec, 185 secs
lola: 55226115 markings, 206879061 edges, 257358 markings/sec, 190 secs
lola: 56498412 markings, 211625820 edges, 254459 markings/sec, 195 secs
lola: 57809448 markings, 216502847 edges, 262207 markings/sec, 200 secs
lola: 59032460 markings, 221073266 edges, 244602 markings/sec, 205 secs
lola: 60251210 markings, 225584940 edges, 243750 markings/sec, 210 secs
lola: 61482177 markings, 230173403 edges, 246193 markings/sec, 215 secs
lola: 62649470 markings, 234583869 edges, 233459 markings/sec, 220 secs
lola: 63908075 markings, 239297988 edges, 251721 markings/sec, 225 secs
lola: 65092836 markings, 243748898 edges, 236952 markings/sec, 230 secs
lola: 66300772 markings, 248253645 edges, 241587 markings/sec, 235 secs
lola: 67540206 markings, 252880138 edges, 247887 markings/sec, 240 secs
lola: 68746427 markings, 257391989 edges, 241244 markings/sec, 245 secs
lola: 69997549 markings, 262046652 edges, 250224 markings/sec, 250 secs
lola: 71211618 markings, 266560660 edges, 242814 markings/sec, 255 secs
lola: 72384218 markings, 270870312 edges, 234520 markings/sec, 260 secs
lola: 73602611 markings, 275401479 edges, 243679 markings/sec, 265 secs
lola: 74812455 markings, 279918292 edges, 241969 markings/sec, 270 secs
lola: 76010619 markings, 284361869 edges, 239633 markings/sec, 275 secs
lola: 77233327 markings, 288931707 edges, 244542 markings/sec, 280 secs
lola: 78459254 markings, 293494273 edges, 245185 markings/sec, 285 secs
lola: 79682657 markings, 298038132 edges, 244681 markings/sec, 290 secs
lola: 80902033 markings, 302590730 edges, 243875 markings/sec, 295 secs
lola: 82151616 markings, 307216562 edges, 249917 markings/sec, 300 secs
lola: 83330598 markings, 311616669 edges, 235796 markings/sec, 305 secs
lola: 84502740 markings, 315992083 edges, 234428 markings/sec, 310 secs
lola: 85694732 markings, 320422244 edges, 238398 markings/sec, 315 secs
lola: 86821727 markings, 324622385 edges, 225399 markings/sec, 320 secs
lola: 87997506 markings, 329015096 edges, 235156 markings/sec, 325 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 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((P2s <= P2wP1) U ((3 <= P12wM3) OR (P2 <= P1wM1)))) AND (NOT(E (X ((2 <= P12s)))) OR ((((P2s <= P12wM3) AND (1 <= M1)) OR ((P2 <= P12M3) AND (1 <= P2))) AND (3 <= P12))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((P2s <= P2wP1) U ((3 <= P12wM3) OR (P2 <= P1wM1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((P2s <= P2wP1) U ((3 <= P12wM3) OR (P2 <= P1wM1)))
lola: processed formula length: 53
lola: 4 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((P12s <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((P12s <= 1))
lola: processed formula length: 15
lola: 4 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((2 <= P2M2))))) AND NOT(A (((1 <= P12) U (3 <= P3s)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= P2M2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (2 <= P2M2)))))
lola: processed formula length: 41
lola: 6 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 7037664 markings, 8573758 edges, 1407533 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 430 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((M1 <= P1M1) OR (P2s <= M2)) AND A (G ((P1wM1 <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((M1 <= P1M1) OR (P2s <= M2)) AND NOT(E(TRUE U (P3 + 1 <= P1wM1)))))
lola: processed formula length: 79
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G (((P3 <= M2) OR (P12s <= M3))))))
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 64 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 602 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= P12) AND (2 <= P1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U ((1 <= P12) AND (2 <= P1))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 12 will run for 752 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (X ((1 <= P1))))) AND A (F (((2 <= P1) OR (P12wM3 <= P1M1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 752 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((1 <= P1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((1 <= P1)))))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1002 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((P12M3 <= P1wM1) AND (P12 <= P2M2)) OR (P12 <= 2) OR (((M2 <= P1M1) OR (1 <= P1s)) AND ((P2wM2 <= P1M1) OR (P12wM3 <= P2M2))))))
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 64 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 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((P12s <= P2M2) AND (P12M3 <= P12s)) OR (P12M3 <= P12s) OR (3 <= P2wP1) OR ((1 <= P3M2) AND (P12wM3 <= P12M3)))))
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 64 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 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3008 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((P12s <= P2d) U A (G ((P1M1 <= P1d)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((P12s <= P2d) U NOT(E(TRUE U (P1d + 1 <= P1M1))))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-500-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2463795 markings, 5448435 edges, 2966512333431504896 markings/sec, 0 secs
lola: 3967842 markings, 10223388 edges, 300809 markings/sec, 5 secs
lola: 5409352 markings, 14887113 edges, 288302 markings/sec, 10 secs
lola: 6881721 markings, 19714927 edges, 294474 markings/sec, 15 secs
lola: 8336869 markings, 24540765 edges, 291030 markings/sec, 20 secs
lola: 9744898 markings, 29274958 edges, 281606 markings/sec, 25 secs
lola: 11094235 markings, 33842186 edges, 269867 markings/sec, 30 secs
lola: 12381728 markings, 38218455 edges, 257499 markings/sec, 35 secs
lola: 13734654 markings, 42797853 edges, 270585 markings/sec, 40 secs
lola: 15131397 markings, 47391437 edges, 279349 markings/sec, 45 secs
lola: 16496390 markings, 52007078 edges, 272999 markings/sec, 50 secs
lola: 17839818 markings, 56617430 edges, 268686 markings/sec, 55 secs
lola: 19235013 markings, 61300384 edges, 279039 markings/sec, 60 secs
lola: 20670735 markings, 66070061 edges, 287144 markings/sec, 65 secs
lola: 22052086 markings, 70682622 edges, 276270 markings/sec, 70 secs
lola: 23494849 markings, 75491402 edges, 288553 markings/sec, 75 secs
lola: 24963187 markings, 80381401 edges, 293668 markings/sec, 80 secs
lola: 26416433 markings, 85234241 edges, 290649 markings/sec, 85 secs
lola: 27917935 markings, 90242369 edges, 300300 markings/sec, 90 secs
lola: 29268754 markings, 94954968 edges, 270164 markings/sec, 95 secs
lola: 30560530 markings, 99499095 edges, 258355 markings/sec, 100 secs
lola: 31868874 markings, 104050274 edges, 261669 markings/sec, 105 secs
lola: 33204700 markings, 108688901 edges, 267165 markings/sec, 110 secs
lola: 34552646 markings, 113381578 edges, 269589 markings/sec, 115 secs
lola: 35941879 markings, 118215789 edges, 277847 markings/sec, 120 secs
lola: 37349607 markings, 123108481 edges, 281546 markings/sec, 125 secs
lola: 38506432 markings, 127701402 edges, 231365 markings/sec, 130 secs
lola: 39702399 markings, 132002578 edges, 239193 markings/sec, 135 secs
lola: 40853721 markings, 136129511 edges, 230264 markings/sec, 140 secs
lola: 41979707 markings, 140162204 edges, 225197 markings/sec, 145 secs
lola: 43150954 markings, 144357957 edges, 234249 markings/sec, 150 secs
lola: 44314354 markings, 148532200 edges, 232680 markings/sec, 155 secs
lola: 45416554 markings, 152481621 edges, 220440 markings/sec, 160 secs
lola: 46467645 markings, 156268822 edges, 210218 markings/sec, 165 secs
lola: 47513768 markings, 160016470 edges, 209225 markings/sec, 170 secs
lola: 48582365 markings, 163832868 edges, 213719 markings/sec, 175 secs
lola: 49689767 markings, 167834573 edges, 221480 markings/sec, 180 secs
lola: 50769187 markings, 171715197 edges, 215884 markings/sec, 185 secs
lola: 51800712 markings, 175413582 edges, 206305 markings/sec, 190 secs
lola: 52952373 markings, 179349486 edges, 230332 markings/sec, 195 secs
lola: 54194336 markings, 183451452 edges, 248393 markings/sec, 200 secs
lola: 55426611 markings, 187628022 edges, 246455 markings/sec, 205 secs
lola: 56596291 markings, 191639115 edges, 233936 markings/sec, 210 secs
lola: 57812167 markings, 195866380 edges, 243175 markings/sec, 215 secs
lola: 59048439 markings, 200171777 edges, 247254 markings/sec, 220 secs
lola: 60257685 markings, 204401098 edges, 241849 markings/sec, 225 secs
lola: 61440349 markings, 208559405 edges, 236533 markings/sec, 230 secs
lola: 62584990 markings, 212603120 edges, 228928 markings/sec, 235 secs
lola: 63634434 markings, 216320762 edges, 209889 markings/sec, 240 secs
lola: 64793740 markings, 220440022 edges, 231861 markings/sec, 245 secs
lola: 65923445 markings, 224476903 edges, 225941 markings/sec, 250 secs
lola: 67029009 markings, 228449813 edges, 221113 markings/sec, 255 secs
lola: 68169765 markings, 232534701 edges, 228151 markings/sec, 260 secs
lola: 69562711 markings, 237190479 edges, 278589 markings/sec, 265 secs
lola: 70974470 markings, 241890110 edges, 282352 markings/sec, 270 secs
lola: 72398838 markings, 246657009 edges, 284874 markings/sec, 275 secs
lola: 73844829 markings, 251476881 edges, 289198 markings/sec, 280 secs
lola: 75238657 markings, 256138707 edges, 278766 markings/sec, 285 secs
lola: 76630642 markings, 260799885 edges, 278397 markings/sec, 290 secs
lola: 77886735 markings, 265170552 edges, 251219 markings/sec, 295 secs
lola: 79138045 markings, 269512300 edges, 250262 markings/sec, 300 secs
lola: 80426548 markings, 273981772 edges, 257701 markings/sec, 305 secs
lola: 81719615 markings, 278651693 edges, 258613 markings/sec, 310 secs
lola: 82824930 markings, 282925164 edges, 221063 markings/sec, 315 secs
lola: 83967069 markings, 287306923 edges, 228428 markings/sec, 320 secs
lola: 85097668 markings, 291647885 edges, 226120 markings/sec, 325 secs
lola: 86298121 markings, 296095136 edges, 240091 markings/sec, 330 secs
lola: 87563808 markings, 300567373 edges, 253137 markings/sec, 335 secs
lola: 88764942 markings, 305011819 edges, 240227 markings/sec, 340 secs
lola: 89967012 markings, 309497021 edges, 240414 markings/sec, 345 secs
lola: 91270736 markings, 314183903 edges, 260745 markings/sec, 350 secs
lola: 92555888 markings, 318811552 edges, 257030 markings/sec, 355 secs
lola: 93800055 markings, 323285323 edges, 248833 markings/sec, 360 secs
lola: 95031162 markings, 327734366 edges, 246221 markings/sec, 365 secs
lola: 96276456 markings, 332251717 edges, 249059 markings/sec, 370 secs
lola: 97496831 markings, 336654335 edges, 244075 markings/sec, 375 secs
lola: 98687425 markings, 341009473 edges, 238119 markings/sec, 380 secs
lola: 99883978 markings, 345366077 edges, 239311 markings/sec, 385 secs
lola: 101074618 markings, 349694308 edges, 238128 markings/sec, 390 secs
lola: 102258686 markings, 354007721 edges, 236814 markings/sec, 395 secs
lola: 103402210 markings, 358199512 edges, 228705 markings/sec, 400 secs
lola: 104557606 markings, 362430867 edges, 231079 markings/sec, 405 secs
lola: 105710323 markings, 366642418 edges, 230543 markings/sec, 410 secs
lola: 106855434 markings, 370828663 edges, 229022 markings/sec, 415 secs
lola: 107992936 markings, 374999772 edges, 227500 markings/sec, 420 secs
lola: 109124792 markings, 379156165 edges, 226371 markings/sec, 425 secs
lola: 110247546 markings, 383253914 edges, 224551 markings/sec, 430 secs
lola: 111361794 markings, 387332734 edges, 222850 markings/sec, 435 secs
lola: 112417519 markings, 391242057 edges, 211145 markings/sec, 440 secs
lola: 113486017 markings, 395169487 edges, 213700 markings/sec, 445 secs
lola: 114528767 markings, 399010329 edges, 208550 markings/sec, 450 secs
lola: 115638372 markings, 402966579 edges, 221921 markings/sec, 455 secs
lola: 116802566 markings, 406785321 edges, 232839 markings/sec, 460 secs
lola: 118051892 markings, 410991693 edges, 249865 markings/sec, 465 secs
lola: 119286926 markings, 415219093 edges, 247007 markings/sec, 470 secs
lola: 120503433 markings, 419437341 edges, 243301 markings/sec, 475 secs
lola: 121787902 markings, 423885363 edges, 256894 markings/sec, 480 secs
lola: 123036037 markings, 428269134 edges, 249627 markings/sec, 485 secs
lola: 124262743 markings, 432570150 edges, 245341 markings/sec, 490 secs
lola: 125473264 markings, 436855097 edges, 242104 markings/sec, 495 secs
lola: 126650094 markings, 441009353 edges, 235366 markings/sec, 500 secs
lola: 127776043 markings, 445016571 edges, 225190 markings/sec, 505 secs
lola: 128890076 markings, 448981063 edges, 222807 markings/sec, 510 secs
lola: 130088866 markings, 453306976 edges, 239758 markings/sec, 515 secs
lola: 131373643 markings, 457928188 edges, 256955 markings/sec, 520 secs
lola: 132417419 markings, 462010411 edges, 208755 markings/sec, 525 secs
lola: 133693185 markings, 466573403 edges, 255153 markings/sec, 530 secs
lola: 134970603 markings, 471123259 edges, 255484 markings/sec, 535 secs
lola: 136244320 markings, 475657729 edges, 254743 markings/sec, 540 secs
lola: 137526203 markings, 480259686 edges, 256377 markings/sec, 545 secs
lola: 138767586 markings, 484756060 edges, 248277 markings/sec, 550 secs
lola: 139945137 markings, 489000304 edges, 235510 markings/sec, 555 secs
lola: 141148745 markings, 493347411 edges, 240722 markings/sec, 560 secs
lola: 142342892 markings, 497661149 edges, 238829 markings/sec, 565 secs
lola: 143532086 markings, 501961699 edges, 237839 markings/sec, 570 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no no unknown no no unknown yes no no no yes no no no unknown
FORMULA FMS-PT-500-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-500-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496374500255

--------------------
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_FMS-PT-500"
export BK_EXAMINATION="CTLCardinality"
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_FMS-PT-500.tgz
mv S_FMS-PT-500 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_FMS-PT-500, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r108-blw3-149441612400417"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;