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 6.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 3.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.1K 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 171K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is IBM5964-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-152658633000178
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526721643155


BK_STOP 1526721687556

--------------------
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 IBM5964-PT-none as instance name.
Using IBM5964 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': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 313, 'Memory': 112.42, 'Tool': 'lola'}, {'Time': 413, 'Memory': 110.58, 'Tool': 'lola'}, {'Time': 986, 'Memory': 127.1, 'Tool': 'gspn'}, {'Time': 2339, 'Memory': 252.36, 'Tool': 'itstools'}, {'Time': 2637, 'Memory': 246.11, 'Tool': 'itstools'}, {'Time': 3732, 'Memory': 161.6, 'Tool': 'gspn'}, {'Time': 5953, 'Memory': 7484.37, 'Tool': 'marcie'}, {'Time': 6202, 'Memory': 7484.5, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 7.472843450479234x far from the best tool lola.
CTLCardinality lola IBM5964-PT-none...

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


checking for too many tokens
===========================================================================================
IBM5964-PT-none: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ IBM5964-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: 402/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 263 places, 139 transitions, 135 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 133 transition conflict sets
lola: TASK
lola: reading formula from IBM5964-PT-none-CTLCardinality.task
lola: E (X (E (F ((2 <= callToTask_s00002183_output_s00000962))))) : E (((callToTask_s00005970_output_s00000938 <= callToTask_s00002186_output_s00000938) U ((2 <= callToTask_s00002185_input_s00000952) AND (3 <= callToTask_s00005967_output_s00000979) AND ((2 <= fork_s00001067_input_s00000935) OR (merge_s00001292_input_s00000952 <= callToTask_s00005969_input_s00000952))))) : NOT((A (F ((2 <= callToTask_s00002183_inputCriterion_s00000937_used))) OR ((callToTask_s00002183_output_s00000956 + 1 <= callToTask_s00002186_output_s00000938) AND (merge_s00000945_input_s00000935 <= 0)))) : (E ((((merge_s00001120_input_s00001513 <= callToTask_s00002186_input_s00001011) AND (callToTask_s00002183_inputCriterion_s00000937_used <= callToTask_s00002186_output_s00000938)) U ((1 <= join_s00001295_activated_s00000946) AND (callToTask_s00005897_output_s00000938 <= merge_s00000945_input_s00000952)))) AND (decision_s00001618_activated <= callToTask_s00001971_input_s00000985)) : A ((((callToProcess_s00004075_output_s00000938 <= callToTask_s00005849_inputCriterion_s00000937_used) OR (callToTask_s00005969_output_s00000959 + 1 <= callToTask_s00002185_input_s00000952)) U (3 <= callToTask_s00002185_input_s00000952))) : (E (G (((callToTask_s00002185_output_s00000938 <= 2) AND ((2 <= callToProcess_s00002538_input_s00000950) OR (process_s00000383__s00005964_input_s00000936 <= callToProcess_s00005925_output_s00000956))))) OR NOT(A (F (((2 <= callToProcess_s00004075_input_s00000986) OR (3 <= callToTask_s00005972_output_s00000938)))))) : E (((fork_s00001537_activated_s00000993 <= callToTask_s00005970_output_s00000981) U ((callToTask_s00001971_output_s00000981 + 1 <= callToTask_s00002183_inputCriterion_s00000937_used) OR (merge_s00001291_input_s00001009 + 1 <= callToTask_s00002526_output_s00000938)))) : E (((((callToTask_s00001746_output_s00000956 <= merge_s00001369_activated) AND (1 <= callToTask_s00005966_output_s00000979)) OR ((callToTask_s00005966_output_s00000938 <= callToTask_s00001632_output_s00000979) AND (callToTask_s00002181_output_s00000979 <= callToTask_s00001632_output_s00000938))) U (((callToTask_s00005971_inputCriterion_s00000937_used <= callToTask_s00001746_output_s00000938) OR (callToTask_s00005968_input_s00000935 <= merge_s00000945_input_s00000950)) AND (1 <= callToTask_s00002427_output_s00000979)))) : ((((merge_s00001290_input_s00000935 <= 2) OR (callToProcess_s00002411_input_s00000935 <= 0)) AND ((callToTask_s00002427_input_s00001203 <= 0) OR (merge_s00000945_input_s00000985 + 1 <= callToTask_s00002741_inputCriterion_s00000937_used)) AND (2 <= callToTask_s00005897_input_s00000986)) OR A (X (E (G ((callToTask_s00005967_input_s00000952 <= callToTask_s00002189_output_s00000938)))))) : A (G ((callToTask_s00005969_output_s00000938 <= decision_s00000999_activated))) : E (X (NOT(A (F ((1 <= callToTask_s00005965_input_s00000952)))))) : (((callToProcess_s00002411_input_s00000935 <= callToTask_s00002186_output_s00000979) AND (E (F ((1 <= merge_s00001066_activated))) OR E (G ((3 <= decision_s00001286_activated))))) AND (callToTask_s00005849_output_s00000938 <= callToTask_s00001971_input_s00000985)) : A ((((callToTask_s00002427_input_s00000950 <= callToTask_s00001746_output_s00000956) OR (merge_s00001120_input_s00001513 <= callToProcess_s00002411_input_s00000950) OR (callToTask_s00002741_input_s00000985 + 1 <= callToTask_s00001305_input_s00000950)) U ((callToTask_s00002185_output_s00000956 + 1 <= fork_s00001537_activated_s00000991) AND (callToTask_s00005969_output_s00000960 <= 1)))) : E (G ((merge_s00001120_input_s00001010 <= 1))) : A (G ((callToTask_s00002186_inputCriterion_s00000937_used <= merge_s00001290_input_s00000952))) : ((callToTask_s00002526_input_s00000935 <= callToProcess_s00002411_input_s00000985) AND A (F ((((2 <= process_s00000383__s00005964_output_s00001610) AND (callToTask_s00001746_output_s00000956 <= join_s00001295_input_s00000952)) OR (callToTask_s00005967_output_s00000956 + 1 <= callToTask_s00005969_output_s00000960)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((2 <= callToTask_s00002183_output_s00000962)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (2 <= callToTask_s00002183_output_s00000962)))
lola: processed formula length: 58
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: 15545 markings, 59845 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((callToTask_s00005970_output_s00000938 <= callToTask_s00002186_output_s00000938) U ((2 <= callToTask_s00002185_input_s00000952) AND (3 <= callToTask_s00005967_output_s00000979) AND ((2 <= fork_s00001067_input_s00000935) OR (merge_s00001292_input_s00000952 <= callToTask_s00005969_input_s00000952)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((callToTask_s00005970_output_s00000938 <= callToTask_s00002186_output_s00000938) U ((2 <= callToTask_s00002185_input_s00000952) AND (3 <= callToTask_s00005967_output_s00000979) AND ((2 <= fork_s00001067_input_s00000935) OR (merge_s00001292_input_s00000952 <= callToTask_s00005969_input_s00000952))))
lola: processed formula length: 302
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 165 markings, 217 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((2 <= callToTask_s00002183_inputCriterion_s00000937_used))) OR ((callToTask_s00002183_output_s00000956 + 1 <= callToTask_s00002186_output_s00000938) AND (merge_s00000945_input_s00000935 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((callToTask_s00002183_inputCriterion_s00000937_used <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= callToTask_s00002183_inputCriterion_s00000937_used)))
lola: processed formula length: 72
lola: 7 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: 43 markings, 42 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((callToTask_s00002186_output_s00000938 <= callToTask_s00002183_output_s00000956) OR (1 <= merge_s00000945_input_s00000935))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((callToTask_s00002186_output_s00000938 <= callToTask_s00002183_output_s00000956) OR (1 <= merge_s00000945_input_s00000935))
lola: processed formula length: 125
lola: 5 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((merge_s00001120_input_s00001513 <= callToTask_s00002186_input_s00001011) AND (callToTask_s00002183_inputCriterion_s00000937_used <= callToTask_s00002186_output_s00000938)) U ((1 <= join_s00001295_activated_s00000946) AND (callToTask_s00005897_output_s00000938 <= merge_s00000945_input_s00000952)))) AND (decision_s00001618_activated <= callToTask_s00001971_input_s00000985))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((merge_s00001120_input_s00001513 <= callToTask_s00002186_input_s00001011) AND (callToTask_s00002183_inputCriterion_s00000937_used <= callToTask_s00002186_output_s00000938)) U ((1 <= join_s00001295_activated_s00000946) AND (callToTask_s00005897_output_s00000938 <= merge_s00000945_input_s00000952))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((merge_s00001120_input_s00001513 <= callToTask_s00002186_input_s00001011) AND (callToTask_s00002183_inputCriterion_s00000937_used <= callToTask_s00002186_output_s00000938)) U ((1 <= join_s00001295_activated_s00000946) AND (callToTask_s00005897_output_s00000938 <= merge_s00000945_input_s00000952)))
lola: processed formula length: 301
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 470 markings, 1014 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((callToProcess_s00004075_output_s00000938 <= callToTask_s00005849_inputCriterion_s00000937_used) OR (callToTask_s00005969_output_s00000959 + 1 <= callToTask_s00002185_input_s00000952)) U (3 <= callToTask_s00002185_input_s00000952)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((callToProcess_s00004075_output_s00000938 <= callToTask_s00005849_inputCriterion_s00000937_used) OR (callToTask_s00005969_output_s00000959 + 1 <= callToTask_s00002185_input_s00000952)) U (3 <= callToTask_s00002185_input_s00000952)))
lola: processed formula: A ((((callToProcess_s00004075_output_s00000938 <= callToTask_s00005849_inputCriterion_s00000937_used) OR (callToTask_s00005969_output_s00000959 + 1 <= callToTask_s00002185_input_s00000952)) U (3 <= callToTask_s00002185_input_s00000952)))
lola: processed formula length: 238
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-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 544 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: 43 markings, 43 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((callToTask_s00002185_output_s00000938 <= 2) AND ((2 <= callToProcess_s00002538_input_s00000950) OR (process_s00000383__s00005964_input_s00000936 <= callToProcess_s00005925_output_s00000956))))) OR NOT(A (F (((2 <= callToProcess_s00004075_input_s00000986) OR (3 <= callToTask_s00005972_output_s00000938))))))
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: E (G (((callToTask_s00002185_output_s00000938 <= 2) AND ((2 <= callToProcess_s00002538_input_s00000950) OR (process_s00000383__s00005964_input_s00000936 <= callToProcess_s00005925_output_s00000956)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= callToTask_s00002185_output_s00000938) OR ((callToProcess_s00002538_input_s00000950 <= 1) AND (callToProcess_s00005925_output_s00000956 + 1 <= process_s00000383__s00005964_input_s00000936)))))
lola: processed formula length: 213
lola: 5 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((callToProcess_s00004075_input_s00000986 <= 1) AND (callToTask_s00005972_output_s00000938 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= callToProcess_s00004075_input_s00000986) OR (3 <= callToTask_s00005972_output_s00000938))))
lola: processed formula length: 112
lola: 5 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: 43 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((fork_s00001537_activated_s00000993 <= callToTask_s00005970_output_s00000981) U ((callToTask_s00001971_output_s00000981 + 1 <= callToTask_s00002183_inputCriterion_s00000937_used) OR (merge_s00001291_input_s00001009 + 1 <= callToTask_s00002526_output_s00000938))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((fork_s00001537_activated_s00000993 <= callToTask_s00005970_output_s00000981) U ((callToTask_s00001971_output_s00000981 + 1 <= callToTask_s00002183_inputCriterion_s00000937_used) OR (merge_s00001291_input_s00001009 + 1 <= callToTask_s00002526_output_s00000938)))
lola: processed formula length: 265
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 82 markings, 91 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((callToTask_s00001746_output_s00000956 <= merge_s00001369_activated) AND (1 <= callToTask_s00005966_output_s00000979)) OR ((callToTask_s00005966_output_s00000938 <= callToTask_s00001632_output_s00000979) AND (callToTask_s00002181_output_s00000979 <= callToTask_s00001632_output_s00000938))) U (((callToTask_s00005971_inputCriterion_s00000937_used <= callToTask_s00001746_output_s00000938) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((callToTask_s00001746_output_s00000956 <= merge_s00001369_activated) AND (1 <= callToTask_s00005966_output_s00000979)) OR ((callToTask_s00005966_output_s00000938 <= callToTask_s00001632_output_s00000979) AND (callToTask_s00002181_output_s00000979 <= callToTask_s00001632_output_s00000938))) U (((callToTask_s00005971_inputCriterion_s00000937_used <= callToTask_s00001746_output_s00000938) OR (c... (shortened)
lola: processed formula length: 523
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 149 markings, 214 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((merge_s00001290_input_s00000935 <= 2) OR (callToProcess_s00002411_input_s00000935 <= 0)) AND ((callToTask_s00002427_input_s00001203 <= 0) OR (merge_s00000945_input_s00000985 + 1 <= callToTask_s00002741_inputCriterion_s00000937_used)) AND (2 <= callToTask_s00005897_input_s00000986)) OR A (X (E (G ((callToTask_s00005967_input_s00000952 <= callToTask_s00002189_output_s00000938))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((merge_s00001290_input_s00000935 <= 2) OR (callToProcess_s00002411_input_s00000935 <= 0)) AND ((callToTask_s00002427_input_s00001203 <= 0) OR (merge_s00000945_input_s00000985 + 1 <= callToTask_s00002741_inputCriterion_s00000937_used)) AND (2 <= callToTask_s00005897_input_s00000986))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((merge_s00001290_input_s00000935 <= 2) OR (callToProcess_s00002411_input_s00000935 <= 0)) AND ((callToTask_s00002427_input_s00001203 <= 0) OR (merge_s00000945_input_s00000985 + 1 <= callToTask_s00002741_inputCriterion_s00000937_used)) AND (2 <= callToTask_s00005897_input_s00000986))
lola: processed formula length: 287
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((callToTask_s00005967_input_s00000952 <= callToTask_s00002189_output_s00000938)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (callToTask_s00002189_output_s00000938 + 1 <= callToTask_s00005967_input_s00000952))))
lola: processed formula length: 102
lola: 3 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: 42 markings, 41 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((callToTask_s00005969_output_s00000938 <= decision_s00000999_activated)))
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 540 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: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(A (F ((1 <= callToTask_s00005965_input_s00000952))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (1 <= callToTask_s00005965_input_s00000952))))
lola: processed formula length: 62
lola: 6 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: 42 markings, 41 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((callToProcess_s00002411_input_s00000935 <= callToTask_s00002186_output_s00000979) AND (E (F ((1 <= merge_s00001066_activated))) OR E (G ((3 <= decision_s00001286_activated))))) AND (callToTask_s00005849_output_s00000938 <= callToTask_s00001971_input_s00000985))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (callToProcess_s00002411_input_s00000935 <= callToTask_s00002186_output_s00000979)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (callToProcess_s00002411_input_s00000935 <= callToTask_s00002186_output_s00000979)
lola: processed formula length: 82
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: processed formula with 1 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= merge_s00001066_activated)))
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 540 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 IBM5964-PT-none-CTLCardinality-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= decision_s00001286_activated)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (decision_s00001286_activated <= 2)))
lola: processed formula length: 50
lola: 3 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((callToTask_s00002427_input_s00000950 <= callToTask_s00001746_output_s00000956) OR (merge_s00001120_input_s00001513 <= callToProcess_s00002411_input_s00000950) OR (callToTask_s00002741_input_s00000985 + 1 <= callToTask_s00001305_input_s00000950)) U ((callToTask_s00002185_output_s00000956 + 1 <= fork_s00001537_activated_s00000991) AND (callToTask_s00005969_output_s00000960 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((callToTask_s00002427_input_s00000950 <= callToTask_s00001746_output_s00000956) OR (merge_s00001120_input_s00001513 <= callToProcess_s00002411_input_s00000950) OR (callToTask_s00002741_input_s00000985 + 1 <= callToTask_s00001305_input_s00000950)) U ((callToTask_s00002185_output_s00000956 + 1 <= fork_s00001537_activated_s00000991) AND (callToTask_s00005969_output_s00000960 <= 1))))
lola: processed formula: A ((((callToTask_s00002427_input_s00000950 <= callToTask_s00001746_output_s00000956) OR (merge_s00001120_input_s00001513 <= callToProcess_s00002411_input_s00000950) OR (callToTask_s00002741_input_s00000985 + 1 <= callToTask_s00001305_input_s00000950)) U ((callToTask_s00002185_output_s00000956 + 1 <= fork_s00001537_activated_s00000991) AND (callToTask_s00005969_output_s00000960 <= 1))))
lola: processed formula length: 390
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-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 544 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 54 markings, 54 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((merge_s00001120_input_s00001010 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= merge_s00001120_input_s00001010)))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: 43 markings, 42 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((callToTask_s00002186_inputCriterion_s00000937_used <= merge_s00001290_input_s00000952)))
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 540 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 IBM5964-PT-none-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-CTLCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2088 markings, 3161 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((callToTask_s00002526_input_s00000935 <= callToProcess_s00002411_input_s00000985) AND A (F ((((2 <= process_s00000383__s00005964_output_s00001610) AND (callToTask_s00001746_output_s00000956 <= join_s00001295_input_s00000952)) OR (callToTask_s00005967_output_s00000956 + 1 <= callToTask_s00005969_output_s00000960)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (callToTask_s00002526_input_s00000935 <= callToProcess_s00002411_input_s00000985)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (callToTask_s00002526_input_s00000935 <= callToProcess_s00002411_input_s00000985)
lola: processed formula length: 81
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: processed formula with 1 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: 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 no yes no no yes yes yes no yes yes yes unknown
FORMULA IBM5964-PT-none-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-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="IBM5964-PT-none"
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/IBM5964-PT-none.tgz
mv IBM5964-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-full"
echo " Input is IBM5964-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 r102-smll-152658633000178"
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 ;