fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r138-qhx2-152673581000418
Last Updated
June 26, 2018

About the Execution of Irma.full for ResAllocation-PT-R100C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4130.260 510323.00 976383.00 2596.70 FFFFFFFF?TFFTTFT normal

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 568K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 404K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is ResAllocation-PT-R100C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-qhx2-152673581000418
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527162844636


BK_STOP 1527163354959

--------------------
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 ResAllocation-PT-R100C002 as instance name.
Using ResAllocation 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 540, 'Memory': 110.82, 'Tool': 'lola'}, {'Time': 720, 'Memory': 111.39, 'Tool': 'lola'}, {'Time': 3434, 'Memory': 321.27, 'Tool': 'itstools'}, {'Time': 4283, 'Memory': 319.95, 'Tool': 'itstools'}, {'Time': 15088, 'Memory': 2353.2, 'Tool': 'marcie'}, {'Time': 17224, 'Memory': 2353.12, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola ResAllocation-PT-R100C002...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
ResAllocation-PT-R100C002: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ ResAllocation-PT-R100C002 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 602/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 400 places, 202 transitions, 200 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 302 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R100C002-ReachabilityCardinality.task
lola: A (G (((p_1_60 <= r_1_38) OR (1 <= p_1_55)))) : E (F ((((3 <= r_0_77) OR (p_1_75 <= r_0_7) OR ((1 <= r_1_49) AND (2 <= r_1_71))) AND (3 <= p_0_31)))) : E (F ((2 <= r_1_41))) : E (F (((2 <= p_0_66) AND (3 <= r_0_36)))) : E (F ((((3 <= p_1_95) OR (3 <= p_0_21) OR ((r_0_89 <= p_1_85) AND (3 <= p_0_34))) AND (p_0_91 + 1 <= r_0_48)))) : A (G (((p_1_91 <= p_1_23) OR (r_1_24 <= r_0_29)))) : A (G (((r_0_45 <= r_0_31) OR (3 <= p_0_96)))) : E (F ((2 <= p_0_13))) : A (G (((r_1_12 <= p_1_64) OR (p_0_97 <= r_1_79)))) : A (G ((((3 <= p_0_38) AND (p_0_41 <= p_0_17)) OR (r_0_21 <= 2) OR (((3 <= p_0_5) OR (1 <= r_0_35)) AND ((p_0_75 <= p_0_17) OR (r_0_83 <= p_0_73)))))) : A (G ((r_0_38 <= r_1_60))) : E (F (((3 <= r_1_55) AND (p_0_97 <= r_1_77) AND ((1 <= p_0_84) OR (3 <= r_1_74)) AND ((1 <= r_0_27) OR (p_0_50 <= r_1_19) OR (p_1_72 <= r_1_13))))) : A (G (((p_1_19 <= 2) OR ((p_1_62 <= r_0_80) AND (3 <= r_0_29)) OR (1 <= p_1_90)))) : E (F ((1 <= p_0_32))) : A (G ((((2 <= r_1_26) AND (3 <= p_1_98) AND (2 <= p_1_90)) OR (p_1_2 <= r_0_26)))) : E (F (((r_1_72 <= 0) AND (p_0_94 <= 2) AND ((r_1_72 <= r_0_98) OR (2 <= r_1_75) OR (p_0_18 <= r_1_55) OR (p_0_98 <= p_0_34)))))
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 (((p_1_60 <= r_1_38) OR (1 <= p_1_55))))
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 28 bytes per marking, with 24 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 ResAllocation-PT-R100C002-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 103 markings, 102 edges
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= r_0_77) OR (p_1_75 <= r_0_7) OR ((1 <= r_1_49) AND (2 <= r_1_71))) AND (3 <= p_0_31))))
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 28 bytes per marking, with 24 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 7 literals and 3 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= r_1_41)))
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 28 bytes per marking, with 24 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 ResAllocation-PT-R100C002-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p_0_66) AND (3 <= r_0_36))))
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 28 bytes per marking, with 24 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 ResAllocation-PT-R100C002-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p_1_95) OR (3 <= p_0_21) OR ((r_0_89 <= p_1_85) AND (3 <= p_0_34))) AND (p_0_91 + 1 <= r_0_48))))
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 28 bytes per marking, with 24 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_1_91 <= p_1_23) OR (r_1_24 <= r_0_29))))
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 28 bytes per marking, with 24 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 ResAllocation-PT-R100C002-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((r_0_45 <= r_0_31) OR (3 <= p_0_96))))
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 28 bytes per marking, with 24 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
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-5.sara.
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-6.sara.
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p_0_13)))
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 28 bytes per marking, with 24 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 ResAllocation-PT-R100C002-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-7.sara.

sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((r_1_12 <= p_1_64) OR (p_0_97 <= r_1_79))))
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 28 bytes per marking, with 24 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 ResAllocation-PT-R100C002-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 583709 markings, 1064375 edges, 116742 markings/sec, 0 secs
lola: sara is running 5 secs || 1134171 markings, 2106987 edges, 110092 markings/sec, 5 secs
lola: sara is running 10 secs || 1661895 markings, 3211912 edges, 105545 markings/sec, 10 secs
lola: sara is running 15 secs || 2204849 markings, 4335416 edges, 108591 markings/sec, 15 secs
sara: warning, failure of lp_solve (at job 581)
lola: sara is running 20 secs || 2691426 markings, 5671713 edges, 97315 markings/sec, 20 secs
lola: sara is running 25 secs || 3155527 markings, 7059686 edges, 92820 markings/sec, 25 secs
lola: sara is running 30 secs || 3645368 markings, 8430783 edges, 97968 markings/sec, 30 secs
lola: sara is running 35 secs || 4198212 markings, 9492383 edges, 110569 markings/sec, 35 secs
lola: sara is running 40 secs || 4715537 markings, 10574033 edges, 103465 markings/sec, 40 secs
lola: sara is running 45 secs || 5175204 markings, 11866076 edges, 91933 markings/sec, 45 secs
lola: sara is running 50 secs || 5664224 markings, 13267755 edges, 97804 markings/sec, 50 secs
lola: sara is running 55 secs || 6120080 markings, 14774223 edges, 91171 markings/sec, 55 secs
lola: sara is running 60 secs || 6635490 markings, 16091479 edges, 103082 markings/sec, 60 secs
lola: sara is running 65 secs || 7148256 markings, 17377236 edges, 102553 markings/sec, 65 secs
lola: sara is running 70 secs || 7629739 markings, 18757982 edges, 96297 markings/sec, 70 secs
lola: sara is running 75 secs || 8055708 markings, 20296261 edges, 85194 markings/sec, 75 secs
lola: sara is running 80 secs || 8492542 markings, 21803834 edges, 87367 markings/sec, 80 secs
lola: sara is running 85 secs || 8946283 markings, 23239440 edges, 90748 markings/sec, 85 secs
lola: sara is running 90 secs || 9373581 markings, 24757912 edges, 85460 markings/sec, 90 secs
lola: sara is running 95 secs || 9844126 markings, 26088945 edges, 94109 markings/sec, 95 secs
lola: sara is running 100 secs || 10314729 markings, 27445656 edges, 94121 markings/sec, 100 secs
lola: sara is running 105 secs || 10742423 markings, 28962893 edges, 85539 markings/sec, 105 secs
lola: sara is running 110 secs || 11127838 markings, 30501909 edges, 77083 markings/sec, 110 secs
lola: sara is running 115 secs || 11543351 markings, 32065446 edges, 83103 markings/sec, 115 secs
lola: sara is running 120 secs || 12068176 markings, 33596417 edges, 104965 markings/sec, 120 secs
lola: sara is running 125 secs || 12509593 markings, 35045646 edges, 88283 markings/sec, 125 secs
lola: sara is running 130 secs || 12987649 markings, 36394125 edges, 95611 markings/sec, 130 secs
lola: sara is running 135 secs || 13439835 markings, 37713204 edges, 90437 markings/sec, 135 secs
lola: sara is running 140 secs || 13896432 markings, 39071544 edges, 91319 markings/sec, 140 secs
lola: sara is running 145 secs || 14336765 markings, 40422226 edges, 88067 markings/sec, 145 secs
lola: sara is running 150 secs || 14817288 markings, 41695163 edges, 96105 markings/sec, 150 secs
lola: sara is running 155 secs || 15280889 markings, 43068282 edges, 92720 markings/sec, 155 secs
lola: sara is running 160 secs || 15786561 markings, 44392614 edges, 101134 markings/sec, 160 secs
lola: sara is running 165 secs || 16226087 markings, 45970356 edges, 87905 markings/sec, 165 secs
lola: sara is running 170 secs || 16615757 markings, 47525016 edges, 77934 markings/sec, 170 secs
lola: sara is running 175 secs || 17038056 markings, 49091426 edges, 84460 markings/sec, 175 secs
lola: sara is running 180 secs || 17441524 markings, 50640886 edges, 80694 markings/sec, 180 secs
lola: sara is running 185 secs || 17843768 markings, 52186348 edges, 80449 markings/sec, 185 secs
lola: sara is running 190 secs || 18240163 markings, 53741882 edges, 79279 markings/sec, 190 secs
lola: sara is running 195 secs || 18626384 markings, 55128283 edges, 77244 markings/sec, 195 secs
lola: sara is running 200 secs || 19025959 markings, 56741351 edges, 79915 markings/sec, 200 secs
lola: sara is running 205 secs || 19495528 markings, 58339739 edges, 93914 markings/sec, 205 secs
lola: sara is running 210 secs || 19918684 markings, 59884731 edges, 84631 markings/sec, 210 secs
lola: sara is running 215 secs || 20341432 markings, 61206806 edges, 84550 markings/sec, 215 secs
lola: sara is running 220 secs || 20866697 markings, 62505369 edges, 105053 markings/sec, 220 secs
lola: sara is running 225 secs || 21337848 markings, 63949907 edges, 94230 markings/sec, 225 secs
lola: sara is running 230 secs || 21743415 markings, 65476789 edges, 81113 markings/sec, 230 secs
lola: sara is running 235 secs || 22187382 markings, 67120223 edges, 88793 markings/sec, 235 secs
lola: sara is running 240 secs || 22589221 markings, 68728801 edges, 80368 markings/sec, 240 secs
lola: sara is running 245 secs || 22950127 markings, 70184861 edges, 72181 markings/sec, 245 secs
lola: sara is running 250 secs || 23357726 markings, 71809210 edges, 81520 markings/sec, 250 secs
lola: sara is running 255 secs || 23823833 markings, 73157065 edges, 93221 markings/sec, 255 secs
lola: sara is running 260 secs || 24282606 markings, 74458827 edges, 91755 markings/sec, 260 secs
lola: sara is running 265 secs || 24686499 markings, 75809870 edges, 80779 markings/sec, 265 secs
lola: sara is running 270 secs || 25104661 markings, 77187639 edges, 83632 markings/sec, 270 secs
lola: sara is running 275 secs || 25650739 markings, 78308192 edges, 109216 markings/sec, 275 secs
lola: sara is running 280 secs || 26217789 markings, 79382771 edges, 113410 markings/sec, 280 secs
lola: sara is running 285 secs || 26700270 markings, 80699611 edges, 96496 markings/sec, 285 secs
lola: sara is running 290 secs || 27129113 markings, 82024985 edges, 85769 markings/sec, 290 secs
lola: sara is running 295 secs || 27581549 markings, 83291598 edges, 90487 markings/sec, 295 secs
lola: sara is running 300 secs || 28030596 markings, 84682063 edges, 89809 markings/sec, 300 secs
lola: sara is running 305 secs || 28491489 markings, 85995048 edges, 92179 markings/sec, 305 secs
lola: sara is running 310 secs || 28949009 markings, 87355709 edges, 91504 markings/sec, 310 secs
lola: sara is running 315 secs || 29415785 markings, 88698857 edges, 93355 markings/sec, 315 secs
lola: sara is running 320 secs || 29870292 markings, 90087392 edges, 90901 markings/sec, 320 secs
lola: sara is running 325 secs || 30344370 markings, 91395315 edges, 94816 markings/sec, 325 secs
lola: sara is running 330 secs || 30806180 markings, 92734587 edges, 92362 markings/sec, 330 secs
lola: sara is running 335 secs || 31270358 markings, 94088957 edges, 92836 markings/sec, 335 secs
lola: sara is running 340 secs || 31684002 markings, 95543657 edges, 82729 markings/sec, 340 secs
lola: sara is running 345 secs || 32055677 markings, 97065149 edges, 74335 markings/sec, 345 secs
lola: sara is running 350 secs || 32437203 markings, 98584212 edges, 76305 markings/sec, 350 secs
lola: sara is running 355 secs || 32825945 markings, 100085695 edges, 77748 markings/sec, 355 secs
lola: sara is running 360 secs || 33193792 markings, 101586487 edges, 73569 markings/sec, 360 secs
lola: sara is running 365 secs || 33593541 markings, 103091472 edges, 79950 markings/sec, 365 secs
lola: sara is running 370 secs || 33987384 markings, 104582178 edges, 78769 markings/sec, 370 secs
lola: sara is running 375 secs || 34367771 markings, 106096332 edges, 76077 markings/sec, 375 secs
lola: sara is running 380 secs || 34826821 markings, 107448909 edges, 91810 markings/sec, 380 secs
lola: sara is running 385 secs || 35276656 markings, 108780709 edges, 89967 markings/sec, 385 secs
lola: sara is running 390 secs || 35668328 markings, 110251308 edges, 78334 markings/sec, 390 secs
lola: sara is running 395 secs || 36052161 markings, 111736259 edges, 76767 markings/sec, 395 secs
lola: sara is running 400 secs || 36434373 markings, 113253368 edges, 76442 markings/sec, 400 secs
lola: sara is running 405 secs || 36815824 markings, 114806306 edges, 76290 markings/sec, 405 secs
lola: sara is running 410 secs || 37234065 markings, 116285693 edges, 83648 markings/sec, 410 secs
lola: sara is running 415 secs || 37655948 markings, 117890975 edges, 84377 markings/sec, 415 secs
lola: sara is running 420 secs || 38138285 markings, 119529513 edges, 96467 markings/sec, 420 secs
lola: sara is running 425 secs || 38596608 markings, 121126446 edges, 91665 markings/sec, 425 secs
lola: sara is running 430 secs || 39022557 markings, 122683028 edges, 85190 markings/sec, 430 secs
lola: sara is running 435 secs || 39523506 markings, 124018862 edges, 100190 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p_0_38) AND (p_0_41 <= p_0_17)) OR (r_0_21 <= 2) OR (((3 <= p_0_5) OR (1 <= r_0_35)) AND ((p_0_75 <= p_0_17) OR (r_0_83 <= p_0_73))))))
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 28 bytes per marking, with 24 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((r_0_38 <= r_1_60)))
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 28 bytes per marking, with 24 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 ResAllocation-PT-R100C002-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 41 markings, 40 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= r_1_55) AND (p_0_97 <= r_1_77) AND ((1 <= p_0_84) OR (3 <= r_1_74)) AND ((1 <= r_0_27) OR (p_0_50 <= r_1_19) OR (p_1_72 <= r_1_13)))))
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 28 bytes per marking, with 24 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 6 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-10.sara.
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


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 773 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_1_19 <= 2) OR ((p_1_62 <= r_0_80) AND (3 <= r_0_29)) OR (1 <= p_1_90))))
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 28 bytes per marking, with 24 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 ResAllocation-PT-R100C002-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1030 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p_0_32)))
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 28 bytes per marking, with 24 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 ResAllocation-PT-R100C002-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 33 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1546 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= r_1_26) AND (3 <= p_1_98) AND (2 <= p_1_90)) OR (p_1_2 <= r_0_26))))
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 28 bytes per marking, with 24 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
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-13.sara.
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 515652 markings, 1455528 edges, 103130 markings/sec, 0 secs
lola: sara is running 5 secs || 1071879 markings, 3071351 edges, 111245 markings/sec, 5 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 15 will run for 3082 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((r_1_72 <= 0) AND (p_0_94 <= 2) AND ((r_1_72 <= r_0_98) OR (2 <= r_1_75) OR (p_0_18 <= r_1_55) OR (p_0_98 <= p_0_34)))))
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 28 bytes per marking, with 24 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no no unknown yes no no yes yes no yes
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-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="ResAllocation-PT-R100C002"
export BK_EXAMINATION="ReachabilityCardinality"
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/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 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 ResAllocation-PT-R100C002, 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 r138-qhx2-152673581000418"
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 ;