Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is FlexibleBarrier-PT-18b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-blw7-152650003500206
=====================================================================

--------------------
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 FlexibleBarrier-PT-18b-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-18b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527193696784


BK_STOP 1527194771253

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using FlexibleBarrier-PT-18b as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3539199, 'Memory': 4504.23, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola FlexibleBarrier-PT-18b...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
FlexibleBarrier-PT-18b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-18b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ FlexibleBarrier-PT-18b @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 9407/65536 symbol table entries, 2286 collisions
lola: preprocessing...
lola: finding significant places
lola: 4370 places, 5037 transitions, 4350 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5075 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-18b-CTLCardinality.task
lola: NOT((E (G (((1 <= p117) OR (p2033 <= p2490)))) AND ((p2160 + 1 <= p3872) OR (p4220 + 1 <= p3376) OR (p3142 <= p4133)))) : NOT(A (X (E (F ((3 <= p1953)))))) : NOT(E (F ((((p724 <= p1678) OR (p2228 <= p3491)) AND ((3 <= p1660) OR (3 <= p4275)))))) : E ((((p4307 <= p3676) AND (3 <= p3709) AND (1 <= p801) AND (p1275 <= p209)) U E (F ((3 <= p3236))))) : A (F (((1 <= p86) AND (p4049 <= p4074)))) : A (F (A (X (((p2715 <= p1799) AND (3 <= p4288)))))) : NOT(E (G ((p1321 <= 2)))) : NOT(((((p3767 <= p3711) OR (p1708 <= p1152) OR (p3163 <= 1)) AND (1 <= p3104)) OR NOT(E (F ((3 <= p778)))))) : A (G ((p458 <= 0))) : ((((2 <= p1209) OR (p1776 <= p1397)) AND (p3500 <= 1) AND ((3 <= p3407) OR (p280 <= p183) OR ((p3358 <= p2802) AND (3 <= p4070))) AND ((p2486 <= p825) OR (2 <= p4329) OR ((p687 <= p468) AND (3 <= p1866)) OR (3 <= p2159))) AND ((E (F ((3 <= p365))) AND E (G ((p20 <= p388)))) AND (p870 <= p1926))) : A ((((p2679 <= p3116) OR (p2900 <= p3882) OR ((2 <= p874) AND (3 <= p946))) U A (G ((p632 <= p1629))))) : E (G (NOT(E (G ((2 <= p4334)))))) : E (G ((p4016 <= 0))) : NOT(A (F (A (X ((3 <= p3862)))))) : A (G ((p361 <= p4151))) : ((3 <= p668) OR E (G ((p1411 <= p3689))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G (((1 <= p117) OR (p2033 <= p2490)))) AND ((p2160 + 1 <= p3872) OR (p4220 + 1 <= p3376) OR (p3142 <= p4133))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p117 <= 0) AND (p2490 + 1 <= p2033))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p117 <= 0) AND (p2490 + 1 <= p2033))))
lola: processed formula: A (F (((p117 <= 0) AND (p2490 + 1 <= p2033))))
lola: processed formula length: 46
lola: 5 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 1 unused bits
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: 118 markings, 118 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p3872 <= p2160) AND (p3376 <= p4220) AND (p4133 + 1 <= p3142))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3872 <= p2160) AND (p3376 <= p4220) AND (p4133 + 1 <= p3142))
lola: processed formula length: 64
lola: 5 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: processed formula with 3 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: ========================================lola:
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (E (F ((3 <= p1953))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (3 <= p1953))))
lola: processed formula length: 31
lola: 8 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 163672 markings, 506221 edges, 3096157398730014720 markings/sec, 0 secs
lola: 334370 markings, 1013442 edges, 34140 markings/sec, 5 secs
lola: 507980 markings, 1490123 edges, 34722 markings/sec, 10 secs
lola: 647155 markings, 1956267 edges, 27835 markings/sec, 15 secs
lola: 748838 markings, 2469233 edges, 20337 markings/sec, 20 secs
lola: 844096 markings, 2946737 edges, 19052 markings/sec, 25 secs
lola: 994024 markings, 3420610 edges, 29986 markings/sec, 30 secs
lola: 1143858 markings, 3877451 edges, 29967 markings/sec, 35 secs
lola: 1276616 markings, 4311375 edges, 26552 markings/sec, 40 secs
lola: 1386006 markings, 4829568 edges, 21878 markings/sec, 45 secs
lola: 1467063 markings, 5321637 edges, 16211 markings/sec, 50 secs
lola: 1546893 markings, 5791715 edges, 15966 markings/sec, 55 secs
lola: 1671613 markings, 6277044 edges, 24944 markings/sec, 60 secs
lola: 1796297 markings, 6739563 edges, 24937 markings/sec, 65 secs
lola: 1904692 markings, 7213683 edges, 21679 markings/sec, 70 secs
lola: 1996079 markings, 7732012 edges, 18277 markings/sec, 75 secs
lola: 2059692 markings, 8209060 edges, 12723 markings/sec, 80 secs
lola: 2216356 markings, 8674207 edges, 31333 markings/sec, 85 secs
lola: 2383626 markings, 9134917 edges, 33454 markings/sec, 90 secs
lola: 2509673 markings, 9620181 edges, 25209 markings/sec, 95 secs
lola: 2601809 markings, 10117486 edges, 18427 markings/sec, 100 secs
lola: 2715159 markings, 10574411 edges, 22670 markings/sec, 105 secs
lola: 2889761 markings, 11049523 edges, 34920 markings/sec, 110 secs
lola: 3029517 markings, 11507766 edges, 27951 markings/sec, 115 secs
lola: 3131063 markings, 12009624 edges, 20309 markings/sec, 120 secs
lola: 3219430 markings, 12466795 edges, 17673 markings/sec, 125 secs
lola: 3386182 markings, 12943834 edges, 33350 markings/sec, 130 secs
lola: 3544679 markings, 13380214 edges, 31699 markings/sec, 135 secs
lola: 3658154 markings, 13877048 edges, 22695 markings/sec, 140 secs
lola: 3725193 markings, 14356563 edges, 13408 markings/sec, 145 secs
lola: 3875133 markings, 14812754 edges, 29988 markings/sec, 150 secs
lola: 4039167 markings, 15264942 edges, 32807 markings/sec, 155 secs
lola: 4168245 markings, 15724713 edges, 25816 markings/sec, 160 secs
lola: 4263175 markings, 16217961 edges, 18986 markings/sec, 165 secs
lola: 4356916 markings, 16652871 edges, 18748 markings/sec, 170 secs
lola: 4525717 markings, 17126712 edges, 33760 markings/sec, 175 secs
lola: 4675536 markings, 17556497 edges, 29964 markings/sec, 180 secs
lola: 4784674 markings, 18045343 edges, 21828 markings/sec, 185 secs
lola: 4850186 markings, 18511617 edges, 13102 markings/sec, 190 secs
lola: 5002150 markings, 18963292 edges, 30393 markings/sec, 195 secs
lola: 5164684 markings, 19410321 edges, 32507 markings/sec, 200 secs
lola: 5289910 markings, 19862288 edges, 25045 markings/sec, 205 secs
lola: 5382763 markings, 20347457 edges, 18571 markings/sec, 210 secs
lola: 5473291 markings, 20772969 edges, 18106 markings/sec, 215 secs
lola: 5632298 markings, 21225930 edges, 31801 markings/sec, 220 secs
lola: 5775206 markings, 21614829 edges, 28582 markings/sec, 225 secs
lola: 5882801 markings, 22072322 edges, 21519 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((((p724 <= p1678) OR (p2228 <= p3491)) AND ((3 <= p1660) OR (3 <= p4275))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 unused bits
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: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-CTLCardinality-2.sara.
lola: sara is running 0 secs || 50582 markings, 91887 edges, 10116 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 104469 markings, 188701 edges, 10777 markings/sec, 5 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p4307 <= p3676) AND (3 <= p3709) AND (1 <= p801) AND (p1275 <= p209)) U E (F ((3 <= p3236)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p4307 <= p3676) AND (3 <= p3709) AND (1 <= p801) AND (p1275 <= p209)) U E(TRUE U (3 <= p3236)))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 214151 markings, 447048 edges, 42817 markings/sec, 0 secs
lola: 388814 markings, 908103 edges, 34933 markings/sec, 5 secs
lola: 577399 markings, 1373981 edges, 37717 markings/sec, 10 secs
lola: 785242 markings, 1840272 edges, 41569 markings/sec, 15 secs
lola: 957992 markings, 2301195 edges, 34550 markings/sec, 20 secs
lola: 1155707 markings, 2763816 edges, 39543 markings/sec, 25 secs
lola: 1353050 markings, 3229912 edges, 39469 markings/sec, 30 secs
lola: 1524903 markings, 3689635 edges, 34371 markings/sec, 35 secs
lola: 1733432 markings, 4155613 edges, 41706 markings/sec, 40 secs
lola: 1921233 markings, 4620184 edges, 37560 markings/sec, 45 secs
lola: 2092111 markings, 5081971 edges, 34176 markings/sec, 50 secs
lola: 2314501 markings, 5558474 edges, 44478 markings/sec, 55 secs
lola: 2501874 markings, 6035979 edges, 37475 markings/sec, 60 secs
lola: 2682664 markings, 6510261 edges, 36158 markings/sec, 65 secs
lola: 2903348 markings, 6985017 edges, 44137 markings/sec, 70 secs
lola: 3079295 markings, 7445510 edges, 35189 markings/sec, 75 secs
lola: 3267944 markings, 7917647 edges, 37730 markings/sec, 80 secs
lola: 3482720 markings, 8392134 edges, 42955 markings/sec, 85 secs
lola: 3661306 markings, 8864834 edges, 35717 markings/sec, 90 secs
lola: 3853870 markings, 9330092 edges, 38513 markings/sec, 95 secs
lola: 4058396 markings, 9799245 edges, 40905 markings/sec, 100 secs
lola: 4235772 markings, 10269098 edges, 35475 markings/sec, 105 secs
lola: 4432760 markings, 10725087 edges, 39398 markings/sec, 110 secs
lola: 4631163 markings, 11199270 edges, 39681 markings/sec, 115 secs
lola: 4808845 markings, 11670747 edges, 35536 markings/sec, 120 secs
lola: 5019355 markings, 12143751 edges, 42102 markings/sec, 125 secs
lola: 5212890 markings, 12617586 edges, 38707 markings/sec, 130 secs
lola: 5387568 markings, 13085876 edges, 34936 markings/sec, 135 secs
lola: 5603395 markings, 13555432 edges, 43165 markings/sec, 140 secs
lola: 5790209 markings, 14026776 edges, 37363 markings/sec, 145 secs
lola: 5963762 markings, 14481165 edges, 34711 markings/sec, 150 secs
lola: 6175663 markings, 14935947 edges, 42380 markings/sec, 155 secs
lola: 6342071 markings, 15382636 edges, 33282 markings/sec, 160 secs
lola: 6533605 markings, 15838027 edges, 38307 markings/sec, 165 secs
lola: 6731828 markings, 16300458 edges, 39645 markings/sec, 170 secs
lola: 6902810 markings, 16758706 edges, 34196 markings/sec, 175 secs
lola: 7108424 markings, 17220920 edges, 41123 markings/sec, 180 secs
lola: 7293783 markings, 17678314 edges, 37072 markings/sec, 185 secs
lola: 7462307 markings, 18136079 edges, 33705 markings/sec, 190 secs
lola: 7676667 markings, 18584752 edges, 42872 markings/sec, 195 secs
lola: 7845981 markings, 19034163 edges, 33863 markings/sec, 200 secs
lola: 8029772 markings, 19477243 edges, 36758 markings/sec, 205 secs
lola: 8223175 markings, 19926068 edges, 38681 markings/sec, 210 secs
lola: 8385838 markings, 20367481 edges, 32533 markings/sec, 215 secs
lola: 8589467 markings, 20813516 edges, 40726 markings/sec, 220 secs
lola: 8764104 markings, 21258103 edges, 34927 markings/sec, 225 secs
lola: 8940368 markings, 21705916 edges, 35253 markings/sec, 230 secs
lola: 9145102 markings, 22157350 edges, 40947 markings/sec, 235 secs
lola: 9307462 markings, 22596435 edges, 32472 markings/sec, 240 secs
lola: 9501213 markings, 23039723 edges, 38750 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p86) AND (p4049 <= p4074))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((1 <= p86) AND (p4049 <= p4074))))
lola: processed formula: A (F (((1 <= p86) AND (p4049 <= p4074))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 1 unused bits
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: 128 markings, 128 edges
lola: ========================================
lola: subprocess 5 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((p2715 <= p1799) AND (3 <= p4288))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(((p2715 <= p1799) AND (3 <= p4288))))
lola: processed formula length: 49
lola: 2 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20 markings, 20 edges
lola: ========================================
lola: subprocess 6 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((p1321 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p1321)))
lola: processed formula: A (F ((3 <= p1321)))
lola: processed formula length: 20
lola: 3 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 1 unused bits
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: 117 markings, 117 edges
lola: ========================================
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((p3767 <= p3711) OR (p1708 <= p1152) OR (p3163 <= 1)) AND (1 <= p3104)) OR NOT(E (F ((3 <= p778))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p3711 + 1 <= p3767) AND (p1152 + 1 <= p1708) AND (2 <= p3163)) OR (p3104 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p3711 + 1 <= p3767) AND (p1152 + 1 <= p1708) AND (2 <= p3163)) OR (p3104 <= 0))
lola: processed formula length: 83
lola: 8 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: processed formula with 4 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: ========================================
lola: subprocess 8 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p778)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 47669 markings, 92521 edges, 9534 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p458 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 43272 markings, 115943 edges, 8654 markings/sec, 0 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((2 <= p1209) OR (p1776 <= p1397)) AND (p3500 <= 1) AND ((3 <= p3407) OR (p280 <= p183) OR ((p3358 <= p2802) AND (3 <= p4070))) AND ((p2486 <= p825) OR (2 <= p4329) OR ((p687 <= p468) AND (3 <= p1866)) OR (3 <= p2159))) AND ((E (F ((3 <= p365))) AND E (G ((p20 <= p388)))) AND (p870 <= p1926)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p1209) OR (p1776 <= p1397)) AND (p3500 <= 1) AND ((3 <= p3407) OR (p280 <= p183) OR ((p3358 <= p2802) AND (3 <= p4070))) AND ((p2486 <= p825) OR (2 <= p4329) OR ((p687 <= p468) AND (3 <= p1866)) OR (3 <= p2159)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= p1209) OR (p1776 <= p1397)) AND (p3500 <= 1) AND ((3 <= p3407) OR (p280 <= p183) OR ((p3358 <= p2802) AND (3 <= p4070))) AND ((p2486 <= p825) OR (2 <= p4329) OR ((p687 <= p468) AND (3 <= p1866)) OR (3 <= p2159)))
lola: processed formula length: 226
lola: 1 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: processed formula with 12 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: ========================================
lola: subprocess 10 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p365)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-CTLCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 43206 markings, 115176 edges, 8641 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p2679 <= p3116) OR (p2900 <= p3882) OR ((2 <= p874) AND (3 <= p946))) U A (G ((p632 <= p1629)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p2679 <= p3116) OR (p2900 <= p3882) OR ((2 <= p874) AND (3 <= p946))) U A (G ((p632 <= p1629)))))
lola: processed formula: A ((((p2679 <= p3116) OR (p2900 <= p3882) OR ((2 <= p874) AND (3 <= p946))) U A (G ((p632 <= p1629)))))
lola: processed formula length: 105
lola: 0 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 53766 markings, 113503 edges, 10753 markings/sec, 0 secs
lola: 108175 markings, 219275 edges, 10882 markings/sec, 5 secs
lola: 163018 markings, 323488 edges, 10969 markings/sec, 10 secs
lola: 216510 markings, 425610 edges, 10698 markings/sec, 15 secs
lola: 271396 markings, 529903 edges, 10977 markings/sec, 20 secs
lola: 323876 markings, 629944 edges, 10496 markings/sec, 25 secs
lola: 376088 markings, 729544 edges, 10442 markings/sec, 30 secs
lola: 428196 markings, 829958 edges, 10422 markings/sec, 35 secs
lola: 481782 markings, 930708 edges, 10717 markings/sec, 40 secs
lola: 535393 markings, 1034300 edges, 10722 markings/sec, 45 secs
lola: 589164 markings, 1138212 edges, 10754 markings/sec, 50 secs
lola: 641599 markings, 1237249 edges, 10487 markings/sec, 55 secs
lola: 679431 markings, 1331939 edges, 7566 markings/sec, 60 secs
lola: 713667 markings, 1409457 edges, 6847 markings/sec, 65 secs
lola: 756289 markings, 1498392 edges, 8524 markings/sec, 70 secs
lola: 793611 markings, 1580227 edges, 7464 markings/sec, 75 secs
lola: 824433 markings, 1652831 edges, 6164 markings/sec, 80 secs
lola: 858200 markings, 1730131 edges, 6753 markings/sec, 85 secs
lola: 896066 markings, 1814363 edges, 7573 markings/sec, 90 secs
lola: 950246 markings, 1925734 edges, 10836 markings/sec, 95 secs
lola: 1004717 markings, 2036727 edges, 10894 markings/sec, 100 secs
lola: 1057411 markings, 2145389 edges, 10539 markings/sec, 105 secs
lola: 1103009 markings, 2249667 edges, 9120 markings/sec, 110 secs
lola: 1153359 markings, 2353509 edges, 10070 markings/sec, 115 secs
lola: 1201582 markings, 2452059 edges, 9645 markings/sec, 120 secs
lola: 1248601 markings, 2547819 edges, 9404 markings/sec, 125 secs
lola: 1293486 markings, 2639732 edges, 8977 markings/sec, 130 secs
lola: 1345704 markings, 2746259 edges, 10444 markings/sec, 135 secs
lola: 1410377 markings, 2865520 edges, 12935 markings/sec, 140 secs
lola: 1458154 markings, 2963686 edges, 9555 markings/sec, 145 secs
lola: 1510182 markings, 3070029 edges, 10406 markings/sec, 150 secs
lola: 1565508 markings, 3183006 edges, 11065 markings/sec, 155 secs
lola: 1620702 markings, 3295694 edges, 11039 markings/sec, 160 secs
lola: 1676876 markings, 3410368 edges, 11235 markings/sec, 165 secs
lola: 1733624 markings, 3525965 edges, 11350 markings/sec, 170 secs
lola: 1788505 markings, 3637905 edges, 10976 markings/sec, 175 secs
lola: 1843671 markings, 3750532 edges, 11033 markings/sec, 180 secs
lola: 1889763 markings, 3860832 edges, 9218 markings/sec, 185 secs
lola: 1902094 markings, 3969107 edges, 2466 markings/sec, 190 secs
lola: 1914196 markings, 4077527 edges, 2420 markings/sec, 195 secs
lola: 1926298 markings, 4185854 edges, 2420 markings/sec, 200 secs
lola: 1939381 markings, 4293906 edges, 2617 markings/sec, 205 secs
lola: 1951769 markings, 4401471 edges, 2478 markings/sec, 210 secs
lola: 1965571 markings, 4510665 edges, 2760 markings/sec, 215 secs
lola: 2032007 markings, 4647666 edges, 13287 markings/sec, 220 secs
lola: 2035253 markings, 4765156 edges, 649 markings/sec, 225 secs
lola: 2092958 markings, 4875884 edges, 11541 markings/sec, 230 secs
lola: 2146164 markings, 4978684 edges, 10641 markings/sec, 235 secs
lola: 2200270 markings, 5083250 edges, 10821 markings/sec, 240 secs
lola: 2239688 markings, 5174289 edges, 7884 markings/sec, 245 secs
lola: 2282767 markings, 5263826 edges, 8616 markings/sec, 250 secs
lola: 2320068 markings, 5346122 edges, 7460 markings/sec, 255 secs
lola: 2350786 markings, 5418120 edges, 6144 markings/sec, 260 secs
lola: 2384344 markings, 5494457 edges, 6712 markings/sec, 265 secs
lola: 2423281 markings, 5578153 edges, 7787 markings/sec, 270 secs
lola: 2463880 markings, 5664811 edges, 8120 markings/sec, 275 secs
lola: 2499419 markings, 5746618 edges, 7108 markings/sec, 280 secs
lola: 2552259 markings, 5854805 edges, 10568 markings/sec, 285 secs
lola: 2604823 markings, 5962466 edges, 10513 markings/sec, 290 secs
lola: 2656056 markings, 6067351 edges, 10247 markings/sec, 295 secs
lola: 2700905 markings, 6171216 edges, 8970 markings/sec, 300 secs
lola: 2751148 markings, 6273900 edges, 10049 markings/sec, 305 secs
lola: 2799130 markings, 6371916 edges, 9596 markings/sec, 310 secs
lola: 2846774 markings, 6469130 edges, 9529 markings/sec, 315 secs
lola: 2892451 markings, 6562881 edges, 9135 markings/sec, 320 secs
lola: 2949781 markings, 6679525 edges, 11466 markings/sec, 325 secs
lola: 3012556 markings, 6794893 edges, 12555 markings/sec, 330 secs
lola: 3061043 markings, 6894858 edges, 9697 markings/sec, 335 secs
lola: 3117506 markings, 7010354 edges, 11293 markings/sec, 340 secs
lola: 3174189 markings, 7125616 edges, 11337 markings/sec, 345 secs
lola: 3230120 markings, 7239996 edges, 11186 markings/sec, 350 secs
lola: 3286105 markings, 7354500 edges, 11197 markings/sec, 355 secs
lola: 3342446 markings, 7469472 edges, 11268 markings/sec, 360 secs
lola: 3396576 markings, 7580068 edges, 10826 markings/sec, 365 secs
lola: 3451767 markings, 7692745 edges, 11038 markings/sec, 370 secs
lola: 3479222 markings, 7802838 edges, 5491 markings/sec, 375 secs
lola: 3491438 markings, 7912592 edges, 2443 markings/sec, 380 secs
lola: 3504570 markings, 8020692 edges, 2626 markings/sec, 385 secs
lola: 3517968 markings, 8129145 edges, 2680 markings/sec, 390 secs
lola: 3530092 markings, 8238084 edges, 2425 markings/sec, 395 secs
lola: 3542189 markings, 8344949 edges, 2419 markings/sec, 400 secs
lola: 3579175 markings, 8471593 edges, 7397 markings/sec, 405 secs
lola: 3617243 markings, 8594576 edges, 7614 markings/sec, 410 secs
lola: 3650325 markings, 8717082 edges, 6616 markings/sec, 415 secs
lola: 3704101 markings, 8821005 edges, 10755 markings/sec, 420 secs
lola: 3758359 markings, 8925872 edges, 10852 markings/sec, 425 secs
lola: 3810835 markings, 9024942 edges, 10495 markings/sec, 430 secs
lola: 3848176 markings, 9118416 edges, 7468 markings/sec, 435 secs
lola: 3882237 markings, 9195516 edges, 6812 markings/sec, 440 secs
lola: 3922863 markings, 9281244 edges, 8125 markings/sec, 445 secs
lola: 3962863 markings, 9368368 edges, 8000 markings/sec, 450 secs
lola: 3993863 markings, 9441553 edges, 6200 markings/sec, 455 secs
lola: 4027636 markings, 9518933 edges, 6755 markings/sec, 460 secs
lola: 4066189 markings, 9604179 edges, 7711 markings/sec, 465 secs
lola: 4121278 markings, 9716667 edges, 11018 markings/sec, 470 secs
lola: 4174853 markings, 9826656 edges, 10715 markings/sec, 475 secs
lola: 4228716 markings, 9937337 edges, 10773 markings/sec, 480 secs
lola: 4274548 markings, 10042367 edges, 9166 markings/sec, 485 secs
lola: 4325415 markings, 10146849 edges, 10173 markings/sec, 490 secs
lola: 4373519 markings, 10245134 edges, 9621 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (G ((2 <= p4334))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p4334 <= 1)))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 94 markings, 188 edges
lola: ========================================
lola: subprocess 12 will run for 628 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p4016 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p4016)))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 94 markings, 94 edges
lola: ========================================
lola: subprocess 13 will run for 838 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (X ((3 <= p3862))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((p3862 <= 2)))))
lola: processed formula length: 36
lola: 7 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 20 markings, 20 edges
lola: ========================================
lola: subprocess 14 will run for 1257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p361 <= p4151)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-CTLCardinality-14.sara.
lola: sara is running 0 secs || 50732 markings, 99036 edges, 10146 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2508 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p668) OR E (G ((p1411 <= p3689))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2508 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p668)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p668)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown yes unknown no no no no no no unknown yes yes yes no unknown
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="FlexibleBarrier-PT-18b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-18b.tgz
mv FlexibleBarrier-PT-18b execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is FlexibleBarrier-PT-18b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-blw7-152650003500206"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;