Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 41K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 160K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 132K 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 31K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K 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 37K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 175K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K 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 407K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Philosophers-PT-000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732583000225
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527440901234

info: Time: 3600 - MCC
===========================================================================================
prep: translating Philosophers-PT-000100 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-000100 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ Philosophers-PT-000100 @ 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: 1000/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 500
lola: finding significant places
lola: 500 places, 500 transitions, 300 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-PT-000100-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_51 + Eat_52 + Eat_53 + Eat_54 + Eat_55 + Eat_56 + Eat_57 + Eat_58 + Eat_59 + Eat_60 + Eat_61 + Eat_62 + Eat_63 + Eat_64 + Eat_65 + Eat_66 + Eat_67 + Eat_68 + Eat_69 + Eat_70 + Eat_71 + Eat_72 + Eat_73 + Eat_74 + Eat_75 + Eat_76 + Eat_77 + Eat_78 + Eat_79 + Eat_80 + Eat_81 + Eat_82 + Eat_83 + Eat_84 + Eat_85 + Eat_86 + Eat_87 + Eat_88 + Eat_89 + Eat_90 + Eat_91 + Eat_92 + Eat_93 + Eat_94 + Eat_95 + Eat_96 + Eat_97 + Eat_98 + Eat_99 + Eat_100 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 <= Think_100 + 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_51 + Think_52 + Think_53 + Think_54 + Think_55 + Think_56 + Think_57 + Think_58 + Think_59 + Think_60 + Think_61 + Think_62 + Think_63 + Think_64 + Think_65 + Think_66 + Think_67 + Think_68 + Think_69 + Think_70 + Think_71 + Think_72 + Think_73 + Think_74 + Think_75 + Think_76 + Think_77 + Think_78 + Think_79 + Think_80 + Think_81 + Think_82 + Think_83 + Think_84 + Think_85 + Think_86 + Think_87 + Think_88 + Think_89 + Think_90 + Think_91 + Think_92 + Think_93 + Think_94 + Think_95 + Think_96 + Think_97 + Think_98 + Think_99 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)
lola: A (X ((X ((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_51 + Eat_52 + Eat_53 + Eat_54 + Eat_55 + Eat_56 + Eat_57 + Eat_58 + Eat_59 + Eat_60 + Eat_61 + Eat_62 + Eat_63 + Eat_64 + Eat_65 + Eat_66 + Eat_67 + Eat_68 + Eat_69 + Eat_70 + Eat_71 + Eat_72 + Eat_73 + Eat_74 + Eat_75 + Eat_76 + Eat_77 + Eat_78 + Eat_79 + Eat_80 + Eat_81 + Eat_82 + Eat_83 + Eat_84 + Eat_85 + Eat_86 + Eat_87 + Eat_88 + Eat_89 + Eat_90 + Eat_91 + Eat_92 + Eat_93 + Eat_94 + Eat_95 + Eat_96 + Eat_97 + Eat_98 + Eat_99 + Eat_100 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9)) U X ((Think_100 + 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_51 + Think_52 + Think_53 + Think_54 + Think_55 + Think_56 + Think_57 + Think_58 + Think_59 + Think_60 + Think_61 + Think_62 + Think_63 + Think_64 + Think_65 + Think_66 + Think_67 + Think_68 + Think_69 + Think_70 + Think_71 + Think_72 + Think_73 + Think_74 + Think_75 + Think_76 + Think_77 + Think_78 + Think_79 + Think_80 + Think_81 + Think_82 + Think_83 + Think_84 + Think_85 + Think_86 + Think_87 + Think_88 + Think_89 + Think_90 + Think_91 + Think_92 + Think_93 + Think_94 + Think_95 + Think_96 + Think_97 + Think_98 + Think_99 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= 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_51 + Catch1_52 + Catch1_53 + Catch1_54 + Catch1_55 + Catch1_56 + Catch1_57 + Catch1_58 + Catch1_59 + Catch1_60 + Catch1_61 + Catch1_62 + Catch1_63 + Catch1_64 + Catch1_65 + Catch1_66 + Catch1_67 + Catch1_68 + Catch1_69 + Catch1_70 + Catch1_71 + Catch1_72 + Catch1_73 + Catch1_74 + Catch1_75 + Catch1_76 + Catch1_77 + Catch1_78 + Catch1_79 + Catch1_80 + Catch1_81 + Catch1_82 + Catch1_83 + Catch1_84 + Catch1_85 + Catch1_86 + Catch1_87 + Catch1_88 + Catch1_89 + Catch1_90 + Catch1_91 + Catch1_92 + Catch1_93 + Catch1_94 + Catch1_95 + Catch1_96 + Catch1_97 + Catch1_98 + Catch1_99 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_100))))) : A (X (G (X ((Catch2_100 + 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 + Catch2_51 + Catch2_52 + Catch2_53 + Catch2_54 + Catch2_55 + Catch2_56 + Catch2_57 + Catch2_58 + Catch2_59 + Catch2_60 + Catch2_61 + Catch2_62 + Catch2_63 + Catch2_64 + Catch2_65 + Catch2_66 + Catch2_67 + Catch2_68 + Catch2_69 + Catch2_70 + Catch2_71 + Catch2_72 + Catch2_73 + Catch2_74 + Catch2_75 + Catch2_76 + Catch2_77 + Catch2_78 + Catch2_79 + Catch2_80 + Catch2_81 + Catch2_82 + Catch2_83 + Catch2_84 + Catch2_85 + Catch2_86 + Catch2_87 + Catch2_88 + Catch2_89 + Catch2_90 + Catch2_91 + Catch2_92 + Catch2_93 + Catch2_94 + Catch2_95 + Catch2_96 + Catch2_97 + Catch2_98 + Catch2_99 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_100 + Fork_99 + 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 + Fork_51 + Fork_52 + Fork_53 + Fork_54 + Fork_55 + Fork_56 + Fork_57 + Fork_58 + Fork_59 + Fork_60 + Fork_61 + Fork_62 + Fork_63 + Fork_64 + Fork_65 + Fork_66 + Fork_67 + Fork_68 + Fork_69 + Fork_70 + Fork_71 + Fork_72 + Fork_73 + Fork_74 + Fork_75 + Fork_76 + Fork_77 + Fork_78 + Fork_79 + Fork_80 + Fork_81 + Fork_82 + Fork_83 + Fork_84 + Fork_85 + Fork_86 + Fork_87 + Fork_88 + Fork_89 + Fork_90 + Fork_91 + Fork_92 + Fork_93 + Fork_94 + Fork_95 + Fork_96 + Fork_97 + Fork_98))))) : A (X ((F ((1 <= 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_51 + Eat_52 + Eat_53 + Eat_54 + Eat_55 + Eat_56 + Eat_57 + Eat_58 + Eat_59 + Eat_60 + Eat_61 + Eat_62 + Eat_63 + Eat_64 + Eat_65 + Eat_66 + Eat_67 + Eat_68 + Eat_69 + Eat_70 + Eat_71 + Eat_72 + Eat_73 + Eat_74 + Eat_75 + Eat_76 + Eat_77 + Eat_78 + Eat_79 + Eat_80 + Eat_81 + Eat_82 + Eat_83 + Eat_84 + Eat_85 + Eat_86 + Eat_87 + Eat_88 + Eat_89 + Eat_90 + Eat_91 + Eat_92 + Eat_93 + Eat_94 + Eat_95 + Eat_96 + Eat_97 + Eat_98 + Eat_99 + Eat_100 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9)) U (Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_100 + Fork_99 + 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 + Fork_51 + Fork_52 + Fork_53 + Fork_54 + Fork_55 + Fork_56 + Fork_57 + Fork_58 + Fork_59 + Fork_60 + Fork_61 + Fork_62 + Fork_63 + Fork_64 + Fork_65 + Fork_66 + Fork_67 + Fork_68 + Fork_69 + Fork_70 + Fork_71 + Fork_72 + Fork_73 + Fork_74 + Fork_75 + Fork_76 + Fork_77 + Fork_78 + Fork_79 + Fork_80 + Fork_81 + Fork_82 + Fork_83 + Fork_84 + Fork_85 + Fork_86 + Fork_87 + Fork_88 + Fork_89 + Fork_90 + Fork_91 + Fork_92 + Fork_93 + Fork_94 + Fork_95 + Fork_96 + Fork_97 + Fork_98 <= 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_51 + Catch1_52 + Catch1_53 + Catch1_54 + Catch1_55 + Catch1_56 + Catch1_57 + Catch1_58 + Catch1_59 + Catch1_60 + Catch1_61 + Catch1_62 + Catch1_63 + Catch1_64 + Catch1_65 + Catch1_66 + Catch1_67 + Catch1_68 + Catch1_69 + Catch1_70 + Catch1_71 + Catch1_72 + Catch1_73 + Catch1_74 + Catch1_75 + Catch1_76 + Catch1_77 + Catch1_78 + Catch1_79 + Catch1_80 + Catch1_81 + Catch1_82 + Catch1_83 + Catch1_84 + Catch1_85 + Catch1_86 + Catch1_87 + Catch1_88 + Catch1_89 + Catch1_90 + Catch1_91 + Catch1_92 + Catch1_93 + Catch1_94 + Catch1_95 + Catch1_96 + Catch1_97 + Catch1_98 + Catch1_99 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_100)))) : A (X ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_100 + Fork_99 + 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 + Fork_51 + Fork_52 + Fork_53 + Fork_54 + Fork_55 + Fork_56 + Fork_57 + Fork_58 + Fork_59 + Fork_60 + Fork_61 + Fork_62 + Fork_63 + Fork_64 + Fork_65 + Fork_66 + Fork_67 + Fork_68 + Fork_69 + Fork_70 + Fork_71 + Fork_72 + Fork_73 + Fork_74 + Fork_75 + Fork_76 + Fork_77 + Fork_78 + Fork_79 + Fork_80 + Fork_81 + Fork_82 + Fork_83 + Fork_84 + Fork_85 + Fork_86 + Fork_87 + Fork_88 + Fork_89 + Fork_90 + Fork_91 + Fork_92 + Fork_93 + Fork_94 + Fork_95 + Fork_96 + Fork_97 + Fork_98 <= Catch2_100 + 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 + Catch2_51 + Catch2_52 + Catch2_53 + Catch2_54 + Catch2_55 + Catch2_56 + Catch2_57 + Catch2_58 + Catch2_59 + Catch2_60 + Catch2_61 + Catch2_62 + Catch2_63 + Catch2_64 + Catch2_65 + Catch2_66 + Catch2_67 + Catch2_68 + Catch2_69 + Catch2_70 + Catch2_71 + Catch2_72 + Catch2_73 + Catch2_74 + Catch2_75 + Catch2_76 + Catch2_77 + Catch2_78 + Catch2_79 + Catch2_80 + Catch2_81 + Catch2_82 + Catch2_83 + Catch2_84 + Catch2_85 + Catch2_86 + Catch2_87 + Catch2_88 + Catch2_89 + Catch2_90 + Catch2_91 + Catch2_92 + Catch2_93 + Catch2_94 + Catch2_95 + Catch2_96 + Catch2_97 + Catch2_98 + Catch2_99))) : A (X (G (((Catch2_100 + 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 + Catch2_51 + Catch2_52 + Catch2_53 + Catch2_54 + Catch2_55 + Catch2_56 + Catch2_57 + Catch2_58 + Catch2_59 + Catch2_60 + Catch2_61 + Catch2_62 + Catch2_63 + Catch2_64 + Catch2_65 + Catch2_66 + Catch2_67 + Catch2_68 + Catch2_69 + Catch2_70 + Catch2_71 + Catch2_72 + Catch2_73 + Catch2_74 + Catch2_75 + Catch2_76 + Catch2_77 + Catch2_78 + Catch2_79 + Catch2_80 + Catch2_81 + Catch2_82 + Catch2_83 + Catch2_84 + Catch2_85 + Catch2_86 + Catch2_87 + Catch2_88 + Catch2_89 + Catch2_90 + Catch2_91 + Catch2_92 + Catch2_93 + Catch2_94 + Catch2_95 + Catch2_96 + Catch2_97 + Catch2_98 + Catch2_99 <= Think_100 + 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_51 + Think_52 + Think_53 + Think_54 + Think_55 + Think_56 + Think_57 + Think_58 + Think_59 + Think_60 + Think_61 + Think_62 + Think_63 + Think_64 + Think_65 + Think_66 + Think_67 + Think_68 + Think_69 + Think_70 + Think_71 + Think_72 + Think_73 + Think_74 + Think_75 + Think_76 + Think_77 + Think_78 + Think_79 + Think_80 + Think_81 + Think_82 + Think_83 + Think_84 + Think_85 + Think_86 + Think_87 + Think_88 + Think_89 + Think_90 + Think_91 + Think_92 + Think_93 + Think_94 + Think_95 + Think_96 + Think_97 + Think_98 + Think_99 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9) U (Catch2_100 + 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 + Catch2_51 + Catch2_52 + Catch2_53 + Catch2_54 + Catch2_55 + Catch2_56 + Catch2_57 + Catch2_58 + Catch2_59 + Catch2_60 + Catch2_61 + Catch2_62 + Catch2_63 + Catch2_64 + Catch2_65 + Catch2_66 + Catch2_67 + Catch2_68 + Catch2_69 + Catch2_70 + Catch2_71 + Catch2_72 + Catch2_73 + Catch2_74 + Catch2_75 + Catch2_76 + Catch2_77 + Catch2_78 + Catch2_79 + Catch2_80 + Catch2_81 + Catch2_82 + Catch2_83 + Catch2_84 + Catch2_85 + Catch2_86 + Catch2_87 + Catch2_88 + Catch2_89 + Catch2_90 + Catch2_91 + Catch2_92 + Catch2_93 + Catch2_94 + Catch2_95 + Catch2_96 + Catch2_97 + Catch2_98 + Catch2_99 <= 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_51 + Catch1_52 + Catch1_53 + Catch1_54 + Catch1_55 + Catch1_56 + Catch1_57 + Catch1_58 + Catch1_59 + Catch1_60 + Catch1_61 + Catch1_62 + Catch1_63 + Catch1_64 + Catch1_65 + Catch1_66 + Catch1_67 + Catch1_68 + Catch1_69 + Catch1_70 + Catch1_71 + Catch1_72 + Catch1_73 + Catch1_74 + Catch1_75 + Catch1_76 + Catch1_77 + Catch1_78 + Catch1_79 + Catch1_80 + Catch1_81 + Catch1_82 + Catch1_83 + Catch1_84 + Catch1_85 + Catch1_86 + Catch1_87 + Catch1_88 + Catch1_89 + Catch1_90 + Catch1_91 + Catch1_92 + Catch1_93 + Catch1_94 + Catch1_95 + Catch1_96 + Catch1_97 + Catch1_98 + Catch1_99 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_100))))) : A ((TRUE U (1 <= 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_51 + Eat_52 + Eat_53 + Eat_54 + Eat_55 + Eat_56 + Eat_57 + Eat_58 + Eat_59 + Eat_60 + Eat_61 + Eat_62 + Eat_63 + Eat_64 + Eat_65 + Eat_66 + Eat_67 + Eat_68 + Eat_69 + Eat_70 + Eat_71 + Eat_72 + Eat_73 + Eat_74 + Eat_75 + Eat_76 + Eat_77 + Eat_78 + Eat_79 + Eat_80 + Eat_81 + Eat_82 + Eat_83 + Eat_84 + Eat_85 + Eat_86 + Eat_87 + Eat_88 + Eat_89 + Eat_90 + Eat_91 + Eat_92 + Eat_93 + Eat_94 + Eat_95 + Eat_96 + Eat_97 + Eat_98 + Eat_99 + Eat_100 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9))) : A (X (G (((Think_100 + 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_51 + Think_52 + Think_53 + Think_54 + Think_55 + Think_56 + Think_57 + Think_58 + Think_59 + Think_60 + Think_61 + Think_62 + Think_63 + Think_64 + Think_65 + Think_66 + Think_67 + Think_68 + Think_69 + Think_70 + Think_71 + Think_72 + Think_73 + Think_74 + Think_75 + Think_76 + Think_77 + Think_78 + Think_79 + Think_80 + Think_81 + Think_82 + Think_83 + Think_84 + Think_85 + Think_86 + Think_87 + Think_88 + Think_89 + Think_90 + Think_91 + Think_92 + Think_93 + Think_94 + Think_95 + Think_96 + Think_97 + Think_98 + Think_99 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 <= 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_51 + Eat_52 + Eat_53 + Eat_54 + Eat_55 + Eat_56 + Eat_57 + Eat_58 + Eat_59 + Eat_60 + Eat_61 + Eat_62 + Eat_63 + Eat_64 + Eat_65 + Eat_66 + Eat_67 + Eat_68 + Eat_69 + Eat_70 + Eat_71 + Eat_72 + Eat_73 + Eat_74 + Eat_75 + Eat_76 + Eat_77 + Eat_78 + Eat_79 + Eat_80 + Eat_81 + Eat_82 + Eat_83 + Eat_84 + Eat_85 + Eat_86 + Eat_87 + Eat_88 + Eat_89 + Eat_90 + Eat_91 + Eat_92 + Eat_93 + Eat_94 + Eat_95 + Eat_96 + Eat_97 + Eat_98 + Eat_99 + Eat_100 + Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9) U (1 <= Catch2_100 + 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 + Catch2_51 + Catch2_52 + Catch2_53 + Catch2_54 + Catch2_55 + Catch2_56 + Catch2_57 + Catch2_58 + Catch2_59 + Catch2_60 + Catch2_61 + Catch2_62 + Catch2_63 + Catch2_64 + Catch2_65 + Catch2_66 + Catch2_67 + Catch2_68 + Catch2_69 + Catch2_70 + Catch2_71 + Catch2_72 + Catch2_73 + Catch2_74 + Catch2_75 + Catch2_76 + Catch2_77 + Catch2_78 + Catch2_79 + Catch2_80 + Catch2_81 + Catch2_82 + Catch2_83 + Catch2_84 + Catch2_85 + Catch2_86 + Catch2_87 + Catch2_88 + Catch2_89 + Catch2_90 + Catch2_91 + Catch2_92 + Catch2_93 + Catch2_94 + Catch2_95 + Catch2_96 + Catch2_97 + Catch2_98 + Catch2_99))))) : A ((((1 <= Think_100 + 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_51 + Think_52 + Think_53 + Think_54 + Think_55 + Think_56 + Think_57 + Think_58 + Think_59 + Think_60 + Think_61 + Think_62 + Think_63 + Think_64 + Think_65 + Think_66 + Think_67 + Think_68 + Think_69 + Think_70 + Think_71 + Think_72 + Think_73 + Think_74 + Think_75 + Think_76 + Think_77 + Think_78 + Think_79 + Think_80 + Think_81 + Think_82 + Think_83 + Think_84 + Think_85 + Think_86 + Think_87 + Think_88 + Think_89 + Think_90 + Think_91 + Think_92 + Think_93 + Think_94 + Think_95 + Think_96 + Think_97 + Think_98 + Think_99 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9) U (1 <= 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_51 + Catch1_52 + Catch1_53 + Catch1_54 + Catch1_55 + Catch1_56 + Catch1_57 + Catch1_58 + Catch1_59 + Catch1_60 + Catch1_61 + Catch1_62 + Catch1_63 + Catch1_64 + Catch1_65 + Catch1_66 + Catch1_67 + Catch1_68 + Catch1_69 + Catch1_70 + Catch1_71 + Catch1_72 + Catch1_73 + Catch1_74 + Catch1_75 + Catch1_76 + Catch1_77 + Catch1_78 + Catch1_79 + Catch1_80 + Catch1_81 + Catch1_82 + Catch1_83 + Catch1_84 + Catch1_85 + Catch1_86 + Catch1_87 + Catch1_88 + Catch1_89 + Catch1_90 + Catch1_91 + Catch1_92 + Catch1_93 + Catch1_94 + Catch1_95 + Catch1_96 + Catch1_97 + Catch1_98 + Catch1_99 + Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_100)) U X (F ((Catch2_100 + 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 + Catch2_51 + Catch2_52 + Catch2_53 + Catch2_54 + Catch2_55 + Catch2_56 + Catch2_57 + Catch2_58 + Catch2_59 + Catch2_60 + Catch2_61 + Catch2_62 + Catch2_63 + Catch2_64 + Catch2_65 + Catch2_66 + Catch2_67 + Catch2_68 + Catch2_69 + Catch2_70 + Catch2_71 + Catch2_72 + Catch2_73 + Catch2_74 + Catch2_75 + Catch2_76 + Catch2_77 + Catch2_78 + Catch2_79 + Catch2_80 + Catch2_81 + Catch2_82 + Catch2_83 + Catch2_84 + Catch2_85 + Catch2_86 + Catch2_87 + Catch2_88 + Catch2_89 + Catch2_90 + Catch2_91 + Catch2_92 + Catch2_93 + Catch2_94 + Catch2_95 + Catch2_96 + Catch2_97 + Catch2_98 + Catch2_99 <= Think_100 + 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_51 + Think_52 + Think_53 + Think_54 + Think_55 + Think_56 + Think_57 + Think_58 + Think_59 + Think_60 + Think_61 + Think_62 + Think_63 + Think_64 + Think_65 + Think_66 + Think_67 + Think_68 + Think_69 + Think_70 + Think_71 + Think_72 + Think_73 + Think_74 + Think_75 + Think_76 + Think_77 + Think_78 + Think_79 + Think_80 + Think_81 + Think_82 + Think_83 + Think_84 + Think_85 + Think_86 + Think_87 + Think_88 + Think_89 + Think_90 + Think_91 + Think_92 + Think_93 + Think_94 + Think_95 + Think_96 + Think_97 + Think_98 + Think_99 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9))))) : A (G ((Catch2_6 <= Fork_3))) : A (X (G ((Think_5 <= Think_79)))) : A (F (F (((Fork_58 <= Catch1_82) U (Catch1_6 <= Catch2_31))))) : A (G (X (F (G ((Catch1_100 <= Fork_95)))))) : A ((Think_14 <= Eat_4)) : A ((Eat_35 <= Think_23)) : A ((Catch1_8 <= Eat_75)) : A (X (X (((Catch1_76 <= Fork_66) U (Catch1_6 <= Eat_47)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Think_14 <= Eat_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Think_14 <= Eat_4)
lola: processed formula length: 19
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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-000100-LTLCardinality-12 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: (Eat_35 <= Think_23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Eat_35 <= Think_23)
lola: processed formula length: 20
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: ========================================

FORMULA Philosophers-PT-000100-LTLCardinality-13 TRUE 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: (Catch1_8 <= Eat_75)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Catch1_8 <= Eat_75)
lola: processed formula length: 20
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: ========================================

FORMULA Philosophers-PT-000100-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_100 + Fork_99 + 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 + F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_100 + Fork_99 + 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 + F... (shortened)
lola: processed formula length: 2192
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: 101 markings, 101 edges

FORMULA Philosophers-PT-000100-LTLCardinality-3 FALSE 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 (G ((F ((Catch2_100 + 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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((Catch2_100 + 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 ... (shortened)
lola: processed formula length: 7081
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1044 markings, 1720 edges

FORMULA Philosophers-PT-000100-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((1 <= Catch2_100 + 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 + Catch... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((1 <= Catch2_100 + 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 + Catch... (shortened)
lola: processed formula length: 4405
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 137 markings, 137 edges
lola: ========================================

FORMULA Philosophers-PT-000100-LTLCardinality-6 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 ((((1 <= Think_100 + 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 + Thi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= Think_100 + 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 + Thi... (shortened)
lola: processed formula length: 4598
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: 401 markings, 400 edges

FORMULA Philosophers-PT-000100-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Think_5 <= Think_79))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Think_5 <= Think_79))))
lola: processed formula length: 33
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: 101 markings, 101 edges
lola: ========================================

FORMULA Philosophers-PT-000100-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((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_51 + Eat_52... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((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_51 + Eat_52... (shortened)
lola: processed formula length: 3197
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 101 markings, 101 edges
lola: ========================================

FORMULA Philosophers-PT-000100-LTLCardinality-0 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 (X (X (G ((Catch2_100 + 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 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((Catch2_100 + 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 +... (shortened)
lola: processed formula length: 2200
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 101 markings, 101 edges
lola: ========================================

FORMULA Philosophers-PT-000100-LTLCardinality-1 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 (X ((F ((1 <= 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_51 + Eat_52... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((1 <= 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_51 + Eat_52... (shortened)
lola: processed formula length: 3097
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: 12009 markings, 30219 edges
lola: ========================================

FORMULA Philosophers-PT-000100-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((Catch1_76 <= Fork_66) U (Catch1_6 <= Eat_47)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((Catch1_76 <= Fork_66) U (Catch1_6 <= Eat_47)))))
lola: processed formula length: 59
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 292 markings, 292 edges
lola: ========================================

FORMULA Philosophers-PT-000100-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Catch2_6 <= Fork_3)))
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 ((Catch2_6 <= Fork_3)))
lola: processed formula length: 28
lola: 17 rewrites
lola: closed formula file Philosophers-PT-000100-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: (Fork_3 + 1 <= Catch2_6)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-PT-000100-LTLCardinality-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA Philosophers-PT-000100-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Catch1_6 <= Catch2_31)))
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_31 + 1 <= Catch1_6)
lola: processed formula length: 27
lola: 17 rewrites
lola: closed formula file Philosophers-PT-000100-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)
sara: try reading problem file Philosophers-PT-000100-LTLCardinality-12-0.sara.
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-000100-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= 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_51 + Eat_52 + E... (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: (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_51 + Eat_52 + Eat_53 + Eat... (shortened)
lola: processed formula length: 896
lola: 17 rewrites
lola: closed formula file Philosophers-PT-000100-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: 1442 markings, 5521 edges
lola: ========================================

FORMULA Philosophers-PT-000100-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Catch1_100 <= Fork_95))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Catch1_100 <= Fork_95))))
lola: processed formula length: 35
lola: 15 rewrites
lola: closed formula file Philosophers-PT-000100-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: 102 markings, 103 edges
lola: ========================================

FORMULA Philosophers-PT-000100-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no no yes no no yes yes no
lola:
preliminary result: no no no no no no no yes no no yes no no yes yes no

lola: memory consumption: 23772 KB
lola: time consumption: 5 seconds

BK_STOP 1527440906985

--------------------
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-000100"
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-000100.tgz
mv Philosophers-PT-000100 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-000100, 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-152732583000225"
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 ;