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 1.5M
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 15K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K 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.4M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is Railroad-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-qhx2-152673580700194
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527152252626


BK_STOP 1527152645226

--------------------
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 Railroad-PT-050 as instance name.
Using Railroad 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': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': None, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 18611, 'Memory': 257.27, 'Tool': 'lola'}, {'Time': 19017, 'Memory': 248.21, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola Railroad-PT-050...

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


checking for too many tokens
===========================================================================================
Railroad-PT-050: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ Railroad-PT-050 @ 3538 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- 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: 3274/65536 symbol table entries, 223 collisions
lola: preprocessing...
lola: finding significant places
lola: 518 places, 2756 transitions, 207 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 312 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-050-ReachabilityCardinality.task
lola: A (G (((pl_P261_38 <= pl_P261_47) AND (pl_P112_28 <= pl_P72_1)))) : E (F (((pl_P168_10 + 1 <= pl_P16_34) AND (pl_P112_51 + 1 <= pl_P16_29) AND (1 <= pl_P116_1)))) : E (F (((pl_P233_3 <= 0) AND (1 <= pl_P261_31) AND ((pl_P16_44 + 1 <= pl_P34_1) OR (pl_P124_1 + 1 <= pl_P154_1))))) : E (F ((2 <= pl_P233_48))) : E (F ((((3 <= pl_P120_1) OR (pl_P182_1 <= 1)) AND ((pl_P233_39 + 1 <= pl_P261_19) OR ((pl_P261_44 <= pl_P168_35) AND (3 <= pl_P233_38)))))) : E (F (((pl_P112_1 + 1 <= pl_P16_19) AND (pl_P16_36 + 1 <= pl_P16_15)))) : A (G ((((pl_P261_4 <= pl_P152_1) AND (pl_P261_32 <= pl_P140_1)) OR (pl_P168_31 <= pl_P201_1) OR (((3 <= pl_P234_1) OR (pl_P168_2 <= pl_P155_1)) AND ((3 <= pl_P75_1) OR (pl_P23_1 <= pl_P230_1)))))) : E (F ((3 <= pl_P112_40))) : A (G ((pl_P168_38 <= pl_P233_19))) : E (F ((((2 <= pl_P16_37) OR (2 <= pl_P42_1)) AND (pl_P233_39 <= 1) AND (pl_P112_17 <= pl_P261_14)))) : E (F ((((pl_P162_1 <= 2) OR (pl_P112_14 <= 2)) AND (2 <= pl_P261_38)))) : E (F (((1 <= pl_P112_29) AND (pl_P261_41 <= pl_P178_1) AND (pl_P80_1 <= pl_P16_4) AND (3 <= pl_P112_7)))) : E (F (((pl_P65_1 <= 0) AND (3 <= pl_P112_48)))) : E (F (((1 <= pl_P261_12) AND (pl_P195_1 <= pl_P256_1) AND (3 <= pl_P233_42) AND (3 <= pl_P112_19) AND ((2 <= pl_P112_40) OR (pl_P76_1 <= pl_P26_1) OR (2 <= pl_P112_9))))) : E (F (((pl_P220_1 <= pl_P16_8) AND (2 <= pl_P261_17) AND (pl_P168_3 + 1 <= pl_P168_44) AND (pl_P79_1 <= pl_P133_1)))) : A (G ((pl_P158_1 <= 2)))
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 (((pl_P261_38 <= pl_P261_47) AND (pl_P112_28 <= pl_P72_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 828 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 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to Railroad-PT-050-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P168_10 + 1 <= pl_P16_34) AND (pl_P112_51 + 1 <= pl_P16_29) AND (1 <= pl_P116_1))))
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 828 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-050-ReachabilityCardinality.sara
----- Kill lola and sara stderr -----
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P233_3 <= 0) AND (1 <= pl_P261_31) AND ((pl_P16_44 + 1 <= pl_P34_1) OR (pl_P124_1 + 1 <= pl_P154_1)))))
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 828 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-050-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-050-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: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pl_P233_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 828 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: ========================================
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 Railroad-PT-050-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-050-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 14001 markings, 24329 edges, 2800 markings/sec, 0 secs

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 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= pl_P120_1) OR (pl_P182_1 <= 1)) AND ((pl_P233_39 + 1 <= pl_P261_19) OR ((pl_P261_44 <= pl_P168_35) AND (3 <= pl_P233_38))))))
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 828 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 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-050-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-050-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 12258 markings, 19689 edges, 2452 markings/sec, 0 secs
lola: sara is running 5 secs || 29921 markings, 50165 edges, 3533 markings/sec, 5 secs

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 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P112_1 + 1 <= pl_P16_19) AND (pl_P16_36 + 1 <= pl_P16_15))))
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 828 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-050-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-050-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 98 markings, 97 edges
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pl_P261_4 <= pl_P152_1) AND (pl_P261_32 <= pl_P140_1)) OR (pl_P168_31 <= pl_P201_1) OR (((3 <= pl_P234_1) OR (pl_P168_2 <= pl_P155_1)) AND ((3 <= pl_P75_1) OR (pl_P23_1 <= pl_P230_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 828 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-050-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-050-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 13430 markings, 16048 edges, 2686 markings/sec, 0 secs
lola: sara is running 5 secs || 31310 markings, 37756 edges, 3576 markings/sec, 5 secs
lola: sara is running 10 secs || 48990 markings, 59353 edges, 3536 markings/sec, 10 secs
lola: sara is running 15 secs || 67051 markings, 81887 edges, 3612 markings/sec, 15 secs
lola: sara is running 20 secs || 85637 markings, 104747 edges, 3717 markings/sec, 20 secs
lola: sara is running 25 secs || 104610 markings, 127948 edges, 3795 markings/sec, 25 secs
lola: sara is running 30 secs || 123130 markings, 151230 edges, 3704 markings/sec, 30 secs
lola: sara is running 35 secs || 141099 markings, 172910 edges, 3594 markings/sec, 35 secs
lola: sara is running 40 secs || 159216 markings, 195065 edges, 3623 markings/sec, 40 secs
lola: sara is running 45 secs || 177684 markings, 218050 edges, 3694 markings/sec, 45 secs
lola: sara is running 50 secs || 195947 markings, 241217 edges, 3653 markings/sec, 50 secs
lola: sara is running 55 secs || 214253 markings, 264280 edges, 3661 markings/sec, 55 secs
lola: sara is running 60 secs || 232406 markings, 287245 edges, 3631 markings/sec, 60 secs
lola: sara is running 65 secs || 251234 markings, 310956 edges, 3766 markings/sec, 65 secs
lola: sara is running 70 secs || 270447 markings, 334259 edges, 3843 markings/sec, 70 secs
lola: sara is running 75 secs || 289595 markings, 357752 edges, 3830 markings/sec, 75 secs
lola: sara is running 80 secs || 309020 markings, 381549 edges, 3885 markings/sec, 80 secs
lola: sara is running 85 secs || 328195 markings, 405383 edges, 3835 markings/sec, 85 secs
lola: sara is running 90 secs || 347229 markings, 428790 edges, 3807 markings/sec, 90 secs
lola: sara is running 95 secs || 365915 markings, 451688 edges, 3737 markings/sec, 95 secs
lola: sara is running 100 secs || 383924 markings, 474480 edges, 3602 markings/sec, 100 secs
lola: sara is running 105 secs || 401633 markings, 496807 edges, 3542 markings/sec, 105 secs
lola: sara is running 110 secs || 419846 markings, 520177 edges, 3643 markings/sec, 110 secs
lola: sara is running 115 secs || 438217 markings, 543169 edges, 3674 markings/sec, 115 secs
lola: sara is running 120 secs || 456634 markings, 565319 edges, 3683 markings/sec, 120 secs
lola: sara is running 125 secs || 474720 markings, 588249 edges, 3617 markings/sec, 125 secs
lola: sara is running 130 secs || 492439 markings, 610437 edges, 3544 markings/sec, 130 secs
lola: sara is running 135 secs || 510623 markings, 632734 edges, 3637 markings/sec, 135 secs
lola: sara is running 140 secs || 528501 markings, 655683 edges, 3576 markings/sec, 140 secs
lola: sara is running 145 secs || 546737 markings, 678319 edges, 3647 markings/sec, 145 secs
lola: sara is running 150 secs || 565866 markings, 701534 edges, 3826 markings/sec, 150 secs
lola: sara is running 155 secs || 585209 markings, 726028 edges, 3869 markings/sec, 155 secs
lola: sara is running 160 secs || 604613 markings, 749817 edges, 3881 markings/sec, 160 secs
lola: sara is running 165 secs || 624105 markings, 774536 edges, 3898 markings/sec, 165 secs
lola: sara is running 170 secs || 643406 markings, 798802 edges, 3860 markings/sec, 170 secs
lola: sara is running 175 secs || 662706 markings, 822534 edges, 3860 markings/sec, 175 secs
lola: sara is running 180 secs || 682041 markings, 845977 edges, 3867 markings/sec, 180 secs
lola: sara is running 185 secs || 701413 markings, 869669 edges, 3874 markings/sec, 185 secs
lola: sara is running 190 secs || 720913 markings, 893628 edges, 3900 markings/sec, 190 secs
lola: sara is running 195 secs || 740262 markings, 917931 edges, 3870 markings/sec, 195 secs
lola: sara is running 200 secs || 759467 markings, 941371 edges, 3841 markings/sec, 200 secs
lola: sara is running 205 secs || 778977 markings, 965727 edges, 3902 markings/sec, 205 secs
lola: sara is running 210 secs || 798157 markings, 989816 edges, 3836 markings/sec, 210 secs
lola: sara is running 215 secs || 817393 markings, 1013988 edges, 3847 markings/sec, 215 secs
lola: sara is running 220 secs || 836794 markings, 1038510 edges, 3880 markings/sec, 220 secs
lola: sara is running 225 secs || 855899 markings, 1063269 edges, 3821 markings/sec, 225 secs
lola: sara is running 230 secs || 875358 markings, 1088024 edges, 3892 markings/sec, 230 secs
lola: sara is running 235 secs || 894558 markings, 1112070 edges, 3840 markings/sec, 235 secs
lola: sara is running 240 secs || 912914 markings, 1134471 edges, 3671 markings/sec, 240 secs
lola: sara is running 245 secs || 932318 markings, 1158305 edges, 3881 markings/sec, 245 secs
lola: sara is running 250 secs || 951654 markings, 1182130 edges, 3867 markings/sec, 250 secs
lola: sara is running 255 secs || 970953 markings, 1206125 edges, 3860 markings/sec, 255 secs
lola: sara is running 260 secs || 990156 markings, 1229502 edges, 3841 markings/sec, 260 secs
lola: sara is running 265 secs || 1008914 markings, 1252584 edges, 3752 markings/sec, 265 secs
lola: sara is running 270 secs || 1027954 markings, 1276553 edges, 3808 markings/sec, 270 secs
lola: sara is running 275 secs || 1046992 markings, 1300866 edges, 3808 markings/sec, 275 secs
lola: sara is running 280 secs || 1066111 markings, 1324884 edges, 3824 markings/sec, 280 secs
lola: sara is running 285 secs || 1085325 markings, 1348872 edges, 3843 markings/sec, 285 secs
lola: sara is running 290 secs || 1103926 markings, 1371780 edges, 3720 markings/sec, 290 secs
lola: sara is running 295 secs || 1123152 markings, 1396265 edges, 3845 markings/sec, 295 secs
lola: sara is running 300 secs || 1142453 markings, 1420859 edges, 3860 markings/sec, 300 secs
lola: sara is running 305 secs || 1161723 markings, 1445947 edges, 3854 markings/sec, 305 secs
lola: sara is running 310 secs || 1180795 markings, 1470067 edges, 3814 markings/sec, 310 secs
lola: sara is running 315 secs || 1199567 markings, 1494090 edges, 3754 markings/sec, 315 secs
lola: sara is running 320 secs || 1217319 markings, 1516952 edges, 3550 markings/sec, 320 secs
lola: sara is running 325 secs || 1235970 markings, 1540197 edges, 3730 markings/sec, 325 secs
lola: sara is running 330 secs || 1254521 markings, 1563028 edges, 3710 markings/sec, 330 secs
lola: sara is running 335 secs || 1273188 markings, 1585705 edges, 3733 markings/sec, 335 secs
lola: sara is running 340 secs || 1291545 markings, 1608384 edges, 3671 markings/sec, 340 secs
lola: sara is running 345 secs || 1310354 markings, 1631557 edges, 3762 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ''
Aborted (core dumped)
FORMULA Railroad-PT-050-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-ReachabilityCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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="Railroad-PT-050"
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/Railroad-PT-050.tgz
mv Railroad-PT-050 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 Railroad-PT-050, 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-152673580700194"
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 ;