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.r055-oct2-155234418500053.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 DES-PT-50b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-oct2-155234418500053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 3.1K Feb 9 09:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 9 09:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 08:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 5 08:27 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 97 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 335 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 23:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K Feb 4 23:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 2 02:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 2 02:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jan 29 16:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 29 16:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 127K 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 DES-PT-50b-LTLCardinality-00
FORMULA_NAME DES-PT-50b-LTLCardinality-01
FORMULA_NAME DES-PT-50b-LTLCardinality-02
FORMULA_NAME DES-PT-50b-LTLCardinality-03
FORMULA_NAME DES-PT-50b-LTLCardinality-04
FORMULA_NAME DES-PT-50b-LTLCardinality-05
FORMULA_NAME DES-PT-50b-LTLCardinality-06
FORMULA_NAME DES-PT-50b-LTLCardinality-07
FORMULA_NAME DES-PT-50b-LTLCardinality-08
FORMULA_NAME DES-PT-50b-LTLCardinality-09
FORMULA_NAME DES-PT-50b-LTLCardinality-10
FORMULA_NAME DES-PT-50b-LTLCardinality-11
FORMULA_NAME DES-PT-50b-LTLCardinality-12
FORMULA_NAME DES-PT-50b-LTLCardinality-13
FORMULA_NAME DES-PT-50b-LTLCardinality-14
FORMULA_NAME DES-PT-50b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552694541913

info: Time: 3600 - MCC
===========================================================================================
prep: translating DES-PT-50b 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 DES-PT-50b formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ DES-PT-50b @ 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: 909/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 479
lola: finding significant places
lola: 479 places, 430 transitions, 414 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 527 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-50b-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p447)
lola: LP says that atomic proposition is always false: (2 <= p327)
lola: LP says that atomic proposition is always false: (3 <= p295)
lola: LP says that atomic proposition is always false: (3 <= p379)
lola: LP says that atomic proposition is always false: (3 <= p319)
lola: A (F ((p270 <= p238))) : A (X (X (G (G ((1 <= p212)))))) : A (G ((p160 <= p465))) : A (X (G ((p106 <= p177)))) : A (G ((F ((1 <= p333)) U X ((p248 <= p310))))) : A (F (X (F (F ((p411 <= p214)))))) : A (F (((1 <= p466) U G ((1 <= p320))))) : A (G (G ((p409 <= p20)))) : A ((p319 <= p224)) : A ((G (F (FALSE)) U X (F ((1 <= p218))))) : A (F (G (FALSE))) : A (F (FALSE)) : A (G (G ((FALSE U (p62 <= p458))))) : A ((F (X ((p315 <= p301))) U G (G (FALSE)))) : A ((p335 <= p398)) : A (G (G (F (G ((p381 <= p1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p319 <= p224)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p319 <= p224)
lola: processed formula length: 14
lola: 36 rewrites
lola: closed formula file DES-PT-50b-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 DES-PT-50b-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 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: 36 rewrites
lola: closed formula file DES-PT-50b-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 DES-PT-50b-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 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: 36 rewrites
lola: closed formula file DES-PT-50b-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 DES-PT-50b-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 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: 36 rewrites
lola: closed formula file DES-PT-50b-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 DES-PT-50b-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p335 <= p398)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p335 <= p398)
lola: processed formula length: 14
lola: 36 rewrites
lola: closed formula file DES-PT-50b-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 DES-PT-50b-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p218))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p218))))
lola: processed formula length: 23
lola: 36 rewrites
lola: closed formula file DES-PT-50b-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: 85 markings, 85 edges
lola: ========================================

FORMULA DES-PT-50b-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p106 <= p177))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p106 <= p177))))
lola: processed formula length: 26
lola: 36 rewrites
lola: closed formula file DES-PT-50b-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: 85 markings, 85 edges
lola: ========================================

FORMULA DES-PT-50b-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((p248 <= p310)))) AND A (G ((F ((1 <= p333)) OR X ((p248 <= p310))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p248 <= p310))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p248 <= p310))))
lola: processed formula length: 26
lola: 36 rewrites
lola: closed formula file DES-PT-50b-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: 89 markings, 89 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA DES-PT-50b-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p411 <= p214))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p411 <= p214))))
lola: processed formula length: 26
lola: 36 rewrites
lola: closed formula file DES-PT-50b-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 DES-PT-50b-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((1 <= p212)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((1 <= p212)))))
lola: processed formula length: 27
lola: 36 rewrites
lola: closed formula file DES-PT-50b-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: 85 markings, 85 edges
lola: ========================================

FORMULA DES-PT-50b-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p62 <= p458)))
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 ((p62 <= p458)))
lola: processed formula length: 21
lola: 38 rewrites
lola: closed formula file DES-PT-50b-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: (p458 + 1 <= p62)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-LTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-LTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1268673 markings, 1649034 edges, 253735 markings/sec, 0 secs
lola: sara is running 5 secs || 2817883 markings, 3280577 edges, 309842 markings/sec, 5 secs
lola: sara is running 10 secs || 4361940 markings, 4906664 edges, 308811 markings/sec, 10 secs
lola: sara is running 15 secs || 5910939 markings, 6537983 edges, 309800 markings/sec, 15 secs
lola: sara is running 20 secs || 7257762 markings, 8159412 edges, 269365 markings/sec, 20 secs
lola: sara is running 25 secs || 8336338 markings, 9896008 edges, 215715 markings/sec, 25 secs
lola: sara is running 30 secs || 9371865 markings, 11619928 edges, 207105 markings/sec, 30 secs
lola: sara is running 35 secs || 10424217 markings, 13343197 edges, 210470 markings/sec, 35 secs
lola: sara is running 40 secs || 11478479 markings, 15027500 edges, 210852 markings/sec, 40 secs
lola: sara is running 45 secs || 12349299 markings, 16387301 edges, 174164 markings/sec, 45 secs
lola: sara is running 50 secs || 13029567 markings, 17448593 edges, 136054 markings/sec, 50 secs
lola: sara is running 55 secs || 14047851 markings, 19061310 edges, 203657 markings/sec, 55 secs
lola: sara is running 60 secs || 15067440 markings, 20682855 edges, 203918 markings/sec, 60 secs
lola: sara is running 65 secs || 16134762 markings, 22333500 edges, 213464 markings/sec, 65 secs
lola: sara is running 70 secs || 17148736 markings, 23966072 edges, 202795 markings/sec, 70 secs
lola: sara is running 75 secs || 18168884 markings, 25584909 edges, 204030 markings/sec, 75 secs
lola: sara is running 80 secs || 19218258 markings, 27230010 edges, 209875 markings/sec, 80 secs

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA DES-PT-50b-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p160 <= p465)))
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 ((p160 <= p465)))
lola: processed formula length: 22
lola: 38 rewrites
lola: closed formula file DES-PT-50b-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: (p465 + 1 <= p160)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-LTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-LTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 879710 markings, 1711615 edges, 175942 markings/sec, 0 secs
lola: sara is running 5 secs || 1752053 markings, 3404209 edges, 174469 markings/sec, 5 secs
lola: sara is running 10 secs || 2635958 markings, 5065735 edges, 176781 markings/sec, 10 secs
lola: sara is running 15 secs || 3379180 markings, 6830075 edges, 148644 markings/sec, 15 secs
lola: sara is running 20 secs || 4101002 markings, 8638763 edges, 144364 markings/sec, 20 secs
lola: sara is running 25 secs || 4710417 markings, 10171801 edges, 121883 markings/sec, 25 secs
lola: sara is running 30 secs || 5400293 markings, 11884649 edges, 137975 markings/sec, 30 secs
lola: sara is running 35 secs || 5885454 markings, 13123480 edges, 97032 markings/sec, 35 secs
lola: sara is running 40 secs || 6562831 markings, 14797597 edges, 135475 markings/sec, 40 secs
lola: sara is running 45 secs || 7278330 markings, 16612288 edges, 143100 markings/sec, 45 secs
lola: sara is running 50 secs || 7984878 markings, 18398921 edges, 141310 markings/sec, 50 secs
lola: sara is running 55 secs || 8715786 markings, 20202008 edges, 146182 markings/sec, 55 secs
lola: sara is running 60 secs || 9423109 markings, 22000817 edges, 141465 markings/sec, 60 secs
lola: sara is running 65 secs || 10117642 markings, 23752495 edges, 138907 markings/sec, 65 secs
lola: sara is running 70 secs || 10827941 markings, 25500512 edges, 142060 markings/sec, 70 secs
lola: sara is running 75 secs || 11364856 markings, 26848232 edges, 107383 markings/sec, 75 secs
lola: sara is running 80 secs || 11709530 markings, 27749529 edges, 68935 markings/sec, 80 secs
lola: sara is running 85 secs || 12067261 markings, 28647614 edges, 71546 markings/sec, 85 secs
lola: sara is running 90 secs || 12435786 markings, 29539207 edges, 73705 markings/sec, 90 secs
lola: sara is running 95 secs || 12778913 markings, 30434073 edges, 68625 markings/sec, 95 secs
lola: sara is running 100 secs || 13133440 markings, 31328550 edges, 70905 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13139246 markings, 31342655 edges
lola: ========================================

FORMULA DES-PT-50b-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p409 <= p20)))
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 ((p409 <= p20)))
lola: processed formula length: 21
lola: 38 rewrites
lola: closed formula file DES-PT-50b-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: (p20 + 1 <= p409)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-LTLCardinality-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2170 markings, 2182 edges
lola: ========================================

FORMULA DES-PT-50b-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1124 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p270 <= p238)))
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: (p238 + 1 <= p270)
lola: processed formula length: 18
lola: 38 rewrites
lola: closed formula file DES-PT-50b-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 DES-PT-50b-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p320))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p320))))
lola: processed formula length: 23
lola: 36 rewrites
lola: closed formula file DES-PT-50b-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: 90 markings, 91 edges

FORMULA DES-PT-50b-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p381 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p381 <= p1))))
lola: processed formula length: 24
lola: 36 rewrites
lola: closed formula file DES-PT-50b-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: 450049 markings, 540838 edges

FORMULA DES-PT-50b-LTLCardinality-15 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 no no yes no no no no no yes no
lola:
preliminary result: yes no no no no yes no no yes no no no no no yes no
lola: ========================================
lola: memory consumption: 19656 KB
lola: time consumption: 197 seconds

BK_STOP 1552694739073

--------------------
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="DES-PT-50b"
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 DES-PT-50b, 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 r055-oct2-155234418500053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b 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 ;