Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2019-input.r132-oct2-155403939300137.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is RERS17pb114-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-oct2-155403939300137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 4.6K Feb 13 08:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 13 08:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 13 08:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 13 08:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 103 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 341 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 13 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 13 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 13 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K Feb 13 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 13 08:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 13 08:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Feb 13 08:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 13 08:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 13 08:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 13 08:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Feb 13 08:05 equiv_col
-rw-r--r-- 1 mcc users 2 Feb 13 08:05 instance
-rw-r--r-- 1 mcc users 6 Feb 13 08:05 iscolored
-rw-r--r-- 1 mcc users 73M Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1554081036368

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb114-PT-2 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb114-PT-2 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ RERS17pb114-PT-2 @ 3568 seconds
lola: LoLA will run for 3568 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 152531/65536 symbol table entries, 94907 collisions
lola: preprocessing...
lola: Size of bit vector: 46272
lola: finding significant places
lola: 1446 places, 151085 transitions, 1411 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 210714 transition conflict sets
lola: TASK
lola: reading formula from RERS17pb114-PT-2-LTLCardinality.task
lola: A ((((1 <= p198) U (1 <= p56)) U (2 <= p195))) : A ((2 <= p748)) : A (X (F (((p527 <= p1430) U (p1318 <= p644))))) : A (G (X (((3 <= p476) U (2 <= p1076))))) : A (G (X ((p73 <= p696)))) : A (F (X (((p197 <= p1087) U (2 <= p407))))) : A (G ((2 <= p1168))) : A (F ((X ((p1287 <= p818)) U F ((p1350 <= p91))))) : A (F (G (G (F ((2 <= p1190)))))) : A (F ((F ((p77 <= p782)) U G ((3 <= p946))))) : A ((p731 <= p244)) : A (F (X (F (G ((1 <= p938)))))) : A (G ((p1159 <= p1022))) : A (G ((p112 <= p1134))) : A (X ((X ((2 <= p800)) U X ((p556 <= p378))))) : A (G ((1 <= p1391)))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p748)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p748)
lola: processed formula length: 11
lola: 17 rewrites
lola: closed formula file RERS17pb114-PT-2-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 RERS17pb114-PT-2-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p731 <= p244)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p731 <= p244)
lola: processed formula length: 14
lola: 17 rewrites
lola: closed formula file RERS17pb114-PT-2-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: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((2 <= p1076)) AND ((3 <= p476) OR (2 <= p1076))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((2 <= p1076)) AND ((3 <= p476) OR (2 <= p1076))))))
lola: processed formula length: 64
lola: 17 rewrites
lola: closed formula file RERS17pb114-PT-2-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: 3 markings, 3 edges
lola: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p73 <= p696))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p73 <= p696))))
lola: processed formula length: 25
lola: 17 rewrites
lola: closed formula file RERS17pb114-PT-2-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: 1580 markings, 2518 edges
lola: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= p407))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= p407))))
lola: processed formula length: 23
lola: 17 rewrites
lola: closed formula file RERS17pb114-PT-2-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p1318 <= p644))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p1318 <= p644))))
lola: processed formula length: 27
lola: 17 rewrites
lola: closed formula file RERS17pb114-PT-2-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
lola: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((2 <= p800) U (p556 <= p378)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((2 <= p800) U (p556 <= p378)))))
lola: processed formula length: 42
lola: 17 rewrites
lola: closed formula file RERS17pb114-PT-2-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p1168)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((2 <= p1168)))
lola: processed formula length: 20
lola: 19 rewrites
lola: closed formula file RERS17pb114-PT-2-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p1168 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to RERS17pb114-PT-2-LTLCardinality-7-0.sara

FORMULA RERS17pb114-PT-2-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p1391)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= p1391)))
lola: processed formula length: 20
lola: 19 rewrites
lola: closed formula file RERS17pb114-PT-2-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p1391 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

FORMULA RERS17pb114-PT-2-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to RERS17pb114-PT-2-LTLCardinality-8-0.sara
lola: subprocess 9 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p1159 <= p1022)))
lola: ========================================
lola: SUBTASKlola:
state equation: calling and running sara
lola: ========================================
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p1159 <= p1022)))
lola: processed formula length: 24
lola: 19 rewrites
lola: closed formula file RERS17pb114-PT-2-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file RERS17pb114-PT-2-LTLCardinality-8-0.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p1022 + 1 <= p1159)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb114-PT-2-LTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb114-PT-2-LTLCardinality-9-0.sara.
lola: sara is running 0 secs || 61 markings, 60 edges, 12 markings/sec, 0 secs
lola: sara is running 5 secs || 120 markings, 119 edges, 12 markings/sec, 5 secs
lola: sara is running 10 secs || 175 markings, 174 edges, 11 markings/sec, 10 secs
lola: sara is running 15 secs || 230 markings, 229 edges, 11 markings/sec, 15 secs
lola: sara is running 20 secs || 309 markings, 308 edges, 16 markings/sec, 20 secs
lola: sara is running 25 secs || 393 markings, 392 edges, 17 markings/sec, 25 secs
lola: sara is running 30 secs || 482 markings, 481 edges, 18 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 566 markings, 565 edges
lola: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p112 <= p1134)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p112 <= p1134)))
lola: processed formula length: 23
lola: 19 rewrites
lola: closed formula file RERS17pb114-PT-2-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p1134 + 1 <= p112)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb114-PT-2-LTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RERS17pb114-PT-2-LTLCardinality-10-0.sara.
lola: sara is running 0 secs || 92 markings, 91 edges, 18 markings/sec, 0 secs
lola: sara is running 5 secs || 180 markings, 179 edges, 18 markings/sec, 5 secs
lola: sara is running 10 secs || 270 markings, 269 edges, 18 markings/sec, 10 secs
lola: sara is running 15 secs || 322 markings, 321 edges, 10 markings/sec, 15 secs
lola: sara is running 20 secs || 376 markings, 375 edges, 11 markings/sec, 20 secs
lola: sara is running 25 secs || 401 markings, 400 edges, 5 markings/sec, 25 secs
lola: sara is running 30 secs || 426 markings, 425 edges, 5 markings/sec, 30 secs
lola: sara is running 35 secs || 510 markings, 509 edges, 17 markings/sec, 35 secs
lola: sara is running 40 secs || 565 markings, 564 edges, 11 markings/sec, 40 secs
lola: sara is running 45 secs || 590 markings, 589 edges, 5 markings/sec, 45 secs
lola: sara is running 50 secs || 676 markings, 675 edges, 17 markings/sec, 50 secs
lola: sara is running 55 secs || 720 markings, 719 edges, 9 markings/sec, 55 secs
lola: sara is running 60 secs || 763 markings, 762 edges, 9 markings/sec, 60 secs
lola: sara is running 65 secs || 807 markings, 806 edges, 9 markings/sec, 65 secs
lola: sara is running 70 secs || 850 markings, 849 edges, 9 markings/sec, 70 secs
lola: sara is running 75 secs || 905 markings, 904 edges, 11 markings/sec, 75 secs
lola: sara is running 80 secs || 964 markings, 963 edges, 12 markings/sec, 80 secs
lola: sara is running 85 secs || 1023 markings, 1022 edges, 12 markings/sec, 85 secs
lola: sara is running 90 secs || 1108 markings, 1107 edges, 17 markings/sec, 90 secs
lola: sara is running 95 secs || 1195 markings, 1194 edges, 17 markings/sec, 95 secs
lola: sara is running 100 secs || 1282 markings, 1281 edges, 17 markings/sec, 100 secs
lola: sara is running 105 secs || 1368 markings, 1367 edges, 17 markings/sec, 105 secs
lola: sara is running 110 secs || 1424 markings, 1423 edges, 11 markings/sec, 110 secs
lola: sara is running 115 secs || 1484 markings, 1483 edges, 12 markings/sec, 115 secs
lola: sara is running 120 secs || 1544 markings, 1543 edges, 12 markings/sec, 120 secs
lola: sara is running 125 secs || 1601 markings, 1600 edges, 11 markings/sec, 125 secs
lola: sara is running 130 secs || 1656 markings, 1655 edges, 11 markings/sec, 130 secs
lola: sara is running 135 secs || 1706 markings, 1705 edges, 10 markings/sec, 135 secs
lola: sara is running 140 secs || 1761 markings, 1760 edges, 11 markings/sec, 140 secs
lola: sara is running 145 secs || 1853 markings, 1852 edges, 18 markings/sec, 145 secs
lola: sara is running 150 secs || 1942 markings, 1941 edges, 18 markings/sec, 150 secs
lola: sara is running 155 secs || 2030 markings, 2029 edges, 18 markings/sec, 155 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2036 markings, 2035 edges
lola: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p1350 <= p91)))
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: (p91 + 1 <= p1350)
lola: processed formula length: 18
lola: 19 rewrites
lola: closed formula file RERS17pb114-PT-2-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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 719 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p1190))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p1190))))
lola: processed formula length: 24
lola: 17 rewrites
lola: closed formula file RERS17pb114-PT-2-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: 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: 4 markings, 4 edges

FORMULA RERS17pb114-PT-2-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 959 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p938))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p938))))
lola: processed formula length: 23
lola: 17 rewrites
lola: closed formula file RERS17pb114-PT-2-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: 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: 5 markings, 6 edges
lola: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= p946))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= p946))))
lola: processed formula length: 23
lola: 17 rewrites
lola: closed formula file RERS17pb114-PT-2-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: 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: 5 markings, 6 edges
lola: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2877 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p198) U (1 <= p56)) U (2 <= p195)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p198) U (1 <= p56)) U (2 <= p195)))
lola: processed formula length: 46
lola: 17 rewrites
lola: closed formula file RERS17pb114-PT-2-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA RERS17pb114-PT-2-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no no yes no no yes no no no yes no
lola:
preliminary result: yes no yes no no no no yes no no yes no no no yes no
lola: memory consumption: 665928 KB
lola: time consumption: 691 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="RERS17pb114-PT-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is RERS17pb114-PT-2, 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 r132-oct2-155403939300137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-2.tgz
mv RERS17pb114-PT-2 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;