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.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 lola
Input is GPPP-PT-C1000N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r244-blw7-152732546700099
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527890294793

info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C1000N0000000100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C1000N0000000100 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ GPPP-PT-C1000N0000000100 @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 1056
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-C1000N0000000100-LTLCardinality.task
lola: LP says that atomic proposition is always true: (R5P <= NADplus)
lola: LP says that atomic proposition is always true: (_1_3_BPG <= NADH)
spx_run: Lost feasibility 10 times - iter 165 and 112 nodes.
spx_run: Lost feasibility 10 times - iter 54219 and 29064 nodes.
spx_run: Lost feasibility 10 times - iter 70229 and 39532 nodes.
spx_run: Lost feasibility 10 times - iter 177676 and 111314 nodes.
check_solution: Constraint R3 = 0 is above its equality of -100
check_solution: Constraint R6 = 0 is above its equality of -400
check_solution: Constraint R9 = 0 is above its equality of -2000
check_solution: Constraint R11 = 0 is above its equality of -3000
check_solution: Constraint R12 = 0 is above its equality of -200
check_solution: Constraint R13 = 0 is above its equality of -7000
check_solution: Constraint R23 = 0 is above its equality of -1
check_solution: Constraint R25 = 0 is above its equality of -200

Seriously low accuracy found ||*|| = 7000 (rel. error 1)
spx_run: Lost feasibility 10 times - iter 16616 and 8500 nodes.
spx_run: Lost feasibility 10 times - iter 18093 and 9305 nodes.
spx_run: Lost feasibility 10 times - iter 18109 and 9314 nodes.
spx_run: Lost feasibility 10 times - iter 19584 and 10039 nodes.
spx_run: Lost feasibility 10 times - iter 19600 and 10048 nodes.
spx_run: Lost feasibility 10 times - iter 21620 and 11181 nodes.
spx_run: Lost feasibility 10 times - iter 21662 and 11204 nodes.
spx_run: Lost feasibility 10 times - iter 24506 and 12765 nodes.
spx_run: Lost feasibility 10 times - iter 24522 and 12774 nodes.
spx_run: Lost feasibility 10 times - iter 26093 and 13599 nodes.
spx_run: Lost feasibility 10 times - iter 26109 and 13608 nodes.
spx_run: Lost feasibility 10 times - iter 28220 and 14789 nodes.
spx_run: Lost feasibility 10 times - iter 28236 and 14798 nodes.
spx_run: Lost feasibility 10 times - iter 29683 and 15485 nodes.
spx_run: Lost feasibility 10 times - iter 29699 and 15494 nodes.
spx_run: Lost feasibility 10 times - iter 31665 and 16571 nodes.
spx_run: Lost feasibility 10 times - iter 31681 and 16580 nodes.
spx_run: Lost feasibility 10 times - iter 33156 and 17305 nodes.
spx_run: Lost feasibility 10 times - iter 33172 and 17314 nodes.
spx_run: Lost feasibility 10 times - iter 35192 and 18447 nodes.
spx_run: Lost feasibility 10 times - iter 35234 and 18470 nodes.
spx_run: Lost feasibility 10 times - iter 38078 and 20031 nodes.
spx_run: Lost feasibility 10 times - iter 38094 and 20040 nodes.
spx_run: Lost feasibility 10 times - iter 39665 and 20865 nodes.
spx_run: Lost feasibility 10 times - iter 39681 and 20874 nodes.
spx_run: Lost feasibility 10 times - iter 41792 and 22055 nodes.
spx_run: Lost feasibility 10 times - iter 41808 and 22064 nodes.
spx_run: Lost feasibility 10 times - iter 43255 and 22751 nodes.
spx_run: Lost feasibility 10 times - iter 43271 and 22760 nodes.
spx_run: Lost feasibility 10 times - iter 45237 and 23837 nodes.
spx_run: Lost feasibility 10 times - iter 45253 and 23846 nodes.
spx_run: Lost feasibility 10 times - iter 46728 and 24571 nodes.
spx_run: Lost feasibility 10 times - iter 46744 and 24580 nodes.
spx_run: Lost feasibility 10 times - iter 48764 and 25713 nodes.
spx_run: Lost feasibility 10 times - iter 48806 and 25736 nodes.
spx_run: Lost feasibility 10 times - iter 51650 and 27297 nodes.
spx_run: Lost feasibility 10 times - iter 51666 and 27306 nodes.
spx_run: Lost feasibility 10 times - iter 53237 and 28131 nodes.
spx_run: Lost feasibility 10 times - iter 53253 and 28140 nodes.
spx_run: Lost feasibility 10 times - iter 55364 and 29321 nodes.
spx_run: Lost fealola: A (F (((2 <= _1_3_BPG) U G ((1 <= PEP))))) : A (F ((a1 <= GSSG))) : A (X ((GAP <= Xu5P))) : A ((((a2 <= DHAP) U (GSSG <= GSH)) U G (F (TRUE)))) : A (X (G (X (F (TRUE))))) : A (F (G (((_3PG <= DHAP) U (c1 <= NADPH))))) : A (X ((G ((NADH <= DHAP)) U X ((b1 <= GSSG))))) : A (X (G (G (X ((GSH <= Xu5P)))))) : A (G (X (X ((c2 <= Gluc))))) : A ((F (X ((1 <= GAP))) U (2 <= b2))) : A (G (G (X ((1 <= _2PG))))) : A (F (((PEP <= ATP) U X ((1 <= GSSG))))) : A (G ((X ((Pyr <= b1)) U F ((_3PG <= NADPplus))))) : A (F (X (F (G ((ATP <= b1)))))) : A (F ((a1 <= F6P))) : A ((2 <= G6P))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: processed formula with 0 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: ========================================
sibility 10 times - iter 55380 and 29330 nodes.
spx_run: Lost feasibility 10 times - iter 56827 and 30017 nodes.
spx_run: Lost feasibility 10 times - iter 56843 and 30026 nodes.
spx_run: Lost feasibility 10 times - iter 58809 and 31103 nodes.
spx_run: Lost feasibility 10 times - iter 58825 and 31112 nodes.
spx_run: Lost feasibility 10 times - iter 60300 and 31837 nodes.
spx_run: Lost feasibility 10 times - iter 60316 and 31846 nodes.
spx_run: Lost feasibility 10 times - iter 62336 and 32979 nodes.
spx_run: Lost feasibility 10 times - iter 62378 and 33002 nodes.
spx_run: Lost feasibility 10 times - iter 65222 and 34563 nodes.
spx_run: Lost feasibility 10 times - iter 65238 and 34572 nodes.
spx_run: Lost feasibility 10 times - iter 66809 and 35397 nodes.
spx_run: Lost feasibility 10 times - iter 66825 and 35406 nodes.
spx_run: Lost feasibility 10 times - iter 68936 and 36587 nodes.
spx_run: Lost feasibility 10 times - iter 68952 and 36596 nodes.
spx_run: Lost feasibility 10 times - iter 70399 and 37283 nodes.
spx_run: Lost feasibility 10 times - iter 70415 and 37292 nodes.
spx_run: Lost feasibility 10 times - iter 72381 and 38369 nodes.
spx_run: Lost feasibility 10 times - iter 72397 and 38378 nodes.
spx_run: Lost feasibility 10 times - iter 73872 and 39103 nodes.
spx_run: Lost feasibility 10 times - iter 73888 and 39112 nodes.
spx_run: Lost feasibility 10 times - iter 75908 and 40245 nodes.
spx_run: Lost feasibility 10 times - iter 75950 and 40268 nodes.
spx_run: Lost feasibility 10 times - iter 78794 and 41829 nodes.
spx_run: Lost feasibility 10 times - iter 78810 and 41838 nodes.
spx_run: Lost feasibility 10 times - iter 80381 and 42663 nodes.
spx_run: Lost feasibility 10 times - iter 80397 and 42672 nodes.
spx_run: Lost feasibility 10 times - iter 82508 and 43853 nodes.
spx_run: Lost feasibility 10 times - iter 82524 and 43862 nodes.
spx_run: Lost feasibility 10 times - iter 83971 and 44549 nodes.
spx_run: Lost feasibility 10 times - iter 83987 and 44558 nodes.
spx_run: Lost feasibility 10 times - iter 85953 and 45635 nodes.
spx_run: Lost feasibility 10 times - iter 85969 and 45644 nodes.
spx_run: Lost feasibility 10 times - iter 87444 and 46369 nodes.
spx_run: Lost feasibility 10 times - iter 87460 and 46378 nodes.
spx_run: Lost feasibility 10 times - iter 89480 and 47511 nodes.
spx_run: Lost feasibility 10 times - iter 89522 and 47534 nodes.
spx_run: Lost feasibility 10 times - iter 92368 and 49095 nodes.
spx_run: Lost feasibility 10 times - iter 92384 and 49104 nodes.
spx_run: Lost feasibility 10 times - iter 93957 and 49929 nodes.
spx_run: Lost feasibility 10 times - iter 93973 and 49938 nodes.
spx_run: Lost feasibility 10 times - iter 96086 and 51119 nodes.
spx_run: Lost feasibility 10 times - iter 96102 and 51128 nodes.
spx_run: Lost feasibility 10 times - iter 97548 and 51815 nodes.
spx_run: Lost feasibility 10 times - iter 97564 and 51824 nodes.
spx_run: Lost feasibility 10 times - iter 99529 and 52901 nodes.
spx_run: Lost feasibility 10 times - iter 99545 and 52910 nodes.
spx_run: Lost feasibility 10 times - iter 101009 and 53630 nodes.

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= G6P)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= G6P)
lola: processed formula length: 10
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-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: ========================================

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((b1 <= GSSG)) OR (G ((NADH <= DHAP)) AND X (F ((b1 <= GSSG)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((b1 <= GSSG)) OR (G ((NADH <= DHAP)) AND X (F ((b1 <= GSSG)))))))
lola: processed formula length: 75
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 5192 markings, 5990 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((GSH <= Xu5P)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((GSH <= Xu5P)))))
lola: processed formula length: 29
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 411 markings, 412 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((c2 <= Gluc)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((c2 <= Gluc)))))
lola: processed formula length: 28
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 4388 markings, 5185 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((1 <= GAP))) U (2 <= b2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((1 <= GAP))) U (2 <= b2)))
lola: processed formula length: 36
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3656382 markings, 6892939 edges, 731276 markings/sec, 0 secs
lola: 6987998 markings, 13328163 edges, 666323 markings/sec, 5 secs
lola: 10138251 markings, 19435610 edges, 630051 markings/sec, 10 secs
lola: 13156916 markings, 25316895 edges, 603733 markings/sec, 15 secs
lola: 16108002 markings, 31067284 edges, 590217 markings/sec, 20 secs
lola: 18979592 markings, 36678997 edges, 574318 markings/sec, 25 secs
lola: 21762152 markings, 42119940 edges, 556512 markings/sec, 30 secs
lola: 24546829 markings, 47579012 edges, 556935 markings/sec, 35 secs
lola: 27242935 markings, 52869049 edges, 539221 markings/sec, 40 secs
lola: 29905158 markings, 58091119 edges, 532445 markings/sec, 45 secs
lola: 32472049 markings, 63124665 edges, 513378 markings/sec, 50 secs
lola: 35119676 markings, 68317311 edges, 529525 markings/sec, 55 secs
lola: 37732932 markings, 73442168 edges, 522651 markings/sec, 60 secs
lola: 40221518 markings, 78347496 edges, 497717 markings/sec, 65 secs
lola: 42856584 markings, 83516234 edges, 527013 markings/sec, 70 secs
lola: 45366530 markings, 88443306 edges, 501989 markings/sec, 75 secs
lola: 47944887 markings, 93519039 edges, 515671 markings/sec, 80 secs
lola: 50401662 markings, 98363745 edges, 491355 markings/sec, 85 secs
lola: 52968521 markings, 103398210 edges, 513372 markings/sec, 90 secs
lola: 55462695 markings, 108312053 edges, 498835 markings/sec, 95 secs
lola: 57909315 markings, 113137032 edges, 489324 markings/sec, 100 secs
lola: 60338276 markings, 117926514 edges, 485792 markings/sec, 105 secs
lola: 62797936 markings, 122757225 edges, 491932 markings/sec, 110 secs
lola: 65320363 markings, 127721538 edges, 504485 markings/sec, 115 secs
lola: 67784058 markings, 132577096 edges, 492739 markings/sec, 120 secs
lola: 70203137 markings, 137345692 edges, 483816 markings/sec, 125 secs
lola: 72602170 markings, 142076121 edges, 479807 markings/sec, 130 secs
lola: 75003066 markings, 146809538 edges, 480179 markings/sec, 135 secs
lola: 77394924 markings, 151525975 edges, 478372 markings/sec, 140 secs
lola: 79776172 markings, 156220895 edges, 476250 markings/sec, 145 secs
lola: 82134796 markings, 160872020 edges, 471725 markings/sec, 150 secs
lola: 84464599 markings, 165468482 edges, 465961 markings/sec, 155 secs
lola: 86760029 markings, 170023319 edges, 459086 markings/sec, 160 secs
lola: 89130888 markings, 174694846 edges, 474172 markings/sec, 165 secs
lola: 91495637 markings, 179357277 edges, 472950 markings/sec, 170 secs
lola: 93855813 markings, 184009046 edges, 472035 markings/sec, 175 secs
lola: 96204557 markings, 188639311 edges, 469749 markings/sec, 180 secs
lola: 98483220 markings, 193133009 edges, 455733 markings/sec, 185 secs
lola: 100665824 markings, 197468195 edges, 436521 markings/sec, 190 secs
lola: 103017881 markings, 202103908 edges, 470411 markings/sec, 195 secs
lola: 105345432 markings, 206691233 edges, 465510 markings/sec, 200 secs
lola: 107622740 markings, 211182596 edges, 455462 markings/sec, 205 secs
lola: 109769175 markings, 215447291 edges, 429287 markings/sec, 210 secs
lola: 112118059 markings, 220077670 edges, 469777 markings/sec, 215 secs
lola: 114251456 markings, 224280774 edges, 426679 markings/sec, 220 secs
lola: 114580009 markings, 224933849 edges, 65711 markings/sec, 225 secs
lola: 114585573 markings, 224945143 edges, 1113 markings/sec, 230 secs
lola: 114591626 markings, 224956850 edges, 1211 markings/sec, 235 secs
lola: 114595571 markings, 224964153 edges, 789 markings/sec, 240 secs
lola: 114597471 markings, 224968276 edges, 380 markings/sec, 245 secs
lola: 114603471 markings, 224980577 edges, 1200 markings/sec, 250 secs
lola: 114631002 markings, 225034413 edges, 5506 markings/sec, 255 secs
lola: 114634895 markings, 225042787 edges, 779 markings/sec, 260 secs
lola: 114640095 markings, 225053523 edges, 1040 markings/sec, 265 secs
lola: 114653283 markings, 225079134 edges, 2638 markings/sec, 270 secs
lola: 114671421 markings, 225115632 edges, 3628 markings/sec, 275 secs
lola: 114676088 markings, 225124769 edges, 933 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((1 <= _2PG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((1 <= _2PG))))
lola: processed formula length: 23
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 405 markings, 405 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= GSSG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= GSSG))))
lola: processed formula length: 23
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((GAP <= Xu5P)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((GAP <= Xu5P)))
lola: processed formula length: 21
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola:
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((a1 <= F6P)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (F6P + 1 <= a1)
lola: processed formula length: 15
lola: 32 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2396 markings, 2396 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((a1 <= GSSG)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (GSSG + 1 <= a1)
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2396 markings, 2396 edges
lola:
========================================
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= PEP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= PEP))))
lola: processed formula length: 22
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 9
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:
========================================FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 13 will run for 1032 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((_3PG <= NADPplus))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((_3PG <= NADPplus))))
lola: processed formula length: 30
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3279651 markings, 5843631 edges, 655930 markings/sec, 0 secs
lola: 6415088 markings, 11455182 edges, 627087 markings/sec, 5 secs
lola: 9465664 markings, 16918966 edges, 610115 markings/sec, 10 secs
lola: 12461557 markings, 22287136 edges, 599179 markings/sec, 15 secs
lola: 15426580 markings, 27600770 edges, 593005 markings/sec, 20 secs
lola: 18354121 markings, 32846980 edges, 585508 markings/sec, 25 secs
lola: 21245298 markings, 38029623 edges, 578235 markings/sec, 30 secs
lola: 24130166 markings, 43201065 edges, 576974 markings/sec, 35 secs
lola: 26988281 markings, 48325098 edges, 571623 markings/sec, 40 secs
lola: 29842197 markings, 53441957 edges, 570783 markings/sec, 45 secs
lola: 32681510 markings, 58533173 edges, 567863 markings/sec, 50 secs
lola: 35527302 markings, 63636010 edges, 569158 markings/sec, 55 secs
lola: 38343805 markings, 68686649 edges, 563301 markings/sec, 60 secs
lola: 41149002 markings, 73716656 edges, 561039 markings/sec, 65 secs
lola: 43957053 markings, 78751746 edges, 561610 markings/sec, 70 secs
lola: 46739123 markings, 83741078 edges, 556414 markings/sec, 75 secs
lola: 49512907 markings, 88715736 edges, 554757 markings/sec, 80 secs
lola: 52287780 markings, 93692244 edges, 554975 markings/sec, 85 secs
lola: 55058051 markings, 98660801 edges, 554054 markings/sec, 90 secs
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: 56016398 markings, 100380615 edges

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((ATP <= b1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((ATP <= b1))))
lola: processed formula length: 23
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 7
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: 1360915 markings, 1806451 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2999 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((c1 <= NADPH)) AND ((_3PG <= DHAP) OR (c1 <= NADPH))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((c1 <= NADPH)) AND ((_3PG <= DHAP) OR (c1 <= NADPH))))))
lola: processed formula length: 69
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 407 markings, 408 edges
lola:
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: ========================================
lola: ...considering subproblem: A ((X (F ((1 <= GAP))) U (2 <= b2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((1 <= GAP))) U (2 <= b2)))
lola: processed formula length: 36
lola: 30 rewrites
lola: closed formula file GPPP-PT-C1000N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3624684 markings, 6831283 edges, 724937 markings/sec, 0 secs
lola: 6857419 markings, 13071072 edges, 646547 markings/sec, 5 secs
lola: 9844256 markings, 18873629 edges, 597367 markings/sec, 10 secs
lola: 12765472 markings, 24546673 edges, 584243 markings/sec, 15 secs
lola: 15573644 markings, 30031703 edges, 561634 markings/sec, 20 secs
lola: 18336435 markings, 35428494 edges, 552558 markings/sec, 25 secs
lola: 21069441 markings, 40768332 edges, 546601 markings/sec, 30 secs
lola: 23711585 markings, 45950783 edges, 528429 markings/sec, 35 secs
lola: 26396206 markings, 51194905 edges, 536924 markings/sec, 40 secs
lola: 29025813 markings, 56350045 edges, 525921 markings/sec, 45 secs
lola: 31612225 markings, 61422908 edges, 517282 markings/sec, 50 secs
lola: 34119016 markings, 66362304 edges, 501358 markings/sec, 55 secs
lola: 36715227 markings, 71452851 edges, 519242 markings/sec, 60 secs
lola: 39272188 markings, 76465830 edges, 511392 markings/sec, 65 secs
lola: 41634791 markings, 81122252 edges, 472521 markings/sec, 70 secs
lola: 44182296 markings, 86116073 edges, 509501 markings/sec, 75 secs
lola: 46596301 markings, 90875033 edges, 482801 markings/sec, 80 secs
lola: 49080548 markings, 95747254 edges, 496849 markings/sec, 85 secs
lola: 51540622 markings, 100592644 edges, 492015 markings/sec, 90 secs
lola: 53947182 markings, 105336989 edges, 481312 markings/sec, 95 secs
lola: 56336384 markings, 110048039 edges, 477840 markings/sec, 100 secs
lola: 58816300 markings, 114910025 edges, 495983 markings/sec, 105 secs
lola: 61249091 markings, 119703026 edges, 486558 markings/sec, 110 secs
lola: 63650657 markings, 124436295 edges, 480313 markings/sec, 115 secs
lola: 66040775 markings, 129148155 edges, 478024 markings/sec, 120 secs
lola: 68410103 markings, 133819207 edges, 473866 markings/sec, 125 secs
lola: 70762962 markings, 138456829 edges, 470572 markings/sec, 130 secs
lola: 73112283 markings, 143088390 edges, 469864 markings/sec, 135 secs
lola: 75460008 markings, 147715882 edges, 469545 markings/sec, 140 secs
lola: 77807643 markings, 152344214 edges, 469527 markings/sec, 145 secs
lola: 80151953 markings, 156965255 edges, 468862 markings/sec, 150 secs
lola: 82483410 markings, 161561918 edges, 466291 markings/sec, 155 secs
lola: 84795859 markings, 166121920 edges, 462490 markings/sec, 160 secs
lola: 87057645 markings, 170583840 edges, 452357 markings/sec, 165 secs
lola: 89291074 markings, 175014024 edges, 446686 markings/sec, 170 secs
lola: 91620052 markings, 179604413 edges, 465796 markings/sec, 175 secs
lola: 93934457 markings, 184165322 edges, 462881 markings/sec, 180 secs
lola: 96237931 markings, 188705732 edges, 460695 markings/sec, 185 secs
lola: 98484516 markings, 193136149 edges, 449317 markings/sec, 190 secs
lola: 100623185 markings, 197383225 edges, 427734 markings/sec, 195 secs
lola: 102926618 markings, 201922186 edges, 460687 markings/sec, 200 secs
lola: 105203413 markings, 206408642 edges, 455359 markings/sec, 205 secs
lola: 107425075 markings, 210791402 edges, 444332 markings/sec, 210 secs
lola: 109564622 markings, 215040508 edges, 427909 markings/sec, 215 secs
lola: 111858416 markings, 219560401 edges, 458759 markings/sec, 220 secs
lola: 114066875 markings, 223915383 edges, 441692 markings/sec, 225 secs
lola: 114597830 markings, 224968634 edges, 106191 markings/sec, 230 secs
lola: 114611727 markings, 224996730 edges, 2779 markings/sec, 235 secs
lola: 114617885 markings, 225008723 edges, 1232 markings/sec, 240 secs
lola: 114622134 markings, 225017207 edges, 850 markings/sec, 245 secs
lola: 114625370 markings, 225023111 edges, 647 markings/sec, 250 secs
lola: 114651732 markings, 225075385 edges, 5272 markings/sec, 255 secs
lola: 114661152 markings, 225095130 edges, 1884 markings/sec, 260 secs
lola: 114666734 markings, 225105493 edges, 1116 markings/sec, 265 secs
lola: 114681219 markings, 225134322 edges, 2897 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes no no no no unknown no yes no no no no
lola:
preliminary result: no no yes yes yes no no no no unknown no yes no no no no
lola: memory consumption: 17464 KB
lola: time consumption: 849 seconds

BK_STOP 1527891143932

--------------------
content from 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-C1000N0000000100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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-C1000N0000000100.tgz
mv GPPP-PT-C1000N0000000100 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 lola"
echo " Input is GPPP-PT-C1000N0000000100, 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 r244-blw7-152732546700099"
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 '' LTLCardinality.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 ;