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 2.0M
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is FlexibleBarrier-PT-22b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-blw7-152650006300236
=====================================================================

--------------------
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 FlexibleBarrier-PT-22b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1527520385271


BK_STOP 1527520689089

--------------------
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 FlexibleBarrier-PT-22b as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 393442, 'Memory': 451.46, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola FlexibleBarrier-PT-22b...

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-22b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ FlexibleBarrier-PT-22b @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 13947/65536 symbol table entries, 4218 collisions
lola: preprocessing...
lola: finding significant places
lola: 6478 places, 7469 transitions, 6454 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 7515 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-22b-ReachabilityCardinality.task
lola: A (G ((p2891 <= p5327))) : A (G ((p919 <= p3583))) : A (G ((p1736 <= p656))) : A (G ((p3245 <= 1))) : A (G (((p3109 <= 1) AND (p1320 <= 0)))) : E (F (((p2568 + 1 <= p1495) AND (p6012 + 1 <= p116) AND ((p3392 + 1 <= p4252) OR (p1614 + 1 <= p2384))))) : A (G ((((p4881 <= 1) OR (p1261 <= 2)) AND (((2 <= p2697) AND (p4779 <= p1887)) OR (p6384 <= 1))))) : A (G (((p3420 <= p70) OR (1 <= p4348) OR (p6016 <= 1) OR (p3243 <= p2417)))) : E (F (((2 <= p4245) AND (p3133 <= p364)))) : E (F ((3 <= p395))) : E (F (((p654 + 1 <= p2637) AND (p4868 <= 0) AND ((p105 <= 1) OR (p3474 + 1 <= p2499))))) : E (F (((2 <= p763) AND ((3 <= p5161) OR (p3332 <= p3273)) AND ((3 <= p2871) OR (3 <= p4303) OR (1 <= p1362))))) : E (F (((2 <= p5453) AND (3 <= p353)))) : E (F ((1 <= p4156))) : E (F (((p562 + 1 <= p4457) AND (p3585 + 1 <= p3593) AND (p1036 <= 1) AND ((1 <= p717) OR (2 <= p4756))))) : E (F ((2 <= p5886)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2891 <= p5327)))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p919 <= p3583)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1736 <= p656)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 31940 markings, 62007 edges, 6388 markings/sec, 0 secs
lola: sara is running 5 secs || 64590 markings, 126277 edges, 6530 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3245 <= 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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 29954 markings, 57601 edges, 5991 markings/sec, 0 secs
lola: sara is running 5 secs || 62123 markings, 120762 edges, 6434 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 94077 markings, 183920 edges, 6391 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p3109 <= 1) AND (p1320 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 30724 markings, 72768 edges, 6145 markings/sec, 0 secs
lola: sara is running 5 secs || 61022 markings, 149930 edges, 6060 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 88974 markings, 224630 edges, 5590 markings/sec, 10 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2568 + 1 <= p1495) AND (p6012 + 1 <= p116) AND ((p3392 + 1 <= p4252) OR (p1614 + 1 <= p2384)))))
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 808 bytes per marking, with 10 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 32538 markings, 63270 edges, 6508 markings/sec, 0 secs
lola: sara is running 5 secs || 65229 markings, 127629 edges, 6538 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 97895 markings, 191932 edges, 6533 markings/sec, 10 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p4881 <= 1) OR (p1261 <= 2)) AND (((2 <= p2697) AND (p4779 <= p1887)) OR (p6384 <= 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 808 bytes per marking, with 10 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 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 31900 markings, 61643 edges, 6380 markings/sec, 0 secs
lola: sara is running 5 secs || 64763 markings, 126322 edges, 6573 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 97555 markings, 190849 edges, 6558 markings/sec, 10 secs
lola: sara is running 15 secs || 128852 markings, 253915 edges, 6259 markings/sec, 15 secs

lola: sara is running 20 secs || 161054 markings, 317817 edges, 6440 markings/sec, 20 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p3420 <= p70) OR (1 <= p4348) OR (p6016 <= 1) OR (p3243 <= p2417))))
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 808 bytes per marking, with 10 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 32371 markings, 62952 edges, 6474 markings/sec, 0 secs
lola: sara is running 5 secs || 65571 markings, 128423 edges, 6640 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 98749 markings, 193849 edges, 6636 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p4245) AND (p3133 <= p364))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 31487 markings, 60369 edges, 6297 markings/sec, 0 secs
lola: sara is running 5 secs || 63492 markings, 123687 edges, 6401 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 91759 markings, 180518 edges, 5653 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p395)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 36712 markings, 76247 edges, 7342 markings/sec, 0 secs
lola: sara is running 5 secs || 78720 markings, 178076 edges, 8402 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 116547 markings, 266371 edges, 7565 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 566 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p654 + 1 <= p2637) AND (p4868 <= 0) AND ((p105 <= 1) OR (p3474 + 1 <= p2499)))))
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 808 bytes per marking, with 10 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 31257 markings, 60509 edges, 6251 markings/sec, 0 secs
lola: sara is running 5 secs || 63381 markings, 123648 edges, 6425 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 95062 markings, 185570 edges, 6336 markings/sec, 10 secs
lola: sara is running 15 secs || 125512 markings, 248213 edges, 6090 markings/sec, 15 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: subprocess 11 will run for 675 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p763) AND ((3 <= p5161) OR (p3332 <= p3273)) AND ((3 <= p2871) OR (3 <= p4303) OR (1 <= p1362)))))
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 808 bytes per marking, with 10 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: ========================================
lola: state equation: Generated DNF with 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 33228 markings, 65945 edges, 6646 markings/sec, 0 secs
lola: sara is running 5 secs || 62082 markings, 135497 edges, 5771 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 91241 markings, 214364 edges, 5832 markings/sec, 10 secs
lola: sara is running 15 secs || 121521 markings, 280522 edges, 6056 markings/sec, 15 secs
lola: sara is running 20 secs || 153750 markings, 346835 edges, 6446 markings/sec, 20 secs
lola: sara is running 25 secs || 186050 markings, 413547 edges, 6460 markings/sec, 25 secs

lola: sara is running 30 secs || 219779 markings, 480621 edges, 6746 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 835 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p5453) AND (3 <= p353))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 32402 markings, 61961 edges, 6480 markings/sec, 0 secs
lola: sara is running 5 secs || 64311 markings, 124772 edges, 6382 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 96459 markings, 187812 edges, 6430 markings/sec, 10 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1107 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p4156)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48 markings, 47 edges
lola: subprocess 14 will run for 1661 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p562 + 1 <= p4457) AND (p3585 + 1 <= p3593) AND (p1036 <= 1) AND ((1 <= p717) OR (2 <= p4756)))))
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 808 bytes per marking, with 10 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: ========================================
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 32081 markings, 61473 edges, 6416 markings/sec, 0 secs
lola: sara is running 5 secs || 64549 markings, 125478 edges, 6494 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 96847 markings, 189126 edges, 6460 markings/sec, 10 secs
lola: sara is running 15 secs || 128516 markings, 252831 edges, 6334 markings/sec, 15 secs
lola: sara is running 20 secs || 160284 markings, 316019 edges, 6354 markings/sec, 20 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p5886)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 32011 markings, 61875 edges, 6402 markings/sec, 0 secs
lola: sara is running 5 secs || 64610 markings, 126041 edges, 6520 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 96969 markings, 189680 edges, 6472 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no yes yes yes no no yes no no yes yes no
----- Kill lola and sara stderr -----
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-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/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b 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-full"
echo " Input is FlexibleBarrier-PT-22b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r094-blw7-152650006300236"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;