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 2.0M
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 52K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 147K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.6M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBNT-PT-S05J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265600445
=====================================================================

--------------------
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 PolyORBNT-PT-S05J20-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527482678123


BK_STOP 1527483536271

--------------------
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 PolyORBNT-PT-S05J20 as instance name.
Using PolyORBNT as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 841424, 'Memory': 15934.85, 'Tool': 'lola'}, {'Time': 860550, 'Memory': 15928.8, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBNT-PT-S05J20...

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


checking for too many tokens
===========================================================================================
PolyORBNT-PT-S05J20: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PolyORBNT-PT-S05J20 @ 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: 1559/65536 symbol table entries, 146 collisions
lola: preprocessing...
lola: finding significant places
lola: 349 places, 1210 transitions, 287 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 668 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-PT-S05J20-LTLCardinality.task
lola: A ((3 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20)) : A (G ((F ((1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)) U F ((2 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16))))) : A (G ((cJobCnt <= place_520_1))) : A (F (F (G (X ((2 <= place_782_1)))))) : A ((X (X ((2 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9))) U X (G ((place_522_1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20))))) : A (F (F (((2 <= place_522_1) U (3 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))))) : A ((X ((1 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16)) U G (G ((3 <= mi1))))) : A (X (G ((ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + ModifiedSrc_5 <= Schedule_Task_B_1)))) : A (F ((CreatedJobs_15_1 <= Perform_Work_B_1_14))) : A (F (F (F (F ((f2_3 <= CreatedJobs_9_4)))))) : A (F ((TheSour_4 <= CreatedJobs_18_4))) : A (F (F (X (X ((FetchJobE_1_4 <= CreatedJobs_5_4)))))) : A (X (G ((QueueJobB_1_0 <= CreatedJobs_13_3)))) : A (G ((CreatedJobs_1_2 <= QueueJobB_1_18))) : A (G ((2 <= mo2))) : A (G (X (((Perform_Work_B_1_10 <= Schedule_Task_E_1_PerformWork_10) U (Schedule_Task_E_1_PerformWork_1 <= FetchJobE_1_2)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perfo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_... (shortened)
lola: processed formula length: 456
lola: 1 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.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: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)) U F ((2 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + Ava... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)) U F ((2 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16)))))
lola: processed formula: A (G ((F ((1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)) U F ((2 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + Ava... (shortened)
lola: processed formula length: 499
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 118396 markings, 178628 edges, 23679 markings/sec, 0 secs
lola: 241398 markings, 358956 edges, 24600 markings/sec, 5 secs
lola: 350189 markings, 518215 edges, 21758 markings/sec, 10 secs
lola: 440020 markings, 644441 edges, 17966 markings/sec, 15 secs
lola: 531461 markings, 773764 edges, 18288 markings/sec, 20 secs
lola: 614960 markings, 893070 edges, 16700 markings/sec, 25 secs
lola: 701359 markings, 1016915 edges, 17280 markings/sec, 30 secs
lola: 794127 markings, 1146242 edges, 18554 markings/sec, 35 secs
lola: 873131 markings, 1260650 edges, 15801 markings/sec, 40 secs
lola: 963251 markings, 1388742 edges, 18024 markings/sec, 45 secs
lola: 1046140 markings, 1509519 edges, 16578 markings/sec, 50 secs
lola: 1129419 markings, 1631735 edges, 16656 markings/sec, 55 secs
lola: 1210749 markings, 1749565 edges, 16266 markings/sec, 60 secs
lola: 1293331 markings, 1871182 edges, 16516 markings/sec, 65 secs
lola: 1374036 markings, 1992291 edges, 16141 markings/sec, 70 secs
lola: 1458843 markings, 2121530 edges, 16961 markings/sec, 75 secs
lola: 1544429 markings, 2256573 edges, 17117 markings/sec, 80 secs
lola: 1619070 markings, 2387715 edges, 14928 markings/sec, 85 secs
lola: 1677995 markings, 2476905 edges, 11785 markings/sec, 90 secs
lola: 1737097 markings, 2575720 edges, 11820 markings/sec, 95 secs
lola: 1795082 markings, 2663854 edges, 11597 markings/sec, 100 secs
lola: 1856956 markings, 2761901 edges, 12375 markings/sec, 105 secs
lola: 1912058 markings, 2850740 edges, 11020 markings/sec, 110 secs
lola: 1974903 markings, 2948113 edges, 12569 markings/sec, 115 secs
lola: 2025047 markings, 3031886 edges, 10029 markings/sec, 120 secs
lola: 2083913 markings, 3121846 edges, 11773 markings/sec, 125 secs
lola: 2142224 markings, 3219302 edges, 11662 markings/sec, 130 secs
lola: 2198855 markings, 3305675 edges, 11326 markings/sec, 135 secs
lola: 2256507 markings, 3402693 edges, 11530 markings/sec, 140 secs
lola: 2313980 markings, 3489346 edges, 11495 markings/sec, 145 secs
lola: 2372375 markings, 3585811 edges, 11679 markings/sec, 150 secs
lola: 2429500 markings, 3674871 edges, 11425 markings/sec, 155 secs
lola: 2486983 markings, 3771603 edges, 11497 markings/sec, 160 secs
lola: 2544754 markings, 3859182 edges, 11554 markings/sec, 165 secs
lola: 2604031 markings, 3956531 edges, 11855 markings/sec, 170 secs
lola: 2667346 markings, 4053444 edges, 12663 markings/sec, 175 secs
lola: 2720575 markings, 4145916 edges, 10646 markings/sec, 180 secs
lola: 2778458 markings, 4237118 edges, 11577 markings/sec, 185 secs
lola: 2837612 markings, 4333616 edges, 11831 markings/sec, 190 secs
lola: 2896847 markings, 4431487 edges, 11847 markings/sec, 195 secs
lola: 2960608 markings, 4529025 edges, 12752 markings/sec, 200 secs
lola: 3013317 markings, 4620342 edges, 10542 markings/sec, 205 secs
lola: 3072201 markings, 4713655 edges, 11777 markings/sec, 210 secs
lola: 3130264 markings, 4808340 edges, 11613 markings/sec, 215 secs
lola: 3189584 markings, 4907826 edges, 11864 markings/sec, 220 secs
lola: 3249633 markings, 5005284 edges, 12010 markings/sec, 225 secs
lola: 3311305 markings, 5101627 edges, 12334 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: A (G ((cJobCnt <= place_520_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1148 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((2 <= place_782_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((2 <= place_782_1)))))
lola: processed formula: A (F (G (X ((2 <= place_782_1)))))
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((2 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9))) U X (G ((place_522_1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((2 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)) U G ((place_522_1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20)))))
lola: processed formula: A (X ((X ((2 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)) U G ((place_522_1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1... (shortened)
lola: processed formula length: 649
lola: 1 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 704368 markings, 1952379 edges, 140874 markings/sec, 0 secs
lola: 1390467 markings, 3885405 edges, 137220 markings/sec, 5 secs
lola: 2087331 markings, 5846799 edges, 139373 markings/sec, 10 secs
lola: 2719300 markings, 7664006 edges, 126394 markings/sec, 15 secs
lola: 3334071 markings, 9434637 edges, 122954 markings/sec, 20 secs
lola: 3918180 markings, 11125935 edges, 116822 markings/sec, 25 secs
lola: 4501963 markings, 12872537 edges, 116757 markings/sec, 30 secs
lola: 5072748 markings, 14600422 edges, 114157 markings/sec, 35 secs
lola: 5564517 markings, 16148132 edges, 98354 markings/sec, 40 secs
lola: 6017438 markings, 17734661 edges, 90584 markings/sec, 45 secs
lola: 6562079 markings, 19506252 edges, 108928 markings/sec, 50 secs
lola: 7232344 markings, 21380432 edges, 134053 markings/sec, 55 secs
lola: 7874839 markings, 23215804 edges, 128499 markings/sec, 60 secs
lola: 8488571 markings, 24952952 edges, 122746 markings/sec, 65 secs
lola: 9058692 markings, 26589165 edges, 114024 markings/sec, 70 secs
lola: 9666750 markings, 28362177 edges, 121612 markings/sec, 75 secs
lola: 10218187 markings, 29991295 edges, 110287 markings/sec, 80 secs
lola: 10788375 markings, 31701311 edges, 114038 markings/sec, 85 secs
lola: 11303303 markings, 33407065 edges, 102986 markings/sec, 90 secs
lola: 11809253 markings, 35009197 edges, 101190 markings/sec, 95 secs
lola: 12277338 markings, 36639934 edges, 93617 markings/sec, 100 secs
lola: 12931862 markings, 38496611 edges, 130905 markings/sec, 105 secs
lola: 13541257 markings, 40217113 edges, 121879 markings/sec, 110 secs
lola: 14192073 markings, 42078613 edges, 130163 markings/sec, 115 secs
lola: 14747049 markings, 43662528 edges, 110995 markings/sec, 120 secs
lola: 15347368 markings, 45427548 edges, 120064 markings/sec, 125 secs
lola: 15886756 markings, 47014360 edges, 107878 markings/sec, 130 secs
lola: 16462262 markings, 48746976 edges, 115101 markings/sec, 135 secs
lola: 16952246 markings, 50407370 edges, 97997 markings/sec, 140 secs
lola: 17456169 markings, 51988042 edges, 100785 markings/sec, 145 secs
lola: 17926239 markings, 53608365 edges, 94014 markings/sec, 150 secs
lola: 18550810 markings, 55371757 edges, 124914 markings/sec, 155 secs
lola: 19122491 markings, 56994838 edges, 114336 markings/sec, 160 secs
lola: 19679344 markings, 58570109 edges, 111371 markings/sec, 165 secs
lola: 20193242 markings, 60067784 edges, 102780 markings/sec, 170 secs
lola: 20727105 markings, 61620361 edges, 106773 markings/sec, 175 secs
lola: 21303884 markings, 63381900 edges, 115356 markings/sec, 180 secs
lola: 21827341 markings, 65080721 edges, 104691 markings/sec, 185 secs
lola: 22377697 markings, 66684879 edges, 110071 markings/sec, 190 secs
lola: 22843017 markings, 68290443 edges, 93064 markings/sec, 195 secs
lola: 23332804 markings, 69873648 edges, 97957 markings/sec, 200 secs
lola: 23906383 markings, 71510546 edges, 114716 markings/sec, 205 secs
lola: 24427610 markings, 72994447 edges, 104245 markings/sec, 210 secs
lola: 24995363 markings, 74585739 edges, 113551 markings/sec, 215 secs
lola: 25539294 markings, 76175770 edges, 108786 markings/sec, 220 secs
lola: 26056031 markings, 77660913 edges, 103347 markings/sec, 225 secs
lola: 26578959 markings, 79219277 edges, 104586 markings/sec, 230 secs
lola: 26728192 markings, 79669727 edges, 29847 markings/sec, 235 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((2 <= place_522_1) U (3 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= place_522_1) U (3 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))))
lola: processed formula: A (F (((2 <= place_522_1) U (3 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))))
lola: processed formula length: 115
lola: 1 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 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: 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 6 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((1 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16)) U G (G ((3 <= mi1)))))
lola: processed formula: A ((X ((1 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17... (shortened)
lola: processed formula length: 445
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 30 edges
lola: ========================================
lola: subprocess 7 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + ModifiedSrc_5 <= Schedule_Task_B_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + ModifiedSrc_5 <= Schedule_Task_B_1))))
lola: processed formula: A (X (G ((ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + ModifiedSrc_5 <= Schedule_Task_B_1))))
lola: processed formula length: 112
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CreatedJobs_15_1 <= Perform_Work_B_1_14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((CreatedJobs_15_1 <= Perform_Work_B_1_14)))
lola: processed formula: A (F ((CreatedJobs_15_1 <= Perform_Work_B_1_14)))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 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: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (F ((f2_3 <= CreatedJobs_9_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((f2_3 <= CreatedJobs_9_4)))
lola: processed formula: A (F ((f2_3 <= CreatedJobs_9_4)))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 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: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((TheSour_4 <= CreatedJobs_18_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((TheSour_4 <= CreatedJobs_18_4)))
lola: processed formula: A (F ((TheSour_4 <= CreatedJobs_18_4)))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 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: 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: 41 markings, 41 edges
lola: ========================================
lola: subprocess 11 will run for 611 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (X ((FetchJobE_1_4 <= CreatedJobs_5_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X ((FetchJobE_1_4 <= CreatedJobs_5_4)))))
lola: processed formula: A (F (X (X ((FetchJobE_1_4 <= CreatedJobs_5_4)))))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 23 markings, 37 edges
lola: ========================================
lola: subprocess 12 will run for 763 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((QueueJobB_1_0 <= CreatedJobs_13_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((QueueJobB_1_0 <= CreatedJobs_13_3))))
lola: processed formula: A (X (G ((QueueJobB_1_0 <= CreatedJobs_13_3))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1796 markings, 4284 edges
lola: ========================================
lola: subprocess 13 will run for 1018 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((CreatedJobs_1_2 <= QueueJobB_1_18)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1148 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 14 will run for 1527 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= mo2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1148 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3055 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((Perform_Work_B_1_10 <= Schedule_Task_E_1_PerformWork_10) U (Schedule_Task_E_1_PerformWork_1 <= FetchJobE_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (((Perform_Work_B_1_10 <= Schedule_Task_E_1_PerformWork_10) U (Schedule_Task_E_1_PerformWork_1 <= FetchJobE_1_2)))))
lola: processed formula: A (G (X (((Perform_Work_B_1_10 <= Schedule_Task_E_1_PerformWork_10) U (Schedule_Task_E_1_PerformWork_1 <= FetchJobE_1_2)))))
lola: processed formula length: 124
lola: 0 rewrites
lola: formula mentions 0 of 349 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1152 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 823503 markings, 2264557 edges, 164701 markings/sec, 0 secs
lola: 1609233 markings, 4458641 edges, 157146 markings/sec, 5 secs
lola: 2330205 markings, 6529259 edges, 144194 markings/sec, 10 secs
lola: 3116591 markings, 8702909 edges, 157277 markings/sec, 15 secs
lola: 3852867 markings, 10824589 edges, 147255 markings/sec, 20 secs
lola: 4598529 markings, 12895094 edges, 149132 markings/sec, 25 secs
lola: 5236287 markings, 14739223 edges, 127552 markings/sec, 30 secs
lola: 5966718 markings, 16824552 edges, 146086 markings/sec, 35 secs
lola: 6630333 markings, 18767258 edges, 132723 markings/sec, 40 secs
lola: 7334737 markings, 20813435 edges, 140881 markings/sec, 45 secs
lola: 7955455 markings, 22604166 edges, 124144 markings/sec, 50 secs
lola: 8601381 markings, 24555533 edges, 129185 markings/sec, 55 secs
lola: 9290342 markings, 26592739 edges, 137792 markings/sec, 60 secs
lola: 9917779 markings, 28529337 edges, 125487 markings/sec, 65 secs
lola: 10554119 markings, 30472365 edges, 127268 markings/sec, 70 secs
lola: 11094261 markings, 32186514 edges, 108028 markings/sec, 75 secs
lola: 11621391 markings, 34051962 edges, 105426 markings/sec, 80 secs
lola: 12146239 markings, 35875174 edges, 104970 markings/sec, 85 secs
lola: 12701787 markings, 37802975 edges, 111110 markings/sec, 90 secs
lola: 13482763 markings, 39999505 edges, 156195 markings/sec, 95 secs
lola: 14207578 markings, 42066088 edges, 144963 markings/sec, 100 secs
lola: 15012811 markings, 44314822 edges, 161047 markings/sec, 105 secs
lola: 15704189 markings, 46310727 edges, 138276 markings/sec, 110 secs
lola: 16402749 markings, 48260667 edges, 139712 markings/sec, 115 secs
lola: 17114097 markings, 50324553 edges, 142270 markings/sec, 120 secs
lola: 17765175 markings, 52177016 edges, 130216 markings/sec, 125 secs
lola: 18423969 markings, 54082708 edges, 131759 markings/sec, 130 secs
lola: 19127381 markings, 56134151 edges, 140682 markings/sec, 135 secs
lola: 19790249 markings, 58079652 edges, 132574 markings/sec, 140 secs
lola: 20432754 markings, 59972459 edges, 128501 markings/sec, 145 secs
lola: 21084669 markings, 61933502 edges, 130383 markings/sec, 150 secs
lola: 21756839 markings, 63962379 edges, 134434 markings/sec, 155 secs
lola: 22366046 markings, 65902819 edges, 121841 markings/sec, 160 secs
lola: 22907723 markings, 67807898 edges, 108335 markings/sec, 165 secs
lola: 23524527 markings, 69697327 edges, 123361 markings/sec, 170 secs
lola: 24023487 markings, 71550759 edges, 99792 markings/sec, 175 secs
lola: 24644818 markings, 73545161 edges, 124266 markings/sec, 180 secs
lola: 25354505 markings, 75559683 edges, 141937 markings/sec, 185 secs
lola: 26105623 markings, 77660259 edges, 150224 markings/sec, 190 secs
lola: 26799393 markings, 79610783 edges, 138754 markings/sec, 195 secs
lola: 27459427 markings, 81525535 edges, 132007 markings/sec, 200 secs
lola: 28237079 markings, 83725277 edges, 155530 markings/sec, 205 secs
lola: 28891143 markings, 85602292 edges, 130813 markings/sec, 210 secs
lola: 29513323 markings, 87386835 edges, 124436 markings/sec, 215 secs
lola: 30200049 markings, 89384766 edges, 137345 markings/sec, 220 secs
lola: 30892729 markings, 91420589 edges, 138536 markings/sec, 225 secs
lola: 31503997 markings, 93220076 edges, 122254 markings/sec, 230 secs
lola: 32153108 markings, 95150451 edges, 129822 markings/sec, 235 secs
lola: 32791179 markings, 97100905 edges, 127614 markings/sec, 240 secs
lola: 33364925 markings, 98974421 edges, 114749 markings/sec, 245 secs
lola: 33919277 markings, 100861614 edges, 110870 markings/sec, 250 secs
lola: 34513155 markings, 102632461 edges, 118776 markings/sec, 255 secs
lola: 35020125 markings, 104455493 edges, 101394 markings/sec, 260 secs
lola: 35489789 markings, 106167329 edges, 93933 markings/sec, 265 secs
lola: 36222557 markings, 108256846 edges, 146554 markings/sec, 270 secs
lola: 36925571 markings, 110246144 edges, 140603 markings/sec, 275 secs
lola: 37590933 markings, 112137712 edges, 133072 markings/sec, 280 secs
lola: 38232373 markings, 113955188 edges, 128288 markings/sec, 285 secs
lola: 38931669 markings, 115924701 edges, 139859 markings/sec, 290 secs
lola: 39552163 markings, 117735175 edges, 124099 markings/sec, 295 secs
lola: 40242563 markings, 119685629 edges, 138080 markings/sec, 300 secs
lola: 40887331 markings, 121551415 edges, 128954 markings/sec, 305 secs
lola: 41481952 markings, 123324454 edges, 118924 markings/sec, 310 secs
lola: 42144185 markings, 125296022 edges, 132447 markings/sec, 315 secs
lola: 42764626 markings, 127291889 edges, 124088 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no unknown no no no yes yes no yes no no no unknown
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="PolyORBNT-PT-S05J20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-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/PolyORBNT-PT-S05J20.tgz
mv PolyORBNT-PT-S05J20 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 mcc4mcc-full"
echo " Input is PolyORBNT-PT-S05J20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r214-smll-152732265600445"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;