fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r095-blw7-152650007300313
Last Updated
June 26, 2018

About the Execution of M4M.struct for GPPP-PT-C0100N0000000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.370 363796.00 688826.00 12809.40 ???????????????? 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 180K
-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 2.9K 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 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 mcc4mcc-structural
Input is GPPP-PT-C0100N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-blw7-152650007300313
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527613987701


BK_STOP 1527614351497

--------------------
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 GPPP-PT-C0100N0000000100 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': 361329, 'Memory': 15952.84, 'Tool': 'lola'}, {'Time': 365457, 'Memory': 15952.63, 'Tool': 'lola'}, {'Time': 683540, 'Memory': 15934.82, 'Tool': 'marcie'}, {'Time': 808885, 'Memory': 15951.02, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola GPPP-PT-C0100N0000000100...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000000100: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ GPPP-PT-C0100N0000000100 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
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-C0100N0000000100-ReachabilityCardinality.task
lola: E (F (((((1 <= E4P) AND (2 <= G6P)) OR (ADP <= 0)) AND ((2 <= NADH) OR (Pi + 1 <= R5P))))) : E (F (((((FBP <= Ru5P) AND (3 <= start)) OR ((G6P <= R5P) AND (b2 <= NADplus))) AND (c1 <= ATP)))) : A (G (((Xu5P + 1 <= GSSG) OR (GSH <= 1) OR ((DHAP + 1 <= Lac) AND (ADP <= 2))))) : E (F ((((2 <= _3PG) AND (2 <= c2)) OR ((1 <= Pi) AND (2 <= R5P) AND (3 <= F6P) AND (1 <= b1))))) : E (F ((3 <= _1_3_BPG))) : A (G (((_2PG <= 1) OR (GSH <= 2) OR ((ADP <= 2) AND (NADPH <= 2))))) : E (F (((ATP + 1 <= FBP) AND (ADP <= 0) AND (c1 + 1 <= R5P)))) : E (F ((((ADP <= Xu5P) OR (2 <= GSH)) AND (b1 + 1 <= _3PG) AND ((b2 + 1 <= NADPplus) OR (b1 <= 2))))) : E (F (((_2PG <= 0) AND (start + 1 <= FBP) AND (NADplus + 1 <= _2PG)))) : E (F ((1 <= _2PG))) : A (G ((_1_3_BPG <= 1))) : A (G ((3 <= NADPplus))) : A (G ((Xu5P <= ADP))) : E (F (((GSSG <= 0) AND (a2 + 1 <= GSH) AND ((FBP <= 0) OR (NADPH + 1 <= Gluc))))) : A (G ((((1 <= _3PG) AND (ATP <= NADPplus)) OR (Lac <= ADP) OR (a2 <= Pi)))) : E (F ((((R5P + 1 <= start) AND (NADplus <= 1)) OR (2 <= Pyr))))
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 (((((1 <= E4P) AND (2 <= G6P)) OR (ADP <= 0)) AND ((2 <= NADH) OR (Pi + 1 <= 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 10 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FBP <= Ru5P) AND (3 <= start)) OR ((G6P <= R5P) AND (b2 <= NADplus))) AND (c1 <= ATP))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 208 markings, 207 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Xu5P + 1 <= GSSG) OR (GSH <= 1) OR ((DHAP + 1 <= Lac) AND (ADP <= 2)))))
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-C0100N0000000100-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 173 markings, 172 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= _3PG) AND (2 <= c2)) OR ((1 <= Pi) AND (2 <= R5P) AND (3 <= F6P) AND (1 <= b1)))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 314 markings, 313 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= _1_3_BPG)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((_2PG <= 1) OR (GSH <= 2) OR ((ADP <= 2) AND (NADPH <= 2)))))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-5.sara
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ATP + 1 <= FBP) AND (ADP <= 0) AND (c1 + 1 <= 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-6.sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityCardinality-5.sara.
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 3648947 markings, 10072210 edges, 729789 markings/sec, 0 secs
lola: sara is running 5 secs || 6980111 markings, 19022041 edges, 666233 markings/sec, 5 secs
lola: sara is running 10 secs || 10100239 markings, 27313535 edges, 624026 markings/sec, 10 secs
lola: sara is running 15 secs || 13348288 markings, 35984051 edges, 649610 markings/sec, 15 secs
lola: sara is running 20 secs || 16655568 markings, 44787714 edges, 661456 markings/sec, 20 secs
lola: sara is running 25 secs || 20022353 markings, 53777920 edges, 673357 markings/sec, 25 secs
lola: sara is running 30 secs || 23406339 markings, 62795986 edges, 676797 markings/sec, 30 secs
lola: sara is running 35 secs || 26040877 markings, 69829800 edges, 526908 markings/sec, 35 secs
lola: sara is running 40 secs || 28889354 markings, 77445075 edges, 569695 markings/sec, 40 secs
lola: sara is running 45 secs || 31661984 markings, 84865269 edges, 554526 markings/sec, 45 secs
lola: sara is running 50 secs || 34469838 markings, 92348003 edges, 561571 markings/sec, 50 secs
lola: sara is running 55 secs || 36944399 markings, 98955667 edges, 494912 markings/sec, 55 secs
lola: sara is running 60 secs || 39641810 markings, 106169055 edges, 539482 markings/sec, 60 secs
lola: sara is running 65 secs || 42274788 markings, 113183408 edges, 526596 markings/sec, 65 secs
lola: sara is running 70 secs || 44880189 markings, 120189153 edges, 521080 markings/sec, 70 secs
lola: sara is running 75 secs || 47660619 markings, 127628427 edges, 556086 markings/sec, 75 secs
lola: sara is running 80 secs || 50485451 markings, 135145342 edges, 564966 markings/sec, 80 secs
lola: sara is running 85 secs || 53322262 markings, 142717287 edges, 567362 markings/sec, 85 secs
lola: sara is running 90 secs || 56087766 markings, 150092769 edges, 553101 markings/sec, 90 secs
lola: sara is running 95 secs || 58898067 markings, 157633923 edges, 562060 markings/sec, 95 secs
lola: sara is running 100 secs || 61727629 markings, 165168187 edges, 565912 markings/sec, 100 secs
lola: sara is running 105 secs || 64587206 markings, 172789700 edges, 571915 markings/sec, 105 secs
lola: sara is running 110 secs || 67404433 markings, 180327045 edges, 563445 markings/sec, 110 secs
lola: sara is running 115 secs || 70261652 markings, 187946401 edges, 571444 markings/sec, 115 secs
lola: sara is running 120 secs || 73108210 markings, 195543736 edges, 569312 markings/sec, 120 secs
lola: sara is running 125 secs || 75956787 markings, 203135164 edges, 569715 markings/sec, 125 secs
lola: sara is running 130 secs || 78808381 markings, 210777508 edges, 570319 markings/sec, 130 secs
lola: sara is running 135 secs || 81654206 markings, 218362168 edges, 569165 markings/sec, 135 secs
lola: sara is running 140 secs || 84446803 markings, 225828505 edges, 558519 markings/sec, 140 secs
lola: sara is running 145 secs || 87292648 markings, 233426218 edges, 569169 markings/sec, 145 secs
lola: sara is running 150 secs || 90160070 markings, 241064949 edges, 573484 markings/sec, 150 secs
lola: sara is running 155 secs || 93030236 markings, 248719674 edges, 574033 markings/sec, 155 secs
lola: sara is running 160 secs || 95877152 markings, 256344467 edges, 569383 markings/sec, 160 secs
lola: sara is running 165 secs || 98735582 markings, 263969088 edges, 571686 markings/sec, 165 secs
lola: sara is running 170 secs || 101600818 markings, 271587651 edges, 573047 markings/sec, 170 secs
lola: sara is running 175 secs || 104481530 markings, 279287289 edges, 576142 markings/sec, 175 secs
lola: sara is running 180 secs || 107384328 markings, 287038418 edges, 580560 markings/sec, 180 secs
lola: sara is running 185 secs || 110276750 markings, 294735232 edges, 578484 markings/sec, 185 secs
lola: sara is running 190 secs || 113166976 markings, 302469516 edges, 578045 markings/sec, 190 secs
lola: sara is running 195 secs || 116091810 markings, 310251135 edges, 584967 markings/sec, 195 secs
lola: sara is running 200 secs || 119007021 markings, 318048108 edges, 583042 markings/sec, 200 secs
lola: sara is running 205 secs || 121989033 markings, 325972558 edges, 596402 markings/sec, 205 secs
lola: sara is running 210 secs || 124974235 markings, 333947151 edges, 597040 markings/sec, 210 secs
lola: sara is running 215 secs || 127976544 markings, 341957117 edges, 600462 markings/sec, 215 secs
lola: sara is running 220 secs || 130981899 markings, 349963516 edges, 601071 markings/sec, 220 secs
lola: sara is running 225 secs || 133991210 markings, 357980044 edges, 601862 markings/sec, 225 secs
lola: sara is running 230 secs || 137023575 markings, 366044904 edges, 606473 markings/sec, 230 secs
lola: sara is running 235 secs || 140052821 markings, 374127995 edges, 605849 markings/sec, 235 secs
lola: sara is running 240 secs || 143095444 markings, 382212410 edges, 608525 markings/sec, 240 secs
lola: sara is running 245 secs || 146139389 markings, 390316950 edges, 608789 markings/sec, 245 secs
lola: sara is running 250 secs || 149200989 markings, 398470133 edges, 612320 markings/sec, 250 secs
lola: sara is running 255 secs || 152299225 markings, 406699394 edges, 619647 markings/sec, 255 secs
lola: sara is running 260 secs || 155428617 markings, 415008384 edges, 625878 markings/sec, 260 secs
lola: sara is running 265 secs || 158687323 markings, 423652091 edges, 651741 markings/sec, 265 secs
lola: sara is running 270 secs || 162055485 markings, 432525546 edges, 673632 markings/sec, 270 secs
lola: sara is running 275 secs || 165170612 markings, 440879897 edges, 623025 markings/sec, 275 secs
lola: sara is running 280 secs || 168375095 markings, 449482255 edges, 640897 markings/sec, 280 secs
lola: sara is running 285 secs || 171498145 markings, 457858467 edges, 624610 markings/sec, 285 secs
lola: sara is running 290 secs || 174818335 markings, 466771381 edges, 664038 markings/sec, 290 secs
lola: sara is running 295 secs || 178203145 markings, 475858011 edges, 676962 markings/sec, 295 secs
lola: sara is running 300 secs || 181024816 markings, 483424840 edges, 564334 markings/sec, 300 secs
lola: sara is running 305 secs || 184340561 markings, 492325682 edges, 663149 markings/sec, 305 secs
lola: sara is running 310 secs || 187397789 markings, 500533801 edges, 611446 markings/sec, 310 secs
lola: sara is running 315 secs || 187400330 markings, 500540221 edges, 508 markings/sec, 315 secs
lola: sara is running 320 secs || 187425396 markings, 500607864 edges, 5013 markings/sec, 320 secs
lola: sara is running 325 secs || 187425411 markings, 500607908 edges, 3 markings/sec, 325 secs
lola: sara is running 330 secs || 187425420 markings, 500607935 edges, 2 markings/sec, 330 secs
lola: sara is running 335 secs || 187438517 markings, 500642323 edges, 2619 markings/sec, 335 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 GPPP-PT-C0100N0000000100-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-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-C0100N0000000100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-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/GPPP-PT-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is GPPP-PT-C0100N0000000100, 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 r095-blw7-152650007300313"
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 ;