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-full
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 r090-blw7-152650001200206
=====================================================================

--------------------
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 1527063271021


BK_STOP 1527064346848

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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 stderr -----
----- Start make result stdout -----
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: 163968 markings, 507374 edges, 3096157398730014720 markings/sec, 0 secs
lola: 329621 markings, 1001675 edges, 33131 markings/sec, 5 secs
lola: 506751 markings, 1488016 edges, 35426 markings/sec, 10 secs
lola: 649501 markings, 1964391 edges, 28550 markings/sec, 15 secs
lola: 750521 markings, 2479616 edges, 20204 markings/sec, 20 secs
lola: 848068 markings, 2960692 edges, 19509 markings/sec, 25 secs
lola: 998759 markings, 3439142 edges, 30138 markings/sec, 30 secs
lola: 1150314 markings, 3901492 edges, 30311 markings/sec, 35 secs
lola: 1283497 markings, 4345795 edges, 26637 markings/sec, 40 secs
lola: 1392672 markings, 4861204 edges, 21835 markings/sec, 45 secs
lola: 1470407 markings, 5344798 edges, 15547 markings/sec, 50 secs
lola: 1552402 markings, 5818694 edges, 16399 markings/sec, 55 secs
lola: 1678717 markings, 6300051 edges, 25263 markings/sec, 60 secs
lola: 1798896 markings, 6753773 edges, 24036 markings/sec, 65 secs
lola: 1906341 markings, 7220593 edges, 21489 markings/sec, 70 secs
lola: 1996862 markings, 7736396 edges, 18104 markings/sec, 75 secs
lola: 2046084 markings, 8174370 edges, 9844 markings/sec, 80 secs
lola: 2161077 markings, 8521046 edges, 22999 markings/sec, 85 secs
lola: 2332914 markings, 8995802 edges, 34367 markings/sec, 90 secs
lola: 2472979 markings, 9456981 edges, 28013 markings/sec, 95 secs
lola: 2574169 markings, 9962456 edges, 20238 markings/sec, 100 secs
lola: 2665935 markings, 10420264 edges, 18353 markings/sec, 105 secs
lola: 2833767 markings, 10899548 edges, 33566 markings/sec, 110 secs
lola: 2989722 markings, 11334154 edges, 31191 markings/sec, 115 secs
lola: 3103445 markings, 11836780 edges, 22745 markings/sec, 120 secs
lola: 3173243 markings, 12319399 edges, 13960 markings/sec, 125 secs
lola: 3279853 markings, 12648612 edges, 21322 markings/sec, 130 secs
lola: 3436529 markings, 13082325 edges, 31335 markings/sec, 135 secs
lola: 3578291 markings, 13525196 edges, 28352 markings/sec, 140 secs
lola: 3681414 markings, 14017769 edges, 20625 markings/sec, 145 secs
lola: 3764076 markings, 14483931 edges, 16532 markings/sec, 150 secs
lola: 3921234 markings, 14940963 edges, 31432 markings/sec, 155 secs
lola: 4066917 markings, 15338592 edges, 29137 markings/sec, 160 secs
lola: 4171521 markings, 15739270 edges, 20921 markings/sec, 165 secs
lola: 4266542 markings, 16229068 edges, 19004 markings/sec, 170 secs
lola: 4361942 markings, 16666713 edges, 19080 markings/sec, 175 secs
lola: 4528665 markings, 17135845 edges, 33345 markings/sec, 180 secs
lola: 4676188 markings, 17561317 edges, 29505 markings/sec, 185 secs
lola: 4785827 markings, 18050079 edges, 21928 markings/sec, 190 secs
lola: 4839619 markings, 18371302 edges, 10758 markings/sec, 195 secs
lola: 4944055 markings, 18804515 edges, 20887 markings/sec, 200 secs
lola: 5112671 markings, 19266731 edges, 33723 markings/sec, 205 secs
lola: 5251856 markings, 19694483 edges, 27837 markings/sec, 210 secs
lola: 5354359 markings, 20169915 edges, 20501 markings/sec, 215 secs
lola: 5420382 markings, 20606586 edges, 13205 markings/sec, 220 secs
lola: 5534774 markings, 20955466 edges, 22878 markings/sec, 225 secs
lola: 5671112 markings, 21328359 edges, 27268 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 236 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 || 50083 markings, 90623 edges, 10017 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 99986 markings, 181443 edges, 9981 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: 219609 markings, 463388 edges, 43909 markings/sec, 0 secs
lola: 398769 markings, 929544 edges, 35832 markings/sec, 5 secs
lola: 583771 markings, 1396426 edges, 37000 markings/sec, 10 secs
lola: 800899 markings, 1872644 edges, 43426 markings/sec, 15 secs
lola: 956909 markings, 2298133 edges, 31202 markings/sec, 20 secs
lola: 1148315 markings, 2741086 edges, 38281 markings/sec, 25 secs
lola: 1342758 markings, 3208588 edges, 38889 markings/sec, 30 secs
lola: 1502944 markings, 3646335 edges, 32037 markings/sec, 35 secs
lola: 1720255 markings, 4115589 edges, 43462 markings/sec, 40 secs
lola: 1893824 markings, 4561696 edges, 34714 markings/sec, 45 secs
lola: 2077532 markings, 5027931 edges, 36742 markings/sec, 50 secs
lola: 2279708 markings, 5471100 edges, 40435 markings/sec, 55 secs
lola: 2459328 markings, 5946952 edges, 35924 markings/sec, 60 secs
lola: 2657724 markings, 6420474 edges, 39679 markings/sec, 65 secs
lola: 2864286 markings, 6897117 edges, 41312 markings/sec, 70 secs
lola: 3026566 markings, 7336659 edges, 32456 markings/sec, 75 secs
lola: 3234618 markings, 7809836 edges, 41610 markings/sec, 80 secs
lola: 3431656 markings, 8285353 edges, 39408 markings/sec, 85 secs
lola: 3605408 markings, 8752073 edges, 34750 markings/sec, 90 secs
lola: 3819216 markings, 9223122 edges, 42762 markings/sec, 95 secs
lola: 4009177 markings, 9694967 edges, 37992 markings/sec, 100 secs
lola: 4183834 markings, 10164888 edges, 34931 markings/sec, 105 secs
lola: 4403917 markings, 10636790 edges, 44017 markings/sec, 110 secs
lola: 4589985 markings, 11111460 edges, 37214 markings/sec, 115 secs
lola: 4770285 markings, 11581866 edges, 36060 markings/sec, 120 secs
lola: 4989077 markings, 12052145 edges, 43758 markings/sec, 125 secs
lola: 5169726 markings, 12526770 edges, 36130 markings/sec, 130 secs
lola: 5357455 markings, 12996547 edges, 37546 markings/sec, 135 secs
lola: 5569176 markings, 13465242 edges, 42344 markings/sec, 140 secs
lola: 5742751 markings, 13927437 edges, 34715 markings/sec, 145 secs
lola: 5931579 markings, 14371575 edges, 37766 markings/sec, 150 secs
lola: 6121274 markings, 14820506 edges, 37939 markings/sec, 155 secs
lola: 6286776 markings, 15270910 edges, 33100 markings/sec, 160 secs
lola: 6496033 markings, 15723064 edges, 41851 markings/sec, 165 secs
lola: 6671658 markings, 16173942 edges, 35125 markings/sec, 170 secs
lola: 6850272 markings, 16625184 edges, 35723 markings/sec, 175 secs
lola: 7053884 markings, 17075829 edges, 40722 markings/sec, 180 secs
lola: 7223103 markings, 17528664 edges, 33844 markings/sec, 185 secs
lola: 7418121 markings, 17980795 edges, 39004 markings/sec, 190 secs
lola: 7609093 markings, 18438182 edges, 38194 markings/sec, 195 secs
lola: 7776036 markings, 18890443 edges, 33389 markings/sec, 200 secs
lola: 7986069 markings, 19343483 edges, 42007 markings/sec, 205 secs
lola: 8162376 markings, 19797110 edges, 35261 markings/sec, 210 secs
lola: 8341861 markings, 20249618 edges, 35897 markings/sec, 215 secs
lola: 8545354 markings, 20701654 edges, 40699 markings/sec, 220 secs
lola: 8711174 markings, 21146610 edges, 33164 markings/sec, 225 secs
lola: 8905207 markings, 21592092 edges, 38807 markings/sec, 230 secs
lola: 9086916 markings, 22034672 edges, 36342 markings/sec, 235 secs
lola: 9250277 markings, 22475928 edges, 32672 markings/sec, 240 secs
lola: 9459250 markings, 22917088 edges, 41795 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 || 51058 markings, 99715 edges, 10212 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 || 42616 markings, 112357 edges, 8523 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 || 44300 markings, 118408 edges, 8860 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: 50988 markings, 106779 edges, 10198 markings/sec, 0 secs
lola: 101264 markings, 206241 edges, 10055 markings/sec, 5 secs
lola: 150453 markings, 299774 edges, 9838 markings/sec, 10 secs
lola: 202833 markings, 399608 edges, 10476 markings/sec, 15 secs
lola: 257797 markings, 504070 edges, 10993 markings/sec, 20 secs
lola: 310259 markings, 604071 edges, 10492 markings/sec, 25 secs
lola: 362446 markings, 703639 edges, 10437 markings/sec, 30 secs
lola: 414547 markings, 802906 edges, 10420 markings/sec, 35 secs
lola: 467897 markings, 904193 edges, 10670 markings/sec, 40 secs
lola: 521578 markings, 1007591 edges, 10736 markings/sec, 45 secs
lola: 575078 markings, 1110973 edges, 10700 markings/sec, 50 secs
lola: 628614 markings, 1214602 edges, 10707 markings/sec, 55 secs
lola: 674991 markings, 1317280 edges, 9275 markings/sec, 60 secs
lola: 709173 markings, 1394638 edges, 6836 markings/sec, 65 secs
lola: 740236 markings, 1467939 edges, 6213 markings/sec, 70 secs
lola: 777299 markings, 1549812 edges, 7413 markings/sec, 75 secs
lola: 820842 markings, 1640811 edges, 8709 markings/sec, 80 secs
lola: 854480 markings, 1717838 edges, 6728 markings/sec, 85 secs
lola: 885268 markings, 1790448 edges, 6158 markings/sec, 90 secs
lola: 936229 markings, 1896682 edges, 10192 markings/sec, 95 secs
lola: 989445 markings, 2005394 edges, 10643 markings/sec, 100 secs
lola: 1041913 markings, 2113531 edges, 10494 markings/sec, 105 secs
lola: 1085186 markings, 2214696 edges, 8655 markings/sec, 110 secs
lola: 1137464 markings, 2320739 edges, 10456 markings/sec, 115 secs
lola: 1185979 markings, 2419960 edges, 9703 markings/sec, 120 secs
lola: 1233316 markings, 2516470 edges, 9467 markings/sec, 125 secs
lola: 1278472 markings, 2608928 edges, 9031 markings/sec, 130 secs
lola: 1326352 markings, 2706811 edges, 9576 markings/sec, 135 secs
lola: 1386799 markings, 2824607 edges, 12089 markings/sec, 140 secs
lola: 1442472 markings, 2930586 edges, 11135 markings/sec, 145 secs
lola: 1491206 markings, 3031151 edges, 9747 markings/sec, 150 secs
lola: 1546972 markings, 3145140 edges, 11153 markings/sec, 155 secs
lola: 1602218 markings, 3257942 edges, 11049 markings/sec, 160 secs
lola: 1658587 markings, 3372991 edges, 11274 markings/sec, 165 secs
lola: 1715433 markings, 3488854 edges, 11369 markings/sec, 170 secs
lola: 1770965 markings, 3602317 edges, 11106 markings/sec, 175 secs
lola: 1826140 markings, 3714960 edges, 11035 markings/sec, 180 secs
lola: 1881871 markings, 3828898 edges, 11146 markings/sec, 185 secs
lola: 1897401 markings, 3936617 edges, 3106 markings/sec, 190 secs
lola: 1910429 markings, 4044393 edges, 2606 markings/sec, 195 secs
lola: 1923814 markings, 4151483 edges, 2677 markings/sec, 200 secs
lola: 1935933 markings, 4258875 edges, 2424 markings/sec, 205 secs
lola: 1948032 markings, 4366320 edges, 2420 markings/sec, 210 secs
lola: 1960129 markings, 4473320 edges, 2419 markings/sec, 215 secs
lola: 2010326 markings, 4604786 edges, 10039 markings/sec, 220 secs
lola: 2033077 markings, 4723406 edges, 4550 markings/sec, 225 secs
lola: 2074995 markings, 4841159 edges, 8384 markings/sec, 230 secs
lola: 2128185 markings, 4943954 edges, 10638 markings/sec, 235 secs
lola: 2181793 markings, 5047531 edges, 10722 markings/sec, 240 secs
lola: 2231487 markings, 5140557 edges, 9939 markings/sec, 245 secs
lola: 2265127 markings, 5229585 edges, 6728 markings/sec, 250 secs
lola: 2299006 markings, 5306035 edges, 6776 markings/sec, 255 secs
lola: 2344598 markings, 5398199 edges, 9118 markings/sec, 260 secs
lola: 2378868 markings, 5476389 edges, 6854 markings/sec, 265 secs
lola: 2408974 markings, 5546552 edges, 6021 markings/sec, 270 secs
lola: 2442408 markings, 5622860 edges, 6687 markings/sec, 275 secs
lola: 2477687 markings, 5702293 edges, 7056 markings/sec, 280 secs
lola: 2532414 markings, 5814010 edges, 10945 markings/sec, 285 secs
lola: 2582336 markings, 5916469 edges, 9984 markings/sec, 290 secs
lola: 2634399 markings, 6023676 edges, 10413 markings/sec, 295 secs
lola: 2678887 markings, 6125925 edges, 8898 markings/sec, 300 secs
lola: 2729478 markings, 6229762 edges, 10118 markings/sec, 305 secs
lola: 2776788 markings, 6326217 edges, 9462 markings/sec, 310 secs
lola: 2822626 markings, 6420258 edges, 9168 markings/sec, 315 secs
lola: 2869706 markings, 6516176 edges, 9416 markings/sec, 320 secs
lola: 2920527 markings, 6619841 edges, 10164 markings/sec, 325 secs
lola: 2983207 markings, 6738891 edges, 12536 markings/sec, 330 secs
lola: 3035819 markings, 6842703 edges, 10522 markings/sec, 335 secs
lola: 3088067 markings, 6950256 edges, 10450 markings/sec, 340 secs
lola: 3144701 markings, 7065399 edges, 11327 markings/sec, 345 secs
lola: 3199453 markings, 7177350 edges, 10950 markings/sec, 350 secs
lola: 3255810 markings, 7292428 edges, 11271 markings/sec, 355 secs
lola: 3311647 markings, 7406581 edges, 11167 markings/sec, 360 secs
lola: 3366708 markings, 7518967 edges, 11012 markings/sec, 365 secs
lola: 3421945 markings, 7631753 edges, 11047 markings/sec, 370 secs
lola: 3471814 markings, 7742745 edges, 9974 markings/sec, 375 secs
lola: 3484186 markings, 7850272 edges, 2474 markings/sec, 380 secs
lola: 3497314 markings, 7957772 edges, 2626 markings/sec, 385 secs
lola: 3510705 markings, 8065884 edges, 2678 markings/sec, 390 secs
lola: 3522827 markings, 8171993 edges, 2424 markings/sec, 395 secs
lola: 3534921 markings, 8277988 edges, 2419 markings/sec, 400 secs
lola: 3547020 markings, 8385433 edges, 2420 markings/sec, 405 secs
lola: 3608631 markings, 8522293 edges, 12322 markings/sec, 410 secs
lola: 3617873 markings, 8637649 edges, 1848 markings/sec, 415 secs
lola: 3671022 markings, 8757027 edges, 10630 markings/sec, 420 secs
lola: 3723895 markings, 8859633 edges, 10575 markings/sec, 425 secs
lola: 3777755 markings, 8963516 edges, 10772 markings/sec, 430 secs
lola: 3824125 markings, 9054879 edges, 9274 markings/sec, 435 secs
lola: 3858928 markings, 9143684 edges, 6961 markings/sec, 440 secs
lola: 3903385 markings, 9236063 edges, 8891 markings/sec, 445 secs
lola: 3934070 markings, 9307997 edges, 6137 markings/sec, 450 secs
lola: 3968041 markings, 9385351 edges, 6794 markings/sec, 455 secs
lola: 4004760 markings, 9466919 edges, 7344 markings/sec, 460 secs
lola: 4048187 markings, 9557739 edges, 8685 markings/sec, 465 secs
lola: 4084281 markings, 9641063 edges, 7219 markings/sec, 470 secs
lola: 4138556 markings, 9752244 edges, 10855 markings/sec, 475 secs
lola: 4192038 markings, 9861381 edges, 10696 markings/sec, 480 secs
lola: 4243068 markings, 9965859 edges, 10206 markings/sec, 485 secs
lola: 4289829 markings, 10074407 edges, 9352 markings/sec, 490 secs
lola: 4340623 markings, 10178035 edges, 10159 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 || 46962 markings, 90705 edges, 9392 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 2507 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 2507 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
----- Kill lola and sara stderr -----
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 -----
----- Finished stderr -----
----- Finished stdout -----

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-full"
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-full"
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 r090-blw7-152650001200206"
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 ;