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)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 12 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 108K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DNAwalker-PT-05track28LR, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-152649743100255
=====================================================================

--------------------
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 DNAwalker-PT-05track28LR-CTLCardinality-00
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-01
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-02
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-03
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-04
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-05
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-06
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-07
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-08
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-09
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-10
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-11
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-12
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-13
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-14
FORMULA_NAME DNAwalker-PT-05track28LR-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526746046523


BK_STOP 1526747046507

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DNAwalker-PT-05track28LR as instance name.
Using DNAwalker as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 43931, 'Memory': 8285.98, 'Tool': 'marcie'}, {'Time': 46531, 'Memory': 8285.97, 'Tool': 'marcie'}, {'Time': 231089, 'Memory': 2894.52, 'Tool': 'itstools'}, {'Time': 233636, 'Memory': 2891.61, 'Tool': 'itstools'}, {'Time': 585734, 'Memory': 6264.05, 'Tool': 'lola'}, {'Time': 586278, 'Memory': 6104.64, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 13.333045002390111x far from the best tool marcie.
CTLCardinality lola DNAwalker-PT-05track28LR...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DNAwalker-PT-05track28LR: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DNAwalker-PT-05track28LR: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DNAwalker-PT-05track28LR @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 284/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 34 places, 250 transitions, 34 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 164 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-05track28LR-CTLCardinality.task
lola: E (X (A (F (((2 <= A24) AND (3 <= A23)))))) : E (F ((E (G ((B15 <= A1))) AND A (G ((A5 <= A23)))))) : E (F (((3 <= A15) AND (A25 <= A5) AND (3 <= B15)))) : A (G ((A (G ((1 <= A20))) OR ((A9 + 1 <= A17) AND (A25 <= 0))))) : E ((((A16 <= A3) AND ((A3 <= B24) OR (3 <= A15))) U ((2 <= B16) AND ((A17 <= B23) OR (A15 <= B9))))) : E ((((A12 <= 2) OR (A6 <= 2)) U (3 <= B23))) : A (F ((((A22 <= A9) OR (2 <= A11)) AND ((2 <= A24) OR (A8 <= A2)) AND ((B9 <= A3) OR (3 <= A28))))) : E (X (A (F (((3 <= A25) AND (A5 <= A7)))))) : NOT((((A15 <= A9) OR (A26 <= A25)) AND (E (G ((A17 <= A28))) AND E (F ((2 <= B23)))))) : A (F ((E (G ((1 <= A7))) AND A (G ((A2 <= B23)))))) : A (G ((((A15 <= 0) OR (A25 + 1 <= B10)) OR E (F ((1 <= A12)))))) : (NOT(A (G (((A25 <= A27) OR (A23 <= A12))))) AND A ((((1 <= A18) AND (A22 <= A2)) U (A15 <= A3)))) : E (X (E (G ((A8 + 1 <= A2))))) : A (F ((((A14 + 1 <= A22) AND (A1 <= 2)) OR ((A4 <= 2) AND (A11 + 1 <= A27))))) : A (F ((2 <= B24))) : NOT(A (((B15 <= A21) U (B15 + 1 <= A5))))
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 (X (A (F (((2 <= A24) AND (3 <= A23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U ((2 <= A24) AND (3 <= A23))))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 145 markings, 160 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((B15 <= A1))) AND A (G ((A5 <= A23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (A1 + 1 <= B15))) AND NOT(E(TRUE U (A23 + 1 <= A5)))))
lola: processed formula length: 77
lola: 5 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 1139688 markings, 3442472 edges, 2097809911680335872 markings/sec, 0 secs
lola: 2222257 markings, 7185645 edges, 216514 markings/sec, 5 secs
lola: 3294157 markings, 10786154 edges, 214380 markings/sec, 10 secs
lola: 4310152 markings, 14356991 edges, 203199 markings/sec, 15 secs
lola: 5209692 markings, 18122047 edges, 179908 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6030629 markings, 22373179 edges
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= A15) AND (A25 <= A5) AND (3 <= B15))))
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 136 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 1 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-05track28LR-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-05track28LR-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((1 <= A20))) OR ((A9 + 1 <= A17) AND (A25 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((A (G ((1 <= A20))) OR ((A9 + 1 <= A17) AND (A25 <= 0)))))
lola: processed formula: A (G ((A (G ((1 <= A20))) OR ((A9 + 1 <= A17) AND (A25 <= 0)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 387585 markings, 1147937 edges, 77517 markings/sec, 0 secs
lola: 710018 markings, 2155576 edges, 64487 markings/sec, 5 secs
lola: 1019021 markings, 3189058 edges, 61801 markings/sec, 10 secs
lola: 1311649 markings, 4149571 edges, 58526 markings/sec, 15 secs
lola: 1600165 markings, 5118649 edges, 57703 markings/sec, 20 secs
lola: 1879679 markings, 6067842 edges, 55903 markings/sec, 25 secs
lola: 2161028 markings, 7034232 edges, 56270 markings/sec, 30 secs
lola: 2478730 markings, 8081824 edges, 63540 markings/sec, 35 secs
lola: 2808868 markings, 9178776 edges, 66028 markings/sec, 40 secs
lola: 3090827 markings, 10142686 edges, 56392 markings/sec, 45 secs
lola: 3369542 markings, 11101613 edges, 55743 markings/sec, 50 secs
lola: 3673379 markings, 12134462 edges, 60767 markings/sec, 55 secs
lola: 3951173 markings, 13107108 edges, 55559 markings/sec, 60 secs
lola: 4244403 markings, 14135579 edges, 58646 markings/sec, 65 secs
lola: 4524906 markings, 15127942 edges, 56101 markings/sec, 70 secs
lola: 4796802 markings, 16119278 edges, 54379 markings/sec, 75 secs
lola: 5149534 markings, 17586185 edges, 70546 markings/sec, 80 secs
lola: 5498983 markings, 19046544 edges, 69890 markings/sec, 85 secs
lola: 5849978 markings, 20508355 edges, 70199 markings/sec, 90 secs
lola: 6238755 markings, 21905975 edges, 77755 markings/sec, 95 secs
lola: 6590271 markings, 23393614 edges, 70303 markings/sec, 100 secs
lola: 6926457 markings, 24637046 edges, 67237 markings/sec, 105 secs
lola: 7252409 markings, 25843248 edges, 65190 markings/sec, 110 secs
lola: 7569741 markings, 26997867 edges, 63466 markings/sec, 115 secs
lola: 7867324 markings, 28150028 edges, 59517 markings/sec, 120 secs
lola: 8138949 markings, 29261133 edges, 54325 markings/sec, 125 secs
lola: 8435495 markings, 30768196 edges, 59309 markings/sec, 130 secs
lola: 8715284 markings, 32035579 edges, 55958 markings/sec, 135 secs
lola: 8999814 markings, 33259854 edges, 56906 markings/sec, 140 secs
lola: 9284661 markings, 34323268 edges, 56969 markings/sec, 145 secs
lola: 9593773 markings, 35590536 edges, 61822 markings/sec, 150 secs
lola: 9910663 markings, 37193245 edges, 63378 markings/sec, 155 secs
lola: 10200549 markings, 38483596 edges, 57977 markings/sec, 160 secs
lola: 10485713 markings, 39739436 edges, 57033 markings/sec, 165 secs
lola: 10779296 markings, 40851669 edges, 58717 markings/sec, 170 secs
lola: 11053179 markings, 41857273 edges, 54777 markings/sec, 175 secs
lola: 11335239 markings, 42886952 edges, 56412 markings/sec, 180 secs
lola: 11627982 markings, 44144818 edges, 58549 markings/sec, 185 secs
lola: 11933829 markings, 45756966 edges, 61169 markings/sec, 190 secs
lola: 12240926 markings, 47221225 edges, 61419 markings/sec, 195 secs
lola: 12531367 markings, 48453148 edges, 58088 markings/sec, 200 secs
lola: 12807468 markings, 49619562 edges, 55220 markings/sec, 205 secs
lola: 13085188 markings, 50821681 edges, 55544 markings/sec, 210 secs
lola: 13362354 markings, 52030846 edges, 55433 markings/sec, 215 secs
lola: 13637802 markings, 53197993 edges, 55090 markings/sec, 220 secs
lola: 13921179 markings, 54414429 edges, 56675 markings/sec, 225 secs
lola: 14205649 markings, 55495121 edges, 56894 markings/sec, 230 secs
lola: 14474433 markings, 56528749 edges, 53757 markings/sec, 235 secs
lola: 14718542 markings, 57460699 edges, 48822 markings/sec, 240 secs
lola: 14992708 markings, 58508802 edges, 54833 markings/sec, 245 secs
lola: 15268692 markings, 59865754 edges, 55197 markings/sec, 250 secs
lola: 15565826 markings, 61473306 edges, 59427 markings/sec, 255 secs
lola: 15857593 markings, 63066259 edges, 58353 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((A16 <= A3) AND ((A3 <= B24) OR (3 <= A15))) U ((2 <= B16) AND ((A17 <= B23) OR (A15 <= B9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((A16 <= A3) AND ((A3 <= B24) OR (3 <= A15))) U ((2 <= B16) AND ((A17 <= B23) OR (A15 <= B9))))
lola: processed formula length: 99
lola: 1 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 1990327 markings, 3858979 edges, 2072699952319954944 markings/sec, 0 secs
lola: 3798056 markings, 7448487 edges, 361546 markings/sec, 5 secs
lola: 5315113 markings, 11453385 edges, 303411 markings/sec, 10 secs
lola: 6847154 markings, 15272276 edges, 306408 markings/sec, 15 secs
lola: 8488442 markings, 19143456 edges, 328258 markings/sec, 20 secs
lola: 10270246 markings, 22559724 edges, 356361 markings/sec, 25 secs
lola: 11924357 markings, 26371438 edges, 330822 markings/sec, 30 secs
lola: 13385580 markings, 30162337 edges, 292245 markings/sec, 35 secs
lola: 14968254 markings, 33904397 edges, 316535 markings/sec, 40 secs
lola: 16563630 markings, 37464803 edges, 319075 markings/sec, 45 secs
lola: 18092240 markings, 40873275 edges, 305722 markings/sec, 50 secs
lola: 19574348 markings, 44215934 edges, 296422 markings/sec, 55 secs
lola: 21024371 markings, 47922744 edges, 290005 markings/sec, 60 secs
lola: 22380087 markings, 51662644 edges, 271143 markings/sec, 65 secs
lola: 23671041 markings, 55350593 edges, 258191 markings/sec, 70 secs
lola: 24892833 markings, 58879718 edges, 244358 markings/sec, 75 secs
lola: 26109245 markings, 62761946 edges, 243282 markings/sec, 80 secs
lola: 27561539 markings, 66377372 edges, 290459 markings/sec, 85 secs
lola: 28824176 markings, 70257010 edges, 252527 markings/sec, 90 secs
lola: 30148722 markings, 73916553 edges, 264909 markings/sec, 95 secs
lola: 31383144 markings, 77342282 edges, 246884 markings/sec, 100 secs
lola: 32554075 markings, 81078973 edges, 234186 markings/sec, 105 secs
lola: 33631449 markings, 84739409 edges, 215475 markings/sec, 110 secs
lola: 35074142 markings, 88645824 edges, 288539 markings/sec, 115 secs
lola: 36703399 markings, 92519613 edges, 325851 markings/sec, 120 secs
lola: 38224582 markings, 96212614 edges, 304237 markings/sec, 125 secs
lola: 39550579 markings, 100001986 edges, 265199 markings/sec, 130 secs
lola: 40951807 markings, 103747481 edges, 280246 markings/sec, 135 secs
lola: 42304039 markings, 107310103 edges, 270446 markings/sec, 140 secs
lola: 43775185 markings, 110878223 edges, 294229 markings/sec, 145 secs
lola: 45061565 markings, 114316160 edges, 257276 markings/sec, 150 secs
lola: 46506292 markings, 117699047 edges, 288945 markings/sec, 155 secs
lola: 47793129 markings, 120851238 edges, 257367 markings/sec, 160 secs
lola: 48943664 markings, 124250859 edges, 230107 markings/sec, 165 secs
lola: 50389313 markings, 128261284 edges, 289130 markings/sec, 170 secs
lola: 51704067 markings, 131416385 edges, 262951 markings/sec, 175 secs
lola: 53023459 markings, 134589780 edges, 263878 markings/sec, 180 secs
lola: 54239467 markings, 137543783 edges, 243202 markings/sec, 185 secs
lola: 55314383 markings, 140560533 edges, 214983 markings/sec, 190 secs
lola: 56383913 markings, 143735312 edges, 213906 markings/sec, 195 secs
lola: 57416562 markings, 147110170 edges, 206530 markings/sec, 200 secs
lola: 58640711 markings, 150258628 edges, 244830 markings/sec, 205 secs
lola: 59837207 markings, 153283276 edges, 239299 markings/sec, 210 secs
lola: 61080998 markings, 156509397 edges, 248758 markings/sec, 215 secs
lola: 62436796 markings, 159830555 edges, 271160 markings/sec, 220 secs
lola: 63918953 markings, 162961109 edges, 296431 markings/sec, 225 secs
lola: 65227216 markings, 166136226 edges, 261653 markings/sec, 230 secs
lola: 66356791 markings, 169206150 edges, 225915 markings/sec, 235 secs
lola: 67832565 markings, 172280950 edges, 295155 markings/sec, 240 secs
lola: 68985572 markings, 174992325 edges, 230601 markings/sec, 245 secs
lola: 70012657 markings, 177836636 edges, 205417 markings/sec, 250 secs
lola: 71066071 markings, 180792759 edges, 210683 markings/sec, 255 secs
lola: 72139307 markings, 183704082 edges, 214647 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((A12 <= 2) OR (A6 <= 2)) U (3 <= B23)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((A12 <= 2) OR (A6 <= 2)) U (3 <= B23))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 1143106 markings, 3452248 edges, 3689330178019819520 markings/sec, 0 secs
lola: 2226271 markings, 7198011 edges, 216633 markings/sec, 5 secs
lola: 3294093 markings, 10785969 edges, 213564 markings/sec, 10 secs
lola: 4303280 markings, 14330192 edges, 201837 markings/sec, 15 secs
lola: 5196012 markings, 18051978 edges, 178546 markings/sec, 20 secs
lola: 6024752 markings, 22341103 edges, 165748 markings/sec, 25 secs
lola: 6817994 markings, 26373778 edges, 158648 markings/sec, 30 secs
lola: 7593260 markings, 30498180 edges, 155053 markings/sec, 35 secs
lola: 8324522 markings, 34477366 edges, 146252 markings/sec, 40 secs
lola: 8971699 markings, 38862466 edges, 129435 markings/sec, 45 secs
lola: 9743234 markings, 42828840 edges, 154307 markings/sec, 50 secs
lola: 10509598 markings, 46966198 edges, 153273 markings/sec, 55 secs
lola: 11242868 markings, 50958754 edges, 146654 markings/sec, 60 secs
lola: 11900240 markings, 55098840 edges, 131474 markings/sec, 65 secs
lola: 12497383 markings, 59279174 edges, 119429 markings/sec, 70 secs
lola: 13072426 markings, 63519047 edges, 115009 markings/sec, 75 secs
lola: 13641675 markings, 67839431 edges, 113850 markings/sec, 80 secs
lola: 14365936 markings, 71748406 edges, 144852 markings/sec, 85 secs
lola: 15123205 markings, 75532669 edges, 151454 markings/sec, 90 secs
lola: 15828249 markings, 79176734 edges, 141009 markings/sec, 95 secs
lola: 16446519 markings, 83238116 edges, 123654 markings/sec, 100 secs
lola: 17039071 markings, 87277990 edges, 118510 markings/sec, 105 secs
lola: 17588859 markings, 91236722 edges, 109958 markings/sec, 110 secs
lola: 18137001 markings, 95353938 edges, 109628 markings/sec, 115 secs
lola: 18716581 markings, 99432435 edges, 115916 markings/sec, 120 secs
lola: 19232562 markings, 103573091 edges, 103196 markings/sec, 125 secs
lola: 19680323 markings, 107558756 edges, 89552 markings/sec, 130 secs
lola: 20345836 markings, 111894216 edges, 133103 markings/sec, 135 secs
lola: 21175130 markings, 115964666 edges, 165859 markings/sec, 140 secs
lola: 21887960 markings, 120107375 edges, 142566 markings/sec, 145 secs
lola: 22494478 markings, 124264815 edges, 121304 markings/sec, 150 secs
lola: 23071798 markings, 128538949 edges, 115464 markings/sec, 155 secs
lola: 23665732 markings, 132642860 edges, 118787 markings/sec, 160 secs
lola: 24182521 markings, 136992517 edges, 103358 markings/sec, 165 secs
lola: 24733008 markings, 141316745 edges, 110097 markings/sec, 170 secs
lola: 25327834 markings, 145425470 edges, 118965 markings/sec, 175 secs
lola: 25821496 markings, 149701019 edges, 98732 markings/sec, 180 secs
lola: 26293255 markings, 153955307 edges, 94352 markings/sec, 185 secs
lola: 27047734 markings, 158162650 edges, 150896 markings/sec, 190 secs
lola: 27996258 markings, 161991404 edges, 189705 markings/sec, 195 secs
lola: 28894586 markings, 165365266 edges, 179666 markings/sec, 200 secs
lola: 29727485 markings, 168523173 edges, 166580 markings/sec, 205 secs
lola: 30537574 markings, 172396791 edges, 162018 markings/sec, 210 secs
lola: 31413215 markings, 176101000 edges, 175128 markings/sec, 215 secs
lola: 32209470 markings, 179671584 edges, 159251 markings/sec, 220 secs
lola: 33109691 markings, 182952440 edges, 180044 markings/sec, 225 secs
lola: 33871387 markings, 186764597 edges, 152339 markings/sec, 230 secs
lola: 34677140 markings, 190162179 edges, 161151 markings/sec, 235 secs
lola: 35473714 markings, 193652113 edges, 159315 markings/sec, 240 secs
lola: 36296206 markings, 196813675 edges, 164498 markings/sec, 245 secs
lola: 37042806 markings, 200215442 edges, 149320 markings/sec, 250 secs
lola: 37771037 markings, 203853039 edges, 145646 markings/sec, 255 secs
lola: 38487662 markings, 207113485 edges, 143325 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((A22 <= A9) OR (2 <= A11)) AND ((2 <= A24) OR (A8 <= A2)) AND ((B9 <= A3) OR (3 <= A28)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((A22 <= A9) OR (2 <= A11)) AND ((2 <= A24) OR (A8 <= A2)) AND ((B9 <= A3) OR (3 <= A28)))))
lola: processed formula: A (F ((((A22 <= A9) OR (2 <= A11)) AND ((2 <= A24) OR (A8 <= A2)) AND ((B9 <= A3) OR (3 <= A28)))))
lola: processed formula length: 102
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 7 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((3 <= A25) AND (A5 <= A7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U ((3 <= A25) AND (A5 <= A7))))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 145 markings, 160 edges
lola: ========================================
lola: subprocess 8 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((A15 <= A9) OR (A26 <= A25)) AND (E (G ((A17 <= A28))) AND E (F ((2 <= B23))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A9 + 1 <= A15) AND (A25 + 1 <= A26))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((A9 + 1 <= A15) AND (A25 + 1 <= A26))
lola: processed formula length: 38
lola: 9 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: processed formula with 2 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A28 + 1 <= A17)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A28 + 1 <= A17)))
lola: processed formula: A (F ((A28 + 1 <= A17)))
lola: processed formula length: 24
lola: 9 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 10 will run for 450 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((B23 <= 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 136 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: yes
lola: produced by: state space
lola: state equation: write sara problem file to DNAwalker-PT-05track28LR-CTLCardinality-10.sara
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: lola: ========================================
state equation: calling and running saralola:
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((1 <= A7))) AND A (G ((A2 <= B23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(A(TRUE U (A7 <= 0))) AND NOT(E(TRUE U (B23 + 1 <= A2)))))
lola: processed formula length: 71
lola: 5 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNINGsara:
try reading problem file DNAwalker-PT-05track28LR-CTLCardinality-10.sara.lola:
CTL formula contains 3 significant temporal operators and needs 13 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: 45 markings, 85 edges
lola: ========================================
lola: subprocess 10 will run for 450 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((A15 <= 0) OR (A25 + 1 <= B10)) OR E (F ((1 <= A12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (((1 <= A15) AND (B10 <= A25)) AND NOT(E(TRUE U (1 <= A12))))))
lola: processed formula length: 76
lola: 4 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 60022 markings, 193875 edges
lola: ========================================
lola: subprocess 11 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((A25 <= A27) OR (A23 <= A12))))) AND A ((((1 <= A18) AND (A22 <= A2)) U (A15 <= A3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((A27 + 1 <= A25) AND (A12 + 1 <= A23))))
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 136 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 DNAwalker-PT-05track28LR-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-05track28LR-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 517796 markings, 1231777 edges, 103559 markings/sec, 0 secs
lola: sara is running 5 secs || 1037516 markings, 2288344 edges, 103944 markings/sec, 5 secs
lola: sara is running 10 secs || 1523617 markings, 3762668 edges, 97220 markings/sec, 10 secs
lola: sara is running 15 secs || 2023947 markings, 5145256 edges, 100066 markings/sec, 15 secs
lola: sara is running 20 secs || 2519402 markings, 6503233 edges, 99091 markings/sec, 20 secs
lola: sara is running 25 secs || 2899426 markings, 7998393 edges, 76005 markings/sec, 25 secs
lola: sara is running 30 secs || 3252886 markings, 9408692 edges, 70692 markings/sec, 30 secs
lola: sara is running 35 secs || 3621488 markings, 10863112 edges, 73720 markings/sec, 35 secs
lola: sara is running 40 secs || 4004209 markings, 12303070 edges, 76544 markings/sec, 40 secs
lola: sara is running 45 secs || 4377372 markings, 13692510 edges, 74633 markings/sec, 45 secs
lola: sara is running 50 secs || 4836308 markings, 14998495 edges, 91787 markings/sec, 50 secs
lola: sara is running 55 secs || 5185248 markings, 16436931 edges, 69788 markings/sec, 55 secs
lola: sara is running 60 secs || 5529736 markings, 17940044 edges, 68898 markings/sec, 60 secs
lola: sara is running 65 secs || 5870742 markings, 19411208 edges, 68201 markings/sec, 65 secs
lola: sara is running 70 secs || 6218430 markings, 20784009 edges, 69538 markings/sec, 70 secs
lola: sara is running 75 secs || 6535980 markings, 22161833 edges, 63510 markings/sec, 75 secs
lola: sara is running 80 secs || 6868847 markings, 23612280 edges, 66573 markings/sec, 80 secs
lola: sara is running 85 secs || 7196465 markings, 25046462 edges, 65524 markings/sec, 85 secs
lola: sara is running 90 secs || 7527497 markings, 26385018 edges, 66206 markings/sec, 90 secs
lola: sara is running 95 secs || 7860473 markings, 27813937 edges, 66595 markings/sec, 95 secs
lola: sara is running 100 secs || 8199622 markings, 29111443 edges, 67830 markings/sec, 100 secs
lola: sara is running 105 secs || 8560023 markings, 30512397 edges, 72080 markings/sec, 105 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8920960 markings, 31843878 edges
lola: ========================================
lola: subprocess 12 will run for 646 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= A18) AND (A22 <= A2)) U (A15 <= A3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= A18) AND (A22 <= A2)) U (A15 <= A3)))
lola: processed formula: A ((((1 <= A18) AND (A22 <= A2)) U (A15 <= A3)))
lola: processed formula length: 48
lola: 3 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 646 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((A8 + 1 <= A2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (A2 <= A8))))
lola: processed formula length: 29
lola: 3 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4146 markings, 6333 edges
lola: ========================================
lola: subprocess 13 will run for 861 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((A14 + 1 <= A22) AND (A1 <= 2)) OR ((A4 <= 2) AND (A11 + 1 <= A27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((A14 + 1 <= A22) AND (A1 <= 2)) OR ((A4 <= 2) AND (A11 + 1 <= A27)))))
lola: processed formula: A (F ((((A14 + 1 <= A22) AND (A1 <= 2)) OR ((A4 <= 2) AND (A11 + 1 <= A27)))))
lola: processed formula length: 79
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 14 will run for 1292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= B24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= B24)))
lola: processed formula: A (F ((2 <= B24)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 15 will run for 2585 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (((B15 <= A21) U (B15 + 1 <= A5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((B15 <= A21) U (B15 + 1 <= A5)))
lola: processed formula length: 38
lola: 7 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-05track28LR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 16 markings, 16 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no unknown unknown unknown no no yes no no yes no no no yes
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-05track28LR-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="DNAwalker-PT-05track28LR"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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/DNAwalker-PT-05track28LR.tgz
mv DNAwalker-PT-05track28LR execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is DNAwalker-PT-05track28LR, 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 r070-smll-152649743100255"
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 ;