About the Execution of M4M.struct for GPPP-PT-C1000N0000000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15900.940 | 447388.00 | 455648.00 | 749.80 | ???????????????? | 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 188K
-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.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K 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 7.8K May 26 09:26 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.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-C1000N0000000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-blw7-152732553000097
=====================================================================
--------------------
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-C1000N0000000010-LTLCardinality-00
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-01
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-02
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-03
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-04
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-05
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-06
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-07
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-08
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-09
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1528025103871
BK_STOP 1528025551259
--------------------
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-C1000N0000000010 as instance name.
Using GPPP as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 16889, 'Memory': 1671.35, 'Tool': 'lola'}, {'Time': 17587, 'Memory': 738.11, 'Tool': 'itstools'}, {'Time': 17854, 'Memory': 1673.1, 'Tool': 'lola'}, {'Time': 18155, 'Memory': 791.02, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola GPPP-PT-C1000N0000000010...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
GPPP-PT-C1000N0000000010: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
GPPP-PT-C1000N0000000010: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ GPPP-PT-C1000N0000000010 @ 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-C1000N0000000010-LTLCardinality.task
lola: A ((ATP <= R5P)) : A ((S7P <= PEP)) : A (G (G (F (X ((3 <= Xu5P)))))) : A (F (G (X (G ((1 <= b1)))))) : A (G (G (F (F ((3 <= GSSG)))))) : A (F (F (F ((a1 <= R5P))))) : A (X (G (F (F ((1 <= ATP)))))) : A (G (F (((a2 <= b2) U (GAP <= NADPH))))) : A (F (G ((2 <= _1_3_BPG)))) : A (X (F (G (X ((3 <= GSSG)))))) : A ((a1 <= NADH)) : A (G (X (G (X ((G6P <= ADP)))))) : A (G (F (((2 <= Pyr) U (1 <= GSSG))))) : A (F ((G ((_3PG <= GSSG)) U X ((Gluc <= NADPplus))))) : A (G (G (X (F ((Pi <= GSH)))))) : A (G ((Pyr <= ADP)))
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 ((ATP <= R5P))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ATP <= R5P)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: processed formula with 1 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 ((S7P <= PEP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (S7P <= PEP)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (X ((3 <= Xu5P))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F (X ((3 <= Xu5P))))))
lola: processed formula: A (G (G (F (X ((3 <= Xu5P))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((1 <= b1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (G ((1 <= b1))))))
lola: processed formula: A (F (G (X (G ((1 <= b1))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 47 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (F ((3 <= GSSG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F ((3 <= GSSG)))))
lola: processed formula: A (G (G (F ((3 <= GSSG)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 207957 markings, 461697 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F ((a1 <= R5P)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((a1 <= R5P)))
lola: processed formula: A (F ((a1 <= R5P)))
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 236 markings, 236 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (F ((1 <= ATP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((1 <= ATP)))))
lola: processed formula: A (X (G (F ((1 <= ATP)))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 46 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((a2 <= b2) U (GAP <= NADPH)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((a2 <= b2) U (GAP <= NADPH)))))
lola: processed formula: A (G (F (((a2 <= b2) U (GAP <= NADPH)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= _1_3_BPG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((2 <= _1_3_BPG))))
lola: processed formula: A (F (G ((2 <= _1_3_BPG))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24 markings, 25 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (X ((3 <= GSSG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G (X ((3 <= GSSG))))))
lola: processed formula: A (X (F (G (X ((3 <= GSSG))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 485322 markings, 2629709 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((a1 <= NADH))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (a1 <= NADH)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: processed formula with 1 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 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((G6P <= ADP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (X ((G6P <= ADP))))))
lola: processed formula: A (G (X (G (X ((G6P <= ADP))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1551678 markings, 9041986 edges, 310336 markings/sec, 0 secs
lola: 3014052 markings, 18220849 edges, 292475 markings/sec, 5 secs
lola: 4322536 markings, 26766393 edges, 261697 markings/sec, 10 secs
lola: 5625638 markings, 35437920 edges, 260620 markings/sec, 15 secs
lola: 6872394 markings, 43865586 edges, 249351 markings/sec, 20 secs
lola: 8145410 markings, 52400541 edges, 254603 markings/sec, 25 secs
lola: 9311902 markings, 60659514 edges, 233298 markings/sec, 30 secs
lola: 10572444 markings, 69063602 edges, 252108 markings/sec, 35 secs
lola: 11704015 markings, 77232194 edges, 226314 markings/sec, 40 secs
lola: 12923896 markings, 85493185 edges, 243976 markings/sec, 45 secs
lola: 14053952 markings, 93588672 edges, 226011 markings/sec, 50 secs
lola: 15335506 markings, 102166855 edges, 256311 markings/sec, 55 secs
lola: 16478562 markings, 110494449 edges, 228611 markings/sec, 60 secs
lola: 17631838 markings, 118494379 edges, 230655 markings/sec, 65 secs
lola: 18873540 markings, 126357210 edges, 248340 markings/sec, 70 secs
lola: 20043990 markings, 134124630 edges, 234090 markings/sec, 75 secs
lola: 21412108 markings, 142921214 edges, 273624 markings/sec, 80 secs
lola: 22555530 markings, 151233654 edges, 228684 markings/sec, 85 secs
lola: 23664434 markings, 159214580 edges, 221781 markings/sec, 90 secs
lola: 24962866 markings, 167870014 edges, 259686 markings/sec, 95 secs
lola: 26008242 markings, 175334402 edges, 209075 markings/sec, 100 secs
lola: 27011409 markings, 182836211 edges, 200633 markings/sec, 105 secs
lola: 28128818 markings, 190202601 edges, 223482 markings/sec, 110 secs
lola: 29250745 markings, 198048893 edges, 224385 markings/sec, 115 secs
lola: 30281752 markings, 205549572 edges, 206201 markings/sec, 120 secs
lola: 31253234 markings, 212512218 edges, 194296 markings/sec, 125 secs
lola: 32333406 markings, 219625662 edges, 216034 markings/sec, 130 secs
lola: 33332326 markings, 226783690 edges, 199784 markings/sec, 135 secs
lola: 34288628 markings, 233875191 edges, 191260 markings/sec, 140 secs
lola: 35238309 markings, 240344353 edges, 189936 markings/sec, 145 secs
lola: 36401056 markings, 248224155 edges, 232549 markings/sec, 150 secs
lola: 37447618 markings, 255843365 edges, 209312 markings/sec, 155 secs
lola: 38405992 markings, 262844661 edges, 191675 markings/sec, 160 secs
lola: 39574284 markings, 270492350 edges, 233658 markings/sec, 165 secs
lola: 40760480 markings, 278954309 edges, 237239 markings/sec, 170 secs
lola: 41754692 markings, 286349354 edges, 198842 markings/sec, 175 secs
lola: 42853540 markings, 293676017 edges, 219770 markings/sec, 180 secs
lola: 43961722 markings, 301364735 edges, 221636 markings/sec, 185 secs
lola: 45059784 markings, 309323702 edges, 219612 markings/sec, 190 secs
lola: 46085502 markings, 316695556 edges, 205144 markings/sec, 195 secs
lola: 47215108 markings, 324153418 edges, 225921 markings/sec, 200 secs
lola: 48248395 markings, 331538484 edges, 206657 markings/sec, 205 secs
lola: 49307536 markings, 339437758 edges, 211828 markings/sec, 210 secs
lola: 50425116 markings, 346806522 edges, 223516 markings/sec, 215 secs
lola: 51538370 markings, 354584672 edges, 222651 markings/sec, 220 secs
lola: 52643951 markings, 362660255 edges, 221116 markings/sec, 225 secs
lola: 53710636 markings, 370237344 edges, 213337 markings/sec, 230 secs
lola: 55012440 markings, 378963613 edges, 260361 markings/sec, 235 secs
lola: 56183892 markings, 387454257 edges, 234290 markings/sec, 240 secs
lola: 57263834 markings, 395204040 edges, 215988 markings/sec, 245 secs
lola: 58530712 markings, 403663185 edges, 253376 markings/sec, 250 secs
lola: 59668972 markings, 411867476 edges, 227652 markings/sec, 255 secs
lola: 60725774 markings, 419579135 edges, 211360 markings/sec, 260 secs
lola: 61972128 markings, 427832608 edges, 249271 markings/sec, 265 secs
lola: 63070846 markings, 435659973 edges, 219744 markings/sec, 270 secs
lola: 64157670 markings, 443736050 edges, 217365 markings/sec, 275 secs
lola: 65320400 markings, 451405064 edges, 232546 markings/sec, 280 secs
lola: 66471716 markings, 459507105 edges, 230263 markings/sec, 285 secs
lola: 67570828 markings, 467534994 edges, 219822 markings/sec, 290 secs
lola: 68651884 markings, 475086498 edges, 216211 markings/sec, 295 secs
lola: 69876032 markings, 483360385 edges, 244830 markings/sec, 300 secs
lola: 71017030 markings, 491650258 edges, 228200 markings/sec, 305 secs
lola: 72110592 markings, 499487133 edges, 218712 markings/sec, 310 secs
lola: 73336798 markings, 507651884 edges, 245241 markings/sec, 315 secs
lola: 74431548 markings, 515492274 edges, 218950 markings/sec, 320 secs
lola: 75441170 markings, 522935399 edges, 201924 markings/sec, 325 secs
lola: 76618160 markings, 530716571 edges, 235398 markings/sec, 330 secs
lola: 77700366 markings, 538422162 edges, 216441 markings/sec, 335 secs
lola: 78787422 markings, 546372905 edges, 217411 markings/sec, 340 secs
lola: 79912738 markings, 554032911 edges, 225063 markings/sec, 345 secs
lola: 81092048 markings, 562165650 edges, 235862 markings/sec, 350 secs
lola: 82168586 markings, 569975926 edges, 215308 markings/sec, 355 secs
lola: 83214392 markings, 577464854 edges, 209161 markings/sec, 360 secs
lola: 84454446 markings, 585727365 edges, 248011 markings/sec, 365 secs
lola: 85594746 markings, 593911084 edges, 228060 markings/sec, 370 secs
lola: 86669938 markings, 601817260 edges, 215038 markings/sec, 375 secs
lola: 87879850 markings, 609777982 edges, 241982 markings/sec, 380 secs
lola: 88990656 markings, 617707406 edges, 222161 markings/sec, 385 secs
lola: 90007718 markings, 625222999 edges, 203412 markings/sec, 390 secs
lola: 91042776 markings, 632228014 edges, 207012 markings/sec, 395 secs
lola: 92257460 markings, 640580434 edges, 242937 markings/sec, 400 secs
lola: 93377422 markings, 648692416 edges, 223992 markings/sec, 405 secs
lola: 94449626 markings, 656390753 edges, 214441 markings/sec, 410 secs
lola: 95682222 markings, 664605656 edges, 246519 markings/sec, 415 secs
lola: 96799995 markings, 672642443 edges, 223555 markings/sec, 420 secs
lola: 97840230 markings, 680287507 edges, 208047 markings/sec, 425 secs
lola: 99000614 markings, 687894324 edges, 232077 markings/sec, 430 secs
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-C1000N0000000010-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-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-C1000N0000000010"
export BK_EXAMINATION="LTLCardinality"
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-C1000N0000000010.tgz
mv GPPP-PT-C1000N0000000010 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-C1000N0000000010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r251-blw7-152732553000097"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
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 ;