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-155403939200089.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 QuasiCertifProtocol-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-oct2-155403939200089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 3.8K Feb 12 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 8 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 8 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.7K Feb 5 00:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 5 00:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 4 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Feb 4 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 1 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 153K 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 QuasiCertifProtocol-PT-06-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1554073757093

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-PT-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-PT-06 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-PT-06 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 386/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 151 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-06-LTLCardinality.task
lola: A (F (X (G (F ((n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_1_2 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_1_1 + n9_1_0 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 <= a4)))))) : A (G (F (X (F ((n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 <= s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0)))))) : A ((n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 <= n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1)) : A ((2 <= SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6)) : A ((3 <= n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6)) : A (X ((X ((3 <= malicious_reservoir)) U (Astart <= s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_6)))) : A (G ((n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1 <= a5))) : A ((AstopOK <= SstopAbort)) : A (G ((n7_4_4 <= n7_1_3))) : A (G (F ((s2_1 <= n9_4_3)))) : A (((n8_5_3 <= n5_6) U ((s6_6 <= n7_0_3) U (n3_4 <= s2_5)))) : A (G (F (G ((n9_6_3 <= s5_4))))) : A (X (F (F (G ((Sstart_5 <= n7_0_3)))))) : A (G (X (G (G ((n9_6_6 <= n7_0_1)))))) : A (G ((G ((n8_0_0 <= n8_6_5)) U (n7_5_3 <= n8_1_1)))) : A (F (F ((Sstart_2 <= n7_4_1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 <= n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 <= n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1_5 ... (shortened)
lola: processed formula length: 490
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 QuasiCertifProtocol-PT-06-LTLCardinality-2 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: (2 <= SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6)
lola: processed formula length: 88
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 QuasiCertifProtocol-PT-06-LTLCardinality-3 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: (3 <= n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 ... (shortened)
lola: processed formula length: 445
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 QuasiCertifProtocol-PT-06-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AstopOK <= SstopAbort)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (AstopOK <= SstopAbort)
lola: processed formula length: 23
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 QuasiCertifProtocol-PT-06-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= malicious_reservoir)) U (Astart <= s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((3 <= malicious_reservoir)) U (Astart <= s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_6))))
lola: processed formula length: 101
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 11 markings, 11 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((n9_6_6 <= n7_0_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((n9_6_6 <= n7_0_1))))
lola: processed formula length: 30
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 264361 markings, 1396691 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((n7_4_4 <= n7_1_3)))
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 ((n7_4_4 <= n7_1_3)))
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: (n7_1_3 + 1 <= n7_4_4)
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: 22 markings, 21 edges

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_6... (shortened)
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 ((n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_6... (shortened)
lola: processed formula length: 454
lola: 20 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: (a5 + 1 <= n8_0_0 + n8_1_0 + n8_2_0 + n8_3_0 + n8_4_0 + n8_5_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_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: 36 markings, 35 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-06-LTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola:
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Sstart_2 <= n7_4_1)))
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: (n7_4_1 + 1 <= Sstart_2)
lola: processed formula length: 24
lola: 20 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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
sara: try reading problem file QuasiCertifProtocol-PT-06-LTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 5377 markings, 20101 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Sstart_5 <= n7_0_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Sstart_5 <= n7_0_3))))
lola: processed formula length: 32
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 1003867 markings, 3831394 edges, 200773 markings/sec, 0 secs
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: 1544446 markings, 6892707 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((s2_1 <= n9_4_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((s2_1 <= n9_4_3))))
lola: processed formula length: 28
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 11 markings, 11 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((n9_6_3 <= s5_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((n9_6_3 <= s5_4))))
lola: processed formula length: 28
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 162943 markings, 526221 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((n7_5_3 <= n8_1_1) OR (G ((n8_0_0 <= n8_6_5)) AND F ((n7_5_3 <= n8_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((n7_5_3 <= n8_1_1) OR (G ((n8_0_0 <= n8_6_5)) AND F ((n7_5_3 <= n8_1_1))))))
lola: processed formula length: 83
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13923 markings, 38969 edges

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((n8_5_3 <= n5_6) U ((s6_6 <= n7_0_3) U (n3_4 <= s2_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((n8_5_3 <= n5_6) U ((s6_6 <= n7_0_3) U (n3_4 <= s2_5))))
lola: processed formula length: 60
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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 QuasiCertifProtocol-PT-06-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 <= s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 <= s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0))))
lola: processed formula length: 110
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 13974 markings, 61899 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_1_2 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_1_1 + n9_1_0 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_6_0 + n9_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_1_2 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_1_1 + n9_1_0 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_6_0 + n9_... (shortened)
lola: processed formula length: 458
lola: 18 rewrites
lola: closed formula file QuasiCertifProtocol-PT-06-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: 136024 markings, 406276 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no no no yes no no yes no yes no no yes
lola:
preliminary result: no no yes no no no no yes no no yes no yes no no yes
lola: memory consumption: 19300 KB
lola: time consumption: 22 seconds

BK_STOP 1554073779376

--------------------
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="QuasiCertifProtocol-PT-06"
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 QuasiCertifProtocol-PT-06, 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-155403939200089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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