About the Execution of 2018-Gold for BridgeAndVehicles-PT-V20P20N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
267.640 | 35463.00 | 36440.00 | 32.50 | FTFFTFFFFFFFFFFF | 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.r022-csrt-155225094700183.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 BridgeAndVehicles-PT-V20P20N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-csrt-155225094700183
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 9 07:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 9 07:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 5 04:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 5 04:49 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 117 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 355 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 4 22:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 2 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 2 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 62K Jan 29 12:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K Jan 29 12:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 598K 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 BridgeAndVehicles-PT-V20P20N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1552408295817
info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P20N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P20N10 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ BridgeAndVehicles-PT-V20P20N10 @ 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: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P20N10-LTLFireability.task
lola: A (G ((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_10_2)))) : A ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_2_1) OR FIREABLE(decision_3_1) OR FIREABLE(decision_4_1) OR FIREABLE(decision_5_1) OR FIREABLE(decision_6_1) OR FIREABLE(decision_7_1) OR FIREABLE(decision_8_1) OR FIREABLE(decision_9_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR FIREABLE(decision_2_2) OR FIREABLE(decision_3_2) OR FIREABLE(decision_4_2) OR FIREABLE(decision_5_2) OR FIREABLE(decision_6_2) OR FIREABLE(decision_7_2) OR FIREABLE(decision_8_2) OR FIREABLE(decision_9_2))) : A (F ((G (FIREABLE(liberation_B)) U G ((FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR FIREABLE(autorisation_B_2_5) OR FIREABLE(autorisation_B_2_6) OR FIREABLE(autorisation_B_2_7) OR FIREABLE(autorisation_B_2_8) OR FIREABLE(autorisation_B_2_9) OR FIREABLE(autorisation_B_2_10) OR FIREABLE(autorisation_B_2_11) OR FIREABLE(autorisation_B_2_12) OR FIREABLE(autorisation_B_2_13) OR FIREABLE(autorisation_B_2_14) OR FIREABLE(autorisation_B_2_15) OR FIREABLE(autorisation_B_2_16) OR FIREABLE(autorisation_B_2_17) OR FIREABLE(autorisation_B_2_18) OR FIREABLE(autorisation_B_2_19) OR FIREABLE(autorisation_B_2_20)))))) : A (F ((((FIREABLE(enregistrement_B_0) OR FIREABLE(enregistrement_B_1) OR FIREABLE(enregistrement_B_2) OR FIREABLE(enregistrement_B_3) OR FIREABLE(enregistrement_B_4) OR FIREABLE(enregistrement_B_5) OR FIREABLE(enregistrement_B_6) OR FIREABLE(enregistrement_B_7) OR FIREABLE(enregistrement_B_8) OR FIREABLE(enregistrement_B_9) OR FIREABLE(enregistrement_B_10) OR FIREABLE(enregistrement_B_11) OR FIREABLE(enregistrement_B_12) OR FIREABLE(enregistrement_B_13) OR FIREABLE(enregistrement_B_14) OR FIREABLE(enregistrement_B_15) OR FIREABLE(enregistrement_B_16) OR FIREABLE(enregistrement_B_17) OR FIREABLE(enregistrement_B_18) OR FIREABLE(enregistrement_B_19) OR FIREABLE(enregistrement_B_20)) U (FIREABLE(enregistrement_A_0) OR FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_2) OR FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4) OR FIREABLE(enregistrement_A_5) OR FIREABLE(enregistrement_A_6) OR FIREABLE(enregistrement_A_7) OR FIREABLE(enregistrement_A_8) OR FIREABLE(enregistrement_A_9) OR FIREABLE(enregistrement_A_10) OR FIREABLE(enregistrement_A_11) OR FIREABLE(enregistrement_A_12) OR FIREABLE(enregistrement_A_13) OR FIREABLE(enregistrement_A_14) OR FIREABLE(enregistrement_A_15) OR FIREABLE(enregistrement_A_16) OR FIREABLE(enregistrement_A_17) OR FIREABLE(enregistrement_A_18) OR FIREABLE(enregistrement_A_19) OR FIREABLE(enregistrement_A_20))) U X (G ((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_10_2))))))) : A (((G ((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_10_2))) U F (FIREABLE(liberation_A))) U (FIREABLE(basculement_1) OR FIREABLE(basculement_2)))) : A (G ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_2_1) OR FIREABLE(decision_3_1) OR FIREABLE(decision_4_1) OR FIREABLE(decision_5_1) OR FIREABLE(decision_6_1) OR FIREABLE(decision_7_1) OR FIREABLE(decision_8_1) OR FIREABLE(decision_9_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR FIREABLE(decision_2_2) OR FIREABLE(decision_3_2) OR FIREABLE(decision_4_2) OR FIREABLE(decision_5_2) OR FIREABLE(decision_6_2) OR FIREABLE(decision_7_2) OR FIREABLE(decision_8_2) OR FIREABLE(decision_9_2)))) : A (X (G (F (((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_10_2)) U FIREABLE(liberation_A)))))) : A ((FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR FIREABLE(autorisation_B_2_5) OR FIREABLE(autorisation_B_2_6) OR FIREABLE(autorisation_B_2_7) OR FIREABLE(autorisation_B_2_8) OR FIREABLE(autorisation_B_2_9) OR FIREABLE(autorisation_B_2_10) OR FIREABLE(autorisation_B_2_11) OR FIREABLE(autorisation_B_2_12) OR FIREABLE(autorisation_B_2_13) OR FIREABLE(autorisation_B_2_14) OR FIREABLE(autorisation_B_2_15) OR FIREABLE(autorisation_B_2_16) OR FIREABLE(autorisation_B_2_17) OR FIREABLE(autorisation_B_2_18) OR FIREABLE(autorisation_B_2_19) OR FIREABLE(autorisation_B_2_20))) : A (X ((FIREABLE(timeout_A_0_10_1_16) U (FIREABLE(timeout_A_0_8_1_20) U FIREABLE(enregistrement_B_11))))) : A (G (FIREABLE(decision_6_2))) : A (FIREABLE(autorisation_A_15_1)) : A (FIREABLE(timeout_B_15_6_2_0)) : A (X (FIREABLE(timeout_A_0_2_1_18))) : A (FIREABLE(timeout_A_0_2_1_14)) : A ((X (FIREABLE(timeout_B_1_3_2_0)) U FIREABLE(timeout_B_10_9_2_0))) : A (F (FIREABLE(timeout_B_13_6_2_0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_2_1) OR FIREABLE(decision_3_1) OR FIREABLE(decision_4_1) OR FIREABLE(decision_5_1) OR FIREABLE(decision_6_1) OR FIREABLE(decision_7_1) OR FIREABLE(decision_8_1) OR FIREABLE(decision_9_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR FIREABLE(decision_2_2) OR FIREABLE(decision_3_2) OR FIREABLE(decision_4_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_2_1) OR FIREABLE(decision_3_1) OR FIREABLE(decision_4_1) OR FIREABLE(decision_5_1) OR FIREABLE(decision_6_1) OR FIREABLE(decision_7_1) OR FIREABLE(decision_8_1) OR FIREABLE(decision_9_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR FIREABLE(decision_2_2) OR FIREABLE(decision_3_2) OR FIREABLE(decision_4_2... (shortened)
lola: processed formula length: 537
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.task
lola: processed formula with 0 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 BridgeAndVehicles-PT-V20P20N10-LTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR FIREABLE(autorisation_B_2_5) OR FIREABLE(autorisation_B_2_6) OR FIREABLE(autorisation_B_2_7) OR FIREABLE(autorisation_B_2_8) OR FIREABLE(autorisation_B_2_9) OR FIREABLE(autorisation_B_2_10) OR FIREABLE(autorisation_B_2_11) OR FIREABLE(autorisation_B_2_12) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR FIREABLE(autorisation_B_2_5) OR FIREABLE(autorisation_B_2_6) OR FIREABLE(autorisation_B_2_7) OR FIREABLE(autorisation_B_2_8) OR FIREABLE(autorisation_B_2_9) OR FIREABLE(autorisation_B_2_10) OR FIREABLE(autorisation_B_2_11) OR FIREABLE(autorisation_B_2_12) OR ... (shortened)
lola: processed formula length: 668
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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 BridgeAndVehicles-PT-V20P20N10-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(autorisation_A_15_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(autorisation_A_15_1)
lola: processed formula length: 29
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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 BridgeAndVehicles-PT-V20P20N10-LTLFireability-10 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: FIREABLE(timeout_B_15_6_2_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(timeout_B_15_6_2_0)
lola: processed formula length: 28
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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 BridgeAndVehicles-PT-V20P20N10-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(timeout_A_0_2_1_14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(timeout_A_0_2_1_14)
lola: processed formula length: 28
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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 BridgeAndVehicles-PT-V20P20N10-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(timeout_A_0_2_1_18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(timeout_A_0_2_1_18)))
lola: processed formula length: 36
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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: 170 markings, 170 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(timeout_A_0_10_1_16) U (FIREABLE(timeout_A_0_8_1_20) U FIREABLE(enregistrement_B_11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(timeout_A_0_10_1_16) U (FIREABLE(timeout_A_0_8_1_20) U FIREABLE(enregistrement_B_11)))))
lola: processed formula length: 104
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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: 170 markings, 170 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-8 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 ((X (FIREABLE(timeout_B_1_3_2_0)) U FIREABLE(timeout_B_10_9_2_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (FIREABLE(timeout_B_1_3_2_0)) U FIREABLE(timeout_B_10_9_2_0)))
lola: processed formula length: 68
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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: 170 markings, 170 edges
lola:
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-14 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 (G (FIREABLE(decision_6_2)))
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 (FIREABLE(decision_6_2)))
lola: processed formula length: 30
lola: 15 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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: NOT FIREABLE(decision_6_2)
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-LTLFireability-8-0.sara
lola: SUBRESULT
lola: result: no
lola: lola: produced by: state spacestate equation: calling and running sara
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_10_2))))
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 ((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_10_2))))
lola: processed formula length: 65
lola: 15 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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: (NOT FIREABLE(altern_cpt_10_1) AND NOT FIREABLE(altern_cpt_10_2))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file BridgeAndVehicles-PT-V20P20N10-LTLFireability-8-0.sara.
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_2_1) OR FIREABLE(decision_3_1) OR FIREABLE(decision_4_1) OR FIREABLE(decision_5_1) OR FIREABLE(decision_6_1) OR FIREABLE(decision_7_1) OR FIREABLE(decision_8_1) OR FIREABLE(decision_9_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR FIREABLE(decision_2_2) OR FIREABLE(decision_3_2) OR FIREABLE(decisi... (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 ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_2_1) OR FIREABLE(decision_3_1) OR FIREABLE(decision_4_1) OR FIREABLE(decision_5_1) OR FIREABLE(decision_6_1) OR FIREABLE(decision_7_1) OR FIREABLE(decision_8_1) OR FIREABLE(decision_9_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR FIREABLE(decision_2_2) OR FIREABLE(decision_3_2) OR FIREABLE(decisi... (shortened)
lola: processed formula length: 545
lola: 15 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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: (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_2_1) AND NOT FIREABLE(decision_3_1) AND NOT FIREABLE(decision_4_1) AND NOT FIREABLE(decision_5_1) AND NOT FIREABLE(decision_6_1) AND NOT FIREABLE(decision_7_1) AND NOT FIREABLE(decision_8_1) AND NOT FIREABLE(decision_9_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2) AND NOT FIREABLE(decision_2_2) AND NOT FIREABLE(decision_3_2) AND NOT FIREABLE(decision_4_2) AND NOT FIREABLE(decision_5_2) AND NOT FIREABLE(decision_6_2) AND NOT FIREABLE(decision_7_2) AND NOT FIREABLE(decision_8_2) AND NOT FIREABLE(decision_9_2))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(timeout_B_13_6_2_0)))
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: NOT FIREABLE(timeout_B_13_6_2_0)
lola: processed formula length: 32
lola: 15 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 170 markings, 169 edges
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(liberation_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(liberation_A))))
lola: processed formula length: 34
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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: place or transition ordering is non-deterministic
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: 24894 markings, 41237 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_10_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_10_2)))))
lola: processed formula length: 69
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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: 171 markings, 172 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F (FIREABLE(liberation_A)) OR (G ((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_10_2))) AND F (FIREABLE(liberation_A)))) U (FIREABLE(basculement_1) OR FIREABLE(basculement_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F (FIREABLE(liberation_A)) OR (G ((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_10_2))) AND F (FIREABLE(liberation_A)))) U (FIREABLE(basculement_1) OR FIREABLE(basculement_2))))
lola: processed formula length: 188
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.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: 113146 markings, 312858 edges, 22629 markings/sec, 0 secs
lola: 240460 markings, 667529 edges, 25463 markings/sec, 5 secs
lola: 347242 markings, 951426 edges, 21356 markings/sec, 10 secs
lola: 450179 markings, 1221083 edges, 20587 markings/sec, 15 secs
lola: 565467 markings, 1540208 edges, 23058 markings/sec, 20 secs
lola: 701658 markings, 1914784 edges, 27238 markings/sec, 25 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: 815517 markings, 2228710 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR FIREABLE(autorisation_B_2_5) OR FIREABLE(autorisation_B_2_6) OR FIREABLE(autorisation_B_2_7) OR FIREABLE(autorisation_B_2_8) OR FIREABLE(autorisation_B_2_9) OR FIREABLE(autorisation_B_2_10) OR FIREABLE(autorisation_B_2_11) OR FIREABLE(autorisation_B_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4) OR FIREABLE(autorisation_B_2_5) OR FIREABLE(autorisation_B_2_6) OR FIREABLE(autorisation_B_2_7) OR FIREABLE(autorisation_B_2_8) OR FIREABLE(autorisation_B_2_9) OR FIREABLE(autorisation_B_2_10) OR FIREABLE(autorisation_B_2_11) OR FIREABLE(autorisation_B_... (shortened)
lola: processed formula length: 1395
lola: 13 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLFireability.task
lola: the resulting Büchi automaton has 11 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: 171 markings, 171 edges
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no yes no no no no no no no no no no no
lola:
preliminary result: no yes no no yes no no no no no no no no no no no
lola: ========================================
lola: memory consumption: 15792 KB
lola: time consumption: 35 seconds
BK_STOP 1552408331280
--------------------
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="BridgeAndVehicles-PT-V20P20N10"
export BK_EXAMINATION="LTLFireability"
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 BridgeAndVehicles-PT-V20P20N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r022-csrt-155225094700183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N10.tgz
mv BridgeAndVehicles-PT-V20P20N10 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
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 ;