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

About the Execution of 2018-Gold for JoinFreeModules-PT-2000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.120 365800.00 374960.00 1796.00 FFFFFT?FFFFFFTFF 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.r088-csrt-155246566100330.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 JoinFreeModules-PT-2000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-155246566100330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 4.1K Feb 11 14:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 11 14:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 7 14:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 7 14:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 3 20:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 3 20:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jan 31 14:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 31 14:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 12M 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 JoinFreeModules-PT-2000-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552876301649

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-2000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-2000 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ JoinFreeModules-PT-2000 @ 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: 26002/65536 symbol table entries, 10032 collisions
lola: preprocessing...
lola: Size of bit vector: 320032
lola: finding significant places
lola: 10001 places, 16001 transitions, 8000 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 18001 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-2000-LTLFireability.task
lola: A (F (G (F (F (F (FIREABLE(t11089))))))) : A (FIREABLE(t15008)) : A ((F (X (FIREABLE(t10188))) U X (F (X (FIREABLE(t6625)))))) : A (G (G (G (X (G (FIREABLE(t10485))))))) : A (F (FIREABLE(t10368))) : A ((F ((FIREABLE(t9136) U FIREABLE(t9049))) U F (FIREABLE(t11106)))) : A (X (X (FIREABLE(t11908)))) : A (F (F (F ((FIREABLE(t10036) U FIREABLE(t13791)))))) : A (X (G (G (X (X (FIREABLE(t13049))))))) : A (FIREABLE(t11709)) : A (X (X (G (F (F (FIREABLE(t12432))))))) : A (X (G (FIREABLE(t15672)))) : A (FIREABLE(t15107)) : A (FIREABLE(t10268)) : A (X (X ((X (FIREABLE(t8258)) U G (FIREABLE(t3839)))))) : A (X (F (G (G (G (FIREABLE(t8632)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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(t15008)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t15008)
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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 JoinFreeModules-PT-2000-LTLFireability-1 FALSE 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: FIREABLE(t11709)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t11709)
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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 JoinFreeModules-PT-2000-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t15107)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t15107)
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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 JoinFreeModules-PT-2000-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t10268)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t10268)
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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

FORMULA JoinFreeModules-PT-2000-LTLFireability-13 TRUE 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: A (X (X (X (G (FIREABLE(t13049))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G (FIREABLE(t13049))))))
lola: processed formula length: 36
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6002 markings, 6002 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-8 FALSE 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 (FIREABLE(t10188)) U X (F (FIREABLE(t6625))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F (FIREABLE(t10188)) U X (F (FIREABLE(t6625))))))
lola: processed formula length: 56
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 6002 markings, 6002 edges

FORMULA JoinFreeModules-PT-2000-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (FIREABLE(t15672))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (FIREABLE(t15672))))
lola: processed formula length: 28
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 6002 markings, 6002 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-11 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 (G (FIREABLE(t10485))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (FIREABLE(t10485))))
lola: processed formula length: 28
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 6002 markings, 6002 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (FIREABLE(t11908))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (FIREABLE(t11908))))
lola: processed formula length: 28
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 23944 markings, 23959 edges, 4789 markings/sec, 0 secs
lola: 50362 markings, 50440 edges, 5284 markings/sec, 5 secs
lola: 76122 markings, 76311 edges, 5152 markings/sec, 10 secs
lola: 102265 markings, 102590 edges, 5229 markings/sec, 15 secs
lola: 128457 markings, 128984 edges, 5238 markings/sec, 20 secs
lola: 155580 markings, 156360 edges, 5425 markings/sec, 25 secs
lola: 185053 markings, 186134 edges, 5895 markings/sec, 30 secs
lola: 212539 markings, 213970 edges, 5497 markings/sec, 35 secs
lola: 240527 markings, 242357 edges, 5598 markings/sec, 40 secs
lola: 267967 markings, 270245 edges, 5488 markings/sec, 45 secs
lola: 295173 markings, 297947 edges, 5441 markings/sec, 50 secs
lola: 321677 markings, 324998 edges, 5301 markings/sec, 55 secs
lola: 347948 markings, 351776 edges, 5254 markings/sec, 60 secs
lola: 375970 markings, 380530 edges, 5604 markings/sec, 65 secs
lola: 402330 markings, 407481 edges, 5272 markings/sec, 70 secs
lola: 429749 markings, 435635 edges, 5484 markings/sec, 75 secs
lola: 457137 markings, 463807 edges, 5478 markings/sec, 80 secs
lola: 483379 markings, 490882 edges, 5248 markings/sec, 85 secs
lola: 509198 markings, 517583 edges, 5164 markings/sec, 90 secs
lola: 535975 markings, 545291 edges, 5355 markings/sec, 95 secs
lola: 561910 markings, 572063 edges, 5187 markings/sec, 100 secs
lola: 586477 markings, 597652 edges, 4913 markings/sec, 105 secs
lola: 611456 markings, 623546 edges, 4996 markings/sec, 110 secs
lola: 635501 markings, 648704 edges, 4809 markings/sec, 115 secs
lola: 661807 markings, 676003 edges, 5261 markings/sec, 120 secs
lola: 686580 markings, 701980 edges, 4955 markings/sec, 125 secs
lola: 711115 markings, 727586 edges, 4907 markings/sec, 130 secs
lola: 734124 markings, 751702 edges, 4602 markings/sec, 135 secs
lola: 756313 markings, 775033 edges, 4438 markings/sec, 140 secs
lola: 778228 markings, 798128 edges, 4383 markings/sec, 145 secs
lola: 799400 markings, 820424 edges, 4234 markings/sec, 150 secs
lola: 821008 markings, 843162 edges, 4322 markings/sec, 155 secs
lola: 842186 markings, 865621 edges, 4236 markings/sec, 160 secs
lola: 863456 markings, 887987 edges, 4254 markings/sec, 165 secs
lola: 884401 markings, 910279 edges, 4189 markings/sec, 170 secs
lola: 886894 markings, 913000 edges, 499 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((X (FIREABLE(t8258)) U G (FIREABLE(t3839))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((X (FIREABLE(t8258)) U G (FIREABLE(t3839))))))
lola: processed formula length: 55
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12003 markings, 12006 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t11106)))
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(t11106)
lola: processed formula length: 20
lola: 34 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t10368)))
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(t10368)
lola: processed formula length: 20
lola: 34 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 214 markings, 214 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 845 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t13791)))
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(t13791)
lola: processed formula length: 20
lola: 34 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 214 markings, 214 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t11089))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t11089))))
lola: processed formula length: 28
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 12 markings, 12 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t12432))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t12432))))
lola: processed formula length: 28
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 214 markings, 214 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t8632))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t8632))))
lola: processed formula length: 27
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 215 markings, 216 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X (FIREABLE(t11908))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (FIREABLE(t11908))))
lola: processed formula length: 28
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 27096 markings, 27116 edges, 5419 markings/sec, 0 secs
lola: 55785 markings, 55876 edges, 5738 markings/sec, 5 secs
lola: 83249 markings, 83459 edges, 5493 markings/sec, 10 secs
lola: 111209 markings, 111587 edges, 5592 markings/sec, 15 secs
lola: 140458 markings, 141088 edges, 5850 markings/sec, 20 secs
lola: 169898 markings, 170800 edges, 5888 markings/sec, 25 secs
lola: 198310 markings, 199534 edges, 5682 markings/sec, 30 secs
lola: 226918 markings, 228570 edges, 5722 markings/sec, 35 secs
lola: 254245 markings, 256325 edges, 5465 markings/sec, 40 secs
lola: 280268 markings, 282752 edges, 5205 markings/sec, 45 secs
lola: 306913 markings, 309916 edges, 5329 markings/sec, 50 secs
lola: 332115 markings, 335601 edges, 5040 markings/sec, 55 secs
lola: 359435 markings, 363530 edges, 5464 markings/sec, 60 secs
lola: 386920 markings, 391672 edges, 5497 markings/sec, 65 secs
lola: 414630 markings, 420090 edges, 5542 markings/sec, 70 secs
lola: 441716 markings, 447931 edges, 5417 markings/sec, 75 secs
lola: 467784 markings, 474804 edges, 5214 markings/sec, 80 secs
lola: 495147 markings, 503022 edges, 5473 markings/sec, 85 secs
lola: 521839 markings, 530617 edges, 5338 markings/sec, 90 secs
lola: 549082 markings, 558812 edges, 5449 markings/sec, 95 secs
lola: 574495 markings, 585225 edges, 5083 markings/sec, 100 secs
lola: 600829 markings, 612610 edges, 5267 markings/sec, 105 secs
lola: 625844 markings, 638564 edges, 5003 markings/sec, 110 secs
lola: 652751 markings, 666612 edges, 5381 markings/sec, 115 secs
lola: 677924 markings, 692975 edges, 5035 markings/sec, 120 secs
lola: 703985 markings, 720094 edges, 5212 markings/sec, 125 secs
lola: 727415 markings, 744806 edges, 4686 markings/sec, 130 secs
lola: 750030 markings, 768558 edges, 4523 markings/sec, 135 secs
lola: 773625 markings, 793326 edges, 4719 markings/sec, 140 secs
lola: 796011 markings, 816921 edges, 4477 markings/sec, 145 secs
lola: 816203 markings, 838148 edges, 4038 markings/sec, 150 secs
lola: 836068 markings, 859072 edges, 3973 markings/sec, 155 secs
lola: 856409 markings, 880719 edges, 4068 markings/sec, 160 secs
lola: 878704 markings, 904129 edges, 4459 markings/sec, 165 secs
lola: 886541 markings, 912646 edges, 1567 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA JoinFreeModules-PT-2000-LTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no yes unknown no no no no no no yes no no
lola:
preliminary result: no no no no no yes unknown no no no no no no yes no no
lola: memory consumption: 276768 KB
lola: time consumption: 365 seconds

BK_STOP 1552876667449

--------------------
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="JoinFreeModules-PT-2000"
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 JoinFreeModules-PT-2000, 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 r088-csrt-155246566100330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-2000.tgz
mv JoinFreeModules-PT-2000 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 '' LTLFireability.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 ;