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 172K
-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.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 8.1K May 15 18:54 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 irma4mcc-structural
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 r091-blw7-152650003300080
=====================================================================

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


BK_STOP 1527184390153

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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 stdout -----
----- Start make result stderr -----
CTLCardinality @ FMS-PT-100 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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: 4323513 markings, 8166976 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: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to FMS-PT-100-CTLCardinality-6.sara
lola: 4 markings, 3 edges
lola: state equation: calling and running sara
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: state equation: write sara problem file to FMS-PT-100-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 99 markings, 98 edges
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: state equation: calling and running sara
sara: try reading problem file FMS-PT-100-CTLCardinality-6.sara.
sara: try reading problem file FMS-PT-100-CTLCardinality-7.sara.


lola: 4325834 markings, 8173434 edges, 2039898496806420480 markings/sec, 0 secs
lola: 7072184 markings, 14825254 edges, 549270 markings/sec, 5 secs
lola: 9609808 markings, 21105655 edges, 507525 markings/sec, 10 secs
lola: 11859383 markings, 26927047 edges, 449915 markings/sec, 15 secs
lola: 13960972 markings, 32518097 edges, 420318 markings/sec, 20 secs
lola: 16025426 markings, 38019362 edges, 412891 markings/sec, 25 secs
lola: 18124298 markings, 43570769 edges, 419774 markings/sec, 30 secs
lola: 20098747 markings, 48884763 edges, 394890 markings/sec, 35 secs
lola: 22058291 markings, 54152588 edges, 391909 markings/sec, 40 secs
lola: 24020364 markings, 59384180 edges, 392415 markings/sec, 45 secs
lola: 26158239 markings, 64809331 edges, 427575 markings/sec, 50 secs
lola: 28006054 markings, 69756803 edges, 369563 markings/sec, 55 secs
lola: 29889706 markings, 74818942 edges, 376730 markings/sec, 60 secs
lola: 31684093 markings, 79800583 edges, 358877 markings/sec, 65 secs
lola: 33576558 markings, 84861704 edges, 378493 markings/sec, 70 secs
lola: 35399975 markings, 89832232 edges, 364683 markings/sec, 75 secs
lola: 37215424 markings, 94744024 edges, 363090 markings/sec, 80 secs
lola: 39001648 markings, 99622830 edges, 357245 markings/sec, 85 secs
lola: 40807526 markings, 104563044 edges, 361176 markings/sec, 90 secs
lola: 42562399 markings, 109400218 edges, 350975 markings/sec, 95 secs
lola: 44231341 markings, 114073048 edges, 333788 markings/sec, 100 secs
lola: 45942016 markings, 118798806 edges, 342135 markings/sec, 105 secs
lola: 47685292 markings, 123539337 edges, 348655 markings/sec, 110 secs
lola: 49438455 markings, 128369452 edges, 350633 markings/sec, 115 secs
lola: 51213563 markings, 133215138 edges, 355022 markings/sec, 120 secs
lola: 52986246 markings, 138069032 edges, 354537 markings/sec, 125 secs
lola: 54732251 markings, 142868472 edges, 349201 markings/sec, 130 secs
lola: 56449881 markings, 147619522 edges, 343526 markings/sec, 135 secs
lola: 58134897 markings, 152321880 edges, 337003 markings/sec, 140 secs
lola: 59826825 markings, 157047257 edges, 338386 markings/sec, 145 secs
lola: 61549762 markings, 161799156 edges, 344587 markings/sec, 150 secs
lola: 63224094 markings, 166433627 edges, 334866 markings/sec, 155 secs
lola: 64861080 markings, 171006075 edges, 327397 markings/sec, 160 secs
lola: 66501583 markings, 175533124 edges, 328101 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 419 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: 1697493 markings, 5753679 edges, 3689348869717491712 markings/sec, 0 secs
lola: 3313261 markings, 11251076 edges, 323154 markings/sec, 5 secs
lola: 4907517 markings, 16679933 edges, 318851 markings/sec, 10 secs
lola: 6486154 markings, 22055040 edges, 315727 markings/sec, 15 secs
lola: 8017913 markings, 27275394 edges, 306352 markings/sec, 20 secs
lola: 9512445 markings, 32369279 edges, 298906 markings/sec, 25 secs
lola: 11012241 markings, 37480893 edges, 299959 markings/sec, 30 secs
lola: 12539470 markings, 42688447 edges, 305446 markings/sec, 35 secs
lola: 14071339 markings, 47913256 edges, 306374 markings/sec, 40 secs
lola: 15583373 markings, 53072232 edges, 302407 markings/sec, 45 secs
lola: 17117703 markings, 58306776 edges, 306866 markings/sec, 50 secs
lola: 18576673 markings, 63285721 edges, 291794 markings/sec, 55 secs
lola: 20078640 markings, 68411047 edges, 300393 markings/sec, 60 secs
lola: 21595319 markings, 73586461 edges, 303336 markings/sec, 65 secs
lola: 23090688 markings, 78689020 edges, 299074 markings/sec, 70 secs
lola: 24600161 markings, 83841942 edges, 301895 markings/sec, 75 secs
lola: 26103192 markings, 88972430 edges, 300606 markings/sec, 80 secs
lola: 27584400 markings, 94030119 edges, 296242 markings/sec, 85 secs
lola: 29069970 markings, 99098929 edges, 297114 markings/sec, 90 secs
lola: 30555869 markings, 104174387 edges, 297180 markings/sec, 95 secs
lola: 32052540 markings, 109287506 edges, 299334 markings/sec, 100 secs
lola: 33540313 markings, 114365592 edges, 297555 markings/sec, 105 secs
lola: 35016663 markings, 119405715 edges, 295270 markings/sec, 110 secs
lola: 36494201 markings, 124450885 edges, 295508 markings/sec, 115 secs
lola: 37978516 markings, 129518683 edges, 296863 markings/sec, 120 secs
lola: 39461659 markings, 134585529 edges, 296629 markings/sec, 125 secs
lola: 40932531 markings, 139611965 edges, 294174 markings/sec, 130 secs
lola: 42413176 markings, 144667305 edges, 296129 markings/sec, 135 secs
lola: 43887945 markings, 149702528 edges, 294954 markings/sec, 140 secs
lola: 45360528 markings, 154735352 edges, 294517 markings/sec, 145 secs
lola: 46832964 markings, 159763780 edges, 294487 markings/sec, 150 secs
lola: 48332424 markings, 164890299 edges, 299892 markings/sec, 155 secs
lola: 49797723 markings, 169896403 edges, 293060 markings/sec, 160 secs
lola: 51271790 markings, 174930048 edges, 294813 markings/sec, 165 secs
lola: 52750232 markings, 179982936 edges, 295688 markings/sec, 170 secs
lola: 54211038 markings, 184972873 edges, 292161 markings/sec, 175 secs
lola: 55671008 markings, 189962014 edges, 291994 markings/sec, 180 secs
lola: 57130864 markings, 194949123 edges, 291971 markings/sec, 185 secs
lola: 58567461 markings, 199859714 edges, 287319 markings/sec, 190 secs
lola: 59993574 markings, 204733022 edges, 285223 markings/sec, 195 secs
lola: 61412860 markings, 209583564 edges, 283857 markings/sec, 200 secs
lola: 62844108 markings, 214475147 edges, 286250 markings/sec, 205 secs
lola: 64265951 markings, 219334062 edges, 284369 markings/sec, 210 secs
lola: 65695402 markings, 224222443 edges, 285890 markings/sec, 215 secs
lola: 67120515 markings, 229093061 edges, 285023 markings/sec, 220 secs
lola: 68531670 markings, 233918232 edges, 282231 markings/sec, 225 secs
lola: 69954964 markings, 238782138 edges, 284659 markings/sec, 230 secs
lola: 71381376 markings, 243660790 edges, 285282 markings/sec, 235 secs
lola: 72810831 markings, 248545438 edges, 285891 markings/sec, 240 secs
lola: 74243212 markings, 253442126 edges, 286476 markings/sec, 245 secs
lola: 75670870 markings, 258324155 edges, 285532 markings/sec, 250 secs
lola: 77028398 markings, 262967221 edges, 271506 markings/sec, 255 secs
lola: 78446289 markings, 267807502 edges, 283578 markings/sec, 260 secs
lola: 79857832 markings, 272633211 edges, 282309 markings/sec, 265 secs
lola: 81290824 markings, 277534466 edges, 286598 markings/sec, 270 secs
lola: 82725781 markings, 282441197 edges, 286991 markings/sec, 275 secs
lola: 84153622 markings, 287324918 edges, 285568 markings/sec, 280 secs
lola: 85575817 markings, 292185624 edges, 284439 markings/sec, 285 secs
lola: 87008953 markings, 297088327 edges, 286627 markings/sec, 290 secs
lola: 88431140 markings, 301953915 edges, 284437 markings/sec, 295 secs
lola: 89849624 markings, 306801772 edges, 283697 markings/sec, 300 secs
lola: 91280812 markings, 311696280 edges, 286238 markings/sec, 305 secs
lola: 92692346 markings, 316519346 edges, 282307 markings/sec, 310 secs
lola: 94117095 markings, 321391486 edges, 284950 markings/sec, 315 secs
lola: 95539200 markings, 326255078 edges, 284421 markings/sec, 320 secs
lola: 96949833 markings, 331078230 edges, 282127 markings/sec, 325 secs
lola: 98364285 markings, 335917234 edges, 282890 markings/sec, 330 secs
lola: 99772062 markings, 340727900 edges, 281555 markings/sec, 335 secs
lola: 101185572 markings, 345559193 edges, 282702 markings/sec, 340 secs
lola: 102607483 markings, 350424298 edges, 284382 markings/sec, 345 secs
lola: 104014539 markings, 355234578 edges, 281411 markings/sec, 350 secs
lola: 105428189 markings, 360070663 edges, 282730 markings/sec, 355 secs
lola: 106837604 markings, 364893211 edges, 281883 markings/sec, 360 secs
lola: 108242350 markings, 369698793 edges, 280949 markings/sec, 365 secs
lola: 109647746 markings, 374502737 edges, 281079 markings/sec, 370 secs
lola: 111063913 markings, 379347526 edges, 283233 markings/sec, 375 secs
lola: 112469437 markings, 384155899 edges, 281105 markings/sec, 380 secs
lola: 113872267 markings, 388951669 edges, 280566 markings/sec, 385 secs
lola: 115268612 markings, 393727776 edges, 279269 markings/sec, 390 secs
lola: 116674194 markings, 398536228 edges, 281116 markings/sec, 395 secs
lola: 118079150 markings, 403341767 edges, 280991 markings/sec, 400 secs
lola: 119480582 markings, 408137355 edges, 280286 markings/sec, 405 secs
lola: 120879114 markings, 412919437 edges, 279706 markings/sec, 410 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 419 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: subprocess 10 will run for 489 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:
========================================
lola: subprocess 11 will run for 587 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 734 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: state equation: write sara problem file to FMS-PT-100-CTLCardinality-12.sara
lola: ========================================
lola: subprocess 13 will run for 978 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 978 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 1468 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: 3190086 markings, 7427201 edges, 2011398055902838784 markings/sec, 0 secs
lola: 6357698 markings, 14803638 edges, 633522 markings/sec, 5 secs
lola: 9519427 markings, 22158104 edges, 632346 markings/sec, 10 secs
lola: 12372074 markings, 29096038 edges, 570529 markings/sec, 15 secs
lola: 14565466 markings, 34944277 edges, 438678 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 1454 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 15 will run for 2909 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 2909 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 stdout -----
----- Kill lola and sara stderr -----
----- 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-100"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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 irma4mcc-structural"
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 r091-blw7-152650003300080"
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 ;