About the Execution of LoLA for Philosophers-PT-000050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
248.280 | 2615.00 | 2969.00 | 14.80 | FFTFFFFTFFFTTTFF | 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 800K
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K 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 12K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K 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 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K 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 205K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Philosophers-PT-000050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732583000223
=====================================================================
--------------------
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 Philosophers-PT-000050-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527440886610
info: Time: 3600 - MCC
===========================================================================================
prep: translating Philosophers-PT-000050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Philosophers-PT-000050 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ Philosophers-PT-000050 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 500/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 250
lola: finding significant places
lola: 250 places, 250 transitions, 150 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 350 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-PT-000050-LTLCardinality.task
lola: LP says that atomic proposition is always true: (Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_33 + Eat_34 + Eat_35 + Eat_36 + Eat_37 + Eat_38 + Eat_39 + Eat_40 + Eat_41 + Eat_42 + Eat_43 + Eat_44 + Eat_45 + Eat_46 + Eat_47 + Eat_48 + Eat_49 + Eat_50 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 <= Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)
lola: A ((3 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_33 + Eat_34 + Eat_35 + Eat_36 + Eat_37 + Eat_38 + Eat_39 + Eat_40 + Eat_41 + Eat_42 + Eat_43 + Eat_44 + Eat_45 + Eat_46 + Eat_47 + Eat_48 + Eat_49 + Eat_50 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9)) : A (X (F (((1 <= Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9) U (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50))))) : A (X ((F ((1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50)) U TRUE))) : A (G (F (((2 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50) U (3 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50))))) : A ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50 <= Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + Catch1_34 + Catch1_35 + Catch1_36 + Catch1_37 + Catch1_38 + Catch1_39 + Catch1_40 + Catch1_41 + Catch1_42 + Catch1_43 + Catch1_44 + Catch1_45 + Catch1_46 + Catch1_47 + Catch1_48 + Catch1_49 + Catch1_50 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9)) : A (G (G (G (G ((3 <= Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)))))) : A (G (((1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50) U (Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50)))) : A (F ((Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_33 + Eat_34 + Eat_35 + Eat_36 + Eat_37 + Eat_38 + Eat_39 + Eat_40 + Eat_41 + Eat_42 + Eat_43 + Eat_44 + Eat_45 + Eat_46 + Eat_47 + Eat_48 + Eat_49 + Eat_50 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50))) : A ((Fork_43 <= Catch1_11)) : A (G (X ((Think_1 <= Eat_14)))) : A (F (G ((Eat_29 <= Fork_21)))) : A ((G ((Catch1_29 <= Think_36)) U (Catch2_5 <= Fork_32))) : A ((Eat_22 <= Fork_1)) : A ((G (X ((Eat_16 <= Think_16))) U X (F ((Eat_49 <= Think_3))))) : A (G ((G ((Fork_17 <= Think_12)) U F ((Eat_23 <= Catch1_20))))) : A (F ((Think_41 <= Catch2_39)))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_33 + Eat_34 + Eat_35 + Eat_36 + Eat_37 + Eat_38 + Eat_39 + Eat_40 + Eat_41 + Eat_42 + Eat_43 + Eat_44 + Eat_45 + Eat_46 + Eat_47 + Eat_48 + Eat_49 + Eat_50 + Eat_1 + Eat_2 + Eat_3 + E... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_33 + Eat_34 + Eat_35 + Eat_36 + Eat_37 + Eat_38 + Eat_39 + Eat_40 + Eat_41 + Eat_42 + Eat_43 + Eat_44 + Eat_45 + Eat_46 + Eat_47 + Eat_48 + Eat_49 + Eat_50 + Eat_1 + Eat_2 + Eat_3 + E... (shortened)
lola: processed formula length: 445
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-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: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 ... (shortened)
lola: processed formula length: 1082
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-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: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Fork_43 <= Catch1_11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Fork_43 <= Catch1_11)
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-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
FORMULA Philosophers-PT-000050-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Eat_22 <= Fork_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Eat_22 <= Fork_1)
lola: processed formula length: 18
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-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
FORMULA Philosophers-PT-000050-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 101 markings, 100 edges
lola: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Think_1 <= Eat_14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Think_1 <= Eat_14))))
lola: processed formula length: 31
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 51 edges
lola: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 ... (shortened)
lola: processed formula length: 607
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 87 markings, 87 edges
lola: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((Eat_49 <= Think_3)) OR (G ((Eat_16 <= Think_16)) AND F ((Eat_49 <= Think_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((Eat_49 <= Think_3)) OR (G ((Eat_16 <= Think_16)) AND F ((Eat_49 <= Think_3))))))
lola: processed formula length: 91
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 201 markings, 200 edges
lola: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Thi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((3 <= Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Thi... (shortened)
lola: processed formula length: 553
lola: 24 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-PT-000050-LTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 49 markings, 48 edges
FORMULA Philosophers-PT-000050-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Think_41 <= Catch2_39)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Catch2_39 + 1 <= Think_41)
lola: processed formula length: 27
lola: 24 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 43 markings, 43 edges
lola: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_33 + Eat_34 + Eat_35 + Eat_36 + Eat_37 + Eat_38 + Eat_39 + Eat_40 + Eat_41 + Eat_42 + Eat_43 + Eat_44 + Eat_45 + Eat_46 + Eat_47 + Eat_48 + Eat_49 + Eat_50 + Eat_1 + Eat_2 + Eat_3 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + ... (shortened)
lola: processed formula length: 1036
lola: 24 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Eat_29 <= Fork_21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Eat_29 <= Fork_21))))
lola: processed formula length: 31
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
========================================
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 464981 markings, 641207 edges
lola: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((Eat_23 <= Catch1_20)) OR (G ((Fork_17 <= Think_12)) AND F ((Eat_23 <= Catch1_20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((Eat_23 <= Catch1_20)) OR (G ((Fork_17 <= Think_12)) AND F ((Eat_23 <= Catch1_20))))))
lola: processed formula length: 96
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 139498 markings, 189606 edges
lola: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Catch2_5 <= Fork_32) OR (G ((Catch1_29 <= Think_36)) AND F ((Catch2_5 <= Fork_32)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Catch2_5 <= Fork_32) OR (G ((Catch1_29 <= Think_36)) AND F ((Catch2_5 <= Fork_32)))))
lola: processed formula length: 90
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork... (shortened)
lola: processed formula length: 507
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 52 markings, 52 edges
FORMULA Philosophers-PT-000050-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Thin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: A (G (((1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_4... (shortened)
lola: processed formula length: 1541
lola: 27 rewrites
lola: closed formula file Philosophers-PT-000050-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Philosophers-PT-000050-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no no no yes no no no yes yes yes no no
lola:
preliminary result: no no yes no no no no yes no no no yes yes yes no no
lola: memory consumption: 21048 KB
lola: time consumption: 3 seconds
BK_STOP 1527440889225
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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/Philosophers-PT-000050.tgz
mv Philosophers-PT-000050 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 lola"
echo " Input is Philosophers-PT-000050, 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 r256-csrt-152732583000223"
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 '
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 ;