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 168K
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 16K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is FMS-PT-100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-blw7-152650006000080
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527484985056


BK_STOP 1527485690051

--------------------
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 FMS-PT-100 as instance name.
Using FMS 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': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 60239, 'Memory': 3565.97, 'Tool': 'lola'}, {'Time': 61386, 'Memory': 3565.17, 'Tool': 'lola'}, {'Time': 1016091, 'Memory': 15952.93, 'Tool': 'marcie'}, {'Time': 1050720, 'Memory': 15953.21, 'Tool': 'marcie'}, {'Time': 1732445, 'Memory': 15947.27, 'Tool': 'itstools'}, {'Time': 1891074, 'Memory': 15952.89, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola FMS-PT-100...

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


checking for too many tokens
===========================================================================================
FMS-PT-100: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ FMS-PT-100 @ 3540 seconds
----- Start make result stderr -----
----- 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-100-CTLCardinality.task
lola: A (G (((P2s <= 2) OR (P12wM3 + 1 <= P1wM1) OR (P3M2 <= P1)))) : A (G (NOT(E (G ((2 <= P2wP1)))))) : A (X (E (F ((3 <= P12s))))) : A (G (E (X ((P1s <= 0))))) : E (F ((P2 + 1 <= P2d))) : (((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d)) OR E (F (E (X ((3 <= P2wP1)))))) : NOT((E (F (((P2M2 <= P3s) AND (1 <= P1d)))) AND NOT(A (G ((3 <= P3)))))) : A (G (E (X (((P1d <= P12) OR (P2s <= M1)))))) : A (G (NOT(A (G ((P2M2 <= P12s)))))) : A (F (E (((P2d <= P1wM1) U (2 <= P12M3))))) : A (G (E (F (TRUE)))) : A (X ((A (G ((P1wM1 <= P1))) OR ((2 <= P1s) OR (P3M2 <= 0))))) : NOT(E (F ((3 <= P2wP1)))) : ((2 <= P12) OR A (G (E (F ((1 <= P1d)))))) : NOT(E (F ((P1 <= P2wP1)))) : (E ((((P1wP2 <= P1d) OR (1 <= P1wP2)) U ((1 <= P12s) OR (1 <= P12wM3)))) AND (1 <= P3))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P2s <= 2) OR (P12wM3 + 1 <= P1wM1) OR (P3M2 <= P1))))
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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 311 markings, 310 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((2 <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (P2wP1 <= 1)))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-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: 621 markings, 1243 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= P12s)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (3 <= P12s)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-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: 2905055 markings, 5096475 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((P1s <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((P1s <= 0)))))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-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: 4277890 markings, 8054771 edges, 3689348869717491712 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: 4339895 markings, 8208078 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((P2 + 1 <= P2d)))
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 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-100-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 103 markings, 102 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d)) OR E (F (E (X ((3 <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d))
lola: processed formula length: 93
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((3 <= P2wP1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((3 <= P2wP1)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-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: 41009 markings, 74705 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((P2M2 <= P3s) AND (1 <= P1d)))) AND NOT(A (G ((3 <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P3s + 1 <= P2M2) OR (P1d <= 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: state equation: write sara problem file to FMS-PT-100-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= 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: 99 markings, 98 edges
lola: state equation: write sara problem file to FMS-PT-100-CTLCardinality-7.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((P1d <= P12) OR (P2s <= M1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((P1d <= P12) OR (P2s <= M1))))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-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: 4213252 markings, 7894677 edges, 2039898496806420480 markings/sec, 0 secs
lola: 6940409 markings, 14488781 edges, 545431 markings/sec, 5 secs
lola: 9380076 markings, 20512699 edges, 487933 markings/sec, 10 secs
lola: 11475811 markings, 26011294 edges, 419147 markings/sec, 15 secs
lola: 13547173 markings, 31397622 edges, 414272 markings/sec, 20 secs
lola: 15503837 markings, 36653567 edges, 391333 markings/sec, 25 secs
lola: 17504707 markings, 41898203 edges, 400174 markings/sec, 30 secs
lola: 19387934 markings, 47007535 edges, 376645 markings/sec, 35 secs
lola: 21279646 markings, 52092689 edges, 378342 markings/sec, 40 secs
lola: 23224999 markings, 57256607 edges, 389071 markings/sec, 45 secs
lola: 25042031 markings, 62153258 edges, 363406 markings/sec, 50 secs
lola: 27145907 markings, 67448619 edges, 420775 markings/sec, 55 secs
lola: 28946554 markings, 72306687 edges, 360129 markings/sec, 60 secs
lola: 30671089 markings, 77023249 edges, 344907 markings/sec, 65 secs
lola: 32522436 markings, 82049965 edges, 370269 markings/sec, 70 secs
lola: 34385687 markings, 87030032 edges, 372650 markings/sec, 75 secs
lola: 36106406 markings, 91762168 edges, 344144 markings/sec, 80 secs
lola: 37880744 markings, 96567308 edges, 354868 markings/sec, 85 secs
lola: 39649362 markings, 101383404 edges, 353724 markings/sec, 90 secs
lola: 41411517 markings, 106216451 edges, 352431 markings/sec, 95 secs
lola: 43097985 markings, 110892925 edges, 337294 markings/sec, 100 secs
lola: 44738097 markings, 115491630 edges, 328022 markings/sec, 105 secs
lola: 46414381 markings, 120105350 edges, 335257 markings/sec, 110 secs
lola: 48100249 markings, 124676750 edges, 337174 markings/sec, 115 secs
lola: 49776906 markings, 129308892 edges, 335331 markings/sec, 120 secs
lola: 51524233 markings, 134064897 edges, 349465 markings/sec, 125 secs
lola: 53252708 markings, 138777015 edges, 345695 markings/sec, 130 secs
lola: 54899523 markings, 143333285 edges, 329363 markings/sec, 135 secs
lola: 56534843 markings, 147863251 edges, 327064 markings/sec, 140 secs
lola: 58154940 markings, 152378522 edges, 324019 markings/sec, 145 secs
lola: 59768150 markings, 156880300 edges, 322642 markings/sec, 150 secs
lola: 61442909 markings, 161490823 edges, 334952 markings/sec, 155 secs
lola: 63070735 markings, 166002840 edges, 325565 markings/sec, 160 secs
lola: 64684313 markings, 170514546 edges, 322716 markings/sec, 165 secs
lola: 66325378 markings, 175054131 edges, 328213 markings/sec, 170 secs
lola: 67821757 markings, 179157645 edges, 299276 markings/sec, 175 secs
lola: 67823903 markings, 179162611 edges, 429 markings/sec, 180 secs
lola: 67826079 markings, 179168605 edges, 435 markings/sec, 185 secs
lola: 67828477 markings, 179176186 edges, 480 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (G ((P2M2 <= P12s))))))
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 (P12s + 1 <= P2M2)))))
lola: processed formula length: 48
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-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: 1588403 markings, 5382813 edges, 3689348869717491712 markings/sec, 0 secs
lola: 3089287 markings, 10488996 edges, 300177 markings/sec, 5 secs
lola: 4560048 markings, 15496809 edges, 294152 markings/sec, 10 secs
lola: 6108731 markings, 20769691 edges, 309737 markings/sec, 15 secs
lola: 7581685 markings, 25788051 edges, 294591 markings/sec, 20 secs
lola: 9090146 markings, 30929525 edges, 301692 markings/sec, 25 secs
lola: 10597526 markings, 36067342 edges, 301476 markings/sec, 30 secs
lola: 12088492 markings, 41150180 edges, 298193 markings/sec, 35 secs
lola: 13590011 markings, 46272262 edges, 300304 markings/sec, 40 secs
lola: 15070887 markings, 51323460 edges, 296175 markings/sec, 45 secs
lola: 16558157 markings, 56400171 edges, 297454 markings/sec, 50 secs
lola: 18027978 markings, 61412321 edges, 293964 markings/sec, 55 secs
lola: 19451266 markings, 66270323 edges, 284658 markings/sec, 60 secs
lola: 20914520 markings, 71263103 edges, 292651 markings/sec, 65 secs
lola: 22377716 markings, 76254365 edges, 292639 markings/sec, 70 secs
lola: 23857368 markings, 81307769 edges, 295930 markings/sec, 75 secs
lola: 25329184 markings, 86331013 edges, 294363 markings/sec, 80 secs
lola: 26780188 markings, 91284451 edges, 290201 markings/sec, 85 secs
lola: 28169285 markings, 96026240 edges, 277819 markings/sec, 90 secs
lola: 29614489 markings, 100958683 edges, 289041 markings/sec, 95 secs
lola: 31081834 markings, 105971072 edges, 293469 markings/sec, 100 secs
lola: 32545185 markings, 110967660 edges, 292670 markings/sec, 105 secs
lola: 33995152 markings, 115918689 edges, 289993 markings/sec, 110 secs
lola: 35429350 markings, 120814523 edges, 286840 markings/sec, 115 secs
lola: 36879049 markings, 125766160 edges, 289940 markings/sec, 120 secs
lola: 38342320 markings, 130762268 edges, 292654 markings/sec, 125 secs
lola: 39782497 markings, 135682350 edges, 288035 markings/sec, 130 secs
lola: 41230902 markings, 140629568 edges, 289681 markings/sec, 135 secs
lola: 42674062 markings, 145557634 edges, 288632 markings/sec, 140 secs
lola: 44122046 markings, 150502818 edges, 289597 markings/sec, 145 secs
lola: 45583158 markings, 155495370 edges, 292222 markings/sec, 150 secs
lola: 47047188 markings, 160496106 edges, 292806 markings/sec, 155 secs
lola: 48538359 markings, 165594566 edges, 298234 markings/sec, 160 secs
lola: 49992052 markings, 170560840 edges, 290739 markings/sec, 165 secs
lola: 51437878 markings, 175497740 edges, 289165 markings/sec, 170 secs
lola: 52897864 markings, 180485683 edges, 291997 markings/sec, 175 secs
lola: 54350131 markings, 185449263 edges, 290453 markings/sec, 180 secs
lola: 55805453 markings, 190421163 edges, 291064 markings/sec, 185 secs
lola: 57261239 markings, 195394131 edges, 291157 markings/sec, 190 secs
lola: 58697970 markings, 200305182 edges, 287346 markings/sec, 195 secs
lola: 60147124 markings, 205257522 edges, 289831 markings/sec, 200 secs
lola: 61613980 markings, 210269745 edges, 293371 markings/sec, 205 secs
lola: 63024286 markings, 215090919 edges, 282061 markings/sec, 210 secs
lola: 64491696 markings, 220106765 edges, 293482 markings/sec, 215 secs
lola: 65954989 markings, 225110025 edges, 292659 markings/sec, 220 secs
lola: 67414983 markings, 230099797 edges, 291999 markings/sec, 225 secs
lola: 68863092 markings, 235050363 edges, 289622 markings/sec, 230 secs
lola: 70327985 markings, 240057896 edges, 292979 markings/sec, 235 secs
lola: 71785853 markings, 245043759 edges, 291574 markings/sec, 240 secs
lola: 73220215 markings, 249944336 edges, 286872 markings/sec, 245 secs
lola: 74684303 markings, 254950641 edges, 292818 markings/sec, 250 secs
lola: 76131778 markings, 259899635 edges, 289495 markings/sec, 255 secs
lola: 77575141 markings, 264832752 edges, 288673 markings/sec, 260 secs
lola: 79021334 markings, 269773445 edges, 289239 markings/sec, 265 secs
lola: 80467922 markings, 274720455 edges, 289318 markings/sec, 270 secs
lola: 81916977 markings, 279675606 edges, 289811 markings/sec, 275 secs
lola: 83377791 markings, 284672927 edges, 292163 markings/sec, 280 secs
lola: 84818118 markings, 289594759 edges, 288065 markings/sec, 285 secs
lola: 86263488 markings, 294538228 edges, 289074 markings/sec, 290 secs
lola: 87719101 markings, 299515485 edges, 291123 markings/sec, 295 secs
lola: 89124607 markings, 304323382 edges, 281101 markings/sec, 300 secs
lola: 90554382 markings, 309209964 edges, 285955 markings/sec, 305 secs
lola: 91965634 markings, 314036701 edges, 282250 markings/sec, 310 secs
lola: 93415105 markings, 318993217 edges, 289894 markings/sec, 315 secs
lola: 94866405 markings, 323953829 edges, 290260 markings/sec, 320 secs
lola: 96309289 markings, 328891433 edges, 288577 markings/sec, 325 secs
lola: 97703976 markings, 333658758 edges, 278937 markings/sec, 330 secs
lola: 99136135 markings, 338555468 edges, 286432 markings/sec, 335 secs
lola: 100574972 markings, 343472349 edges, 287767 markings/sec, 340 secs
lola: 102009372 markings, 348377612 edges, 286880 markings/sec, 345 secs
lola: 103436954 markings, 353259197 edges, 285516 markings/sec, 350 secs
lola: 104867103 markings, 358150298 edges, 286030 markings/sec, 355 secs
lola: 106279719 markings, 362984704 edges, 282523 markings/sec, 360 secs
lola: 107702873 markings, 367852727 edges, 284631 markings/sec, 365 secs
lola: 109126015 markings, 372721386 edges, 284628 markings/sec, 370 secs
lola: 110551002 markings, 377593614 edges, 284997 markings/sec, 375 secs
lola: 111969296 markings, 382445002 edges, 283659 markings/sec, 380 secs
lola: 113374640 markings, 387251466 edges, 281069 markings/sec, 385 secs
lola: 114796397 markings, 392112760 edges, 284351 markings/sec, 390 secs
lola: 116212723 markings, 396958890 edges, 283265 markings/sec, 395 secs
lola: 117611621 markings, 401743118 edges, 279780 markings/sec, 400 secs
lola: 118966879 markings, 406378369 edges, 271052 markings/sec, 405 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((P2d <= P1wM1) U (2 <= P12M3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((P2d <= P1wM1) U (2 <= P12M3)))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13186 markings, 18676 edges
lola: ========================================
lola: subprocess 10 will run for 484 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 581 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((P1wM1 <= P1))) OR ((2 <= P1s) OR (P3M2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((A (G ((P1wM1 <= P1))) OR ((2 <= P1s) OR (P3M2 <= 0)))))
lola: processed formula: A (X ((A (G ((P1wM1 <= P1))) OR ((2 <= P1s) OR (P3M2 <= 0)))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 30456 markings, 55505 edges
lola: ========================================
lola: subprocess 12 will run for 726 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((3 <= P2wP1))))
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: 13 markings, 12 edges
lola: ========================================
lola: subprocess 13 will run for 968 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= P12) OR A (G (E (F ((1 <= P1d))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 968 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= P12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= P12)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: processed formula with 1 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 14 will run for 1453 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= P1d)))))
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 (1 <= P1d)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-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: 3201282 markings, 7453379 edges, 2011398055902838784 markings/sec, 0 secs
lola: 6348786 markings, 14783052 edges, 629501 markings/sec, 5 secs
lola: 9492754 markings, 22096879 edges, 628794 markings/sec, 10 secs
lola: 12196270 markings, 28626184 edges, 540703 markings/sec, 15 secs
lola: 14334888 markings, 34324707 edges, 427724 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 15211208 markings, 36724725 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((P1 <= P2wP1))))
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-100-CTLCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
lola: ========================================
lola: subprocess 15 will run for 2878 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((P1wP2 <= P1d) OR (1 <= P1wP2)) U ((1 <= P12s) OR (1 <= P12wM3)))) AND (1 <= P3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2878 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((P1wP2 <= P1d) OR (1 <= P1wP2)) U ((1 <= P12s) OR (1 <= P12wM3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((P1wP2 <= P1d) OR (1 <= P1wP2)) U ((1 <= P12s) OR (1 <= P12wM3)))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-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: 809 markings, 910 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes yes no unknown unknown yes yes no no yes no unknown
FORMULA FMS-PT-100-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="FMS-PT-100"
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/FMS-PT-100.tgz
mv FMS-PT-100 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 FMS-PT-100, 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 r094-blw7-152650006000080"
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 ;