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.r110-oct2-155272242300143.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 PermAdmissibility-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-oct2-155272242300143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.2K Feb 12 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 12 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 8 03:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 8 03:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K 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:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K Feb 5 00:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 4 07:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 4 07:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 1 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 1 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 4 22:22 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 481K 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 PermAdmissibility-PT-02-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553039018738

info: Time: 3600 - MCC
===========================================================================================
prep: translating PermAdmissibility-PT-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PermAdmissibility-PT-02 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ PermAdmissibility-PT-02 @ 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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5376
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-PT-02-LTLCardinality.task
lola: LP says that atomic proposition is always true: (out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)
lola: LP says that atomic proposition is always false: (3 <= c5)
lola: place invariant simplifies atomic proposition
lola: before: (out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)
lola: after: (0 <= 0)
lola: always true
lola: A (X ((1 <= c20))) : A (TRUE) : A ((c11 <= c15)) : A (G ((c13 <= aux8_2 + aux8_3 + aux8_6 + aux8_7))) : A (G (F (F (G ((1 <= c13)))))) : A (G (F (G (G ((1 <= c13)))))) : A (G (FALSE)) : A (X (F (G (F (TRUE))))) : A (X (F (F (G ((out7_7 <= out4_3)))))) : A (G ((aux6_4 <= aux10_0))) : A (G (G ((aux10_0 <= aux7_7)))) : A ((out1_6 <= out4_3)) : A (X (G (X (F ((out3_7 <= aux12_6)))))) : A ((aux13_6 <= aux11_3)) : A (X ((aux14_6 <= aux15_4))) : A (X (X (F (X ((aux7_7 <= out8_7))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-LTLCardinality.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 PermAdmissibility-PT-02-LTLCardinality-1 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: (c11 <= c15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (c11 <= c15)
lola: processed formula length: 12
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-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 PermAdmissibility-PT-02-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA PermAdmissibility-PT-02-LTLCardinality-6 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: (out1_6 <= out4_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (out1_6 <= out4_3)
lola: processed formula length: 18
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-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 PermAdmissibility-PT-02-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (aux13_6 <= aux11_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (aux13_6 <= aux11_3)
lola: processed formula length: 20
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-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 PermAdmissibility-PT-02-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= c20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= c20)))
lola: processed formula length: 18
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 33 markings, 33 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-LTLCardinality-7 TRUE 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 ((aux14_6 <= aux15_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((aux14_6 <= aux15_4)))
lola: processed formula length: 28
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((aux7_7 <= out8_7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((aux7_7 <= out8_7))))))
lola: processed formula length: 38
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 2023270 markings, 2155049 edges, 404654 markings/sec, 0 secs
lola: 3982435 markings, 4242354 edges, 391833 markings/sec, 5 secs
lola: 5870390 markings, 6294901 edges, 377591 markings/sec, 10 secs
lola: 7783463 markings, 8370473 edges, 382615 markings/sec, 15 secs
lola: 9644893 markings, 10404578 edges, 372286 markings/sec, 20 secs
lola: 11363581 markings, 12282323 edges, 343738 markings/sec, 25 secs
lola: 13057510 markings, 14181631 edges, 338786 markings/sec, 30 secs
lola: 14727267 markings, 16104599 edges, 333951 markings/sec, 35 secs
lola: 16373788 markings, 17928787 edges, 329304 markings/sec, 40 secs
lola: 18020794 markings, 19806502 edges, 329401 markings/sec, 45 secs
lola: 19349707 markings, 21791471 edges, 265783 markings/sec, 50 secs
lola: 20722332 markings, 23809955 edges, 274525 markings/sec, 55 secs
lola: 22470951 markings, 25789512 edges, 349724 markings/sec, 60 secs
lola: 24262980 markings, 27828162 edges, 358406 markings/sec, 65 secs
lola: 25963461 markings, 29696634 edges, 340096 markings/sec, 70 secs
lola: 27726814 markings, 31615274 edges, 352671 markings/sec, 75 secs
lola: 29524837 markings, 33601776 edges, 359605 markings/sec, 80 secs
lola: 31134271 markings, 35650411 edges, 321887 markings/sec, 85 secs
lola: 32931079 markings, 37620817 edges, 359362 markings/sec, 90 secs
lola: 34229838 markings, 39712676 edges, 259752 markings/sec, 95 secs
lola: 35902731 markings, 41800636 edges, 334579 markings/sec, 100 secs
lola: 37564335 markings, 43932547 edges, 332321 markings/sec, 105 secs
lola: 39366044 markings, 45988116 edges, 360342 markings/sec, 110 secs
lola: 41005745 markings, 48155310 edges, 327940 markings/sec, 115 secs
lola: 42583665 markings, 50237951 edges, 315584 markings/sec, 120 secs
lola: 43895139 markings, 52424229 edges, 262295 markings/sec, 125 secs
lola: 45243716 markings, 54674865 edges, 269715 markings/sec, 130 secs
lola: 46555578 markings, 56864252 edges, 262372 markings/sec, 135 secs
lola: 47812797 markings, 59046353 edges, 251444 markings/sec, 140 secs
lola: 49361062 markings, 61091561 edges, 309653 markings/sec, 145 secs
lola: 50970042 markings, 62844063 edges, 321796 markings/sec, 150 secs
lola: 52610037 markings, 64638884 edges, 327999 markings/sec, 155 secs
lola: 54218279 markings, 66529745 edges, 321648 markings/sec, 160 secs
lola: 55865860 markings, 68389082 edges, 329516 markings/sec, 165 secs
lola: 57275689 markings, 70322318 edges, 281966 markings/sec, 170 secs
lola: 58844663 markings, 72216864 edges, 313795 markings/sec, 175 secs
lola: 60550389 markings, 74073775 edges, 341145 markings/sec, 180 secs
lola: 62178885 markings, 75963454 edges, 325699 markings/sec, 185 secs
lola: 63589754 markings, 77921241 edges, 282174 markings/sec, 190 secs
lola: 65094669 markings, 79850664 edges, 300983 markings/sec, 195 secs
lola: 66643475 markings, 81820478 edges, 309761 markings/sec, 200 secs
lola: 67911021 markings, 83916994 edges, 253509 markings/sec, 205 secs
lola: 68989536 markings, 86080525 edges, 215703 markings/sec, 210 secs
lola: 70048060 markings, 88194168 edges, 211705 markings/sec, 215 secs
lola: 71751796 markings, 90170986 edges, 340747 markings/sec, 220 secs
lola: 73457478 markings, 92050682 edges, 341136 markings/sec, 225 secs
lola: 74914170 markings, 93941538 edges, 291338 markings/sec, 230 secs
lola: 76555582 markings, 95850572 edges, 328282 markings/sec, 235 secs
lola: 78150152 markings, 97787036 edges, 318914 markings/sec, 240 secs
lola: 79514023 markings, 99789027 edges, 272774 markings/sec, 245 secs
lola: 80627768 markings, 101886517 edges, 222749 markings/sec, 250 secs
lola: 82185242 markings, 103816731 edges, 311495 markings/sec, 255 secs
lola: 83615004 markings, 105702012 edges, 285952 markings/sec, 260 secs
lola: 84942732 markings, 107646223 edges, 265546 markings/sec, 265 secs
lola: 85949102 markings, 109653212 edges, 201274 markings/sec, 270 secs
lola: 87259900 markings, 111664226 edges, 262160 markings/sec, 275 secs
lola: 88981135 markings, 113537728 edges, 344247 markings/sec, 280 secs
lola: 90560624 markings, 115414538 edges, 315898 markings/sec, 285 secs
lola: 92182174 markings, 117294665 edges, 324310 markings/sec, 290 secs
lola: 93754569 markings, 119237046 edges, 314479 markings/sec, 295 secs
lola: 95298656 markings, 121202225 edges, 308817 markings/sec, 300 secs
lola: 96576139 markings, 123241631 edges, 255497 markings/sec, 305 secs
lola: 98127217 markings, 125098689 edges, 310216 markings/sec, 310 secs
lola: 99692637 markings, 126969421 edges, 313084 markings/sec, 315 secs
lola: 100932806 markings, 128937488 edges, 248034 markings/sec, 320 secs
lola: 102671198 markings, 130840436 edges, 347678 markings/sec, 325 secs
lola: 104302799 markings, 132746693 edges, 326320 markings/sec, 330 secs
lola: 105881273 markings, 134702413 edges, 315695 markings/sec, 335 secs
lola: 107568638 markings, 136551657 edges, 337473 markings/sec, 340 secs
lola: 109064258 markings, 138485764 edges, 299124 markings/sec, 345 secs
lola: 110334512 markings, 140568680 edges, 254051 markings/sec, 350 secs
lola: 111967825 markings, 142427591 edges, 326663 markings/sec, 355 secs
lola: 113504133 markings, 144260690 edges, 307262 markings/sec, 360 secs
lola: 114763509 markings, 146163239 edges, 251875 markings/sec, 365 secs
lola: 116177259 markings, 148021479 edges, 282750 markings/sec, 370 secs
lola: 117517522 markings, 149889801 edges, 268053 markings/sec, 375 secs
lola: 118704036 markings, 151735050 edges, 237303 markings/sec, 380 secs
lola: 119158474 markings, 152234661 edges, 90888 markings/sec, 385 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((aux6_4 <= aux10_0)))
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 ((aux6_4 <= aux10_0)))
lola: processed formula length: 27
lola: 25 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (aux10_0 + 1 <= aux6_4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-02-LTLCardinality-9-0.sara

lola: ========================================
FORMULA PermAdmissibility-PT-02-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((aux10_0 <= aux7_7)))
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 ((aux10_0 <= aux7_7)))
lola: processed formula length: 27
lola: 25 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: (aux7_7 + 1 <= aux10_0)
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: 8 markings, 7 edges

FORMULA PermAdmissibility-PT-02-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((c13 <= aux8_2 + aux8_3 + aux8_6 + aux8_7)))
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 ((c13 <= aux8_2 + aux8_3 + aux8_6 + aux8_7)))
lola: processed formula length: 50
lola: 25 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: (aux8_2 + aux8_3 + aux8_6 + aux8_7 + 1 <= c13)
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: 9 markings, 8 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 794 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= c13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= c13))))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 34 markings, 35 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1059 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= c13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= c13))))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 34 markings, 35 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((out3_7 <= aux12_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((out3_7 <= aux12_6))))
lola: processed formula length: 31
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 282576 markings, 808091 edges, 56515 markings/sec, 0 secs
lola: 582627 markings, 1656198 edges, 60010 markings/sec, 5 secs
lola: 885206 markings, 2456013 edges, 60516 markings/sec, 10 secs
lola: 1184435 markings, 3271870 edges, 59846 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1236313 markings, 3419575 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((out7_7 <= out4_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((out7_7 <= out4_3))))
lola: processed formula length: 30
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 296280 markings, 847122 edges, 59256 markings/sec, 0 secs
lola: 589164 markings, 1673159 edges, 58577 markings/sec, 5 secs
lola: 890345 markings, 2469229 edges, 60236 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1074307 markings, 2952462 edges
lola: ========================================

FORMULA PermAdmissibility-PT-02-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((aux7_7 <= out8_7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((aux7_7 <= out8_7))))))
lola: processed formula length: 38
lola: 23 rewrites
lola: closed formula file PermAdmissibility-PT-02-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: 2164361 markings, 2323548 edges, 432872 markings/sec, 0 secs
lola: 4228732 markings, 4544189 edges, 412874 markings/sec, 5 secs
lola: 6265987 markings, 6745939 edges, 407451 markings/sec, 10 secs
lola: 8259060 markings, 8903087 edges, 398615 markings/sec, 15 secs
lola: 10217029 markings, 11031458 edges, 391594 markings/sec, 20 secs
lola: 12092888 markings, 13101187 edges, 375172 markings/sec, 25 secs
lola: 14083762 markings, 15258660 edges, 398175 markings/sec, 30 secs
lola: 15948211 markings, 17415263 edges, 372890 markings/sec, 35 secs
lola: 17774884 markings, 19542718 edges, 365335 markings/sec, 40 secs
lola: 19338287 markings, 21772561 edges, 312681 markings/sec, 45 secs
lola: 20956203 markings, 24075526 edges, 323583 markings/sec, 50 secs
lola: 22877851 markings, 26255718 edges, 384330 markings/sec, 55 secs
lola: 24737673 markings, 28360515 edges, 371964 markings/sec, 60 secs
lola: 26630850 markings, 30419590 edges, 378635 markings/sec, 65 secs
lola: 28491901 markings, 32420138 edges, 372210 markings/sec, 70 secs
lola: 30260972 markings, 34572803 edges, 353814 markings/sec, 75 secs
lola: 31998732 markings, 36626217 edges, 347552 markings/sec, 80 secs
lola: 33637396 markings, 38726358 edges, 327733 markings/sec, 85 secs
lola: 35106466 markings, 40901374 edges, 293814 markings/sec, 90 secs
lola: 36901042 markings, 43001891 edges, 358915 markings/sec, 95 secs
lola: 38614173 markings, 45135001 edges, 342626 markings/sec, 100 secs
lola: 40415805 markings, 47171735 edges, 360326 markings/sec, 105 secs
lola: 42005027 markings, 49341607 edges, 317844 markings/sec, 110 secs
lola: 43393250 markings, 51587758 edges, 277645 markings/sec, 115 secs
lola: 44783562 markings, 53906767 edges, 278062 markings/sec, 120 secs
lola: 46143278 markings, 56176219 edges, 271943 markings/sec, 125 secs
lola: 47463233 markings, 58379368 edges, 263991 markings/sec, 130 secs
lola: 48899641 markings, 60584423 edges, 287282 markings/sec, 135 secs
lola: 50657582 markings, 62503631 edges, 351588 markings/sec, 140 secs
lola: 52416596 markings, 64435964 edges, 351803 markings/sec, 145 secs
lola: 54092970 markings, 66395319 edges, 335275 markings/sec, 150 secs
lola: 55829543 markings, 68341669 edges, 347315 markings/sec, 155 secs
lola: 57305304 markings, 70388368 edges, 295152 markings/sec, 160 secs
lola: 58995225 markings, 72377793 edges, 337984 markings/sec, 165 secs
lola: 60752039 markings, 74293315 edges, 351363 markings/sec, 170 secs
lola: 62417978 markings, 76268897 edges, 333188 markings/sec, 175 secs
lola: 63799482 markings, 78310085 edges, 276301 markings/sec, 180 secs
lola: 65452700 markings, 80247275 edges, 330644 markings/sec, 185 secs
lola: 67027319 markings, 82256697 edges, 314924 markings/sec, 190 secs
lola: 68195972 markings, 84426176 edges, 233731 markings/sec, 195 secs
lola: 69263206 markings, 86623196 edges, 213447 markings/sec, 200 secs
lola: 70455552 markings, 88757373 edges, 238469 markings/sec, 205 secs
lola: 72235587 markings, 90702065 edges, 356007 markings/sec, 210 secs
lola: 73962855 markings, 92612920 edges, 345454 markings/sec, 215 secs
lola: 75523090 markings, 94622050 edges, 312047 markings/sec, 220 secs
lola: 77170284 markings, 96581815 edges, 329439 markings/sec, 225 secs
lola: 78699249 markings, 98562531 edges, 305793 markings/sec, 230 secs
lola: 79976633 markings, 100613462 edges, 255477 markings/sec, 235 secs
lola: 81240142 markings, 102763454 edges, 252702 markings/sec, 240 secs
lola: 82750072 markings, 104703619 edges, 301986 markings/sec, 245 secs
lola: 84321665 markings, 106575804 edges, 314319 markings/sec, 250 secs
lola: 85421433 markings, 108602568 edges, 219954 markings/sec, 255 secs
lola: 86461548 markings, 110679435 edges, 208023 markings/sec, 260 secs
lola: 88163052 markings, 112650297 edges, 340301 markings/sec, 265 secs
lola: 89887107 markings, 114550744 edges, 344811 markings/sec, 270 secs
lola: 91475412 markings, 116517415 edges, 317661 markings/sec, 275 secs
lola: 93110823 markings, 118468837 edges, 327082 markings/sec, 280 secs
lola: 94757615 markings, 120437366 edges, 329358 markings/sec, 285 secs
lola: 96091332 markings, 122529077 edges, 266743 markings/sec, 290 secs
lola: 97659194 markings, 124450212 edges, 313572 markings/sec, 295 secs
lola: 99195776 markings, 126357730 edges, 307316 markings/sec, 300 secs
lola: 100425164 markings, 128331630 edges, 245878 markings/sec, 305 secs
lola: 102145153 markings, 130262985 edges, 343998 markings/sec, 310 secs
lola: 103854799 markings, 132189708 edges, 341929 markings/sec, 315 secs
lola: 105443916 markings, 134185999 edges, 317823 markings/sec, 320 secs
lola: 107143758 markings, 136077834 edges, 339968 markings/sec, 325 secs
lola: 108771981 markings, 137997150 edges, 325645 markings/sec, 330 secs
lola: 110057373 markings, 140092010 edges, 257078 markings/sec, 335 secs
lola: 111598085 markings, 142011076 edges, 308142 markings/sec, 340 secs
lola: 113167561 markings, 143895519 edges, 313895 markings/sec, 345 secs
lola: 114581094 markings, 145811537 edges, 282707 markings/sec, 350 secs
lola: 115944596 markings, 147750205 edges, 272700 markings/sec, 355 secs
lola: 117327232 markings, 149667563 edges, 276527 markings/sec, 360 secs
lola: 118592158 markings, 151566151 edges, 252985 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA PermAdmissibility-PT-02-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no no no yes no no no yes no yes yes unknown
lola:
preliminary result: no yes yes no no no no yes no no no yes no yes yes unknown
lola: memory consumption: 17204 KB
lola: time consumption: 807 seconds

BK_STOP 1553039825322

--------------------
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="PermAdmissibility-PT-02"
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 PermAdmissibility-PT-02, 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 r110-oct2-155272242300143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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