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 188K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:26 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 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.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 17K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is FMS-PT-200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-blw7-152650006000087
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527485610210


BK_STOP 1527486087115

--------------------
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-200 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': 926028, 'Memory': 15944.05, 'Tool': 'lola'}, {'Time': 969484, 'Memory': 15938.68, 'Tool': 'lola'}, {'Time': 1614630, 'Memory': 15953.07, 'Tool': 'marcie'}, {'Time': 1696009, 'Memory': 15953.27, 'Tool': 'marcie'}, {'Time': 2161758, 'Memory': 15934.91, 'Tool': 'itstools'}, {'Time': 2318384, 'Memory': 15948.64, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola FMS-PT-200...

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


checking for too many tokens
===========================================================================================
FMS-PT-200: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ FMS-PT-200 @ 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-200-CTLCardinality.task
lola: (A (X (A (G (TRUE)))) OR (A (G ((P2 <= P1))) AND A (G (((3 <= P1wP2) AND (M1 <= P2wP1)))))) : E (F (((2 <= P3M2) AND (2 <= P2s)))) : (NOT(E (F ((3 <= P1s)))) OR NOT(E (G ((M3 <= P3))))) : E (F ((E (X ((2 <= M2))) AND ((3 <= P1s) OR ((1 <= P12s) AND (2 <= P2M2)))))) : (E ((((M1 <= P2wM2) OR (1 <= P12wM3)) U ((P12wM3 <= P1M1) OR (1 <= P2d)))) AND NOT(E (F ((M3 <= 0))))) : E (F ((E (G ((3 <= M2))) AND (3 <= P2wP1)))) : (E (G (E (F ((M2 <= P3M2))))) AND A (G (((P12M3 <= P12wM3) OR (P1 <= P2s) OR (1 <= M3) OR (1 <= P2wP1))))) : E ((((P1 <= 2) OR ((3 <= P3) AND (2 <= P2))) U (2 <= P12))) : A (((P3 <= P2wP1) U E (F ((P3 <= P1wP2))))) : E (X (E (F (((3 <= P2s) AND (M1 <= P2wP1)))))) : A ((((P2 <= 2) AND (P2wP1 + 1 <= P12s)) U E (F ((3 <= P1wP2))))) : (E (F ((((1 <= P12s) AND (P1wP2 <= P2wP1))))) OR A (X (((3 <= P3) AND (2 <= M3) AND (P2s <= P2d) AND (3 <= P1M1))))) : A (G (((3 <= P2d) OR (3 <= P3M2) OR ((P1wP2 <= M3)) OR (P12 <= P2wM2) OR (P3 + 1 <= M3)))) : (((1 <= P2wP1) OR A (G (((1 <= P1) OR (2 <= M1))))) OR (3 <= P12M3)) : E (((P12wM3 <= P1wM1) U ((3 <= P1s) AND (3 <= P1d) AND (P2d + 1 <= M2)))) : (((P12s <= P1d) OR (1 <= P3) OR (P2wP1 <= P3)) AND A (G (A (F (TRUE)))))
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 (X (A (G (TRUE)))) OR (A (G ((P2 <= P1))) AND A (G (((3 <= P1wP2) AND (M1 <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= P3M2) AND (2 <= P2s))))
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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F ((3 <= P1s)))) OR NOT(E (G ((M3 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P1s <= 2)))
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-200-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((P3 + 1 <= M3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((P3 + 1 <= M3)))
lola: processed formula: A (F ((P3 + 1 <= M3)))
lola: processed formula length: 22
lola: 6 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 804 markings, 804 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X ((2 <= M2))) AND ((3 <= P1s) OR ((1 <= P12s) AND (2 <= P2M2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (EX((2 <= M2)) AND ((3 <= P1s) OR ((1 <= P12s) AND (2 <= P2M2)))))
lola: processed formula length: 76
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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: 3644876 markings, 6347071 edges, 3689329903141912576 markings/sec, 0 secs
lola: 7110531 markings, 12343244 edges, 693131 markings/sec, 5 secs
lola: 10526329 markings, 18255173 edges, 683160 markings/sec, 10 secs
lola: 13928027 markings, 24144316 edges, 680340 markings/sec, 15 secs
lola: 17331184 markings, 30028964 edges, 680631 markings/sec, 20 secs
lola: 20683131 markings, 35835332 edges, 670389 markings/sec, 25 secs
lola: 24054561 markings, 42445448 edges, 674286 markings/sec, 30 secs
lola: 26860643 markings, 48411860 edges, 561216 markings/sec, 35 secs
lola: 29030716 markings, 53816321 edges, 434015 markings/sec, 40 secs
lola: 31042246 markings, 58983662 edges, 402306 markings/sec, 45 secs
lola: 33732819 markings, 64696582 edges, 538115 markings/sec, 50 secs
lola: 35721025 markings, 69725380 edges, 397641 markings/sec, 55 secs
lola: 37604672 markings, 74639686 edges, 376729 markings/sec, 60 secs
lola: 39449132 markings, 79466519 edges, 368892 markings/sec, 65 secs
lola: 41277394 markings, 84305063 edges, 365652 markings/sec, 70 secs
lola: 43163080 markings, 89065306 edges, 377137 markings/sec, 75 secs
lola: 44880402 markings, 93632471 edges, 343464 markings/sec, 80 secs
lola: 46556831 markings, 98172803 edges, 335286 markings/sec, 85 secs
lola: 48166365 markings, 102491824 edges, 321907 markings/sec, 90 secs
lola: 49478059 markings, 106045221 edges, 262339 markings/sec, 95 secs
lola: 50767875 markings, 109551925 edges, 257963 markings/sec, 100 secs
lola: 52127736 markings, 113057374 edges, 271972 markings/sec, 105 secs
lola: 53466159 markings, 116587297 edges, 267685 markings/sec, 110 secs
lola: 54784096 markings, 120137920 edges, 263587 markings/sec, 115 secs
lola: 56188663 markings, 123797913 edges, 280913 markings/sec, 120 secs
lola: 57535999 markings, 127412109 edges, 269467 markings/sec, 125 secs
lola: 58941952 markings, 131155631 edges, 281191 markings/sec, 130 secs
lola: 60319005 markings, 134712352 edges, 275411 markings/sec, 135 secs
lola: 61585260 markings, 138154540 edges, 253251 markings/sec, 140 secs
lola: 62827362 markings, 141571594 edges, 248420 markings/sec, 145 secs
lola: 64217410 markings, 145255283 edges, 278010 markings/sec, 150 secs
lola: 65506008 markings, 148773155 edges, 257720 markings/sec, 155 secs
lola: 66875561 markings, 152385333 edges, 273911 markings/sec, 160 secs
lola: 69181897 markings, 157114338 edges, 461267 markings/sec, 165 secs
lola: 69487044 markings, 157955339 edges, 61029 markings/sec, 170 secs
lola: 69490434 markings, 157963901 edges, 678 markings/sec, 175 secs
lola: 69493370 markings, 157974551 edges, 587 markings/sec, 180 secs
lola: 69494190 markings, 157976827 edges, 164 markings/sec, 185 secs
lola: 69496650 markings, 157985203 edges, 492 markings/sec, 190 secs
lola: 69497258 markings, 157986831 edges, 122 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((M1 <= P2wM2) OR (1 <= P12wM3)) U ((P12wM3 <= P1M1) OR (1 <= P2d)))) AND NOT(E (F ((M3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((M1 <= P2wM2) OR (1 <= P12wM3)) U ((P12wM3 <= P1M1) OR (1 <= P2d))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((M1 <= P2wM2) OR (1 <= P12wM3)) U ((P12wM3 <= P1M1) OR (1 <= P2d)))
lola: processed formula length: 72
lola: 4 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= M3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((3 <= M2))) AND (3 <= P2wP1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (M2 <= 2))) AND (3 <= P2wP1)))
lola: processed formula length: 53
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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: 4717934 markings, 11175317 edges, 3689329903141912576 markings/sec, 0 secs
lola: 9066782 markings, 21536212 edges, 869770 markings/sec, 5 secs
lola: 13165414 markings, 31295984 edges, 819726 markings/sec, 10 secs
lola: 17129432 markings, 40732668 edges, 792804 markings/sec, 15 secs
lola: 21055564 markings, 50078624 edges, 785226 markings/sec, 20 secs
lola: 24967621 markings, 59389523 edges, 782411 markings/sec, 25 secs
lola: 28801091 markings, 68509582 edges, 766694 markings/sec, 30 secs
lola: 32582699 markings, 77508302 edges, 756322 markings/sec, 35 secs
lola: 36301792 markings, 86357609 edges, 743819 markings/sec, 40 secs
lola: 39976528 markings, 95100536 edges, 734947 markings/sec, 45 secs
lola: 43640664 markings, 103816442 edges, 732827 markings/sec, 50 secs
lola: 47304281 markings, 112532219 edges, 732723 markings/sec, 55 secs
lola: 50963667 markings, 121235837 edges, 731877 markings/sec, 60 secs
lola: 54579648 markings, 129835345 edges, 723196 markings/sec, 65 secs
lola: 58173780 markings, 138381201 edges, 718826 markings/sec, 70 secs
lola: 61796734 markings, 146996031 edges, 724591 markings/sec, 75 secs
lola: 65398582 markings, 155564159 edges, 720370 markings/sec, 80 secs
lola: 69042109 markings, 164231409 edges, 728705 markings/sec, 85 secs
lola: 72704496 markings, 172943174 edges, 732477 markings/sec, 90 secs
lola: 76442092 markings, 181836039 edges, 747519 markings/sec, 95 secs
lola: 79816360 markings, 189799995 edges, 674854 markings/sec, 100 secs
lola: 82653052 markings, 196457131 edges, 567338 markings/sec, 105 secs
lola: 85422497 markings, 202955051 edges, 553889 markings/sec, 110 secs
lola: 88171038 markings, 209404965 edges, 549708 markings/sec, 115 secs
lola: 90909264 markings, 215831564 edges, 547645 markings/sec, 120 secs
lola: 93679865 markings, 222332124 edges, 554120 markings/sec, 125 secs
lola: 96478197 markings, 228897874 edges, 559666 markings/sec, 130 secs
lola: 99273789 markings, 235456398 edges, 559118 markings/sec, 135 secs
lola: 102083412 markings, 242047342 edges, 561925 markings/sec, 140 secs
lola: 104943737 markings, 248755357 edges, 572065 markings/sec, 145 secs
lola: 107895727 markings, 255679544 edges, 590398 markings/sec, 150 secs
lola: 110935871 markings, 262806978 edges, 608029 markings/sec, 155 secs
lola: 114088468 markings, 270198449 edges, 630519 markings/sec, 160 secs
lola: 117541769 markings, 278293814 edges, 690660 markings/sec, 165 secs
lola: 120683402 markings, 285647304 edges, 628327 markings/sec, 170 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 120683402 markings, 285647304 edges
lola: ========================================
lola: subprocess 6 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((M2 <= P3M2))))) AND A (G (((P12M3 <= P12wM3) OR (P1 <= P2s) OR (1 <= M3) OR (1 <= P2wP1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((M2 <= P3M2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (M2 <= P3M2)))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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: 1003 markings, 3008 edges
lola: ========================================
lola: subprocess 7 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P12M3 <= P12wM3) OR (P1 <= P2s) OR (1 <= M3) OR (1 <= 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 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((P1 <= 2) OR ((3 <= P3) AND (2 <= P2))) U (2 <= P12)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((P1 <= 2) OR ((3 <= P3) AND (2 <= P2))) U (2 <= P12))
lola: processed formula length: 57
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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: state equation: calling and running sara
lola: ========================================
sara: try reading problem file FMS-PT-200-CTLCardinality-7.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 544785 markings, 954879 edges
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((P3 <= P2wP1) U E (F ((P3 <= P1wP2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((P3 <= P2wP1) U E(TRUE U (P3 <= P1wP2)))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1001 markings, 1001 edges
lola: ========================================
lola: subprocess 9 will run for 447 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((3 <= P2s) AND (M1 <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U ((3 <= P2s) AND (M1 <= P2wP1))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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: 5537416 markings, 9620846 edges, 3689329903141912576 markings/sec, 0 secs
lola: 10580012 markings, 18349670 edges, 1008519 markings/sec, 5 secs
lola: 15561476 markings, 26966130 edges, 996293 markings/sec, 10 secs
lola: 20490111 markings, 35500726 edges, 985727 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 22599106 markings, 39373021 edges
lola: ========================================
lola: subprocess 10 will run for 518 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((P2 <= 2) AND (P2wP1 + 1 <= P12s)) U E (F ((3 <= P1wP2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((P2 <= 2) AND (P2wP1 + 1 <= P12s)) U E(TRUE U (3 <= P1wP2)))
lola: processed formula length: 63
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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: 804 markings, 804 edges
lola: subprocess 11 will run for 621 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= P12s) AND (P1wP2 <= P2wP1))))) OR A (X (((3 <= P3) AND (2 <= M3) AND (P2s <= P2d) AND (3 <= P1M1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 11 will run for 621 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= P12s) AND (P1wP2 <= P2wP1)))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FMS-PT-200-CTLCardinality-11.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 12 will run for 776 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= P2d) OR (3 <= P3M2) OR ((P1wP2 <= M3)) OR (P12 <= P2wM2) OR (P3 + 1 <= M3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11781 markings, 13518 edges
lola: ========================================
lola: ========================================
lola: lola: ========================================
subprocess 13 will run for 1035 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= P2wP1) OR A (G (((1 <= P1) OR (2 <= M1))))) OR (3 <= P12M3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1035 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= P2wP1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P2wP1)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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 1553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= P1) OR (2 <= M1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 203 markings, 202 edges
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-14.sara
lola: ========================================
lola: subprocess 15 will run for 3107 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P12M3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P12M3)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((P12wM3 <= P1wM1) U ((3 <= P1s) AND (3 <= P1d) AND (P2d + 1 <= M2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((P12wM3 <= P1wM1) U ((3 <= P1s) AND (3 <= P1d) AND (P2d + 1 <= M2)))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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: 801295 markings, 1391003 edges
lola: ========================================
lola: subprocess 15 will run for 3106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P12s <= P1d) OR (1 <= P3) OR (P2wP1 <= P3)) AND A (G (A (F (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P12s <= P1d) OR (1 <= P3) OR (P2wP1 <= P3))
lola: processed formula length: 47
lola: 6 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: processed formula with 3 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: RESULT
lola:
SUMMARY: yes yes no unknown no no no yes yes yes yes yes no no yes yes
FORMULA FMS-PT-200-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-15 TRUE 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-200"
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-200.tgz
mv FMS-PT-200 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-200, 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-152650006000087"
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 ;