fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r214-smll-152732265600461
Last Updated
June 26, 2018

About the Execution of M4M.full for PolyORBNT-PT-S10J60

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2129.830 361033.00 360559.00 2206.50 ???????????????? normal

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 22M
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 271K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 795K 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 9.2K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 121K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K 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 494K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 30K 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 19M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBNT-PT-S10J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265600461
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527484931867


BK_STOP 1527485292900

--------------------
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-S10J60 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': 1319155, 'Memory': 15952.39, 'Tool': 'lola'}, {'Time': 1324677, 'Memory': 15942.18, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBNT-PT-S10J60...

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


checking for too many tokens
===========================================================================================
PolyORBNT-PT-S10J60: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBNT-PT-S10J60 @ 3538 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 14154/65536 symbol table entries, 4750 collisions
lola: preprocessing...
lola: finding significant places
lola: 1234 places, 12920 transitions, 1082 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3498 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-PT-S10J60-LTLCardinality.task
lola: A ((1 <= block)) : A (G ((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + QueueJobB_1_23 + QueueJobB_1_24 + QueueJobB_1_25 + QueueJobB_1_26 + QueueJobB_1_27 + QueueJobB_1_28 + QueueJobB_1_29 + QueueJobB_1_30 + QueueJobB_1_31 + QueueJobB_1_32 + QueueJobB_1_33 + QueueJobB_1_34 + QueueJobB_1_35 + QueueJobB_1_36 + QueueJobB_1_37 + QueueJobB_1_38 + QueueJobB_1_39 + QueueJobB_1_40 + QueueJobB_1_41 + QueueJobB_1_42 + QueueJobB_1_43 + QueueJobB_1_44 + QueueJobB_1_45 + QueueJobB_1_46 + QueueJobB_1_47 + QueueJobB_1_48 + QueueJobB_1_49 + QueueJobB_1_50 + QueueJobB_1_51 + QueueJobB_1_52 + QueueJobB_1_53 + QueueJobB_1_54 + QueueJobB_1_55 + QueueJobB_1_56 + QueueJobB_1_57 + QueueJobB_1_58 + QueueJobB_1_59 + QueueJobB_1_60 <= Try_Check_Sources_E_1))) : A ((Try_Check_Sources_E_1 <= mo2)) : A ((place_458 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + FetchJobE_1_23 + FetchJobE_1_24 + FetchJobE_1_25 + FetchJobE_1_26 + FetchJobE_1_27 + FetchJobE_1_28 + FetchJobE_1_29 + FetchJobE_1_30 + FetchJobE_1_31 + FetchJobE_1_32 + FetchJobE_1_33 + FetchJobE_1_34 + FetchJobE_1_35 + FetchJobE_1_36 + FetchJobE_1_37 + FetchJobE_1_38 + FetchJobE_1_39 + FetchJobE_1_40 + FetchJobE_1_41 + FetchJobE_1_42 + FetchJobE_1_43 + FetchJobE_1_44 + FetchJobE_1_45 + FetchJobE_1_46 + FetchJobE_1_47 + FetchJobE_1_48 + FetchJobE_1_49 + FetchJobE_1_50 + FetchJobE_1_51 + FetchJobE_1_52 + FetchJobE_1_53 + FetchJobE_1_54 + FetchJobE_1_55 + FetchJobE_1_56 + FetchJobE_1_57 + FetchJobE_1_58 + FetchJobE_1_59 + FetchJobE_1_60)) : A (X ((NotifyEventJobQueuedE_1 <= mi3))) : A ((3 <= place_518_1)) : A ((G (G ((place_520_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 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60))) U G (F ((1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + QueueJobB_1_23 + QueueJobB_1_24 + QueueJobB_1_25 + QueueJobB_1_26 + QueueJobB_1_27 + QueueJobB_1_28 + QueueJobB_1_29 + QueueJobB_1_30 + QueueJobB_1_31 + QueueJobB_1_32 + QueueJobB_1_33 + QueueJobB_1_34 + QueueJobB_1_35 + QueueJobB_1_36 + QueueJobB_1_37 + QueueJobB_1_38 + QueueJobB_1_39 + QueueJobB_1_40 + QueueJobB_1_41 + QueueJobB_1_42 + QueueJobB_1_43 + QueueJobB_1_44 + QueueJobB_1_45 + QueueJobB_1_46 + QueueJobB_1_47 + QueueJobB_1_48 + QueueJobB_1_49 + QueueJobB_1_50 + QueueJobB_1_51 + QueueJobB_1_52 + QueueJobB_1_53 + QueueJobB_1_54 + QueueJobB_1_55 + QueueJobB_1_56 + QueueJobB_1_57 + QueueJobB_1_58 + QueueJobB_1_59 + QueueJobB_1_60))))) : A ((((mi3 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40 + f1_41 + f1_42 + f1_43 + f1_44 + f1_45 + f1_46 + f1_47 + f1_48 + f1_49 + f1_50 + f1_51 + f1_52 + f1_53 + f1_54 + f1_55 + f1_56 + f1_57 + f1_58 + f1_59 + f1_60) U (block <= 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 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60)) U ((3 <= place_518_1) U (place_456 <= QueueJobE_1)))) : A (G (F ((place_782_1 <= CreatedJobs_34_8)))) : A (F (F (G (G ((CreatedJobs_54_9 <= CreatedJobs_59_5)))))) : A ((FetchJobE_1_38 <= CreatedJobs_47_4)) : A ((G (X ((QueueJobB_1_41 <= CreatedJobs_39_9))) U X (G ((NotifyEventJobQueuedB_1_10 <= CreatedJobs_39_1))))) : A (X (G (G (F ((CreatedJobs_28_8 <= Perform_Work_B_1_48)))))) : A ((Perform_Work_B_1_36 <= CreatedJobs_56_8)) : A ((((CreatedJobs_4_5 <= QueueJobB_1_9) U (place_521_1 <= QueueJobB_1_59)) U F (F ((CreatedJobs_33_10 <= CreatedJobs_56_10))))) : A ((CreatedJobs_28_6 <= CreatedJobs_8_7))
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 ((1 <= block))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= block)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J60-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + QueueJobB_1_... (shortened)
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 4328 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: 47 markings, 46 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((Try_Check_Sources_E_1 <= mo2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Try_Check_Sources_E_1 <= mo2)
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J60-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((place_458 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + Fe... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (place_458 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + Fetch... (shortened)
lola: processed formula length: 1039
lola: 1 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J60-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NotifyEventJobQueuedE_1 <= mi3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NotifyEventJobQueuedE_1 <= mi3)))
lola: processed formula: A (X ((NotifyEventJobQueuedE_1 <= mi3)))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J60-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4332 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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= place_518_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= place_518_1)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J60-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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((place_520_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_Wo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((place_520_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 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60))) U G (F ((1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + QueueJobB_1_23 + QueueJobB_1_24 + QueueJobB_1_25 + QueueJobB_1_26 + QueueJobB_1_27 + QueueJobB_1_28 + QueueJobB_1_29 + QueueJobB_1_30 + QueueJobB_1_31 + QueueJobB_1_32 + QueueJobB_1_33 + QueueJobB_1_34 + QueueJobB_1_35 + QueueJobB_1_36 + QueueJobB_1_37 + QueueJobB_1_38 + QueueJobB_1_39 + QueueJobB_1_40 + QueueJobB_1_41 + QueueJobB_1_42 + QueueJobB_1_43 + QueueJobB_1_44 + QueueJobB_1_45 + QueueJobB_1_46 + QueueJobB_1_47 + QueueJobB_1_48 + QueueJobB_1_49 + QueueJobB_1_50 + QueueJobB_1_51 + QueueJobB_1_52 + QueueJobB_1_53 + QueueJobB_1_54 + QueueJobB_1_55 + QueueJobB_1_56 + QueueJobB_1_57 + QueueJobB_1_58 + QueueJobB_1_59 + QueueJobB_1_60)))))
lola: processed formula: A ((G (G ((place_520_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_Wo... (shortened)
lola: processed formula length: 2402
lola: 0 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-PT-S10J60-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4332 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 16363 markings, 18781 edges, 3273 markings/sec, 0 secs
lola: 33522 markings, 39273 edges, 3432 markings/sec, 5 secs
lola: 50397 markings, 59425 edges, 3375 markings/sec, 10 secs
lola: 67014 markings, 79247 edges, 3323 markings/sec, 15 secs
lola: 83418 markings, 99073 edges, 3281 markings/sec, 20 secs
lola: 99796 markings, 118838 edges, 3276 markings/sec, 25 secs
lola: 116175 markings, 138632 edges, 3276 markings/sec, 30 secs
lola: 132578 markings, 158352 edges, 3281 markings/sec, 35 secs
lola: 148528 markings, 177868 edges, 3190 markings/sec, 40 secs
lola: 164526 markings, 197391 edges, 3200 markings/sec, 45 secs
lola: 180572 markings, 216932 edges, 3209 markings/sec, 50 secs
lola: 196535 markings, 236423 edges, 3193 markings/sec, 55 secs
lola: 212282 markings, 255787 edges, 3149 markings/sec, 60 secs
lola: 228045 markings, 275252 edges, 3153 markings/sec, 65 secs
lola: 243205 markings, 294113 edges, 3032 markings/sec, 70 secs
lola: 258372 markings, 313039 edges, 3033 markings/sec, 75 secs
lola: 273310 markings, 331698 edges, 2988 markings/sec, 80 secs
lola: 288154 markings, 350287 edges, 2969 markings/sec, 85 secs
lola: 303854 markings, 369569 edges, 3140 markings/sec, 90 secs
lola: 319736 markings, 388932 edges, 3176 markings/sec, 95 secs
lola: 335382 markings, 408096 edges, 3129 markings/sec, 100 secs
lola: 350825 markings, 427156 edges, 3089 markings/sec, 105 secs
lola: 366554 markings, 446580 edges, 3146 markings/sec, 110 secs
lola: 381830 markings, 465614 edges, 3055 markings/sec, 115 secs
lola: 396177 markings, 483970 edges, 2869 markings/sec, 120 secs
lola: 410045 markings, 501886 edges, 2774 markings/sec, 125 secs
lola: 423137 markings, 519256 edges, 2618 markings/sec, 130 secs
lola: 438990 markings, 538645 edges, 3171 markings/sec, 135 secs
lola: 454128 markings, 557435 edges, 3028 markings/sec, 140 secs
lola: 468954 markings, 576078 edges, 2965 markings/sec, 145 secs
lola: 483214 markings, 594300 edges, 2852 markings/sec, 150 secs
lola: 496754 markings, 612002 edges, 2708 markings/sec, 155 secs
lola: 509551 markings, 629150 edges, 2559 markings/sec, 160 secs
lola: 524734 markings, 648023 edges, 3037 markings/sec, 165 secs
lola: 538814 markings, 666120 edges, 2816 markings/sec, 170 secs
lola: 551830 markings, 683340 edges, 2603 markings/sec, 175 secs
lola: 563623 markings, 699673 edges, 2359 markings/sec, 180 secs
lola: 578726 markings, 718464 edges, 3021 markings/sec, 185 secs
lola: 592470 markings, 736244 edges, 2749 markings/sec, 190 secs
lola: 604859 markings, 753135 edges, 2478 markings/sec, 195 secs
lola: 617523 markings, 770083 edges, 2533 markings/sec, 200 secs
lola: 631590 markings, 788078 edges, 2813 markings/sec, 205 secs
lola: 644107 markings, 804971 edges, 2503 markings/sec, 210 secs
lola: 656096 markings, 821521 edges, 2398 markings/sec, 215 secs
lola: 669941 markings, 839401 edges, 2769 markings/sec, 220 secs
lola: 681403 markings, 855576 edges, 2292 markings/sec, 225 secs
lola: 694293 markings, 872764 edges, 2578 markings/sec, 230 secs
lola: 706933 markings, 889802 edges, 2528 markings/sec, 235 secs
lola: 717967 markings, 905595 edges, 2207 markings/sec, 240 secs
lola: 731189 markings, 923011 edges, 2644 markings/sec, 245 secs
lola: 741454 markings, 938279 edges, 2053 markings/sec, 250 secs
lola: 755148 markings, 956035 edges, 2739 markings/sec, 255 secs
lola: 765713 markings, 971658 edges, 2113 markings/sec, 260 secs
lola: 778458 markings, 988740 edges, 2549 markings/sec, 265 secs
lola: 788334 markings, 1003685 edges, 1975 markings/sec, 270 secs
lola: 800655 markings, 1020453 edges, 2464 markings/sec, 275 secs
lola: 811503 markings, 1036203 edges, 2170 markings/sec, 280 secs
lola: 822156 markings, 1051720 edges, 2131 markings/sec, 285 secs
lola: 833962 markings, 1068259 edges, 2361 markings/sec, 290 secs
lola: 844125 markings, 1083484 edges, 2033 markings/sec, 295 secs
lola: 854081 markings, 1098666 edges, 1991 markings/sec, 300 secs
lola: 865623 markings, 1115003 edges, 2308 markings/sec, 305 secs
lola: 875921 markings, 1130426 edges, 2060 markings/sec, 310 secs
lola: 885920 markings, 1145574 edges, 2000 markings/sec, 315 secs
lola: 895724 markings, 1160691 edges, 1961 markings/sec, 320 secs
lola: 905305 markings, 1175591 edges, 1916 markings/sec, 325 secs
lola: 914834 markings, 1190466 edges, 1906 markings/sec, 330 secs
lola: 924022 markings, 1204983 edges, 1838 markings/sec, 335 secs
lola: 933453 markings, 1219725 edges, 1886 markings/sec, 340 secs
lola: 942850 markings, 1234489 edges, 1879 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ''
Aborted (core dumped)
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-PT-S10J60-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J60"
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-S10J60.tgz
mv PolyORBNT-PT-S10J60 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-S10J60, 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-152732265600461"
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 ;