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 180K
-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.3K 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 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K 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 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 irma4mcc-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 r090-blw7-152650001000087
=====================================================================

--------------------
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 1527053542904


BK_STOP 1527053943727

--------------------
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 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 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 235 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: 3741220 markings, 6512477 edges, 3689329903141912576 markings/sec, 0 secs
lola: 7257476 markings, 12599470 edges, 703251 markings/sec, 5 secs
lola: 10724556 markings, 18600287 edges, 693416 markings/sec, 10 secs
lola: 13883349 markings, 24062653 edges, 631759 markings/sec, 15 secs
lola: 17322431 markings, 30014455 edges, 687816 markings/sec, 20 secs
lola: 20738062 markings, 35926754 edges, 683126 markings/sec, 25 secs
lola: 24283657 markings, 42922169 edges, 709119 markings/sec, 30 secs
lola: 27142198 markings, 49095486 edges, 571708 markings/sec, 35 secs
lola: 29276984 markings, 54466355 edges, 426957 markings/sec, 40 secs
lola: 31334494 markings, 59698573 edges, 411502 markings/sec, 45 secs
lola: 34043306 markings, 65457053 edges, 541762 markings/sec, 50 secs
lola: 35999450 markings, 70476292 edges, 391229 markings/sec, 55 secs
lola: 37909007 markings, 75456209 edges, 381911 markings/sec, 60 secs
lola: 39793281 markings, 80340465 edges, 376855 markings/sec, 65 secs
lola: 41582797 markings, 85138904 edges, 357903 markings/sec, 70 secs
lola: 43608065 markings, 90127246 edges, 405054 markings/sec, 75 secs
lola: 45260565 markings, 94682269 edges, 330500 markings/sec, 80 secs
lola: 46979140 markings, 99316186 edges, 343715 markings/sec, 85 secs
lola: 48747915 markings, 104042656 edges, 353755 markings/sec, 90 secs
lola: 50381895 markings, 108536393 edges, 326796 markings/sec, 95 secs
lola: 52146051 markings, 113101194 edges, 352831 markings/sec, 100 secs
lola: 53848873 markings, 117627409 edges, 340564 markings/sec, 105 secs
lola: 55631540 markings, 122275343 edges, 356533 markings/sec, 110 secs
lola: 57329173 markings, 126853951 edges, 339527 markings/sec, 115 secs
lola: 59022201 markings, 131346992 edges, 338606 markings/sec, 120 secs
lola: 60720771 markings, 135799220 edges, 339714 markings/sec, 125 secs
lola: 62306438 markings, 140136588 edges, 317133 markings/sec, 130 secs
lola: 63981095 markings, 144634227 edges, 334931 markings/sec, 135 secs
lola: 65651249 markings, 149135620 edges, 334031 markings/sec, 140 secs
lola: 67892664 markings, 154185605 edges, 448283 markings/sec, 145 secs
lola: 69484984 markings, 157950167 edges, 318464 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 281 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 281 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 307 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: state equation: write sara problem file to FMS-PT-200-CTLCardinality-5.sara
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 307 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: 4752444 markings, 11257512 edges, 3689329903141912576 markings/sec, 0 secs
lola: 9148242 markings, 21730553 edges, 879160 markings/sec, 5 secs
lola: 13317119 markings, 31657420 edges, 833775 markings/sec, 10 secs
lola: 17369026 markings, 41303250 edges, 810381 markings/sec, 15 secs
lola: 21352137 markings, 50784678 edges, 796622 markings/sec, 20 secs
lola: 25270949 markings, 60111265 edges, 783762 markings/sec, 25 secs
lola: 29118740 markings, 69265547 edges, 769558 markings/sec, 30 secs
lola: 32929194 markings, 78332949 edges, 762091 markings/sec, 35 secs
lola: 36650451 markings, 87187225 edges, 744251 markings/sec, 40 secs
lola: 40346162 markings, 95979542 edges, 739142 markings/sec, 45 secs
lola: 44012395 markings, 104701391 edges, 733247 markings/sec, 50 secs
lola: 47700054 markings, 113473644 edges, 737532 markings/sec, 55 secs
lola: 51366487 markings, 122193685 edges, 733287 markings/sec, 60 secs
lola: 54998201 markings, 130830381 edges, 726343 markings/sec, 65 secs
lola: 58614467 markings, 139429418 edges, 723253 markings/sec, 70 secs
lola: 62255505 markings, 148087030 edges, 728208 markings/sec, 75 secs
lola: 65862261 markings, 156667167 edges, 721351 markings/sec, 80 secs
lola: 69216299 markings, 164645838 edges, 670808 markings/sec, 85 secs
lola: 72853957 markings, 173298701 edges, 727532 markings/sec, 90 secs
lola: 76602530 markings, 182217774 edges, 749715 markings/sec, 95 secs
lola: 79940843 markings, 190092060 edges, 667663 markings/sec, 100 secs
lola: 82792442 markings, 196784277 edges, 570320 markings/sec, 105 secs
lola: 85574303 markings, 203311172 edges, 556372 markings/sec, 110 secs
lola: 88339740 markings, 209800846 edges, 553087 markings/sec, 115 secs
lola: 91099133 markings, 216277101 edges, 551879 markings/sec, 120 secs
lola: 93890558 markings, 222826638 edges, 558285 markings/sec, 125 secs
lola: 96715382 markings, 229454015 edges, 564965 markings/sec, 130 secs
lola: 99529734 markings, 236057214 edges, 562870 markings/sec, 135 secs
lola: 102375368 markings, 242731886 edges, 569127 markings/sec, 140 secs
lola: 105250356 markings, 249474293 edges, 574998 markings/sec, 145 secs
lola: 108241002 markings, 256489011 edges, 598129 markings/sec, 150 secs
lola: 111348762 markings, 263775084 edges, 621552 markings/sec, 155 secs
lola: 114572635 markings, 271333331 edges, 644775 markings/sec, 160 secs
lola: 118213960 markings, 279868150 edges, 728265 markings/sec, 165 secs
lola: 120683402 markings, 285647304 edges, 493888 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 320 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 320 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 356 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: state equation: write sara problem file to FMS-PT-200-CTLCardinality-7.sara
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara
23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 356 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).
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 400 seconds at most (--localtimelimit=-1)
lola: 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: 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 458 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: 5509610 markings, 9573207 edges, 3689329903141912576 markings/sec, 0 secs
lola: 10601943 markings, 18389824 edges, 1018467 markings/sec, 5 secs
lola: 15644577 markings, 27115915 edges, 1008527 markings/sec, 10 secs
lola: 20649499 markings, 35775216 edges, 1000984 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 530 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: ========================================
lola: subprocess 11 will run for 636 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: subprocess 11 will run for 636 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
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 795 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: state equation: calling and running sara
sara: try reading problem file 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: subprocess 13 will run for 1061 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 1061 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 1591 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: state equation: write sara problem file to FMS-PT-200-CTLCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 203 markings, 202 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3183 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: ========================================
sara: try reading problem file FMS-PT-200-CTLCardinality-14.sara.

lola: subprocess 14 will run for 1591 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 3182 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 stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FMS-PT-200"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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 irma4mcc-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 r090-blw7-152650001000087"
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 ;