fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r197-oct2-155272231400708
Last Updated
Apr 15, 2019

About the Execution of ITS-Tools.M for Philosophers-COL-000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5795.930 3600000.00 3909851.00 217.50 FFF????????????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r197-oct2-155272231400708.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is Philosophers-COL-000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-oct2-155272231400708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.5K Feb 12 04:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 12 04:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 8 03:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 8 03:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 5 00:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K Feb 5 00:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 4 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 4 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 1 02:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 02:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:22 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 14K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1553685286979

11:15:12.869 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
11:15:12.874 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F(X("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_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)>=1)"))))))
Formula 0 simplified : !XXFX"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_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)>=1)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 500 rows 500 cols
invariant :fork_3 + catch1_4 + catch2_3 + eat_3 + eat_4 = 1
invariant :fork_37 + catch1_38 + catch2_37 + eat_37 + eat_38 = 1
invariant :fork_25 + catch1_26 + catch2_25 + eat_25 + eat_26 = 1
invariant :fork_59 + catch1_60 + catch2_59 + eat_59 + eat_60 = 1
invariant :think_22 + catch1_22 + catch2_22 + eat_22 = 1
invariant :think_57 + catch1_57 + catch2_57 + eat_57 = 1
invariant :fork_39 + catch1_40 + catch2_39 + eat_39 + eat_40 = 1
invariant :fork_63 + catch1_64 + catch2_63 + eat_63 + eat_64 = 1
invariant :think_82 + catch1_82 + catch2_82 + eat_82 = 1
invariant :fork_82 + catch1_83 + catch2_82 + eat_82 + eat_83 = 1
invariant :think_38 + catch1_38 + catch2_38 + eat_38 = 1
invariant :think_76 + catch1_76 + catch2_76 + eat_76 = 1
invariant :fork_72 + catch1_73 + catch2_72 + eat_72 + eat_73 = 1
invariant :think_27 + catch1_27 + catch2_27 + eat_27 = 1
invariant :fork_62 + catch1_63 + catch2_62 + eat_62 + eat_63 = 1
invariant :think_0 + catch1_0 + catch2_0 + eat_0 = 1
invariant :think_49 + catch1_49 + catch2_49 + eat_49 = 1
invariant :fork_46 + catch1_47 + catch2_46 + eat_46 + eat_47 = 1
invariant :think_24 + catch1_24 + catch2_24 + eat_24 = 1
invariant :think_96 + catch1_96 + catch2_96 + eat_96 = 1
invariant :think_68 + catch1_68 + catch2_68 + eat_68 = 1
invariant :fork_43 + catch1_44 + catch2_43 + eat_43 + eat_44 = 1
invariant :think_83 + catch1_83 + catch2_83 + eat_83 = 1
invariant :fork_34 + catch1_35 + catch2_34 + eat_34 + eat_35 = 1
invariant :fork_57 + catch1_58 + catch2_57 + eat_57 + eat_58 = 1
invariant :fork_75 + catch1_76 + catch2_75 + eat_75 + eat_76 = 1
invariant :think_67 + catch1_67 + catch2_67 + eat_67 = 1
invariant :fork_11 + catch1_12 + catch2_11 + eat_11 + eat_12 = 1
invariant :think_99 + catch1_99 + catch2_99 + eat_99 = 1
invariant :think_54 + catch1_54 + catch2_54 + eat_54 = 1
invariant :fork_2 + catch1_3 + catch2_2 + eat_2 + eat_3 = 1
invariant :think_53 + catch1_53 + catch2_53 + eat_53 = 1
invariant :think_26 + catch1_26 + catch2_26 + eat_26 = 1
invariant :think_77 + catch1_77 + catch2_77 + eat_77 = 1
invariant :think_11 + catch1_11 + catch2_11 + eat_11 = 1
invariant :think_51 + catch1_51 + catch2_51 + eat_51 = 1
invariant :fork_56 + catch1_57 + catch2_56 + eat_56 + eat_57 = 1
invariant :fork_6 + catch1_7 + catch2_6 + eat_6 + eat_7 = 1
invariant :think_41 + catch1_41 + catch2_41 + eat_41 = 1
invariant :fork_66 + catch1_67 + catch2_66 + eat_66 + eat_67 = 1
invariant :fork_1 + catch1_2 + catch2_1 + eat_1 + eat_2 = 1
invariant :think_78 + catch1_78 + catch2_78 + eat_78 = 1
invariant :fork_51 + catch1_52 + catch2_51 + eat_51 + eat_52 = 1
invariant :think_29 + catch1_29 + catch2_29 + eat_29 = 1
invariant :think_92 + catch1_92 + catch2_92 + eat_92 = 1
invariant :fork_79 + catch1_80 + catch2_79 + eat_79 + eat_80 = 1
invariant :fork_96 + catch1_97 + catch2_96 + eat_96 + eat_97 = 1
invariant :fork_98 + catch1_99 + catch2_98 + eat_98 + eat_99 = 1
invariant :fork_80 + catch1_81 + catch2_80 + eat_80 + eat_81 = 1
invariant :fork_21 + catch1_22 + catch2_21 + eat_21 + eat_22 = 1
invariant :think_56 + catch1_56 + catch2_56 + eat_56 = 1
invariant :think_28 + catch1_28 + catch2_28 + eat_28 = 1
invariant :think_35 + catch1_35 + catch2_35 + eat_35 = 1
invariant :fork_5 + catch1_6 + catch2_5 + eat_5 + eat_6 = 1
invariant :think_84 + catch1_84 + catch2_84 + eat_84 = 1
invariant :fork_89 + catch1_90 + catch2_89 + eat_89 + eat_90 = 1
invariant :think_33 + catch1_33 + catch2_33 + eat_33 = 1
invariant :fork_24 + catch1_25 + catch2_24 + eat_24 + eat_25 = 1
invariant :think_79 + catch1_79 + catch2_79 + eat_79 = 1
invariant :fork_40 + catch1_41 + catch2_40 + eat_40 + eat_41 = 1
invariant :fork_26 + catch1_27 + catch2_26 + eat_26 + eat_27 = 1
invariant :fork_47 + catch1_48 + catch2_47 + eat_47 + eat_48 = 1
invariant :think_95 + catch1_95 + catch2_95 + eat_95 = 1
invariant :fork_9 + catch1_10 + catch2_9 + eat_9 + eat_10 = 1
invariant :fork_10 + catch1_11 + catch2_10 + eat_10 + eat_11 = 1
invariant :think_58 + catch1_58 + catch2_58 + eat_58 = 1
invariant :think_44 + catch1_44 + catch2_44 + eat_44 = 1
invariant :think_63 + catch1_63 + catch2_63 + eat_63 = 1
invariant :think_5 + catch1_5 + catch2_5 + eat_5 = 1
invariant :think_4 + catch1_4 + catch2_4 + eat_4 = 1
invariant :fork_97 + catch1_98 + catch2_97 + eat_97 + eat_98 = 1
invariant :think_14 + catch1_14 + catch2_14 + eat_14 = 1
invariant :fork_74 + catch1_75 + catch2_74 + eat_74 + eat_75 = 1
invariant :think_19 + catch1_19 + catch2_19 + eat_19 = 1
invariant :fork_64 + catch1_65 + catch2_64 + eat_64 + eat_65 = 1
invariant :think_94 + catch1_94 + catch2_94 + eat_94 = 1
invariant :think_47 + catch1_47 + catch2_47 + eat_47 = 1
invariant :fork_8 + catch1_9 + catch2_8 + eat_8 + eat_9 = 1
invariant :fork_36 + catch1_37 + catch2_36 + eat_36 + eat_37 = 1
invariant :think_40 + catch1_40 + catch2_40 + eat_40 = 1
invariant :fork_68 + catch1_69 + catch2_68 + eat_68 + eat_69 = 1
invariant :fork_7 + catch1_8 + catch2_7 + eat_7 + eat_8 = 1
invariant :think_25 + catch1_25 + catch2_25 + eat_25 = 1
invariant :think_36 + catch1_36 + catch2_36 + eat_36 = 1
invariant :fork_95 + catch1_96 + catch2_95 + eat_95 + eat_96 = 1
invariant :think_60 + catch1_60 + catch2_60 + eat_60 = 1
invariant :fork_90 + catch1_91 + catch2_90 + eat_90 + eat_91 = 1
invariant :think_48 + catch1_48 + catch2_48 + eat_48 = 1
invariant :think_34 + catch1_34 + catch2_34 + eat_34 = 1
invariant :think_31 + catch1_31 + catch2_31 + eat_31 = 1
invariant :fork_35 + catch1_36 + catch2_35 + eat_35 + eat_36 = 1
invariant :fork_13 + catch1_14 + catch2_13 + eat_13 + eat_14 = 1
invariant :fork_19 + catch1_20 + catch2_19 + eat_19 + eat_20 = 1
invariant :fork_15 + catch1_16 + catch2_15 + eat_15 + eat_16 = 1
invariant :think_46 + catch1_46 + catch2_46 + eat_46 = 1
invariant :fork_77 + catch1_78 + catch2_77 + eat_77 + eat_78 = 1
invariant :think_42 + catch1_42 + catch2_42 + eat_42 = 1
invariant :fork_4 + catch1_5 + catch2_4 + eat_4 + eat_5 = 1
invariant :think_6 + catch1_6 + catch2_6 + eat_6 = 1
invariant :fork_30 + catch1_31 + catch2_30 + eat_30 + eat_31 = 1
invariant :fork_53 + catch1_54 + catch2_53 + eat_53 + eat_54 = 1
invariant :think_3 + catch1_3 + catch2_3 + eat_3 = 1
invariant :fork_48 + catch1_49 + catch2_48 + eat_48 + eat_49 = 1
invariant :fork_14 + catch1_15 + catch2_14 + eat_14 + eat_15 = 1
invariant :fork_27 + catch1_28 + catch2_27 + eat_27 + eat_28 = 1
invariant :think_45 + catch1_45 + catch2_45 + eat_45 = 1
invariant :think_52 + catch1_52 + catch2_52 + eat_52 = 1
invariant :fork_81 + catch1_82 + catch2_81 + eat_81 + eat_82 = 1
invariant :think_69 + catch1_69 + catch2_69 + eat_69 = 1
invariant :think_88 + catch1_88 + catch2_88 + eat_88 = 1
invariant :fork_54 + catch1_55 + catch2_54 + eat_54 + eat_55 = 1
invariant :fork_91 + catch1_92 + catch2_91 + eat_91 + eat_92 = 1
invariant :think_17 + catch1_17 + catch2_17 + eat_17 = 1
invariant :think_87 + catch1_87 + catch2_87 + eat_87 = 1
invariant :fork_33 + catch1_34 + catch2_33 + eat_33 + eat_34 = 1
invariant :fork_73 + catch1_74 + catch2_73 + eat_73 + eat_74 = 1
invariant :fork_86 + catch1_87 + catch2_86 + eat_86 + eat_87 = 1
invariant :think_71 + catch1_71 + catch2_71 + eat_71 = 1
invariant :think_62 + catch1_62 + catch2_62 + eat_62 = 1
invariant :think_93 + catch1_93 + catch2_93 + eat_93 = 1
invariant :fork_61 + catch1_62 + catch2_61 + eat_61 + eat_62 = 1
invariant :fork_29 + catch1_30 + catch2_29 + eat_29 + eat_30 = 1
invariant :think_15 + catch1_15 + catch2_15 + eat_15 = 1
invariant :think_55 + catch1_55 + catch2_55 + eat_55 = 1
invariant :think_21 + catch1_21 + catch2_21 + eat_21 = 1
invariant :fork_32 + catch1_33 + catch2_32 + eat_32 + eat_33 = 1
invariant :fork_93 + catch1_94 + catch2_93 + eat_93 + eat_94 = 1
invariant :think_90 + catch1_90 + catch2_90 + eat_90 = 1
invariant :think_72 + catch1_72 + catch2_72 + eat_72 = 1
invariant :fork_49 + catch1_50 + catch2_49 + eat_49 + eat_50 = 1
invariant :think_32 + catch1_32 + catch2_32 + eat_32 = 1
invariant :think_66 + catch1_66 + catch2_66 + eat_66 = 1
invariant :fork_31 + catch1_32 + catch2_31 + eat_31 + eat_32 = 1
invariant :fork_71 + catch1_72 + catch2_71 + eat_71 + eat_72 = 1
invariant :fork_78 + catch1_79 + catch2_78 + eat_78 + eat_79 = 1
invariant :think_18 + catch1_18 + catch2_18 + eat_18 = 1
invariant :think_97 + catch1_97 + catch2_97 + eat_97 = 1
invariant :think_39 + catch1_39 + catch2_39 + eat_39 = 1
invariant :think_9 + catch1_9 + catch2_9 + eat_9 = 1
invariant :think_80 + catch1_80 + catch2_80 + eat_80 = 1
invariant :fork_23 + catch1_24 + catch2_23 + eat_23 + eat_24 = 1
invariant :think_74 + catch1_74 + catch2_74 + eat_74 = 1
invariant :think_89 + catch1_89 + catch2_89 + eat_89 = 1
invariant :fork_67 + catch1_68 + catch2_67 + eat_67 + eat_68 = 1
invariant :think_12 + catch1_12 + catch2_12 + eat_12 = 1
invariant :fork_94 + catch1_95 + catch2_94 + eat_94 + eat_95 = 1
invariant :fork_69 + catch1_70 + catch2_69 + eat_69 + eat_70 = 1
invariant :fork_17 + catch1_18 + catch2_17 + eat_17 + eat_18 = 1
invariant :think_70 + catch1_70 + catch2_70 + eat_70 = 1
invariant :fork_85 + catch1_86 + catch2_85 + eat_85 + eat_86 = 1
invariant :think_81 + catch1_81 + catch2_81 + eat_81 = 1
invariant :think_23 + catch1_23 + catch2_23 + eat_23 = 1
invariant :think_50 + catch1_50 + catch2_50 + eat_50 = 1
invariant :fork_38 + catch1_39 + catch2_38 + eat_38 + eat_39 = 1
invariant :think_64 + catch1_64 + catch2_64 + eat_64 = 1
invariant :fork_42 + catch1_43 + catch2_42 + eat_42 + eat_43 = 1
invariant :think_1 + catch1_1 + catch2_1 + eat_1 = 1
invariant :think_8 + catch1_8 + catch2_8 + eat_8 = 1
invariant :think_16 + catch1_16 + catch2_16 + eat_16 = 1
invariant :fork_55 + catch1_56 + catch2_55 + eat_55 + eat_56 = 1
invariant :think_61 + catch1_61 + catch2_61 + eat_61 = 1
invariant :fork_16 + catch1_17 + catch2_16 + eat_16 + eat_17 = 1
invariant :think_73 + catch1_73 + catch2_73 + eat_73 = 1
invariant :fork_70 + catch1_71 + catch2_70 + eat_70 + eat_71 = 1
invariant :think_20 + catch1_20 + catch2_20 + eat_20 = 1
invariant :think_75 + catch1_75 + catch2_75 + eat_75 = 1
invariant :think_85 + catch1_85 + catch2_85 + eat_85 = 1
invariant :fork_12 + catch1_13 + catch2_12 + eat_12 + eat_13 = 1
invariant :think_37 + catch1_37 + catch2_37 + eat_37 = 1
invariant :fork_20 + catch1_21 + catch2_20 + eat_20 + eat_21 = 1
invariant :think_10 + catch1_10 + catch2_10 + eat_10 = 1
invariant :think_91 + catch1_91 + catch2_91 + eat_91 = 1
invariant :think_2 + catch1_2 + catch2_2 + eat_2 = 1
invariant :fork_18 + catch1_19 + catch2_18 + eat_18 + eat_19 = 1
invariant :fork_28 + catch1_29 + catch2_28 + eat_28 + eat_29 = 1
invariant :fork_92 + catch1_93 + catch2_92 + eat_92 + eat_93 = 1
invariant :fork_99 + catch1_0 + catch2_99 + eat_0 + eat_99 = 1
invariant :think_59 + catch1_59 + catch2_59 + eat_59 = 1
invariant :fork_84 + catch1_85 + catch2_84 + eat_84 + eat_85 = 1
invariant :think_30 + catch1_30 + catch2_30 + eat_30 = 1
invariant :fork_44 + catch1_45 + catch2_44 + eat_44 + eat_45 = 1
invariant :fork_58 + catch1_59 + catch2_58 + eat_58 + eat_59 = 1
invariant :fork_76 + catch1_77 + catch2_76 + eat_76 + eat_77 = 1
invariant :think_7 + catch1_7 + catch2_7 + eat_7 = 1
invariant :fork_52 + catch1_53 + catch2_52 + eat_52 + eat_53 = 1
invariant :fork_60 + catch1_61 + catch2_60 + eat_60 + eat_61 = 1
invariant :think_86 + catch1_86 + catch2_86 + eat_86 = 1
invariant :think_65 + catch1_65 + catch2_65 + eat_65 = 1
invariant :fork_88 + catch1_89 + catch2_88 + eat_88 + eat_89 = 1
invariant :fork_22 + catch1_23 + catch2_22 + eat_22 + eat_23 = 1
invariant :fork_65 + catch1_66 + catch2_65 + eat_65 + eat_66 = 1
invariant :fork_41 + catch1_42 + catch2_41 + eat_41 + eat_42 = 1
invariant :fork_0 + catch1_1 + catch2_0 + eat_0 + eat_1 = 1
invariant :think_98 + catch1_98 + catch2_98 + eat_98 = 1
invariant :fork_45 + catch1_46 + catch2_45 + eat_45 + eat_46 = 1
invariant :think_43 + catch1_43 + catch2_43 + eat_43 = 1
invariant :fork_50 + catch1_51 + catch2_50 + eat_50 + eat_51 = 1
invariant :fork_83 + catch1_84 + catch2_83 + eat_83 + eat_84 = 1
invariant :think_13 + catch1_13 + catch2_13 + eat_13 = 1
invariant :fork_87 + catch1_88 + catch2_87 + eat_87 + eat_88 = 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1033 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.4087,330864,1,0,500,1.99096e+06,20,400,12397,1.78458e+06,1009
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000100-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(X(X("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_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_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)>=2)"))))))
Formula 1 simplified : !XGXX"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_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_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)>=2)"
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
1843 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,28.8439,611012,1,0,602,2.69678e+06,32,598,23092,2.7599e+06,1517
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000100-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_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_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)>=3)"))))
Formula 2 simplified : !GX"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_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_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)>=3)"
Computing Next relation with stutter on 2 deadlock states
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 5089 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 83 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](X((LTLAP2==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1698 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,45.8188,761992,1,0,611,2.7448e+06,38,611,33190,2.82751e+06,1744
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000100-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(F(X(G("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_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_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)>=2)"))))))
Formula 3 simplified : !FXG"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_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_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)>=2)"
Computing Next relation with stutter on 2 deadlock states
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](X((LTLAP2==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
255
Detected timeout of ITS tools.
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((F(F(X(G("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_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_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)>=2)"))))))
Formula 0 simplified : !FXG"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_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_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)>=2)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((F(F(X(G("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_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_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)>=2)"))))))
Formula 0 simplified : !FXG"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_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_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)>=2)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 27, 2019 11:14:48 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 27, 2019 11:14:48 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 11:14:48 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 27, 2019 11:15:13 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 24689 ms
Mar 27, 2019 11:15:13 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
Mar 27, 2019 11:15:13 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 27, 2019 11:15:13 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

Mar 27, 2019 11:15:13 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Mar 27, 2019 11:15:13 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 27, 2019 11:15:13 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 5 ms
Mar 27, 2019 11:15:13 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 212 ms
Mar 27, 2019 11:15:13 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 66 ms
Mar 27, 2019 11:15:14 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 500 transitions.
Mar 27, 2019 11:15:14 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 500 transitions.
Mar 27, 2019 11:15:14 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 500 places.
Mar 27, 2019 11:15:14 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 500 transitions.
Mar 27, 2019 11:15:14 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
Mar 27, 2019 11:15:14 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms
Mar 27, 2019 11:15:14 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 200 place invariants in 133 ms
Mar 27, 2019 11:15:15 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 500 variables to be positive in 776 ms
Mar 27, 2019 11:15:15 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 500 transitions.
Mar 27, 2019 11:15:15 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/500 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 11:15:15 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 11:15:15 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 500 transitions.
Mar 27, 2019 11:15:15 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 11:15:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 500 transitions.
Mar 27, 2019 11:15:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/500) took 26 ms. Total solver calls (SAT/UNSAT): 8(3/5)
Mar 27, 2019 11:15:52 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(253/500) took 3033 ms. Total solver calls (SAT/UNSAT): 1779(454/1325)
Mar 27, 2019 11:15:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 5526 ms. Total solver calls (SAT/UNSAT): 2600(500/2100)
Mar 27, 2019 11:15:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 500 transitions.
Mar 27, 2019 11:15:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 11:15:54 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 40846ms conformant to PINS in folder :/home/mcc/execution
pins2lts-mc, 0.000: Registering PINS so language module
pins2lts-mc( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc( 1/ 8), 0.007: library has no initializer
pins2lts-mc( 1/ 8), 0.007: loading model GAL
pins2lts-mc( 3/ 8), 0.007: library has no initializer
pins2lts-mc( 3/ 8), 0.007: loading model GAL
pins2lts-mc( 4/ 8), 0.007: library has no initializer
pins2lts-mc( 4/ 8), 0.007: loading model GAL
pins2lts-mc( 0/ 8), 0.020: library has no initializer
pins2lts-mc( 0/ 8), 0.020: loading model GAL
pins2lts-mc( 6/ 8), 0.007: library has no initializer
pins2lts-mc( 6/ 8), 0.007: loading model GAL
pins2lts-mc( 2/ 8), 0.007: library has no initializer
pins2lts-mc( 2/ 8), 0.007: loading model GAL
pins2lts-mc( 5/ 8), 0.007: library has no initializer
pins2lts-mc( 5/ 8), 0.007: loading model GAL
pins2lts-mc( 7/ 8), 0.007: library has no initializer
pins2lts-mc( 7/ 8), 0.007: loading model GAL
pins2lts-mc( 5/ 8), 0.487: completed loading model GAL
pins2lts-mc( 7/ 8), 0.487: completed loading model GAL
pins2lts-mc( 5/ 8), 0.487: LTL layer: formula: [](X((LTLAP2==true)))
pins2lts-mc( 1/ 8), 0.490: completed loading model GAL
pins2lts-mc( 6/ 8), 0.490: completed loading model GAL
pins2lts-mc( 0/ 8), 0.503: completed loading model GAL
pins2lts-mc( 4/ 8), 0.490: completed loading model GAL
pins2lts-mc( 2/ 8), 0.490: completed loading model GAL
pins2lts-mc( 5/ 8), 0.490: "[](X((LTLAP2==true)))" is not a file, parsing as formula...
pins2lts-mc( 3/ 8), 0.490: completed loading model GAL
pins2lts-mc( 5/ 8), 0.491: Using Spin LTL semantics
pins2lts-mc( 0/ 8), 0.517: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc( 0/ 8), 1.193: DFS-FIFO for weak LTL, using special progress label 513
pins2lts-mc( 0/ 8), 1.193: There are 514 state labels and 1 edge labels
pins2lts-mc( 0/ 8), 1.193: State length is 501, there are 504 groups
pins2lts-mc( 0/ 8), 1.193: Running dfsfifo using 8 cores
pins2lts-mc( 0/ 8), 1.193: Using a tree table with 2^27 elements
pins2lts-mc( 0/ 8), 1.193: Successor permutation: rr
pins2lts-mc( 0/ 8), 1.193: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc( 4/ 8), 3.137: ~1 levels ~960 states ~189504 transitions
pins2lts-mc( 3/ 8), 4.669: ~1 levels ~1920 states ~376440 transitions
pins2lts-mc( 3/ 8), 5.853: ~1 levels ~3840 states ~752776 transitions
pins2lts-mc( 3/ 8), 7.530: ~1 levels ~7680 states ~1505432 transitions
pins2lts-mc( 0/ 8), 10.060: ~1 levels ~15360 states ~3010944 transitions
pins2lts-mc( 4/ 8), 14.640: ~1 levels ~30720 states ~6022648 transitions
pins2lts-mc( 5/ 8), 24.325: ~1 levels ~61440 states ~11961464 transitions
pins2lts-mc( 5/ 8), 46.264: ~1 levels ~122880 states ~23881392 transitions
pins2lts-mc( 0/ 8), 75.136: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc( 0/ 8), 78.880:
pins2lts-mc( 0/ 8), 78.880: mean standard work distribution: 4.7% (states) 4.7% (transitions)
pins2lts-mc( 0/ 8), 78.880:
pins2lts-mc( 0/ 8), 78.880: Explored 178734 states 34716807 transitions, fanout: 194.237
pins2lts-mc( 0/ 8), 78.880: Total exploration time 77.640 sec (74.140 sec minimum, 75.440 sec on average)
pins2lts-mc( 0/ 8), 78.880: States per second: 2302, Transitions per second: 447151
pins2lts-mc( 0/ 8), 78.880:
pins2lts-mc( 0/ 8), 78.880: Progress states detected: 16184227
pins2lts-mc( 0/ 8), 78.880: Redundant explorations: -98.8957
pins2lts-mc( 0/ 8), 78.880:
pins2lts-mc( 0/ 8), 78.880: Queue width: 8B, total height: 17299269, memory: 131.98MB
pins2lts-mc( 0/ 8), 78.880: Tree memory: 379.5MB, 24.6 B/state, compr.: 1.2%
pins2lts-mc( 0/ 8), 78.880: Tree fill ratio (roots/leafs): 12.0%/100.0%
pins2lts-mc( 0/ 8), 78.880: Stored 510 string chucks using 0MB
pins2lts-mc( 0/ 8), 78.880: Total memory used for chunk indexing: 0MB
pins2lts-mc( 0/ 8), 78.880: Est. total memory use: 511.5MB (~1156.0MB paged-in)
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](X((LTLAP2==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:168)
at fr.lip6.move.gal.application.LTSminRunner.access$9(LTSminRunner.java:122)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:91)
at java.lang.Thread.run(Thread.java:748)
Mar 27, 2019 11:35:14 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 79 ms
Mar 27, 2019 11:35:14 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
Mar 27, 2019 11:35:14 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Mar 27, 2019 11:55:14 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 65 ms
Mar 27, 2019 11:55:14 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 13 ms
Mar 27, 2019 11:55:14 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms

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-COL-000100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsm"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstoolsm"
echo " Input is Philosophers-COL-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 r197-oct2-155272231400708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000100.tgz
mv Philosophers-COL-000100 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;