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-full
Input is FMS-PT-100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-blw7-152650001000080
=====================================================================

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


BK_STOP 1527054014776

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using FMS-PT-100 as instance name.
Using FMS as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 60239, 'Memory': 3565.97, 'Tool': 'lola'}, {'Time': 61386, 'Memory': 3565.17, 'Tool': 'lola'}, {'Time': 1016091, 'Memory': 15952.93, 'Tool': 'marcie'}, {'Time': 1050720, 'Memory': 15953.21, 'Tool': 'marcie'}, {'Time': 1732445, 'Memory': 15947.27, 'Tool': 'itstools'}, {'Time': 1891074, 'Memory': 15952.89, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola FMS-PT-100...

Time: 3600 - MCC
----- Start make prepare stderr -----
----- Start make prepare stdout -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 42/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from FMS-PT-100-CTLCardinality.task
lola: A (G (((P2s <= 2) OR (P12wM3 + 1 <= P1wM1) OR (P3M2 <= P1)))) : A (G (NOT(E (G ((2 <= P2wP1)))))) : A (X (E (F ((3 <= P12s))))) : A (G (E (X ((P1s <= 0))))) : E (F ((P2 + 1 <= P2d))) : (((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d)) OR E (F (E (X ((3 <= P2wP1)))))) : NOT((E (F (((P2M2 <= P3s) AND (1 <= P1d)))) AND NOT(A (G ((3 <= P3)))))) : A (G (E (X (((P1d <= P12) OR (P2s <= M1)))))) : A (G (NOT(A (G ((P2M2 <= P12s)))))) : A (F (E (((P2d <= P1wM1) U (2 <= P12M3))))) : A (G (E (F (TRUE)))) : A (X ((A (G ((P1wM1 <= P1))) OR ((2 <= P1s) OR (P3M2 <= 0))))) : NOT(E (F ((3 <= P2wP1)))) : ((2 <= P12) OR A (G (E (F ((1 <= P1d)))))) : NOT(E (F ((P1 <= P2wP1)))) : (E ((((P1wP2 <= P1d) OR (1 <= P1wP2)) U ((1 <= P12s) OR (1 <= P12wM3)))) AND (1 <= P3))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P2s <= 2) OR (P12wM3 + 1 <= P1wM1) OR (P3M2 <= P1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 311 markings, 310 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((2 <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (P2wP1 <= 1)))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 621 markings, 1243 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= P12s)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (3 <= P12s)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2905055 markings, 5096475 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((P1s <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((P1s <= 0)))))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4308625 markings, 8128493 edges, 3689348869717491712 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4339895 markings, 8208078 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((P2 + 1 <= P2d)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-100-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 103 markings, 102 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d)) OR E (F (E (X ((3 <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d))
lola: processed formula length: 93
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((3 <= P2wP1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((3 <= P2wP1)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 41009 markings, 74705 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((P2M2 <= P3s) AND (1 <= P1d)))) AND NOT(A (G ((3 <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P3s + 1 <= P2M2) OR (P1d <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to FMS-PT-100-CTLCardinality-6.saralola:
lola: ========================================
subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= P3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 99 markings, 98 edges
lola: ========================================
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: 4204127 markings, 7874452 edges, 2039898496806420480 markings/sec, 0 secs
lola: 6816657 markings, 14154267 edges, 522506 markings/sec, 5 secs
lola: 8991963 markings, 19544695 edges, 435061 markings/sec, 10 secs
lola: 10959346 markings, 24611162 edges, 393477 markings/sec, 15 secs
lola: 12831863 markings, 29507850 edges, 374503 markings/sec, 20 secs
lola: 14751381 markings, 34647995 edges, 383904 markings/sec, 25 secs
lola: 16655776 markings, 39709297 edges, 380879 markings/sec, 30 secs
lola: 18579690 markings, 44776426 edges, 384783 markings/sec, 35 secs
lola: 20369375 markings, 49636895 edges, 357937 markings/sec, 40 secs
lola: 22186577 markings, 54487124 edges, 363440 markings/sec, 45 secs
lola: 24014112 markings, 59364900 edges, 365507 markings/sec, 50 secs
lola: 26024901 markings, 64454539 edges, 402158 markings/sec, 55 secs
lola: 27792561 markings, 69204677 edges, 353532 markings/sec, 60 secs
lola: 29593475 markings, 74031679 edges, 360183 markings/sec, 65 secs
lola: 31294519 markings, 78726856 edges, 340209 markings/sec, 70 secs
lola: 33068734 markings, 83534895 edges, 354843 markings/sec, 75 secs
lola: 34829410 markings, 88279411 edges, 352135 markings/sec, 80 secs
lola: 36578759 markings, 92985014 edges, 349870 markings/sec, 85 secs
lola: 38250083 markings, 97591961 edges, 334265 markings/sec, 90 secs
lola: 39967495 markings, 102264957 edges, 343482 markings/sec, 95 secs
lola: 41684528 markings, 106968403 edges, 343407 markings/sec, 100 secs
lola: 43311307 markings, 111514721 edges, 325356 markings/sec, 105 secs
lola: 44931967 markings, 115999142 edges, 324132 markings/sec, 110 secs
lola: 46547956 markings, 120481259 edges, 323198 markings/sec, 115 secs
lola: 48241088 markings, 125066022 edges, 338626 markings/sec, 120 secs
lola: 49903526 markings, 129655260 edges, 332488 markings/sec, 125 secs
lola: 51625315 markings, 134360472 edges, 344358 markings/sec, 130 secs
lola: 53320744 markings, 138972246 edges, 339086 markings/sec, 135 secs
lola: 54964404 markings, 143516525 edges, 328732 markings/sec, 140 secs
lola: 56595977 markings, 148041624 edges, 326315 markings/sec, 145 secs
lola: 58208258 markings, 152530074 edges, 322456 markings/sec, 150 secs
lola: 59822380 markings, 157036367 edges, 322824 markings/sec, 155 secs
lola: 61487345 markings, 161619757 edges, 332993 markings/sec, 160 secs
lola: 63130779 markings, 166162477 edges, 328687 markings/sec, 165 secs
lola: 64753012 markings, 170701411 edges, 324447 markings/sec, 170 secs
lola: 66384515 markings, 175215770 edges, 326301 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 418 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: 1579298 markings, 5352342 edges, 3689348869717491712 markings/sec, 0 secs
lola: 3167832 markings, 10756442 edges, 317707 markings/sec, 5 secs
lola: 4690735 markings, 15941508 edges, 304581 markings/sec, 10 secs
lola: 6223438 markings, 21160514 edges, 306541 markings/sec, 15 secs
lola: 7756959 markings, 26385428 edges, 306704 markings/sec, 20 secs
lola: 9282884 markings, 31586706 edges, 305185 markings/sec, 25 secs
lola: 10793800 markings, 36736512 edges, 302183 markings/sec, 30 secs
lola: 12298493 markings, 41866734 edges, 300939 markings/sec, 35 secs
lola: 13796368 markings, 46975578 edges, 299575 markings/sec, 40 secs
lola: 15280814 markings, 52040280 edges, 296889 markings/sec, 45 secs
lola: 16786322 markings, 57178804 edges, 301102 markings/sec, 50 secs
lola: 18267347 markings, 62229564 edges, 296205 markings/sec, 55 secs
lola: 19749485 markings, 67288024 edges, 296428 markings/sec, 60 secs
lola: 21234699 markings, 72355914 edges, 297043 markings/sec, 65 secs
lola: 22696006 markings, 77340300 edges, 292261 markings/sec, 70 secs
lola: 24186291 markings, 82429332 edges, 298057 markings/sec, 75 secs
lola: 25675134 markings, 87512162 edges, 297769 markings/sec, 80 secs
lola: 27128246 markings, 92472054 edges, 290622 markings/sec, 85 secs
lola: 28592878 markings, 97471984 edges, 292926 markings/sec, 90 secs
lola: 30040598 markings, 102412273 edges, 289544 markings/sec, 95 secs
lola: 31508707 markings, 107428691 edges, 293622 markings/sec, 100 secs
lola: 32981468 markings, 112458214 edges, 294552 markings/sec, 105 secs
lola: 34434978 markings, 117421294 edges, 290702 markings/sec, 110 secs
lola: 35894566 markings, 122403666 edges, 291918 markings/sec, 115 secs
lola: 37344710 markings, 127354252 edges, 290029 markings/sec, 120 secs
lola: 38809384 markings, 132358577 edges, 292935 markings/sec, 125 secs
lola: 40258189 markings, 137307683 edges, 289761 markings/sec, 130 secs
lola: 41721873 markings, 142305446 edges, 292737 markings/sec, 135 secs
lola: 43171919 markings, 147258648 edges, 290009 markings/sec, 140 secs
lola: 44636241 markings, 152260370 edges, 292864 markings/sec, 145 secs
lola: 46079844 markings, 157191119 edges, 288721 markings/sec, 150 secs
lola: 47530010 markings, 162145870 edges, 290033 markings/sec, 155 secs
lola: 49009189 markings, 167201101 edges, 295836 markings/sec, 160 secs
lola: 50352032 markings, 171790479 edges, 268569 markings/sec, 165 secs
lola: 51796677 markings, 176723613 edges, 288929 markings/sec, 170 secs
lola: 53256551 markings, 181709805 edges, 291975 markings/sec, 175 secs
lola: 54704280 markings, 186657797 edges, 289546 markings/sec, 180 secs
lola: 56149530 markings, 191597322 edges, 289050 markings/sec, 185 secs
lola: 57593668 markings, 196532121 edges, 288828 markings/sec, 190 secs
lola: 59040964 markings, 201478974 edges, 289459 markings/sec, 195 secs
lola: 60472395 markings, 206370154 edges, 286286 markings/sec, 200 secs
lola: 61918607 markings, 211310980 edges, 289242 markings/sec, 205 secs
lola: 63358940 markings, 216234255 edges, 288067 markings/sec, 210 secs
lola: 64806188 markings, 221181462 edges, 289450 markings/sec, 215 secs
lola: 66250780 markings, 226119411 edges, 288918 markings/sec, 220 secs
lola: 67696427 markings, 231062088 edges, 289129 markings/sec, 225 secs
lola: 69126578 markings, 235950854 edges, 286030 markings/sec, 230 secs
lola: 70563027 markings, 240861096 edges, 287290 markings/sec, 235 secs
lola: 72016232 markings, 245830465 edges, 290641 markings/sec, 240 secs
lola: 73454632 markings, 250745003 edges, 287680 markings/sec, 245 secs
lola: 74904713 markings, 255704158 edges, 290016 markings/sec, 250 secs
lola: 76337754 markings, 260604637 edges, 286608 markings/sec, 255 secs
lola: 77757397 markings, 265455670 edges, 283929 markings/sec, 260 secs
lola: 79193117 markings, 270360434 edges, 287144 markings/sec, 265 secs
lola: 80618420 markings, 275235189 edges, 285061 markings/sec, 270 secs
lola: 82050208 markings, 280131071 edges, 286358 markings/sec, 275 secs
lola: 83483337 markings, 285034149 edges, 286626 markings/sec, 280 secs
lola: 84903834 markings, 289887663 edges, 284099 markings/sec, 285 secs
lola: 86332697 markings, 294774329 edges, 285773 markings/sec, 290 secs
lola: 87768897 markings, 299685942 edges, 287240 markings/sec, 295 secs
lola: 89194021 markings, 304560789 edges, 285025 markings/sec, 300 secs
lola: 90619343 markings, 309432301 edges, 285064 markings/sec, 305 secs
lola: 92032105 markings, 314264273 edges, 282552 markings/sec, 310 secs
lola: 93450460 markings, 319114091 edges, 283671 markings/sec, 315 secs
lola: 94872207 markings, 323973767 edges, 284349 markings/sec, 320 secs
lola: 96287290 markings, 328816102 edges, 283017 markings/sec, 325 secs
lola: 97704035 markings, 333658960 edges, 283349 markings/sec, 330 secs
lola: 99117298 markings, 338490934 edges, 282653 markings/sec, 335 secs
lola: 100529190 markings, 343316738 edges, 282378 markings/sec, 340 secs
lola: 101944123 markings, 348154518 edges, 282987 markings/sec, 345 secs
lola: 103358517 markings, 352991339 edges, 282879 markings/sec, 350 secs
lola: 104786250 markings, 357874956 edges, 285547 markings/sec, 355 secs
lola: 106196962 markings, 362702255 edges, 282142 markings/sec, 360 secs
lola: 107611165 markings, 367538327 edges, 282841 markings/sec, 365 secs
lola: 109019399 markings, 372356578 edges, 281647 markings/sec, 370 secs
lola: 110430934 markings, 377182559 edges, 282307 markings/sec, 375 secs
lola: 111854675 markings, 382052420 edges, 284748 markings/sec, 380 secs
lola: 113251357 markings, 386830838 edges, 279336 markings/sec, 385 secs
lola: 114668081 markings, 391674086 edges, 283345 markings/sec, 390 secs
lola: 116069030 markings, 396467063 edges, 280190 markings/sec, 395 secs
lola: 117479370 markings, 401290604 edges, 282068 markings/sec, 400 secs
lola: 118888160 markings, 406109194 edges, 281758 markings/sec, 405 secs
lola: 120289518 markings, 410903511 edges, 280272 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 418 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((P2d <= P1wM1) U (2 <= P12M3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((P2d <= P1wM1) U (2 <= P12M3)))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13186 markings, 18676 edges
lola: ========================================
lola: subprocess 10 will run for 487 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 585 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 731 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((3 <= P2wP1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: lola: subprocess 13 will run for 975 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 975 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 1463 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: 3123128 markings, 7269903 edges, 2011398055902838784 markings/sec, 0 secs
lola: 6257865 markings, 14570351 edges, 626947 markings/sec, 5 secs
lola: 9338695 markings, 21738300 edges, 616166 markings/sec, 10 secs
lola: 12239089 markings, 28740454 edges, 580079 markings/sec, 15 secs
lola: 14440989 markings, 34607971 edges, 440380 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 1449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((P1 <= P2wP1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
lola: ========================================
lola: subprocess 15 will run for 2899 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 2899 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((P1wP2 <= P1d) OR (1 <= P1wP2)) U ((1 <= P12s) OR (1 <= P12wM3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((P1wP2 <= P1d) OR (1 <= P1wP2)) U ((1 <= P12s) OR (1 <= P12wM3)))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 809 markings, 910 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes yes no unknown unknown yes yes no no yes no unknown
FORMULA FMS-PT-100-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished 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-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-100.tgz
mv FMS-PT-100 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is FMS-PT-100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r090-blw7-152650001000080"
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 ;