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-155272231400699.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-000050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-oct2-155272231400699
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.3K Feb 12 04:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 04:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 03:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 03:52 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.4K Feb 5 00:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K 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.1K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 4 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 1 02:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 1 02:47 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 12K 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-000050-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553684866265

11:08:12.425 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
11:08:12.431 [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(G(X("((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)>=1)"))))))
Formula 0 simplified : !XXGX"((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)>=1)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 250 rows 250 cols
invariant :think_47 + catch1_47 + catch2_47 + eat_47 = 1
invariant :fork_17 + catch1_18 + catch2_17 + eat_17 + eat_18 = 1
invariant :fork_20 + catch1_21 + catch2_20 + eat_20 + eat_21 = 1
invariant :fork_1 + catch1_2 + catch2_1 + eat_1 + eat_2 = 1
invariant :fork_43 + catch1_44 + catch2_43 + eat_43 + eat_44 = 1
invariant :think_6 + catch1_6 + catch2_6 + eat_6 = 1
invariant :fork_29 + catch1_30 + catch2_29 + eat_29 + eat_30 = 1
invariant :fork_25 + catch1_26 + catch2_25 + eat_25 + eat_26 = 1
invariant :fork_15 + catch1_16 + catch2_15 + eat_15 + eat_16 = 1
invariant :think_27 + catch1_27 + catch2_27 + eat_27 = 1
invariant :fork_36 + catch1_37 + catch2_36 + eat_36 + eat_37 = 1
invariant :fork_48 + catch1_49 + catch2_48 + eat_48 + eat_49 = 1
invariant :fork_22 + catch1_23 + catch2_22 + eat_22 + eat_23 = 1
invariant :think_7 + catch1_7 + catch2_7 + eat_7 = 1
invariant :fork_24 + catch1_25 + catch2_24 + eat_24 + eat_25 = 1
invariant :think_5 + catch1_5 + catch2_5 + eat_5 = 1
invariant :think_32 + catch1_32 + catch2_32 + eat_32 = 1
invariant :think_21 + catch1_21 + catch2_21 + eat_21 = 1
invariant :think_20 + catch1_20 + catch2_20 + eat_20 = 1
invariant :fork_4 + catch1_5 + catch2_4 + eat_4 + eat_5 = 1
invariant :fork_40 + catch1_41 + catch2_40 + eat_40 + eat_41 = 1
invariant :fork_6 + catch1_7 + catch2_6 + eat_6 + eat_7 = 1
invariant :fork_16 + catch1_17 + catch2_16 + eat_16 + eat_17 = 1
invariant :fork_44 + catch1_45 + catch2_44 + eat_44 + eat_45 = 1
invariant :think_13 + catch1_13 + catch2_13 + eat_13 = 1
invariant :think_37 + catch1_37 + catch2_37 + eat_37 = 1
invariant :think_41 + catch1_41 + catch2_41 + eat_41 = 1
invariant :think_8 + catch1_8 + catch2_8 + eat_8 = 1
invariant :fork_46 + catch1_47 + catch2_46 + eat_46 + eat_47 = 1
invariant :think_14 + catch1_14 + catch2_14 + eat_14 = 1
invariant :fork_9 + catch1_10 + catch2_9 + eat_9 + eat_10 = 1
invariant :fork_41 + catch1_42 + catch2_41 + eat_41 + eat_42 = 1
invariant :fork_7 + catch1_8 + catch2_7 + eat_7 + eat_8 = 1
invariant :think_49 + catch1_49 + catch2_49 + eat_49 = 1
invariant :fork_0 + catch1_1 + catch2_0 + eat_0 + eat_1 = 1
invariant :think_25 + catch1_25 + catch2_25 + eat_25 = 1
invariant :think_1 + catch1_1 + catch2_1 + eat_1 = 1
invariant :think_48 + catch1_48 + catch2_48 + eat_48 = 1
invariant :think_2 + catch1_2 + catch2_2 + eat_2 = 1
invariant :fork_30 + catch1_31 + catch2_30 + eat_30 + eat_31 = 1
invariant :think_35 + catch1_35 + catch2_35 + eat_35 = 1
invariant :fork_21 + catch1_22 + catch2_21 + eat_21 + eat_22 = 1
invariant :fork_10 + catch1_11 + catch2_10 + eat_10 + eat_11 = 1
invariant :fork_35 + catch1_36 + catch2_35 + eat_35 + eat_36 = 1
invariant :think_45 + catch1_45 + catch2_45 + eat_45 = 1
invariant :fork_31 + catch1_32 + catch2_31 + eat_31 + eat_32 = 1
invariant :fork_3 + catch1_4 + catch2_3 + eat_3 + eat_4 = 1
invariant :think_34 + catch1_34 + catch2_34 + eat_34 = 1
invariant :think_19 + catch1_19 + catch2_19 + eat_19 = 1
invariant :fork_11 + catch1_12 + catch2_11 + eat_11 + eat_12 = 1
invariant :think_10 + catch1_10 + catch2_10 + eat_10 = 1
invariant :fork_27 + catch1_28 + catch2_27 + eat_27 + eat_28 = 1
invariant :fork_33 + catch1_34 + catch2_33 + eat_33 + eat_34 = 1
invariant :think_39 + catch1_39 + catch2_39 + eat_39 = 1
invariant :fork_14 + catch1_15 + catch2_14 + eat_14 + eat_15 = 1
invariant :fork_32 + catch1_33 + catch2_32 + eat_32 + eat_33 = 1
invariant :fork_37 + catch1_38 + catch2_37 + eat_37 + eat_38 = 1
invariant :think_43 + catch1_43 + catch2_43 + eat_43 = 1
invariant :think_26 + catch1_26 + catch2_26 + eat_26 = 1
invariant :think_3 + catch1_3 + catch2_3 + eat_3 = 1
invariant :think_15 + catch1_15 + catch2_15 + eat_15 = 1
invariant :fork_26 + catch1_27 + catch2_26 + eat_26 + eat_27 = 1
invariant :fork_39 + catch1_40 + catch2_39 + eat_39 + eat_40 = 1
invariant :think_30 + catch1_30 + catch2_30 + eat_30 = 1
invariant :think_9 + catch1_9 + catch2_9 + eat_9 = 1
invariant :think_36 + catch1_36 + catch2_36 + eat_36 = 1
invariant :think_11 + catch1_11 + catch2_11 + eat_11 = 1
invariant :fork_18 + catch1_19 + catch2_18 + eat_18 + eat_19 = 1
invariant :think_17 + catch1_17 + catch2_17 + eat_17 = 1
invariant :think_38 + catch1_38 + catch2_38 + eat_38 = 1
invariant :think_42 + catch1_42 + catch2_42 + eat_42 = 1
invariant :think_40 + catch1_40 + catch2_40 + eat_40 = 1
invariant :fork_28 + catch1_29 + catch2_28 + eat_28 + eat_29 = 1
invariant :fork_13 + catch1_14 + catch2_13 + eat_13 + eat_14 = 1
invariant :fork_49 + catch1_0 + catch2_49 + eat_0 + eat_49 = 1
invariant :fork_19 + catch1_20 + catch2_19 + eat_19 + eat_20 = 1
invariant :fork_42 + catch1_43 + catch2_42 + eat_42 + eat_43 = 1
invariant :fork_2 + catch1_3 + catch2_2 + eat_2 + eat_3 = 1
invariant :think_44 + catch1_44 + catch2_44 + eat_44 = 1
invariant :think_31 + catch1_31 + catch2_31 + eat_31 = 1
invariant :think_28 + catch1_28 + catch2_28 + eat_28 = 1
invariant :fork_34 + catch1_35 + catch2_34 + eat_34 + eat_35 = 1
invariant :think_4 + catch1_4 + catch2_4 + eat_4 = 1
invariant :fork_5 + catch1_6 + catch2_5 + eat_5 + eat_6 = 1
invariant :fork_8 + catch1_9 + catch2_8 + eat_8 + eat_9 = 1
invariant :think_23 + catch1_23 + catch2_23 + eat_23 = 1
invariant :think_29 + catch1_29 + catch2_29 + eat_29 = 1
invariant :think_22 + catch1_22 + catch2_22 + eat_22 = 1
invariant :think_0 + catch1_0 + catch2_0 + eat_0 = 1
invariant :think_12 + catch1_12 + catch2_12 + eat_12 = 1
invariant :fork_47 + catch1_48 + catch2_47 + eat_47 + eat_48 = 1
invariant :fork_12 + catch1_13 + catch2_12 + eat_12 + eat_13 = 1
invariant :think_18 + catch1_18 + catch2_18 + eat_18 = 1
invariant :think_24 + catch1_24 + catch2_24 + eat_24 = 1
invariant :fork_45 + catch1_46 + catch2_45 + eat_45 + eat_46 = 1
invariant :think_16 + catch1_16 + catch2_16 + eat_16 = 1
invariant :think_33 + catch1_33 + catch2_33 + eat_33 = 1
invariant :fork_23 + catch1_24 + catch2_23 + eat_23 + eat_24 = 1
invariant :think_46 + catch1_46 + catch2_46 + eat_46 = 1
invariant :fork_38 + catch1_39 + catch2_38 + eat_38 + eat_39 = 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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
478 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,4.81685,136332,1,0,155,566630,23,105,8941,660990,271
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F("((((((((((((((((((((((((((((((((((((((((((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)+fork_10)+fork_11)+fork_12)+fork_13)+fork_14)+fork_15)+fork_16)+fork_17)+fork_18)+fork_19)+fork_20)+fork_21)+fork_22)+fork_23)+fork_24)+fork_25)+fork_26)+fork_27)+fork_28)+fork_29)+fork_30)+fork_31)+fork_32)+fork_33)+fork_34)+fork_35)+fork_36)+fork_37)+fork_38)+fork_39)+fork_40)+fork_41)+fork_42)+fork_43)+fork_44)+fork_45)+fork_46)+fork_47)+fork_48)+fork_49)<=(((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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))")))
Formula 1 simplified : !F"((((((((((((((((((((((((((((((((((((((((((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)+fork_10)+fork_11)+fork_12)+fork_13)+fork_14)+fork_15)+fork_16)+fork_17)+fork_18)+fork_19)+fork_20)+fork_21)+fork_22)+fork_23)+fork_24)+fork_25)+fork_26)+fork_27)+fork_28)+fork_29)+fork_30)+fork_31)+fork_32)+fork_33)+fork_34)+fork_35)+fork_36)+fork_37)+fork_38)+fork_39)+fork_40)+fork_41)+fork_42)+fork_43)+fork_44)+fork_45)+fork_46)+fork_47)+fork_48)+fork_49)<=(((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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))"
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 6186 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 68 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>((LTLAP1==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 658 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]([]([]((LTLAP2==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 1231 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([](X((LTLAP3==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 810 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(X(<>([]((LTLAP4==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5157 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,56.3806,618824,1,0,231,1.98444e+06,32,204,44473,3.27988e+06,525
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(G(G("((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)>=3)"))))))
Formula 2 simplified : !FG"((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)>=3)"
Computing Next relation with stutter on 2 deadlock states
LTSmin run took 29919 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X([](X((LTLAP5==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
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([](X((LTLAP5==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
255
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8597 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,142.364,1384856,1,0,653,4.86787e+06,45,538,47023,1.0248e+07,1348
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(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)>=3)")))))
Formula 3 simplified : !FGX"((((((((((((((((((((((((((((((((((((((((((((((((((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)>=3)"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
29 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,142.652,1389308,1,0,655,4.88766e+06,50,541,47699,1.02772e+07,1361
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(F(G("((((((((((((((((((((((((((((((((((((((((((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_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)>=2)"))))))
Formula 4 simplified : !FXFG"((((((((((((((((((((((((((((((((((((((((((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_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)>=2)"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2895 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,171.602,1854716,1,0,1085,6.56846e+06,63,883,50249,1.42747e+07,2193
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(X("((((((((((((((((((((((((((((((((((((((((((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)+fork_10)+fork_11)+fork_12)+fork_13)+fork_14)+fork_15)+fork_16)+fork_17)+fork_18)+fork_19)+fork_20)+fork_21)+fork_22)+fork_23)+fork_24)+fork_25)+fork_26)+fork_27)+fork_28)+fork_29)+fork_30)+fork_31)+fork_32)+fork_33)+fork_34)+fork_35)+fork_36)+fork_37)+fork_38)+fork_39)+fork_40)+fork_41)+fork_42)+fork_43)+fork_44)+fork_45)+fork_46)+fork_47)+fork_48)+fork_49)>=1)")))))
Formula 5 simplified : !XGX"((((((((((((((((((((((((((((((((((((((((((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)+fork_10)+fork_11)+fork_12)+fork_13)+fork_14)+fork_15)+fork_16)+fork_17)+fork_18)+fork_19)+fork_20)+fork_21)+fork_22)+fork_23)+fork_24)+fork_25)+fork_26)+fork_27)+fork_28)+fork_29)+fork_30)+fork_31)+fork_32)+fork_33)+fork_34)+fork_35)+fork_36)+fork_37)+fork_38)+fork_39)+fork_40)+fork_41)+fork_42)+fork_43)+fork_44)+fork_45)+fork_46)+fork_47)+fork_48)+fork_49)>=1)"
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
165 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,173.262,1893504,1,0,1114,6.57543e+06,69,938,52798,1.42869e+07,2378
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G(G("((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)<=(((((((((((((((((((((((((((((((((((((((((((((((((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))")))U(F(G("((((((((((((((((((((((((((((((((((((((((((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)+fork_10)+fork_11)+fork_12)+fork_13)+fork_14)+fork_15)+fork_16)+fork_17)+fork_18)+fork_19)+fork_20)+fork_21)+fork_22)+fork_23)+fork_24)+fork_25)+fork_26)+fork_27)+fork_28)+fork_29)+fork_30)+fork_31)+fork_32)+fork_33)+fork_34)+fork_35)+fork_36)+fork_37)+fork_38)+fork_39)+fork_40)+fork_41)+fork_42)+fork_43)+fork_44)+fork_45)+fork_46)+fork_47)+fork_48)+fork_49)<=(((((((((((((((((((((((((((((((((((((((((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_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))")))))
Formula 6 simplified : !(G"((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)<=(((((((((((((((((((((((((((((((((((((((((((((((((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))" U FG"((((((((((((((((((((((((((((((((((((((((((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)+fork_10)+fork_11)+fork_12)+fork_13)+fork_14)+fork_15)+fork_16)+fork_17)+fork_18)+fork_19)+fork_20)+fork_21)+fork_22)+fork_23)+fork_24)+fork_25)+fork_26)+fork_27)+fork_28)+fork_29)+fork_30)+fork_31)+fork_32)+fork_33)+fork_34)+fork_35)+fork_36)+fork_37)+fork_38)+fork_39)+fork_40)+fork_41)+fork_42)+fork_43)+fork_44)+fork_45)+fork_46)+fork_47)+fork_48)+fork_49)<=(((((((((((((((((((((((((((((((((((((((((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_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))")
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
25089 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,424.166,2502968,1,0,1127,8.71887e+06,15,948,95905,2.21359e+07,181
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G("((((((((((((((((((((((((((((((((((((((((((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_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)<=(((((((((((((((((((((((((((((((((((((((((((((((((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))")))
Formula 7 simplified : !G"((((((((((((((((((((((((((((((((((((((((((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_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)<=(((((((((((((((((((((((((((((((((((((((((((((((((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))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
4796 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,472.135,2502968,1,0,1127,8.71887e+06,29,948,168759,2.21359e+07,455
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(F(F("((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)<=(((((((((((((((((((((((((((((((((((((((((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)+fork_10)+fork_11)+fork_12)+fork_13)+fork_14)+fork_15)+fork_16)+fork_17)+fork_18)+fork_19)+fork_20)+fork_21)+fork_22)+fork_23)+fork_24)+fork_25)+fork_26)+fork_27)+fork_28)+fork_29)+fork_30)+fork_31)+fork_32)+fork_33)+fork_34)+fork_35)+fork_36)+fork_37)+fork_38)+fork_39)+fork_40)+fork_41)+fork_42)+fork_43)+fork_44)+fork_45)+fork_46)+fork_47)+fork_48)+fork_49))"))))))
Formula 8 simplified : !FXF"((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)<=(((((((((((((((((((((((((((((((((((((((((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)+fork_10)+fork_11)+fork_12)+fork_13)+fork_14)+fork_15)+fork_16)+fork_17)+fork_18)+fork_19)+fork_20)+fork_21)+fork_22)+fork_23)+fork_24)+fork_25)+fork_26)+fork_27)+fork_28)+fork_29)+fork_30)+fork_31)+fork_32)+fork_33)+fork_34)+fork_35)+fork_36)+fork_37)+fork_38)+fork_39)+fork_40)+fork_41)+fork_42)+fork_43)+fork_44)+fork_45)+fork_46)+fork_47)+fork_48)+fork_49))"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
7 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,472.229,2502968,1,0,1127,8.71887e+06,38,948,169080,2.21359e+07,459
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((true))
Formula 9 simplified : 0
Computing Next relation with stutter on 2 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 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,472.23,2502968,1,0,1127,8.71887e+06,38,948,169080,2.21359e+07,459
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((false))
Formula 10 simplified : 1
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 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,472.232,2502968,1,0,1127,8.71887e+06,38,948,169080,2.21359e+07,461
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(G(X(X("((((((((((((((((((((((((((((((((((((((((((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)+fork_10)+fork_11)+fork_12)+fork_13)+fork_14)+fork_15)+fork_16)+fork_17)+fork_18)+fork_19)+fork_20)+fork_21)+fork_22)+fork_23)+fork_24)+fork_25)+fork_26)+fork_27)+fork_28)+fork_29)+fork_30)+fork_31)+fork_32)+fork_33)+fork_34)+fork_35)+fork_36)+fork_37)+fork_38)+fork_39)+fork_40)+fork_41)+fork_42)+fork_43)+fork_44)+fork_45)+fork_46)+fork_47)+fork_48)+fork_49)<=(((((((((((((((((((((((((((((((((((((((((((((((((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))"))))))
Formula 11 simplified : !GXX"((((((((((((((((((((((((((((((((((((((((((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)+fork_10)+fork_11)+fork_12)+fork_13)+fork_14)+fork_15)+fork_16)+fork_17)+fork_18)+fork_19)+fork_20)+fork_21)+fork_22)+fork_23)+fork_24)+fork_25)+fork_26)+fork_27)+fork_28)+fork_29)+fork_30)+fork_31)+fork_32)+fork_33)+fork_34)+fork_35)+fork_36)+fork_37)+fork_38)+fork_39)+fork_40)+fork_41)+fork_42)+fork_43)+fork_44)+fork_45)+fork_46)+fork_47)+fork_48)+fork_49)<=(((((((((((((((((((((((((((((((((((((((((((((((((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))"
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
23 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,472.476,2502968,1,0,1127,8.71887e+06,44,948,169956,2.21359e+07,474
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((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)>=1)"))U(G("((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)<=(((((((((((((((((((((((((((((((((((((((((((((((((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))")))))
Formula 12 simplified : !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)>=1)" U G"((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)<=(((((((((((((((((((((((((((((((((((((((((((((((((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))")
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11213 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,584.61,2759508,1,0,1127,8.71887e+06,19,948,52906,2.28543e+07,507
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((true))
Formula 13 simplified : 0
Computing Next relation with stutter on 2 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
6 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,584.664,2759508,1,0,1127,8.71887e+06,20,948,53801,2.28543e+07,508
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((F("((((((((((((((((((((((((((((((((((((((((((((((((((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)<=(((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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))"))U(("((((((((((((((((((((((((((((((((((((((((((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_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)>=3)")U("((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)<=(((((((((((((((((((((((((((((((((((((((((((((((((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))"))))
Formula 14 simplified : !(F"((((((((((((((((((((((((((((((((((((((((((((((((((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)<=(((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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))" U ("((((((((((((((((((((((((((((((((((((((((((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_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)>=3)" U "((((((((((((((((((((((((((((((((((((((((((((((((((catch2_0+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)<=(((((((((((((((((((((((((((((((((((((((((((((((((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))"))
Computing Next relation with stutter on 2 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 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,584.672,2759720,1,0,1127,8.71887e+06,29,948,53858,2.28543e+07,512
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((true))
Formula 15 simplified : 0
Computing Next relation with stutter on 2 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 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,584.672,2759720,1,0,1127,8.71887e+06,29,948,53858,2.28543e+07,512
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Philosophers-COL-000050-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1553685601194

--------------------
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:07: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:07:48 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 11:07: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:08:12 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 24830 ms
Mar 27, 2019 11:08:12 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
Mar 27, 2019 11:08:12 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 27, 2019 11:08:12 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

Mar 27, 2019 11:08:12 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Mar 27, 2019 11:08:12 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 27, 2019 11:08:12 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 4 ms
Mar 27, 2019 11:08:13 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 93 ms
Mar 27, 2019 11:08:13 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 92 ms
Mar 27, 2019 11:08:13 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 250 transitions.
Mar 27, 2019 11:08:13 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 250 places.
Mar 27, 2019 11:08:13 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 250 transitions.
Mar 27, 2019 11:08:13 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 250 transitions.
Mar 27, 2019 11:08:13 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
Mar 27, 2019 11:08:13 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Mar 27, 2019 11:08:14 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 100 place invariants in 66 ms
Mar 27, 2019 11:08:14 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 250 variables to be positive in 477 ms
Mar 27, 2019 11:08:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 250 transitions.
Mar 27, 2019 11:08:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/250 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 11:08:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 11:08:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 250 transitions.
Mar 27, 2019 11:08:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 11:08:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 250 transitions.
Mar 27, 2019 11:08:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/250) took 114 ms. Total solver calls (SAT/UNSAT): 8(3/5)
Mar 27, 2019 11:08:52 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(111/250) took 3125 ms. Total solver calls (SAT/UNSAT): 785(212/573)
Mar 27, 2019 11:08:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(165/250) took 6133 ms. Total solver calls (SAT/UNSAT): 1115(250/865)
Mar 27, 2019 11:08:57 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 7988 ms. Total solver calls (SAT/UNSAT): 1300(250/1050)
Mar 27, 2019 11:08:57 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 250 transitions.
Mar 27, 2019 11:08:57 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 11:08:57 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 44027ms conformant to PINS in folder :/home/mcc/execution
pins2lts-mc, 0.000: Registering PINS so language module
pins2lts-mc( 0/ 8), 0.026: Loading model from ./gal.so
pins2lts-mc( 6/ 8), 0.025: library has no initializer
pins2lts-mc( 6/ 8), 0.025: loading model GAL
pins2lts-mc( 1/ 8), 0.025: library has no initializer
pins2lts-mc( 1/ 8), 0.025: loading model GAL
pins2lts-mc( 3/ 8), 0.026: library has no initializer
pins2lts-mc( 3/ 8), 0.026: loading model GAL
pins2lts-mc( 0/ 8), 0.026: library has no initializer
pins2lts-mc( 0/ 8), 0.027: loading model GAL
pins2lts-mc( 4/ 8), 0.026: library has no initializer
pins2lts-mc( 4/ 8), 0.026: loading model GAL
pins2lts-mc( 7/ 8), 0.026: library has no initializer
pins2lts-mc( 7/ 8), 0.027: loading model GAL
pins2lts-mc( 2/ 8), 0.026: library has no initializer
pins2lts-mc( 2/ 8), 0.027: loading model GAL
pins2lts-mc( 5/ 8), 0.027: library has no initializer
pins2lts-mc( 5/ 8), 0.027: loading model GAL
pins2lts-mc( 6/ 8), 0.029: completed loading model GAL
pins2lts-mc( 6/ 8), 0.029: LTL layer: formula: X([](X((LTLAP5==true))))
pins2lts-mc( 1/ 8), 0.029: completed loading model GAL
pins2lts-mc( 6/ 8), 0.029: "X([](X((LTLAP5==true))))" is not a file, parsing as formula...
pins2lts-mc( 6/ 8), 0.030: Using Spin LTL semantics
pins2lts-mc( 0/ 8), 0.033: completed loading model GAL
pins2lts-mc( 3/ 8), 0.033: completed loading model GAL
pins2lts-mc( 4/ 8), 0.033: completed loading model GAL
pins2lts-mc( 2/ 8), 0.035: completed loading model GAL
pins2lts-mc( 5/ 8), 0.034: completed loading model GAL
pins2lts-mc( 7/ 8), 0.041: completed loading model GAL
pins2lts-mc( 0/ 8), 0.107: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc( 0/ 8), 0.623: DFS-FIFO for weak LTL, using special progress label 266
pins2lts-mc( 0/ 8), 0.623: There are 267 state labels and 1 edge labels
pins2lts-mc( 0/ 8), 0.623: State length is 251, there are 255 groups
pins2lts-mc( 0/ 8), 0.623: Running dfsfifo using 8 cores
pins2lts-mc( 0/ 8), 0.623: Using a tree table with 2^27 elements
pins2lts-mc( 0/ 8), 0.623: Successor permutation: rr
pins2lts-mc( 0/ 8), 0.623: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc( 6/ 8), 11.274: ~1 levels ~960 states ~92248 transitions
pins2lts-mc( 6/ 8), 12.128: ~1 levels ~1920 states ~184424 transitions
pins2lts-mc( 3/ 8), 13.526: ~1 levels ~3840 states ~369168 transitions
pins2lts-mc( 0/ 8), 15.183: ~1 levels ~7680 states ~737672 transitions
pins2lts-mc( 0/ 8), 19.267: ~1 levels ~15360 states ~1461112 transitions
pins2lts-mc( 0/ 8), 27.275: ~1 levels ~30720 states ~2905328 transitions
pins2lts-mc( 6/ 8), 35.709: ~1 levels ~61440 states ~5781880 transitions
pins2lts-mc( 6/ 8), 56.393: ~1 levels ~122880 states ~11516032 transitions
pins2lts-mc( 2/ 8), 81.904: ~1 levels ~245760 states ~22811464 transitions
pins2lts-mc( 1/ 8), 132.764: ~1 levels ~491520 states ~45590768 transitions
pins2lts-mc( 4/ 8), 161.851: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc( 0/ 8), 165.015:
pins2lts-mc( 0/ 8), 165.015: mean standard work distribution: 3.0% (states) 2.9% (transitions)
pins2lts-mc( 0/ 8), 165.015:
pins2lts-mc( 0/ 8), 165.015: Explored 559751 states 51860123 transitions, fanout: 92.649
pins2lts-mc( 0/ 8), 165.015: Total exploration time 164.330 sec (161.620 sec minimum, 163.135 sec on average)
pins2lts-mc( 0/ 8), 165.015: States per second: 3406, Transitions per second: 315585
pins2lts-mc( 0/ 8), 165.015:
pins2lts-mc( 0/ 8), 165.015: Progress states detected: 18598291
pins2lts-mc( 0/ 8), 165.015: Redundant explorations: -96.9904
pins2lts-mc( 0/ 8), 165.015:
pins2lts-mc( 0/ 8), 165.015: Queue width: 8B, total height: 21723864, memory: 165.74MB
pins2lts-mc( 0/ 8), 165.015: Tree memory: 397.9MB, 22.4 B/state, compr.: 2.2%
pins2lts-mc( 0/ 8), 165.015: Tree fill ratio (roots/leafs): 13.0%/100.0%
pins2lts-mc( 0/ 8), 165.015: Stored 254 string chucks using 0MB
pins2lts-mc( 0/ 8), 165.015: Total memory used for chunk indexing: 0MB
pins2lts-mc( 0/ 8), 165.015: Est. total memory use: 563.6MB (~1189.7MB 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([](X((LTLAP5==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)

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-000050"
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-000050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-oct2-155272231400699"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000050.tgz
mv Philosophers-COL-000050 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 ;