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 mcc4mcc-structural
Input is IBM5964-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-152658637500182
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526818845365


BK_STOP 1526818890374

--------------------
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 IBM5964-PT-none as instance name.
Using IBM5964 as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', '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': 246, 'Memory': 112.08, 'Tool': 'lola'}, {'Time': 375, 'Memory': 111.44, 'Tool': 'lola'}, {'Time': 973, 'Memory': 105.97, 'Tool': 'gspn'}, {'Time': 2631, 'Memory': 240.29, 'Tool': 'itstools'}, {'Time': 2785, 'Memory': 238.74, 'Tool': 'itstools'}, {'Time': 3573, 'Memory': 162.73, 'Tool': 'gspn'}, {'Time': 6493, 'Memory': 7484.73, 'Tool': 'marcie'}, {'Time': 6985, 'Memory': 7483.94, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability 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 ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ IBM5964-PT-none @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-ReachabilityFireability.task
lola: E (F ((FIREABLE(merge_s00000945_fire_s00000953) AND FIREABLE(join_s00001294_activate_s00000946) AND NOT FIREABLE(fork_s00001067_fire_s00000991) AND FIREABLE(callToTask_s00001632_inputCriterion_s00000937) AND ((FIREABLE(callToTask_s00005965_outputCriterion_s00000939) AND (FIREABLE(decision_s00001287_fire_s00000993) OR FIREABLE(fork_s00001537_fire_s00000993))) OR FIREABLE(callToTask_s00005968_inputCriterion_s00000937))))) : A (G ((FIREABLE(callToTask_s00005972_outputCriterion_s00000939) OR ((FIREABLE(fork_s00001536_activate_s00000990) OR FIREABLE(decision_s00001616_fire_s00000991)) AND (FIREABLE(merge_s00001292_activate_s00000948) OR FIREABLE(callToTask_s00005966_outputCriterion_s00000939))) OR NOT FIREABLE(callToProcess_s00002316_inputCriterion_s00000937)))) : E (F (FIREABLE(join_s00001294_activate_s00000946))) : E (F (FIREABLE(fork_s00001067_fire_s00000993))) : A (G (NOT FIREABLE(callToTask_s00001305_inputCriterion_s00000937))) : A (G (NOT FIREABLE(join_s00001294_activate_s00000946))) : E (F ((FIREABLE(callToTask_s00002186_inputCriterion_s00000937) AND (FIREABLE(fork_s00001067_fire_s00000991) OR FIREABLE(callToTask_s00005849_inputCriterion_s00000937)) AND FIREABLE(callToTask_s00005971_outputCriterion_s00000939) AND FIREABLE(merge_s00001290_activate_s00000948) AND FIREABLE(callToTask_s00002185_outputCriterion_s00000939) AND NOT FIREABLE(join_s00001294_activate_s00000948)))) : A (G (NOT FIREABLE(decision_s00001288_fire_s00000995))) : A (G ((NOT FIREABLE(decision_s00000989_fire_s00000991) OR (FIREABLE(decision_s00001617_activate_s00000990) AND FIREABLE(join_s00001295_activate_s00000948)) OR FIREABLE(callToTask_s00002526_outputCriterion_s00000939) OR NOT FIREABLE(fork_s00001536_fire_s00000993) OR NOT FIREABLE(callToTask_s00002190_outputCriterion_s00000939) OR NOT FIREABLE(decision_s00001289_fire_s00000991) OR NOT FIREABLE(merge_s00000945_activate_s00000946)))) : E (F (FIREABLE(callToProcess_s00004075_outputCriterion_s00000939))) : A (G ((NOT FIREABLE(callToTask_s00005897_outputCriterion_s00000939) OR NOT FIREABLE(callToTask_s00005970_inputCriterion_s00000937) OR (FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) AND NOT FIREABLE(merge_s00001066_activate_s00000946)) OR ((FIREABLE(callToTask_s00005969_inputCriterion_s00000937) OR FIREABLE(merge_s00003354_activate_s00000946)) AND (FIREABLE(callToTask_s00005969_outputCriterion_s00000939) OR FIREABLE(merge_s00001291_activate_s00000946)) AND FIREABLE(callToTask_s00005969_outputCriterion_s00000939) AND FIREABLE(fork_s00001067_activate_s00000990) AND (FIREABLE(decision_s00000989_fire_s00000993) OR FIREABLE(decision_s00001617_activate_s00000990)))))) : E (F (((FIREABLE(callToTask_s00005966_inputCriterion_s00000937) OR FIREABLE(decision_s00001616_fire_s00000991)) AND (FIREABLE(decision_s00001289_activate_s00000990) OR FIREABLE(callToTask_s00001305_inputCriterion_s00000937)) AND FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) AND FIREABLE(decision_s00001617_fire_s00000991) AND (FIREABLE(callToProcess_s00002316_inputCriterion_s00000937) OR FIREABLE(callToTask_s00005897_outputCriterion_s00000939)) AND FIREABLE(callToTask_s00002183_inputCriterion_s00000937)))) : A (G ((NOT FIREABLE(decision_s00001617_fire_s00000991) OR NOT FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) OR (NOT FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(fork_s00001293_fire_s00000993)) OR FIREABLE(merge_s00001290_activate_s00000949)))) : E (F (((FIREABLE(merge_s00001120_activate_s00000949) OR FIREABLE(callToTask_s00001305_inputCriterion_s00000937)) AND NOT FIREABLE(join_s00001294_fire_s00000953) AND (FIREABLE(callToTask_s00001971_inputCriterion_s00000937) OR NOT FIREABLE(merge_s00001066_fire_s00000953)) AND FIREABLE(merge_s00003354_activate_s00000948)))) : A (G (NOT FIREABLE(decision_s00001286_fire_s00000993))) : A (G (((NOT FIREABLE(merge_s00001120_activate_s00000949) AND NOT FIREABLE(decision_s00001287_fire_s00000993)) OR (NOT FIREABLE(callToProcess_s00002411_outputCriterion_s00000939) AND NOT FIREABLE(join_s00001295_fire_s00000953)) OR FIREABLE(merge_s00001290_activate_s00000946) OR FIREABLE(decision_s00001618_activate_s00000990))))
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 (F ((FIREABLE(merge_s00000945_fire_s00000953) AND FIREABLE(join_s00001294_activate_s00000946) AND NOT FIREABLE(fork_s00001067_fire_s00000991) AND FIREABLE(callToTask_s00001632_inputCriterion_s00000937) AND ((FIREABLE(callToTask_s00005965_outputCriterion_s00000939) AND (FIREABLE(decision_s00001287_fire_s00000993) OR FIREABLE(fork_s00001537_fire_s00000993))) OR FIREABLE(callToTask_s00005968_inpu... (shortened)
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 34 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(callToTask_s00005972_outputCriterion_s00000939) OR ((FIREABLE(fork_s00001536_activate_s00000990) OR FIREABLE(decision_s00001616_fire_s00000991)) AND (FIREABLE(merge_s00001292_activate_s00000948) OR FIREABLE(callToTask_s00005966_outputCriterion_s00000939))) OR NOT FIREABLE(callToProcess_s00002316_inputCriterion_s00000937))))
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 30 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1879 markings, 2562 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(join_s00001294_activate_s00000946)))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(fork_s00001067_fire_s00000993)))
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-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(callToTask_s00001305_inputCriterion_s00000937)))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(join_s00001294_activate_s00000946)))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToTask_s00002186_inputCriterion_s00000937) AND (FIREABLE(fork_s00001067_fire_s00000991) OR FIREABLE(callToTask_s00005849_inputCriterion_s00000937)) AND FIREABLE(callToTask_s00005971_outputCriterion_s00000939) AND FIREABLE(merge_s00001290_activate_s00000948) AND FIREABLE(callToTask_s00002185_outputCriterion_s00000939) AND NOT FIREABLE(join_s00001294_activate_s00000948))))
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 104 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 434 markings, 532 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(decision_s00001288_fire_s00000995)))
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-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(decision_s00000989_fire_s00000991) OR (FIREABLE(decision_s00001617_activate_s00000990) AND FIREABLE(join_s00001295_activate_s00000948)) OR FIREABLE(callToTask_s00002526_outputCriterion_s00000939) OR NOT FIREABLE(fork_s00001536_fire_s00000993) OR NOT FIREABLE(callToTask_s00002190_outputCriterion_s00000939) OR NOT FIREABLE(decision_s00001289_fire_s00000991) OR NOT FIREABLE(... (shortened)
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 54 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(callToProcess_s00004075_outputCriterion_s00000939)))
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-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(callToTask_s00005897_outputCriterion_s00000939) OR NOT FIREABLE(callToTask_s00005970_inputCriterion_s00000937) OR (FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) AND NOT FIREABLE(merge_s00001066_activate_s00000946)) OR ((FIREABLE(callToTask_s00005969_inputCriterion_s00000937) OR FIREABLE(merge_s00003354_activate_s00000946)) AND (FIREABLE(callToTask_s00005969_ou... (shortened)
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 200 literals and 26 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3103 markings, 4610 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(callToTask_s00005966_inputCriterion_s00000937) OR FIREABLE(decision_s00001616_fire_s00000991)) AND (FIREABLE(decision_s00001289_activate_s00000990) OR FIREABLE(callToTask_s00001305_inputCriterion_s00000937)) AND FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) AND FIREABLE(decision_s00001617_fire_s00000991) AND (FIREABLE(callToProcess_s00002316_inputCriterion_s0000093... (shortened)
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 100 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1172 markings, 1823 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(decision_s00001617_fire_s00000991) OR NOT FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) OR (NOT FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(fork_s00001293_fire_s00000993)) OR FIREABLE(merge_s00001290_activate_s00000949))))
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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 390 markings, 466 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(merge_s00001120_activate_s00000949) OR FIREABLE(callToTask_s00001305_inputCriterion_s00000937)) AND NOT FIREABLE(join_s00001294_fire_s00000953) AND (FIREABLE(callToTask_s00001971_inputCriterion_s00000937) OR NOT FIREABLE(merge_s00001066_fire_s00000953)) AND FIREABLE(merge_s00003354_activate_s00000948))))
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 68 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(decision_s00001286_fire_s00000993)))
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-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(merge_s00001120_activate_s00000949) AND NOT FIREABLE(decision_s00001287_fire_s00000993)) OR (NOT FIREABLE(callToProcess_s00002411_outputCriterion_s00000939) AND NOT FIREABLE(join_s00001295_fire_s00000953)) OR FIREABLE(merge_s00001290_activate_s00000946) OR FIREABLE(decision_s00001618_activate_s00000990))))
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 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1461 markings, 1951 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes yes no yes yes no yes no yes no yes yes
FORMULA IBM5964-PT-none-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityFireability-15 TRUE 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="ReachabilityFireability"
export BK_TOOL="mcc4mcc-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/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 mcc4mcc-structural"
echo " Input is IBM5964-PT-none, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r107-smll-152658637500182"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;