fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r031-ebro-152646309700518
Last Updated
June 26, 2018

About the Execution of Irma.struct for CircadianClock-PT-100000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.590 491023.00 430684.00 2160.50 FTFFTTTT?FFTTTTF 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 184K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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:49 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is CircadianClock-PT-100000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309700518
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526842674704


BK_STOP 1526843165727

--------------------
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 CircadianClock-PT-100000 as instance name.
Using CircadianClock 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': 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': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': None, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 320569, 'Memory': 15919.64, 'Tool': 'lola'}, {'Time': 334839, 'Memory': 15940.89, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityFireability lola CircadianClock-PT-100000...

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


checking for too many tokens
===========================================================================================
CircadianClock-PT-100000: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ CircadianClock-PT-100000 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 30/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26 transition conflict sets
lola: TASK
lola: reading formula from CircadianClock-PT-100000-ReachabilityFireability.task
lola: E (F (())) : A (G ((NOT FIREABLE(transl_r) OR NOT FIREABLE(deg_a) OR (NOT FIREABLE(transc_da_a) AND NOT FIREABLE(deg_r)) OR FIREABLE(deg_mr) OR FIREABLE(deactive)))) : E (F ((FIREABLE(bind_r) AND FIREABLE(transc_dr) AND NOT FIREABLE(deg_a)))) : E (F (())) : A (G ((NOT FIREABLE(bind_r) OR FIREABLE(deg_a)))) : A (G ((NOT FIREABLE(transl_a) OR NOT FIREABLE(transc_da) OR FIREABLE(deg_ma)))) : E (F ((FIREABLE(rel_r) AND NOT FIREABLE(transc_da) AND NOT FIREABLE(transc_da) AND NOT FIREABLE(transc_dr_a) AND NOT FIREABLE(bind_a) AND NOT FIREABLE(transc_dr)))) : A (G (((FIREABLE(deg_r) AND FIREABLE(rel_r)) OR FIREABLE(deg_c) OR NOT FIREABLE(transl_r) OR NOT FIREABLE(rel_r) OR FIREABLE(deg_mr)))) : A (G (((FIREABLE(transc_da_a) AND FIREABLE(transl_r)) OR NOT FIREABLE(bind_r) OR FIREABLE(transc_da) OR FIREABLE(deg_ma) OR (FIREABLE(transc_dr) AND FIREABLE(transc_da_a)) OR FIREABLE(transc_dr)))) : A (G ((FIREABLE(rel_a) OR FIREABLE(transc_da)))) : E (F (())) : A (G ((FIREABLE(rel_r) OR FIREABLE(transc_dr_a) OR FIREABLE(transc_da_a) OR FIREABLE(transl_r) OR FIREABLE(transc_dr_a) OR FIREABLE(deg_ma) OR FIREABLE(transc_da) OR FIREABLE(bind_r) OR (FIREABLE(transc_dr) AND FIREABLE(transl_a))))) : A (G ((NOT FIREABLE(deg_c) OR NOT FIREABLE(transc_da) OR NOT FIREABLE(rel_a) OR FIREABLE(transc_dr_a)))) : E (F ((NOT FIREABLE(transc_dr) AND NOT FIREABLE(deactive) AND FIREABLE(transc_da_a) AND NOT FIREABLE(transc_dr_a)))) : E (F (((FIREABLE(rel_a) AND ((FIREABLE(transc_dr) AND FIREABLE(rel_r)) OR (FIREABLE(rel_r) AND FIREABLE(transc_da)))) OR (NOT FIREABLE(transc_da_a) AND (FIREABLE(rel_a) OR FIREABLE(rel_r)) AND NOT FIREABLE(deg_a))))) : E (F (((FIREABLE(bind_a) OR FIREABLE(transc_da)) AND FIREABLE(transc_da) AND FIREABLE(transl_a) AND FIREABLE(rel_r) AND (FIREABLE(transl_r) OR FIREABLE(deg_r)) AND (((FIREABLE(rel_a) OR FIREABLE(bind_r)) AND (FIREABLE(bind_a) OR FIREABLE(deg_mr))) OR NOT FIREABLE(deg_ma)))))
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 (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(transl_r) OR NOT FIREABLE(deg_a) OR (NOT FIREABLE(transc_da_a) AND NOT FIREABLE(deg_r)) OR FIREABLE(deg_mr) OR FIREABLE(deactive))))
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 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(bind_r) AND FIREABLE(transc_dr) AND NOT FIREABLE(deg_a))))
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 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: ========================================
lola: state equation: State predicate is contradiction.
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 (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(bind_r) OR FIREABLE(deg_a))))
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 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(transl_a) OR NOT FIREABLE(transc_da) OR FIREABLE(deg_ma))))
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 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(rel_r) AND NOT FIREABLE(transc_da) AND NOT FIREABLE(transc_da) AND NOT FIREABLE(transc_dr_a) AND NOT FIREABLE(bind_a) AND NOT FIREABLE(transc_dr))))
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 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: ========================================
lola: state equation: Generated DNF with 112 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 300005 markings, 400005 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(deg_r) AND FIREABLE(rel_r)) OR FIREABLE(deg_c) OR NOT FIREABLE(transl_r) OR NOT FIREABLE(rel_r) OR FIREABLE(deg_mr))))
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 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(transc_da_a) AND FIREABLE(transl_r)) OR NOT FIREABLE(bind_r) OR FIREABLE(transc_da) OR FIREABLE(deg_ma) OR (FIREABLE(transc_dr) AND FIREABLE(transc_da_a)) OR FIREABLE(transc_dr))))
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 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 168 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-8.sara.
lola: sara is running 0 secs || 2127899 markings, 3373822 edges, 425580 markings/sec, 0 secs
lola: sara is running 5 secs || 3811913 markings, 6228591 edges, 336803 markings/sec, 5 secs
lola: sara is running 10 secs || 5472916 markings, 9082976 edges, 332201 markings/sec, 10 secs
lola: sara is running 15 secs || 7046477 markings, 11731349 edges, 314712 markings/sec, 15 secs
lola: sara is running 20 secs || 8745350 markings, 14579394 edges, 339775 markings/sec, 20 secs
lola: sara is running 25 secs || 10426689 markings, 17461946 edges, 336268 markings/sec, 25 secs
lola: sara is running 30 secs || 12125944 markings, 20370462 edges, 339851 markings/sec, 30 secs
lola: sara is running 35 secs || 13797746 markings, 23171150 edges, 334360 markings/sec, 35 secs
lola: sara is running 40 secs || 15480232 markings, 26004216 edges, 336497 markings/sec, 40 secs
lola: sara is running 45 secs || 17122907 markings, 28828664 edges, 328535 markings/sec, 45 secs
lola: sara is running 50 secs || 18762442 markings, 31609461 edges, 327907 markings/sec, 50 secs
lola: sara is running 55 secs || 20487758 markings, 34503822 edges, 345063 markings/sec, 55 secs
lola: sara is running 60 secs || 22151498 markings, 37330171 edges, 332748 markings/sec, 60 secs
lola: sara is running 65 secs || 23764965 markings, 40106857 edges, 322693 markings/sec, 65 secs
lola: sara is running 70 secs || 25402995 markings, 42855627 edges, 327606 markings/sec, 70 secs
lola: sara is running 75 secs || 27029893 markings, 45585945 edges, 325380 markings/sec, 75 secs
lola: sara is running 80 secs || 28625037 markings, 48332669 edges, 319029 markings/sec, 80 secs
lola: sara is running 85 secs || 30256079 markings, 51098692 edges, 326208 markings/sec, 85 secs
lola: sara is running 90 secs || 31884398 markings, 53823349 edges, 325664 markings/sec, 90 secs
lola: sara is running 95 secs || 33492146 markings, 56570040 edges, 321550 markings/sec, 95 secs
lola: sara is running 100 secs || 35016435 markings, 59179516 edges, 304858 markings/sec, 100 secs
lola: sara is running 105 secs || 36606760 markings, 61837698 edges, 318065 markings/sec, 105 secs
lola: sara is running 110 secs || 38220908 markings, 64581067 edges, 322830 markings/sec, 110 secs
lola: sara is running 115 secs || 39834135 markings, 67357437 edges, 322645 markings/sec, 115 secs
lola: sara is running 120 secs || 41437259 markings, 70041320 edges, 320625 markings/sec, 120 secs
lola: sara is running 125 secs || 43080877 markings, 72806840 edges, 328724 markings/sec, 125 secs
lola: sara is running 130 secs || 44646886 markings, 75505967 edges, 313202 markings/sec, 130 secs
lola: sara is running 135 secs || 46201104 markings, 78128328 edges, 310844 markings/sec, 135 secs
lola: sara is running 140 secs || 47861769 markings, 80909642 edges, 332133 markings/sec, 140 secs
lola: sara is running 145 secs || 49458255 markings, 83652277 edges, 319297 markings/sec, 145 secs
lola: sara is running 150 secs || 51041126 markings, 86348674 edges, 316574 markings/sec, 150 secs
lola: sara is running 155 secs || 52636476 markings, 89015704 edges, 319070 markings/sec, 155 secs
lola: sara is running 160 secs || 54222081 markings, 91720834 edges, 317121 markings/sec, 160 secs
lola: sara is running 165 secs || 55757541 markings, 94352743 edges, 307092 markings/sec, 165 secs
lola: sara is running 170 secs || 57440483 markings, 97173074 edges, 336588 markings/sec, 170 secs
lola: sara is running 175 secs || 59090074 markings, 99959888 edges, 329918 markings/sec, 175 secs
lola: sara is running 180 secs || 60705455 markings, 102739881 edges, 323076 markings/sec, 180 secs
lola: sara is running 185 secs || 62323609 markings, 105468931 edges, 323631 markings/sec, 185 secs
lola: sara is running 190 secs || 63949086 markings, 108188721 edges, 325095 markings/sec, 190 secs
lola: sara is running 195 secs || 65537188 markings, 110919665 edges, 317620 markings/sec, 195 secs
lola: sara is running 200 secs || 67156833 markings, 113677492 edges, 323929 markings/sec, 200 secs
lola: sara is running 205 secs || 68779369 markings, 116392149 edges, 324507 markings/sec, 205 secs
lola: sara is running 210 secs || 70387399 markings, 119129731 edges, 321606 markings/sec, 210 secs
lola: sara is running 215 secs || 71956805 markings, 121827891 edges, 313881 markings/sec, 215 secs
lola: sara is running 220 secs || 73539754 markings, 124473288 edges, 316590 markings/sec, 220 secs
lola: sara is running 225 secs || 75207245 markings, 127290152 edges, 333498 markings/sec, 225 secs
lola: sara is running 230 secs || 76912791 markings, 130217762 edges, 341109 markings/sec, 230 secs
lola: sara is running 235 secs || 78588670 markings, 133059386 edges, 335176 markings/sec, 235 secs
lola: sara is running 240 secs || 80280357 markings, 135895098 edges, 338337 markings/sec, 240 secs
lola: sara is running 245 secs || 81939610 markings, 138716931 edges, 331851 markings/sec, 245 secs
lola: sara is running 250 secs || 83551434 markings, 141491210 edges, 322365 markings/sec, 250 secs
lola: sara is running 255 secs || 85229641 markings, 144306888 edges, 335641 markings/sec, 255 secs
lola: sara is running 260 secs || 86889999 markings, 147091076 edges, 332072 markings/sec, 260 secs
lola: sara is running 265 secs || 88502398 markings, 149866317 edges, 322480 markings/sec, 265 secs
lola: sara is running 270 secs || 90116263 markings, 152609050 edges, 322773 markings/sec, 270 secs
lola: sara is running 275 secs || 91738166 markings, 155322677 edges, 324381 markings/sec, 275 secs
lola: sara is running 280 secs || 93372940 markings, 158109867 edges, 326955 markings/sec, 280 secs
lola: sara is running 285 secs || 95029591 markings, 160957553 edges, 331330 markings/sec, 285 secs
lola: sara is running 290 secs || 96670872 markings, 163705534 edges, 328256 markings/sec, 290 secs
lola: sara is running 295 secs || 98323201 markings, 166483910 edges, 330466 markings/sec, 295 secs
lola: sara is running 300 secs || 99924994 markings, 169241851 edges, 320359 markings/sec, 300 secs
lola: sara is running 305 secs || 101513385 markings, 171930582 edges, 317678 markings/sec, 305 secs
lola: sara is running 310 secs || 103165328 markings, 174696818 edges, 330389 markings/sec, 310 secs
lola: sara is running 315 secs || 104783182 markings, 177465294 edges, 323571 markings/sec, 315 secs
lola: sara is running 320 secs || 106363435 markings, 180168852 edges, 316051 markings/sec, 320 secs
lola: sara is running 325 secs || 107975238 markings, 182864859 edges, 322361 markings/sec, 325 secs
lola: sara is running 330 secs || 109554427 markings, 185546511 edges, 315838 markings/sec, 330 secs
lola: sara is running 335 secs || 111078919 markings, 188171662 edges, 304898 markings/sec, 335 secs
lola: sara is running 340 secs || 112741224 markings, 190956063 edges, 332461 markings/sec, 340 secs
lola: sara is running 345 secs || 114398028 markings, 193746171 edges, 331361 markings/sec, 345 secs
lola: sara is running 350 secs || 116012009 markings, 196524130 edges, 322796 markings/sec, 350 secs
lola: sara is running 355 secs || 117614247 markings, 199234613 edges, 320448 markings/sec, 355 secs
lola: sara is running 360 secs || 119212296 markings, 201906589 edges, 319610 markings/sec, 360 secs
lola: sara is running 365 secs || 120793499 markings, 204622217 edges, 316241 markings/sec, 365 secs
lola: sara is running 370 secs || 122401907 markings, 207363807 edges, 321682 markings/sec, 370 secs
lola: sara is running 375 secs || 124007798 markings, 210049523 edges, 321178 markings/sec, 375 secs
lola: sara is running 380 secs || 125554979 markings, 212687608 edges, 309436 markings/sec, 380 secs
lola: sara is running 385 secs || 127105398 markings, 215345737 edges, 310084 markings/sec, 385 secs
lola: sara is running 390 secs || 128665900 markings, 217952039 edges, 312100 markings/sec, 390 secs
lola: sara is running 395 secs || 130215029 markings, 220587064 edges, 309826 markings/sec, 395 secs
lola: sara is running 400 secs || 131272515 markings, 222389043 edges, 211497 markings/sec, 400 secs
lola: sara is running 405 secs || 131280685 markings, 222403340 edges, 1634 markings/sec, 405 secs
lola: sara is running 410 secs || 131288134 markings, 222416379 edges, 1490 markings/sec, 410 secs
lola: sara is running 415 secs || 131288148 markings, 222416402 edges, 3 markings/sec, 415 secs
lola: sara is running 420 secs || 131288160 markings, 222416423 edges, 2 markings/sec, 420 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 ((FIREABLE(rel_a) OR FIREABLE(transc_da))))
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 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 4 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100001 markings, 100000 edges
lola: ========================================
lola: subprocess 10 will run for 515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(rel_r) OR FIREABLE(transc_dr_a) OR FIREABLE(transc_da_a) OR FIREABLE(transl_r) OR FIREABLE(transc_dr_a) OR FIREABLE(deg_ma) OR FIREABLE(transc_da) OR FIREABLE(bind_r) OR (FIREABLE(transc_dr) AND FIREABLE(transl_a)))))
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 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 4608 literals and 512 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-11.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 773 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(deg_c) OR NOT FIREABLE(transc_da) OR NOT FIREABLE(rel_a) OR FIREABLE(transc_dr_a))))
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 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 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-12.sara.

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 1031 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(transc_dr) AND NOT FIREABLE(deactive) AND FIREABLE(transc_da_a) AND NOT FIREABLE(transc_dr_a))))
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 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 60 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100004 markings, 100003 edges
lola: ========================================
lola: subprocess 14 will run for 1547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(rel_a) AND ((FIREABLE(transc_dr) AND FIREABLE(rel_r)) OR (FIREABLE(rel_r) AND FIREABLE(transc_da)))) OR (NOT FIREABLE(transc_da_a) AND (FIREABLE(rel_a) OR FIREABLE(rel_r)) AND NOT FIREABLE(deg_a)))))
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 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 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 8 edges
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-14.sara
lola: ========================================
lola: subprocess 15 will run for 3094 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(bind_a) OR FIREABLE(transc_da)) AND FIREABLE(transc_da) AND FIREABLE(transl_a) AND FIREABLE(rel_r) AND (FIREABLE(transl_r) OR FIREABLE(deg_r)) AND (((FIREABLE(rel_a) OR FIREABLE(bind_r)) AND (FIREABLE(bind_a) OR FIREABLE(deg_mr))) OR NOT FIREABLE(deg_ma)))))
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 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 208 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-ReachabilityFireability-15.sara.

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 yes no no yes yes yes yes unknown no no yes yes yes yes no
FORMULA CircadianClock-PT-100000-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="CircadianClock-PT-100000"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-100000.tgz
mv CircadianClock-PT-100000 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is CircadianClock-PT-100000, 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 r031-ebro-152646309700518"
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 ;