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 376K
-rw-r--r-- 1 mcc users 5.6K 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 5.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 174K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is IBM319-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-smll-152658633600171
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526732714541


BK_STOP 1526732759378

--------------------
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 IBM319-PT-none as instance name.
Using IBM319 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': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 173, 'Memory': 110.09, 'Tool': 'lola'}, {'Time': 278, 'Memory': 110.93, 'Tool': 'lola'}, {'Time': 746, 'Memory': 101.35, 'Tool': 'gspn'}, {'Time': 2332, 'Memory': 2207.29, 'Tool': 'marcie'}, {'Time': 2355, 'Memory': 2207.28, 'Tool': 'marcie'}, {'Time': 3215, 'Memory': 158.27, 'Tool': 'gspn'}, {'Time': 5940, 'Memory': 349.11, 'Tool': 'itstools'}, {'Time': 6920, 'Memory': 359.54, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 34.335260115606935x far from the best tool lola.
CTLCardinality lola IBM319-PT-none...

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


checking for too many tokens
===========================================================================================
IBM319-PT-none: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ IBM319-PT-none @ 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: 431/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 253 places, 178 transitions, 169 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 164 transition conflict sets
lola: TASK
lola: reading formula from IBM319-PT-none-CTLCardinality.task
lola: NOT((NOT(E (F ((3 <= callToTask_s00002953_input_s00001066)))) OR (A (X ((callToTask_s00002960_input_s00001052 <= merge_s00001160_input_s00001129))) AND (callToTask_s00002949_output_s00001054 + 1 <= merge_s00002239_input_s00001129)))) : E (X (A (F ((callToTask_s00002956_input_s00001052 + 1 <= callToTask_s00002962_inputCriterion_s00001053_used))))) : A ((((callToTask_s00002959_inputCriterion_s00001053_used <= 0) OR ((fork_s00001071_activated_s00001075 <= callToTask_s00002667_inputCriterion_s00001053_used) AND (callToTask_s00002930_output_s00001054 <= callToProcess_s00002882_output_s00001054))) U ((2 <= callToTask_s00002950_output_s00001077) OR (callToProcess_s00002499_input_s00001052 + 1 <= merge_s00001061_input_s00001068)))) : E (G ((((callToProcess_s00002882_output_s00001077 <= 2) OR (3 <= fork_s00001071_activated_s00001073)) OR A (F ((callToTask_s00002961_output_s00001077 <= callToTask_s00002952_output_s00001077)))))) : E (F (((2 <= callToTask_s00002956_output_s00001077) AND (fork_s00001071_activated_s00001075 <= 1)))) : NOT(A (G (A (F ((1 <= callToTask_s00002930_input_s00001052)))))) : ((((callToTask_s00002965_input_s00001052 <= 2) OR (decision_s00001123_input_s00001066 + 1 <= callToTask_s00002962_output_s00001054) OR (1 <= callToTask_s00002953_output_s00001077)) OR (((3 <= callToTask_s00002930_input_s00001052) AND (callToTask_s00001406_inputCriterion_s00001053_used <= callToTask_s00002956_output_s00001054) AND (1 <= callToTask_s00002964_output_s00001077) AND (1 <= callToTask_s00001168_input_s00001127)) OR A (X ((merge_s00002239_input_s00001129 <= merge_s00002239_activated))))) AND NOT(E (F (((callToProcess_s00002499_input_s00001052 <= merge_s00002239_input_s00001129) AND (2 <= merge_s00002239_activated)))))) : E (G (((((join_s00001164_input_s00001052 <= merge_s00002239_input_s00001068) OR (callToTask_s00002667_output_s00001054 <= callToTask_s00002930_input_s00001052)) AND ((2 <= callToTask_s00002961_output_s00001054) OR (decision_s00002948_activated <= callToTask_s00002870_output_s00001077))) OR (callToTask_s00002952_input_s00001066 <= callToProcess_s00001108_output_s00001054)))) : A (F ((A (G ((3 <= callToTask_s00002965_output_s00001054))) OR (1 <= callToTask_s00002961_input_s00001066)))) : NOT(A (G (((callToTask_s00002667_inputCriterion_s00001053_used <= 2) AND (callToTask_s00002966_input_s00001066 <= 0))))) : A ((((callToTask_s00002896_output_s00001054 <= merge_s00002239_input_s00001068) OR (process_s00000343__s00003019_output_s00001249 <= merge_s00002239_input_s00001129) OR (3 <= callToTask_s00002932_input_s00001066) OR (1 <= callToTask_s00002962_input_s00001066)) U A (G ((2 <= callToTask_s00002958_inputCriterion_s00001053_used))))) : A (F (((3 <= callToProcess_s00002944_output_s00001077) AND (merge_s00002241_input_s00001066 <= 2)))) : A (G (((callToTask_s00002869_output_s00001054 <= 0) OR (2 <= callToTask_s00002950_output_s00001077) OR ((callToTask_s00001168_input_s00001068 <= merge_s00001161_activated) AND (decision_s00001126_activated <= merge_s00002240_input_s00001127)) OR (callToTask_s00002869_output_s00001077 <= 1)))) : E ((A (X ((2 <= callToTask_s00001852_output_s00001077))) U E (G ((merge_s00002239_activated <= callToTask_s00002964_output_s00001077))))) : A (F (NOT(A (F ((2 <= decision_s00002055_input_s00001066)))))) : E (F ((2 <= callToTask_s00002254_output_s00001054)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(E (F ((3 <= callToTask_s00002953_input_s00001066)))) OR (A (X ((callToTask_s00002960_input_s00001052 <= merge_s00001160_input_s00001129))) AND (callToTask_s00002949_output_s00001054 + 1 <= merge_s00002239_input_s00001129))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= callToTask_s00002953_input_s00001066)))
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 676 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 unreachable.
lola: 268 markings, 281 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((callToTask_s00002956_input_s00001052 + 1 <= callToTask_s00002962_inputCriterion_s00001053_used)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (callToTask_s00002956_input_s00001052 + 1 <= callToTask_s00002962_inputCriterion_s00001053_used)))
lola: processed formula length: 110
lola: 2 rewrites
lola: formula mentions 0 of 253 places; total mentions: 0
lola: closed formula file IBM319-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 676 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 66 markings, 65 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((callToTask_s00002959_inputCriterion_s00001053_used <= 0) OR ((fork_s00001071_activated_s00001075 <= callToTask_s00002667_inputCriterion_s00001053_used) AND (callToTask_s00002930_output_s00001054 <= callToProcess_s00002882_output_s00001054))) U ((2 <= callToTask_s00002950_output_s00001077) OR (callToProcess_s00002499_input_s00001052 + 1 <= merge_s00001061_input_s00001068))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((callToTask_s00002959_inputCriterion_s00001053_used <= 0) OR ((fork_s00001071_activated_s00001075 <= callToTask_s00002667_inputCriterion_s00001053_used) AND (callToTask_s00002930_output_s00001054 <= callToProcess_s00002882_output_s00001054))) U ((2 <= callToTask_s00002950_output_s00001077) OR (callToProcess_s00002499_input_s00001052 + 1 <= merge_s00001061_input_s00001068))))
lola: processed formula: A ((((callToTask_s00002959_inputCriterion_s00001053_used <= 0) OR ((fork_s00001071_activated_s00001075 <= callToTask_s00002667_inputCriterion_s00001053_used) AND (callToTask_s00002930_output_s00001054 <= callToProcess_s00002882_output_s00001054))) U ((2 <= callToTask_s00002950_output_s00001077) OR (callToProcess_s00002499_input_s00001052 + 1 <= merge_s00001061_input_s00001068))))
lola: processed formula length: 384
lola: 0 rewrites
lola: formula mentions 0 of 253 places; total mentions: 0
lola: closed formula file IBM319-PT-none-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 680 bytes per marking, with 30 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((callToProcess_s00002882_output_s00001077 <= 2) OR (3 <= fork_s00001071_activated_s00001073)) OR A (F ((callToTask_s00002961_output_s00001077 <= callToTask_s00002952_output_s00001077))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((3 <= callToProcess_s00002882_output_s00001077) AND (fork_s00001071_activated_s00001073 <= 2)) AND NOT(A(TRUE U (callToTask_s00002961_output_s00001077 <= callToTask_s00002952_output_s00001077))))))
lola: processed formula length: 212
lola: 4 rewrites
lola: formula mentions 0 of 253 places; total mentions: 0
lola: closed formula file IBM319-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 676 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: 71 markings, 70 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= callToTask_s00002956_output_s00001077) AND (fork_s00001071_activated_s00001075 <= 1))))
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 676 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 IBM319-PT-none-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 260 markings, 273 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (A (F ((1 <= callToTask_s00002930_input_s00001052))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (1 <= callToTask_s00002930_input_s00001052))))
lola: processed formula length: 68
lola: 8 rewrites
lola: formula mentions 0 of 253 places; total mentions: 0
lola: closed formula file IBM319-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 676 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: 100 markings, 115 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((callToTask_s00002965_input_s00001052 <= 2) OR (decision_s00001123_input_s00001066 + 1 <= callToTask_s00002962_output_s00001054) OR (1 <= callToTask_s00002953_output_s00001077)) OR (((3 <= callToTask_s00002930_input_s00001052) AND (callToTask_s00001406_inputCriterion_s00001053_used <= callToTask_s00002956_output_s00001054) AND (1 <= callToTask_s00002964_output_s00001077) AND (1 <= callToTask_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((callToTask_s00002965_input_s00001052 <= 2) OR (decision_s00001123_input_s00001066 + 1 <= callToTask_s00002962_output_s00001054) OR (1 <= callToTask_s00002953_output_s00001077))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((callToTask_s00002965_input_s00001052 <= 2) OR (decision_s00001123_input_s00001066 + 1 <= callToTask_s00002962_output_s00001054) OR (1 <= callToTask_s00002953_output_s00001077))
lola: processed formula length: 180
lola: 3 rewrites
lola: formula mentions 0 of 253 places; total mentions: 0
lola: closed formula file IBM319-PT-none-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: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((merge_s00002239_input_s00001129 + 1 <= callToProcess_s00002499_input_s00001052) OR (merge_s00002239_activated <= 1))))
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 676 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 IBM319-PT-none-CTLCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 148 markings, 157 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((((join_s00001164_input_s00001052 <= merge_s00002239_input_s00001068) OR (callToTask_s00002667_output_s00001054 <= callToTask_s00002930_input_s00001052)) AND ((2 <= callToTask_s00002961_output_s00001054) OR (decision_s00002948_activated <= callToTask_s00002870_output_s00001077))) OR (callToTask_s00002952_input_s00001066 <= callToProcess_s00001108_output_s00001054))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((((merge_s00002239_input_s00001068 + 1 <= join_s00001164_input_s00001052) AND (callToTask_s00002930_input_s00001052 + 1 <= callToTask_s00002667_output_s00001054)) OR ((callToTask_s00002961_output_s00001054 <= 1) AND (callToTask_s00002870_output_s00001077 + 1 <= decision_s00002948_activated))) AND (callToProcess_s00001108_output_s00001054 + 1 <= callToTask_s00002952_input_s00001066))... (shortened)
lola: processed formula length: 402
lola: 2 rewrites
lola: formula mentions 0 of 253 places; total mentions: 0
lola: closed formula file IBM319-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 676 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: 71 markings, 70 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((3 <= callToTask_s00002965_output_s00001054))) OR (1 <= callToTask_s00002961_input_s00001066))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((3 <= callToTask_s00002965_output_s00001054))) OR (1 <= callToTask_s00002961_input_s00001066))))
lola: processed formula: A (F ((A (G ((3 <= callToTask_s00002965_output_s00001054))) OR (1 <= callToTask_s00002961_input_s00001066))))
lola: processed formula length: 109
lola: 0 rewrites
lola: formula mentions 0 of 253 places; total mentions: 0
lola: closed formula file IBM319-PT-none-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 680 bytes per marking, with 30 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((callToTask_s00002667_inputCriterion_s00001053_used <= 2) AND (callToTask_s00002966_input_s00001066 <= 0)))))
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 676 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 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-CTLCardinality-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 96 markings, 95 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((callToTask_s00002896_output_s00001054 <= merge_s00002239_input_s00001068) OR (process_s00000343__s00003019_output_s00001249 <= merge_s00002239_input_s00001129) OR (3 <= callToTask_s00002932_input_s00001066) OR (1 <= callToTask_s00002962_input_s00001066)) U A (G ((2 <= callToTask_s00002958_inputCriterion_s00001053_used)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((callToTask_s00002896_output_s00001054 <= merge_s00002239_input_s00001068) OR (process_s00000343__s00003019_output_s00001249 <= merge_s00002239_input_s00001129) OR (3 <= callToTask_s00002932_input_s00001066) OR (1 <= callToTask_s00002962_input_s00001066)) U A (G ((2 <= callToTask_s00002958_inputCriterion_s00001053_used)))))
lola: processed formula: A ((((callToTask_s00002896_output_s00001054 <= merge_s00002239_input_s00001068) OR (process_s00000343__s00003019_output_s00001249 <= merge_s00002239_input_s00001129) OR (3 <= callToTask_s00002932_input_s00001066) OR (1 <= callToTask_s00002962_input_s00001066)) U A (G ((2 <= callToTask_s00002958_inputCriterion_s00001053_used)))))
lola: processed formula length: 333
lola: 0 rewrites
lola: formula mentions 0 of 253 places; total mentions: 0
lola: closed formula file IBM319-PT-none-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 680 bytes per marking, with 29 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: 88 markings, 89 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= callToProcess_s00002944_output_s00001077) AND (merge_s00002241_input_s00001066 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= callToProcess_s00002944_output_s00001077) AND (merge_s00002241_input_s00001066 <= 2))))
lola: processed formula: A (F (((3 <= callToProcess_s00002944_output_s00001077) AND (merge_s00002241_input_s00001066 <= 2))))
lola: processed formula length: 100
lola: 0 rewrites
lola: formula mentions 0 of 253 places; total mentions: 0
lola: closed formula file IBM319-PT-none-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 680 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((callToTask_s00002869_output_s00001054 <= 0) OR (2 <= callToTask_s00002950_output_s00001077) OR ((callToTask_s00001168_input_s00001068 <= merge_s00001161_activated) AND (decision_s00001126_activated <= merge_s00002240_input_s00001127)) OR (callToTask_s00002869_output_s00001077 <= 1))))
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 676 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((2 <= callToTask_s00001852_output_s00001077))) U E (G ((merge_s00002239_activated <= callToTask_s00002964_output_s00001077)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(AX((2 <= callToTask_s00001852_output_s00001077)) U NOT(A(TRUE U (callToTask_s00002964_output_s00001077 + 1 <= merge_s00002239_activated))))
lola: processed formula length: 141
lola: 4 rewrites
lola: formula mentions 0 of 253 places; total mentions: 0
lola: closed formula file IBM319-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 676 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 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: 65 markings, 65 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (F ((2 <= decision_s00002055_input_s00001066))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (2 <= decision_s00002055_input_s00001066))))
lola: processed formula length: 66
lola: 6 rewrites
lola: formula mentions 0 of 253 places; total mentions: 0
lola: closed formula file IBM319-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 676 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: sara: produced by: CTL model checkertry reading problem file IBM319-PT-none-CTLCardinality-12.sara.

lola: The net satisfies the given formula.
lola: 71 markings, 71 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= callToTask_s00002254_output_s00001054)))
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 676 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 IBM319-PT-none-CTLCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 280 markings, 293 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no yes yes yes no yes no no yes yes yes no
sara: place or transition ordering is non-deterministic

FORMULA IBM319-PT-none-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-CTLCardinality-15 FALSE 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="IBM319-PT-none"
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/IBM319-PT-none.tgz
mv IBM319-PT-none 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 IBM319-PT-none, 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 r103-smll-152658633600171"
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 ;