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 192K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.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 20K 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 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is GPPP-PT-C0100N0000100000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-blw7-152650001400334
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527069271181


BK_STOP 1527069893947

--------------------
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 GPPP-PT-C0100N0000100000 as instance name.
Using GPPP 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': False, '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': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 1078924, 'Memory': 15952.92, 'Tool': 'lola'}, {'Time': 1103104, 'Memory': 15950.2, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola GPPP-PT-C0100N0000100000...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000100000: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ GPPP-PT-C0100N0000100000 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0100N0000100000-ReachabilityCardinality.task
lola: A (G (((S7P <= GSH) OR (1 <= NADPH) OR (F6P + 1 <= b1) OR (Lac <= b1) OR (1 <= NADPplus) OR (3 <= start) OR (G6P <= _3PG)))) : A (G (((NADPplus + 1 <= E4P) OR ((2 <= NADPH) AND (3 <= PEP)) OR (1 <= NADH) OR (Lac <= b2)))) : E (F ((3 <= S7P))) : A (G (((F6P <= b1) OR ((F6P <= a1) AND (R5P <= _2PG)) OR (c1 <= G6P)))) : E (F ((((b1 <= NADPplus) OR (Xu5P <= b2) OR ((3 <= S7P) AND (3 <= _1_3_BPG))) AND (NADplus + 1 <= Lac)))) : E (F (((S7P <= a1) AND (1 <= PEP) AND (1 <= Lac) AND (2 <= R5P)))) : A (G ((_1_3_BPG <= NADplus))) : E (F (((_3PG + 1 <= Pyr) AND (ATP <= 0) AND ((GSH + 1 <= GSSG) OR (Ru5P + 1 <= S7P))))) : A (G (((a1 <= ADP) OR (3 <= GAP) OR (GSH <= 0) OR (1 <= NADplus) OR (start <= 0)))) : E (F (((GSH <= 2) AND (Gluc <= 0) AND (1 <= a2)))) : E (F (((G6P <= 0) AND (Lac + 1 <= start) AND (GSSG <= 2) AND (F6P <= 0)))) : A (G ((start + 1 <= GSSG))) : A (G (((3 <= Xu5P) OR ((1 <= a1) AND (GSH <= a1)) OR (_2PG <= NADplus)))) : A (G (((NADPH + 1 <= a2) OR (Ru5P <= 1) OR (2 <= ATP) OR (1 <= Pyr) OR ((2 <= c2) AND (FBP <= _3PG))))) : A (G ((2 <= NADPplus))) : E (F ((1 <= Lac)))
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 (((S7P <= GSH) OR (1 <= NADPH) OR (F6P + 1 <= b1) OR (Lac <= b1) OR (1 <= NADPplus) OR (3 <= start) OR (G6P <= _3PG))))
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 84 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 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NADPplus + 1 <= E4P) OR ((2 <= NADPH) AND (3 <= PEP)) OR (1 <= NADH) OR (Lac <= b2))))
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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= S7P)))
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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-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: A (G (((F6P <= b1) OR ((F6P <= a1) AND (R5P <= _2PG)) OR (c1 <= G6P))))
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 84 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 GPPP-PT-C0100N0000100000-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 607 markings, 606 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((b1 <= NADPplus) OR (Xu5P <= b2) OR ((3 <= S7P) AND (3 <= _1_3_BPG))) AND (NADplus + 1 <= Lac))))
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 84 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3659624 markings, 9756649 edges, 731925 markings/sec, 0 secs
lola: sara is running 5 secs || 7341539 markings, 20023706 edges, 736383 markings/sec, 5 secs
lola: sara is running 10 secs || 11071455 markings, 29280592 edges, 745983 markings/sec, 10 secs
lola: sara is running 15 secs || 14275283 markings, 36961971 edges, 640766 markings/sec, 15 secs
lola: sara is running 20 secs || 17074118 markings, 43677632 edges, 559767 markings/sec, 20 secs
lola: sara is running 25 secs || 19951924 markings, 50582579 edges, 575561 markings/sec, 25 secs
lola: sara is running 30 secs || 22784490 markings, 57379303 edges, 566513 markings/sec, 30 secs
lola: sara is running 35 secs || 25574888 markings, 64074662 edges, 558080 markings/sec, 35 secs
lola: sara is running 40 secs || 28339775 markings, 70708844 edges, 552977 markings/sec, 40 secs
lola: sara is running 45 secs || 30919753 markings, 76899298 edges, 515996 markings/sec, 45 secs
lola: sara is running 50 secs || 33565013 markings, 83246369 edges, 529052 markings/sec, 50 secs
lola: sara is running 55 secs || 36285082 markings, 89772773 edges, 544014 markings/sec, 55 secs
lola: sara is running 60 secs || 38989851 markings, 96262607 edges, 540954 markings/sec, 60 secs
lola: sara is running 65 secs || 41685747 markings, 102731163 edges, 539179 markings/sec, 65 secs
lola: sara is running 70 secs || 44366395 markings, 109163063 edges, 536130 markings/sec, 70 secs
lola: sara is running 75 secs || 47032094 markings, 115559260 edges, 533140 markings/sec, 75 secs
lola: sara is running 80 secs || 49680117 markings, 121912796 edges, 529605 markings/sec, 80 secs
lola: sara is running 85 secs || 52334282 markings, 128281705 edges, 530833 markings/sec, 85 secs
lola: sara is running 90 secs || 55003536 markings, 134685762 edges, 533851 markings/sec, 90 secs
lola: sara is running 95 secs || 57670467 markings, 141084596 edges, 533386 markings/sec, 95 secs
lola: sara is running 100 secs || 60319130 markings, 147439868 edges, 529733 markings/sec, 100 secs
lola: sara is running 105 secs || 62960050 markings, 153776215 edges, 528184 markings/sec, 105 secs
lola: sara is running 110 secs || 65591122 markings, 160089286 edges, 526214 markings/sec, 110 secs
lola: sara is running 115 secs || 68270927 markings, 166519132 edges, 535961 markings/sec, 115 secs
lola: sara is running 120 secs || 70925608 markings, 172888532 edges, 530936 markings/sec, 120 secs
lola: sara is running 125 secs || 73560893 markings, 179211430 edges, 527057 markings/sec, 125 secs
lola: sara is running 130 secs || 76248409 markings, 185659657 edges, 537503 markings/sec, 130 secs
lola: sara is running 135 secs || 78901517 markings, 192025425 edges, 530622 markings/sec, 135 secs
lola: sara is running 140 secs || 81607740 markings, 198518455 edges, 541245 markings/sec, 140 secs
lola: sara is running 145 secs || 84188652 markings, 204711247 edges, 516182 markings/sec, 145 secs
lola: sara is running 150 secs || 86865973 markings, 211134551 edges, 535464 markings/sec, 150 secs
lola: sara is running 155 secs || 89557503 markings, 217592368 edges, 538306 markings/sec, 155 secs
lola: sara is running 160 secs || 92243752 markings, 224037563 edges, 537250 markings/sec, 160 secs
lola: sara is running 165 secs || 94931970 markings, 230487274 edges, 537644 markings/sec, 165 secs
lola: sara is running 170 secs || 97635040 markings, 236972839 edges, 540614 markings/sec, 170 secs
lola: sara is running 175 secs || 100384825 markings, 243570365 edges, 549957 markings/sec, 175 secs
lola: sara is running 180 secs || 103119059 markings, 250130630 edges, 546847 markings/sec, 180 secs
lola: sara is running 185 secs || 105884244 markings, 256765063 edges, 553037 markings/sec, 185 secs
lola: sara is running 190 secs || 108687746 markings, 263491105 edges, 560700 markings/sec, 190 secs
lola: sara is running 195 secs || 111510008 markings, 270262449 edges, 564452 markings/sec, 195 secs
lola: sara is running 200 secs || 114401338 markings, 277200019 edges, 578266 markings/sec, 200 secs
lola: sara is running 205 secs || 117345395 markings, 284264085 edges, 588811 markings/sec, 205 secs
lola: sara is running 210 secs || 120430086 markings, 291732751 edges, 616938 markings/sec, 210 secs
lola: sara is running 215 secs || 122956880 markings, 297807832 edges, 505359 markings/sec, 215 secs
lola: sara is running 220 secs || 125584670 markings, 304186182 edges, 525558 markings/sec, 220 secs
lola: sara is running 225 secs || 128286431 markings, 310743783 edges, 540352 markings/sec, 225 secs
lola: sara is running 230 secs || 131041948 markings, 317431167 edges, 551103 markings/sec, 230 secs
lola: sara is running 235 secs || 133726724 markings, 323887519 edges, 536955 markings/sec, 235 secs
lola: sara is running 240 secs || 136485756 markings, 330580492 edges, 551806 markings/sec, 240 secs
lola: sara is running 245 secs || 139255959 markings, 337302351 edges, 554041 markings/sec, 245 secs
lola: sara is running 250 secs || 142025919 markings, 344024333 edges, 553992 markings/sec, 250 secs
lola: sara is running 255 secs || 144789328 markings, 350731020 edges, 552682 markings/sec, 255 secs
lola: sara is running 260 secs || 147391296 markings, 356986531 edges, 520394 markings/sec, 260 secs
lola: sara is running 265 secs || 150132699 markings, 363638572 edges, 548281 markings/sec, 265 secs
lola: sara is running 270 secs || 152855066 markings, 370246022 edges, 544473 markings/sec, 270 secs
lola: sara is running 275 secs || 155554281 markings, 376798447 edges, 539843 markings/sec, 275 secs
lola: sara is running 280 secs || 158128815 markings, 382989263 edges, 514907 markings/sec, 280 secs
lola: sara is running 285 secs || 160836367 markings, 389559235 edges, 541510 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((S7P <= a1) AND (1 <= PEP) AND (1 <= Lac) AND (2 <= R5P))))
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 84 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-5.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 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((_1_3_BPG <= NADplus)))
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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3823106 markings, 10213231 edges, 764621 markings/sec, 0 secs
lola: sara is running 5 secs || 7416164 markings, 20231852 edges, 718612 markings/sec, 5 secs
lola: sara is running 10 secs || 11176925 markings, 29533095 edges, 752152 markings/sec, 10 secs
lola: sara is running 15 secs || 14395061 markings, 37249457 edges, 643627 markings/sec, 15 secs
lola: sara is running 20 secs || 17369778 markings, 44386904 edges, 594943 markings/sec, 20 secs
lola: sara is running 25 secs || 20279948 markings, 51369843 edges, 582034 markings/sec, 25 secs
lola: sara is running 30 secs || 23150550 markings, 58257599 edges, 574120 markings/sec, 30 secs
lola: sara is running 35 secs || 25975602 markings, 65036002 edges, 565010 markings/sec, 35 secs
lola: sara is running 40 secs || 28799084 markings, 71810924 edges, 564696 markings/sec, 40 secs
lola: sara is running 45 secs || 31580678 markings, 78485105 edges, 556319 markings/sec, 45 secs
lola: sara is running 50 secs || 34323590 markings, 85066532 edges, 548582 markings/sec, 50 secs
lola: sara is running 55 secs || 37018886 markings, 91533673 edges, 539059 markings/sec, 55 secs
lola: sara is running 60 secs || 39727325 markings, 98032313 edges, 541688 markings/sec, 60 secs
lola: sara is running 65 secs || 42437108 markings, 104534151 edges, 541957 markings/sec, 65 secs
lola: sara is running 70 secs || 45111622 markings, 110951365 edges, 534903 markings/sec, 70 secs
lola: sara is running 75 secs || 47788741 markings, 117374672 edges, 535424 markings/sec, 75 secs
lola: sara is running 80 secs || 50300242 markings, 123400742 edges, 502300 markings/sec, 80 secs
lola: sara is running 85 secs || 52973509 markings, 129814847 edges, 534653 markings/sec, 85 secs
lola: sara is running 90 secs || 55627714 markings, 136183418 edges, 530841 markings/sec, 90 secs
lola: sara is running 95 secs || 58272632 markings, 142529547 edges, 528984 markings/sec, 95 secs
lola: sara is running 100 secs || 60776035 markings, 148535943 edges, 500681 markings/sec, 100 secs
lola: sara is running 105 secs || 63261599 markings, 154499858 edges, 497113 markings/sec, 105 secs
lola: sara is running 110 secs || 65791225 markings, 160569394 edges, 505925 markings/sec, 110 secs
lola: sara is running 115 secs || 68481208 markings, 167023605 edges, 537997 markings/sec, 115 secs
lola: sara is running 120 secs || 71127477 markings, 173372894 edges, 529254 markings/sec, 120 secs
lola: sara is running 125 secs || 73718830 markings, 179590459 edges, 518271 markings/sec, 125 secs
lola: sara is running 130 secs || 76412141 markings, 186052510 edges, 538662 markings/sec, 130 secs
lola: sara is running 135 secs || 78834438 markings, 191864370 edges, 484459 markings/sec, 135 secs
lola: sara is running 140 secs || 81528736 markings, 198329009 edges, 538860 markings/sec, 140 secs
lola: sara is running 145 secs || 84156314 markings, 204633730 edges, 525516 markings/sec, 145 secs
lola: sara is running 150 secs || 86849758 markings, 211095786 edges, 538689 markings/sec, 150 secs
lola: sara is running 155 secs || 89537155 markings, 217543637 edges, 537479 markings/sec, 155 secs
lola: sara is running 160 secs || 92230719 markings, 224006193 edges, 538713 markings/sec, 160 secs
lola: sara is running 165 secs || 94936196 markings, 230497438 edges, 541095 markings/sec, 165 secs
lola: sara is running 170 secs || 97654853 markings, 237020256 edges, 543731 markings/sec, 170 secs
lola: sara is running 175 secs || 100431351 markings, 243681964 edges, 555300 markings/sec, 175 secs
lola: sara is running 180 secs || 103190581 markings, 250302290 edges, 551846 markings/sec, 180 secs
lola: sara is running 185 secs || 105974283 markings, 256981003 edges, 556740 markings/sec, 185 secs
lola: sara is running 190 secs || 108784979 markings, 263724486 edges, 562139 markings/sec, 190 secs
lola: sara is running 195 secs || 111479820 markings, 270190226 edges, 538968 markings/sec, 195 secs
lola: sara is running 200 secs || 114254880 markings, 276848878 edges, 555012 markings/sec, 200 secs
lola: sara is running 205 secs || 117082398 markings, 283633019 edges, 565504 markings/sec, 205 secs
lola: sara is running 210 secs || 120205327 markings, 291192667 edges, 624586 markings/sec, 210 secs
lola: sara is running 215 secs || 122747416 markings, 297303707 edges, 508418 markings/sec, 215 secs
lola: sara is running 220 secs || 125397793 markings, 303736846 edges, 530075 markings/sec, 220 secs
lola: sara is running 225 secs || 128104647 markings, 310306871 edges, 541371 markings/sec, 225 secs
lola: sara is running 230 secs || 130767480 markings, 316771632 edges, 532567 markings/sec, 230 secs
lola: sara is running 235 secs || 133448834 markings, 323218119 edges, 536271 markings/sec, 235 secs
lola: sara is running 240 secs || 136269490 markings, 330060382 edges, 564131 markings/sec, 240 secs
lola: sara is running 245 secs || 139035070 markings, 336771356 edges, 553116 markings/sec, 245 secs
lola: sara is running 250 secs || 141755152 markings, 343373600 edges, 544016 markings/sec, 250 secs
lola: sara is running 255 secs || 144463116 markings, 349894404 edges, 541593 markings/sec, 255 secs
lola: sara is running 260 secs || 147156406 markings, 356421299 edges, 538658 markings/sec, 260 secs
lola: sara is running 265 secs || 149924084 markings, 363136960 edges, 553536 markings/sec, 265 secs
lola: sara is running 270 secs || 152679882 markings, 369824964 edges, 551160 markings/sec, 270 secs
lola: sara is running 275 secs || 155397738 markings, 376422255 edges, 543571 markings/sec, 275 secs
lola: sara is running 280 secs || 158013872 markings, 382712406 edges, 523227 markings/sec, 280 secs
lola: sara is running 285 secs || 160765529 markings, 389388891 edges, 550331 markings/sec, 285 secs
lola: sara is running 290 secs || 163511966 markings, 396054208 edges, 549287 markings/sec, 290 secs
lola: sara is running 295 secs || 166218846 markings, 402625148 edges, 541376 markings/sec, 295 secs
lola: sara is running 300 secs || 168751042 markings, 408715137 edges, 506439 markings/sec, 300 secs
lola: sara is running 305 secs || 171409165 markings, 415165711 edges, 531625 markings/sec, 305 secs
lola: sara is running 310 secs || 174176730 markings, 421881823 edges, 553513 markings/sec, 310 secs
lola: sara is running 315 secs || 177012992 markings, 428763766 edges, 567252 markings/sec, 315 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: '\ufffd'
Aborted (core dumped)
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-15 CANNOT_COMPUTE 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="GPPP-PT-C0100N0000100000"
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/GPPP-PT-C0100N0000100000.tgz
mv GPPP-PT-C0100N0000100000 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 GPPP-PT-C0100N0000100000, 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 r090-blw7-152650001400334"
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 ;