fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r187-csrt-155344544400104
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for NoC3x3-PT-5A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2172.610 352070.00 358680.00 32.60 TTFFFFTFTFFFFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r187-csrt-155344544400104.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off 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 NoC3x3-PT-5A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-csrt-155344544400104
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 3.3K Mar 23 12:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 12:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 23 12:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 12:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 10:10 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 10:10 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 12:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.3K Mar 23 12:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 12:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K Mar 23 12:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 23 10:10 NewModel
-rw-r--r-- 1 mcc users 3.8K Mar 23 12:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 12:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 103 Mar 23 11:58 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 341 Mar 23 11:58 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 23 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 23 12:13 UpperBounds.txt

-rw-r--r-- 1 mcc users 3.6K Mar 23 12:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 23 10:10 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 23 10:10 instance
-rw-r--r-- 1 mcc users 6 Mar 23 10:10 iscolored
-rw-r--r-- 1 mcc users 0 Mar 23 10:10 model-fix.log
-rw-r--r-- 1 mcc users 248K Mar 23 10:10 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 NoC3x3-PT-5A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553700244850

info: Time: 3600 - MCC
===========================================================================================
prep: translating NoC3x3-PT-5A Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating NoC3x3-PT-5A formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ NoC3x3-PT-5A @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1350/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 417
lola: finding significant places
lola: 417 places, 933 transitions, 351 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1244 transition conflict sets
lola: TASK
lola: reading formula from NoC3x3-PT-5A-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p51)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p179)
lola: LP says that atomic proposition is always false: (3 <= p110)
lola: LP says that atomic proposition is always false: (3 <= p410)
lola: LP says that atomic proposition is always false: (2 <= p162)
lola: A ((p80 <= p159)) : A ((p29 <= p415)) : A (FALSE) : A (F (X ((1 <= p65)))) : A (X (F ((1 <= p367)))) : A ((((p185 <= p366) U (p324 <= p105)) U F (G ((p306 <= p175))))) : A (X ((p220 <= p195))) : A (G (X (X (F (FALSE))))) : A ((p50 <= p395)) : A (G (FALSE)) : A (FALSE) : A (X (FALSE)) : A (X (G (F (X (FALSE))))) : A ((p132 <= p197)) : A ((X (G ((p308 <= p251))) U X ((1 <= p114)))) : A (G ((p323 <= p97)))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p80 <= p159)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p80 <= p159)
lola: processed formula length: 13
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-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 NoC3x3-PT-5A-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p29 <= p415)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p29 <= p415)
lola: processed formula length: 13
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-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 NoC3x3-PT-5A-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-LTLCardinality.task
lola: processed formula with 0 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 NoC3x3-PT-5A-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-LTLCardinality.task
lola: processed formula with 0 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 NoC3x3-PT-5A-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p50 <= p395)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p50 <= p395)
lola: processed formula length: 13
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-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 NoC3x3-PT-5A-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-LTLCardinality.task
lola: processed formula with 0 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 NoC3x3-PT-5A-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-LTLCardinality.task
lola: processed formula with 0 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 NoC3x3-PT-5A-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-LTLCardinality.task
lola: processed formula with 0 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 NoC3x3-PT-5A-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-LTLCardinality.task
lola: processed formula with 0 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

FORMULA NoC3x3-PT-5A-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p132 <= p197)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p132 <= p197)
lola: processed formula length: 14
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-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

FORMULA NoC3x3-PT-5A-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p367))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p367))))
lola: processed formula length: 23
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-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: 49 markings, 49 edges
lola: ========================================

FORMULA NoC3x3-PT-5A-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p220 <= p195)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p220 <= p195)))
lola: processed formula length: 22
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-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 NoC3x3-PT-5A-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p65))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p65))))
lola: processed formula length: 22
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-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: 49 markings, 49 edges
lola: ========================================

FORMULA NoC3x3-PT-5A-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p114) OR (G ((p308 <= p251)) AND F ((1 <= p114))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((1 <= p114) OR (G ((p308 <= p251)) AND F ((1 <= p114))))))
lola: processed formula length: 65
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-LTLCardinality.task
lola: the resulting Büchi automaton has 6 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: 3 markings, 2 edges

FORMULA NoC3x3-PT-5A-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p323 <= p97)))
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 ((p323 <= p97)))
lola: processed formula length: 21
lola: 32 rewrites
lola: closed formula file NoC3x3-PT-5A-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: ========================================
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: (p97 + 1 <= p323)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NoC3x3-PT-5A-LTLCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is not invariant.
lola: 13 markings, 14 edges
lola: ========================================

FORMULA NoC3x3-PT-5A-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p306 <= p175))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p306 <= p175))))
lola: processed formula length: 26
lola: 30 rewrites
lola: closed formula file NoC3x3-PT-5A-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
sara: try reading problem file NoC3x3-PT-5A-LTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: 138807 markings, 232842 edges, 27761 markings/sec, 0 secs
lola: 304094 markings, 472025 edges, 33057 markings/sec, 5 secs
lola: 460954 markings, 687297 edges, 31372 markings/sec, 10 secs
lola: 600072 markings, 861768 edges, 27824 markings/sec, 15 secs
lola: 746164 markings, 1062612 edges, 29218 markings/sec, 20 secs
lola: 880441 markings, 1261868 edges, 26855 markings/sec, 25 secs
lola: 1014802 markings, 1460937 edges, 26872 markings/sec, 30 secs
lola: 1147844 markings, 1657802 edges, 26608 markings/sec, 35 secs
lola: 1280888 markings, 1856382 edges, 26609 markings/sec, 40 secs
lola: 1413775 markings, 2056113 edges, 26577 markings/sec, 45 secs
lola: 1544186 markings, 2250136 edges, 26082 markings/sec, 50 secs
lola: 1677402 markings, 2446176 edges, 26643 markings/sec, 55 secs
lola: 1833751 markings, 2661149 edges, 31270 markings/sec, 60 secs
lola: 1979955 markings, 2859310 edges, 29241 markings/sec, 65 secs
lola: 2124665 markings, 3050771 edges, 28942 markings/sec, 70 secs
lola: 2274263 markings, 3252940 edges, 29920 markings/sec, 75 secs
lola: 2418512 markings, 3450407 edges, 28850 markings/sec, 80 secs
lola: 2562667 markings, 3647102 edges, 28831 markings/sec, 85 secs
lola: 2709552 markings, 3847609 edges, 29377 markings/sec, 90 secs
lola: 2869221 markings, 4065378 edges, 31934 markings/sec, 95 secs
lola: 3027579 markings, 4283569 edges, 31672 markings/sec, 100 secs
lola: 3184402 markings, 4499776 edges, 31365 markings/sec, 105 secs
lola: 3351429 markings, 4715948 edges, 33405 markings/sec, 110 secs
lola: 3501424 markings, 4910720 edges, 29999 markings/sec, 115 secs
lola: 3610789 markings, 5105390 edges, 21873 markings/sec, 120 secs
lola: 3697455 markings, 5262415 edges, 17333 markings/sec, 125 secs
lola: 3787090 markings, 5427492 edges, 17927 markings/sec, 130 secs
lola: 3874824 markings, 5598085 edges, 17547 markings/sec, 135 secs
lola: 3960096 markings, 5773707 edges, 17054 markings/sec, 140 secs
lola: 4106973 markings, 6081042 edges, 29375 markings/sec, 145 secs
lola: 4251657 markings, 6318926 edges, 28937 markings/sec, 150 secs
lola: 4411524 markings, 6597453 edges, 31973 markings/sec, 155 secs
lola: 4541517 markings, 6772214 edges, 25999 markings/sec, 160 secs
lola: 4668308 markings, 6944540 edges, 25358 markings/sec, 165 secs
lola: 4794469 markings, 7113508 edges, 25232 markings/sec, 170 secs
lola: 4931637 markings, 7301463 edges, 27434 markings/sec, 175 secs
lola: 5062059 markings, 7480163 edges, 26084 markings/sec, 180 secs
lola: 5196491 markings, 7668536 edges, 26886 markings/sec, 185 secs
lola: 5333555 markings, 7859973 edges, 27413 markings/sec, 190 secs
lola: 5464475 markings, 8038064 edges, 26184 markings/sec, 195 secs
lola: 5599045 markings, 8222240 edges, 26914 markings/sec, 200 secs
lola: 5726935 markings, 8398371 edges, 25578 markings/sec, 205 secs
lola: 5852953 markings, 8573914 edges, 25204 markings/sec, 210 secs
lola: 5983787 markings, 8755308 edges, 26167 markings/sec, 215 secs
lola: 6112520 markings, 8936115 edges, 25747 markings/sec, 220 secs
lola: 6241274 markings, 9117744 edges, 25751 markings/sec, 225 secs
lola: 6376925 markings, 9308719 edges, 27130 markings/sec, 230 secs
lola: 6501834 markings, 9482900 edges, 24982 markings/sec, 235 secs
lola: 6637222 markings, 9675113 edges, 27078 markings/sec, 240 secs
lola: 6777117 markings, 9875230 edges, 27979 markings/sec, 245 secs
lola: 6913307 markings, 10070918 edges, 27238 markings/sec, 250 secs
lola: 7054419 markings, 10269506 edges, 28222 markings/sec, 255 secs
lola: 7195172 markings, 10469303 edges, 28151 markings/sec, 260 secs
lola: 7336439 markings, 10668362 edges, 28253 markings/sec, 265 secs
lola: 7478335 markings, 10868354 edges, 28379 markings/sec, 270 secs
lola: 7617676 markings, 11067045 edges, 27868 markings/sec, 275 secs
lola: 7765175 markings, 11278119 edges, 29500 markings/sec, 280 secs
lola: 7910128 markings, 11489275 edges, 28991 markings/sec, 285 secs
lola: 8053755 markings, 11693605 edges, 28725 markings/sec, 290 secs
lola: 8195913 markings, 11896119 edges, 28432 markings/sec, 295 secs
lola: 8341136 markings, 12102140 edges, 29045 markings/sec, 300 secs
lola: 8482483 markings, 12307074 edges, 28269 markings/sec, 305 secs
lola: 8625942 markings, 12508252 edges, 28692 markings/sec, 310 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: 8716942 markings, 12670706 edges

FORMULA NoC3x3-PT-5A-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no no no yes no yes no no no no yes yes no
lola:
preliminary result: yes yes no no no no yes no yes no no no no yes yes no
lola: ========================================
lola: memory consumption: 19912 KB
lola: time consumption: 351 seconds

BK_STOP 1553700596920

--------------------
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="NoC3x3-PT-5A"
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 NoC3x3-PT-5A, 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 r187-csrt-155344544400104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-5A.tgz
mv NoC3x3-PT-5A 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 ;