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 73M
-rw-r--r-- 1 mcc users 2.9K May 30 22:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 30 22:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 29 16:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 16:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.4K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 10:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 10:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 28 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 28 08:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.5K May 28 07:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 28 07:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:31 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:31 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 27 04:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 04:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 28 07:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 2 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 73M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RERS17pb114-PT-9, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170100536
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527809091042

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb114-PT-9 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb114-PT-9 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ RERS17pb114-PT-9 @ 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: 1446
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-1-LTLCardinality.task
lola: A ((p1267 <= p917)) : A (X ((1 <= p1369))) : A (X ((G ((p922 <= p1222)) U G ((p1236 <= p751))))) : A (F (G (X (F ((1 <= p79)))))) : A ((((p1138 <= p1367) U (3 <= p602)) U ((3 <= p1190) U (3 <= p930)))) : A ((G ((3 <= p299)) U (p1410 <= p693))) : A (F ((X ((3 <= p218)) U F ((p879 <= p1226))))) : A (F (F (F (G ((1 <= p126)))))) : A ((p743 <= p1337)) : A (F (F ((p303 <= p255)))) : A (X (G (X (X ((1 <= p816)))))) : A ((p1282 <= p1108)) : A ((p826 <= p1175)) : A ((2 <= p573)) : A (G ((F ((1 <= p935)) U X ((p549 <= p811))))) : A ((3 <= p1260))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1267 <= p917)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1267 <= p917)
lola: processed formula length: 15
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-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-1-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 199 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p743 <= p1337)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p743 <= p1337)
lola: processed formula length: 15
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-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-1-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1282 <= p1108)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1282 <= p1108)
lola: processed formula length: 16
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-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-1-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 3 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p826 <= p1175)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p826 <= p1175)
lola: processed formula length: 15
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-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-1-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p573)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p573)
lola: processed formula length: 11
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-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-1-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p1260)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p1260)
lola: processed formula length: 12
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-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-1-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p1369)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= p1369)))
lola: processed formula length: 20
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-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: 3 markings, 3 edges
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((1 <= p816))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((1 <= p816))))))
lola: processed formula length: 31
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: 5 markings, 5 edges
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((p549 <= p811)))) AND A (G ((F ((1 <= p935)) OR X ((p549 <= p811))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p549 <= p811))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p549 <= p811))))
lola: processed formula length: 26
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-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: 21 markings, 29 edges, 4 markings/sec, 0 secs
lola: 41 markings, 53 edges, 4 markings/sec, 5 secs
lola: 61 markings, 77 edges, 4 markings/sec, 10 secs
lola: 82 markings, 110 edges, 4 markings/sec, 15 secs
lola: 102 markings, 136 edges, 4 markings/sec, 20 secs
lola: 122 markings, 161 edges, 4 markings/sec, 25 secs
lola: 142 markings, 188 edges, 4 markings/sec, 30 secs
lola: 163 markings, 214 edges, 4 markings/sec, 35 secs
lola: 182 markings, 235 edges, 4 markings/sec, 40 secs
lola: 202 markings, 259 edges, 4 markings/sec, 45 secs
lola: 222 markings, 285 edges, 4 markings/sec, 50 secs
lola: 242 markings, 325 edges, 4 markings/sec, 55 secs
lola: 263 markings, 366 edges, 4 markings/sec, 60 secs
lola: 283 markings, 406 edges, 4 markings/sec, 65 secs
lola: 304 markings, 444 edges, 4 markings/sec, 70 secs
lola: 324 markings, 483 edges, 4 markings/sec, 75 secs
lola: 345 markings, 525 edges, 4 markings/sec, 80 secs
lola: 365 markings, 565 edges, 4 markings/sec, 85 secs
lola: 386 markings, 601 edges, 4 markings/sec, 90 secs
lola: 406 markings, 640 edges, 4 markings/sec, 95 secs
lola: 426 markings, 678 edges, 4 markings/sec, 100 secs
lola: 447 markings, 701 edges, 4 markings/sec, 105 secs
lola: 468 markings, 726 edges, 4 markings/sec, 110 secs
lola: 488 markings, 759 edges, 4 markings/sec, 115 secs
lola: 508 markings, 799 edges, 4 markings/sec, 120 secs
lola: 530 markings, 842 edges, 4 markings/sec, 125 secs
lola: 551 markings, 872 edges, 4 markings/sec, 130 secs
lola: 572 markings, 903 edges, 4 markings/sec, 135 secs
lola: 593 markings, 945 edges, 4 markings/sec, 140 secs
lola: 628 markings, 983 edges, 7 markings/sec, 145 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: 658 markings, 1014 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((p1236 <= p751)) OR (G ((p922 <= p1222)) AND F (G ((p1236 <= p751)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((p1236 <= p751)) OR (G ((p922 <= p1222)) AND F (G ((p1236 <= p751)))))))
lola: processed formula length: 82
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-LTLCardinality.task
lola: the resulting Büchi automaton has 8 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: 113 markings, 141 edges

FORMULA RERS17pb114-PT-1-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p879 <= p1226)))
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: (p1226 + 1 <= p879)
lola: processed formula length: 19
lola: 26 rewrites
lola: closed formula file RERS17pb114-PT-1-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

FORMULA RERS17pb114-PT-1-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p303 <= p255)))
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: (p255 + 1 <= p303)
lola: processed formula length: 18
lola: 26 rewrites
lola: closed formula file RERS17pb114-PT-1-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-1-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p79))))
lola: processed formula length: 22
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-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, 5 edges

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

FORMULA RERS17pb114-PT-1-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p1410 <= p693) OR (G ((3 <= p299)) AND F ((p1410 <= p693)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p1410 <= p693) OR (G ((3 <= p299)) AND F ((p1410 <= p693)))))
lola: processed formula length: 66
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-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: 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-1-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2836 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p1138 <= p1367) U (3 <= p602)) U ((3 <= p1190) U (3 <= p930))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p1138 <= p1367) U (3 <= p602)) U ((3 <= p1190) U (3 <= p930))))
lola: processed formula length: 69
lola: 24 rewrites
lola: closed formula file RERS17pb114-PT-1-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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, 5 edges
lola: ========================================

FORMULA RERS17pb114-PT-1-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no yes yes no yes yes no yes yes no no no
lola:
preliminary result: yes no no no no yes yes no yes yes no yes yes no no no
lola: memory consumption: 544256 KB
lola: time consumption: 733 seconds

BK_STOP 1527809826196

--------------------
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-9"
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/RERS17pb114-PT-9.tgz
mv RERS17pb114-PT-9 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 RERS17pb114-PT-9, 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 r280-csrt-152749170100536"
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 ;