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.r107-oct2-155272231600817.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 itstools
Input is Philosophers-PT-000050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-oct2-155272231600817
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 23K Feb 12 04:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 12 04:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 8 03:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K 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 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 9.9K Feb 5 00:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Feb 5 00:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 4 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 4 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 1 02:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 1 02:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 205K 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-PT-000050-LTLFireability-00
FORMULA_NAME Philosophers-PT-000050-LTLFireability-01
FORMULA_NAME Philosophers-PT-000050-LTLFireability-02
FORMULA_NAME Philosophers-PT-000050-LTLFireability-03
FORMULA_NAME Philosophers-PT-000050-LTLFireability-04
FORMULA_NAME Philosophers-PT-000050-LTLFireability-05
FORMULA_NAME Philosophers-PT-000050-LTLFireability-06
FORMULA_NAME Philosophers-PT-000050-LTLFireability-07
FORMULA_NAME Philosophers-PT-000050-LTLFireability-08
FORMULA_NAME Philosophers-PT-000050-LTLFireability-09
FORMULA_NAME Philosophers-PT-000050-LTLFireability-10
FORMULA_NAME Philosophers-PT-000050-LTLFireability-11
FORMULA_NAME Philosophers-PT-000050-LTLFireability-12
FORMULA_NAME Philosophers-PT-000050-LTLFireability-13
FORMULA_NAME Philosophers-PT-000050-LTLFireability-14
FORMULA_NAME Philosophers-PT-000050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552955991336

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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.201903111103/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F("((((((((((((((((((((((((((((((((((((((((((((((((((Eat_2>=1)||(Eat_3>=1))||(Eat_1>=1))||(Eat_23>=1))||(Eat_22>=1))||(Eat_21>=1))||(Eat_20>=1))||(Eat_27>=1))||(Eat_26>=1))||(Eat_25>=1))||(Eat_24>=1))||(Eat_31>=1))||(Eat_30>=1))||(Eat_29>=1))||(Eat_28>=1))||(Eat_35>=1))||(Eat_34>=1))||(Eat_33>=1))||(Eat_32>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(Eat_10>=1))||(Eat_11>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_14>=1))||(Eat_15>=1))||(Eat_12>=1))||(Eat_13>=1))||(Eat_18>=1))||(Eat_19>=1))||(Eat_16>=1))||(Eat_17>=1))||(Eat_36>=1))||(Eat_37>=1))||(Eat_38>=1))||(Eat_39>=1))||(Eat_40>=1))||(Eat_41>=1))||(Eat_42>=1))||(Eat_43>=1))||(Eat_44>=1))||(Eat_45>=1))||(Eat_46>=1))||(Eat_47>=1))||(Eat_48>=1))||(Eat_49>=1))||(Eat_50>=1))")))
Formula 0 simplified : !F"((((((((((((((((((((((((((((((((((((((((((((((((((Eat_2>=1)||(Eat_3>=1))||(Eat_1>=1))||(Eat_23>=1))||(Eat_22>=1))||(Eat_21>=1))||(Eat_20>=1))||(Eat_27>=1))||(Eat_26>=1))||(Eat_25>=1))||(Eat_24>=1))||(Eat_31>=1))||(Eat_30>=1))||(Eat_29>=1))||(Eat_28>=1))||(Eat_35>=1))||(Eat_34>=1))||(Eat_33>=1))||(Eat_32>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(Eat_10>=1))||(Eat_11>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_14>=1))||(Eat_15>=1))||(Eat_12>=1))||(Eat_13>=1))||(Eat_18>=1))||(Eat_19>=1))||(Eat_16>=1))||(Eat_17>=1))||(Eat_36>=1))||(Eat_37>=1))||(Eat_38>=1))||(Eat_39>=1))||(Eat_40>=1))||(Eat_41>=1))||(Eat_42>=1))||(Eat_43>=1))||(Eat_44>=1))||(Eat_45>=1))||(Eat_46>=1))||(Eat_47>=1))||(Eat_48>=1))||(Eat_49>=1))||(Eat_50>=1))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 250 rows 250 cols
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
invariant :Eat_24 + Think_24 + Catch2_24 + Catch1_24 = 1
invariant :Fork_1 + -1'Think_1 + -1'Think_2 + -1'Catch2_2 + -1'Catch1_1 = -1
invariant :Fork_27 + -1'Think_27 + -1'Think_28 + -1'Catch2_28 + -1'Catch1_27 = -1
invariant :Eat_37 + Think_37 + Catch2_37 + Catch1_37 = 1
invariant :Fork_28 + -1'Think_29 + -1'Think_28 + -1'Catch2_29 + -1'Catch1_28 = -1
invariant :Eat_9 + Think_9 + Catch2_9 + Catch1_9 = 1
invariant :Fork_20 + -1'Think_21 + -1'Think_20 + -1'Catch2_21 + -1'Catch1_20 = -1
invariant :Eat_20 + Think_20 + Catch2_20 + Catch1_20 = 1
invariant :Eat_46 + Think_46 + Catch2_46 + Catch1_46 = 1
invariant :Fork_19 + -1'Think_20 + -1'Think_19 + -1'Catch2_20 + -1'Catch1_19 = -1
invariant :Fork_48 + -1'Think_48 + -1'Think_49 + -1'Catch2_49 + -1'Catch1_48 = -1
invariant :Fork_30 + -1'Think_31 + -1'Think_30 + -1'Catch2_31 + -1'Catch1_30 = -1
invariant :Fork_37 + -1'Think_37 + -1'Think_38 + -1'Catch2_38 + -1'Catch1_37 = -1
invariant :Fork_18 + -1'Think_19 + -1'Think_18 + -1'Catch2_19 + -1'Catch1_18 = -1
invariant :Eat_45 + Think_45 + Catch2_45 + Catch1_45 = 1
invariant :Fork_50 + -1'Think_1 + -1'Think_50 + -1'Catch2_1 + -1'Catch1_50 = -1
invariant :Fork_16 + -1'Think_17 + -1'Think_16 + -1'Catch2_17 + -1'Catch1_16 = -1
invariant :Eat_48 + Think_48 + Catch2_48 + Catch1_48 = 1
invariant :Fork_38 + -1'Think_39 + -1'Think_38 + -1'Catch2_39 + -1'Catch1_38 = -1
invariant :Eat_32 + Think_32 + Catch2_32 + Catch1_32 = 1
invariant :Fork_25 + -1'Think_25 + -1'Think_26 + -1'Catch2_26 + -1'Catch1_25 = -1
invariant :Eat_34 + Think_34 + Catch2_34 + Catch1_34 = 1
invariant :Fork_47 + -1'Think_47 + -1'Think_48 + -1'Catch2_48 + -1'Catch1_47 = -1
invariant :Fork_6 + -1'Think_6 + -1'Think_7 + -1'Catch2_7 + -1'Catch1_6 = -1
invariant :Fork_8 + -1'Think_8 + -1'Think_9 + -1'Catch2_9 + -1'Catch1_8 = -1
invariant :Eat_36 + Think_36 + Catch2_36 + Catch1_36 = 1
invariant :Fork_4 + -1'Think_4 + -1'Think_5 + -1'Catch2_5 + -1'Catch1_4 = -1
invariant :Eat_5 + Think_5 + Catch2_5 + Catch1_5 = 1
invariant :Eat_27 + Think_27 + Catch2_27 + Catch1_27 = 1
invariant :Eat_38 + Think_38 + Catch2_38 + Catch1_38 = 1
invariant :Fork_49 + -1'Think_50 + -1'Think_49 + -1'Catch2_50 + -1'Catch1_49 = -1
invariant :Eat_13 + Think_13 + Catch2_13 + Catch1_13 = 1
invariant :Fork_5 + -1'Think_6 + -1'Think_5 + -1'Catch2_6 + -1'Catch1_5 = -1
invariant :Eat_30 + Think_30 + Catch2_30 + Catch1_30 = 1
invariant :Fork_21 + -1'Think_22 + -1'Think_21 + -1'Catch2_22 + -1'Catch1_21 = -1
invariant :Eat_14 + Think_14 + Catch2_14 + Catch1_14 = 1
invariant :Fork_39 + -1'Think_39 + -1'Think_40 + -1'Catch2_40 + -1'Catch1_39 = -1
invariant :Fork_11 + -1'Think_12 + -1'Think_11 + -1'Catch2_12 + -1'Catch1_11 = -1
invariant :Eat_26 + Think_26 + Catch2_26 + Catch1_26 = 1
invariant :Eat_49 + Think_49 + Catch2_49 + Catch1_49 = 1
invariant :Fork_26 + -1'Think_27 + -1'Think_26 + -1'Catch2_27 + -1'Catch1_26 = -1
invariant :Fork_10 + -1'Think_11 + -1'Think_10 + -1'Catch2_11 + -1'Catch1_10 = -1
invariant :Eat_25 + Think_25 + Catch2_25 + Catch1_25 = 1
invariant :Eat_44 + Think_44 + Catch2_44 + Catch1_44 = 1
invariant :Fork_40 + -1'Think_41 + -1'Think_40 + -1'Catch2_41 + -1'Catch1_40 = -1
invariant :Fork_46 + -1'Think_46 + -1'Think_47 + -1'Catch2_47 + -1'Catch1_46 = -1
invariant :Eat_12 + Think_12 + Catch2_12 + Catch1_12 = 1
invariant :Fork_36 + -1'Think_37 + -1'Think_36 + -1'Catch2_37 + -1'Catch1_36 = -1
invariant :Fork_15 + -1'Think_16 + -1'Think_15 + -1'Catch2_16 + -1'Catch1_15 = -1
invariant :Eat_28 + Think_28 + Catch2_28 + Catch1_28 = 1
invariant :Fork_12 + -1'Think_13 + -1'Think_12 + -1'Catch2_13 + -1'Catch1_12 = -1
invariant :Eat_33 + Think_33 + Catch2_33 + Catch1_33 = 1
invariant :Eat_43 + Think_43 + Catch2_43 + Catch1_43 = 1
invariant :Fork_35 + -1'Think_35 + -1'Think_36 + -1'Catch2_36 + -1'Catch1_35 = -1
invariant :Eat_50 + Think_50 + Catch2_50 + Catch1_50 = 1
invariant :Fork_32 + -1'Think_33 + -1'Think_32 + -1'Catch2_33 + -1'Catch1_32 = -1
invariant :Eat_40 + Think_40 + Catch2_40 + Catch1_40 = 1
invariant :Fork_45 + -1'Think_45 + -1'Think_46 + -1'Catch2_46 + -1'Catch1_45 = -1
invariant :Eat_18 + Think_18 + Catch2_18 + Catch1_18 = 1
invariant :Fork_17 + -1'Think_17 + -1'Think_18 + -1'Catch2_18 + -1'Catch1_17 = -1
invariant :Fork_29 + -1'Think_29 + -1'Think_30 + -1'Catch2_30 + -1'Catch1_29 = -1
invariant :Fork_9 + -1'Think_9 + -1'Think_10 + -1'Catch2_10 + -1'Catch1_9 = -1
invariant :Fork_43 + -1'Think_43 + -1'Think_44 + -1'Catch2_44 + -1'Catch1_43 = -1
invariant :Eat_3 + Think_3 + Catch2_3 + Catch1_3 = 1
invariant :Eat_41 + Think_41 + Catch2_41 + Catch1_41 = 1
invariant :Eat_17 + Think_17 + Catch2_17 + Catch1_17 = 1
invariant :Eat_29 + Think_29 + Catch2_29 + Catch1_29 = 1
invariant :Eat_47 + Think_47 + Catch2_47 + Catch1_47 = 1
invariant :Fork_14 + -1'Think_15 + -1'Think_14 + -1'Catch2_15 + -1'Catch1_14 = -1
invariant :Fork_23 + -1'Think_24 + -1'Think_23 + -1'Catch2_24 + -1'Catch1_23 = -1
invariant :Eat_22 + Think_22 + Catch2_22 + Catch1_22 = 1
invariant :Eat_21 + Think_21 + Catch2_21 + Catch1_21 = 1
invariant :Eat_2 + Think_2 + Catch2_2 + Catch1_2 = 1
invariant :Eat_39 + Think_39 + Catch2_39 + Catch1_39 = 1
invariant :Eat_10 + Think_10 + Catch2_10 + Catch1_10 = 1
invariant :Fork_7 + -1'Think_8 + -1'Think_7 + -1'Catch2_8 + -1'Catch1_7 = -1
invariant :Fork_22 + -1'Think_23 + -1'Think_22 + -1'Catch2_23 + -1'Catch1_22 = -1
invariant :Eat_15 + Think_15 + Catch2_15 + Catch1_15 = 1
invariant :Fork_42 + -1'Think_42 + -1'Think_43 + -1'Catch2_43 + -1'Catch1_42 = -1
invariant :Fork_44 + -1'Think_44 + -1'Think_45 + -1'Catch2_45 + -1'Catch1_44 = -1
invariant :Eat_6 + Think_6 + Catch2_6 + Catch1_6 = 1
invariant :Eat_31 + Think_31 + Catch2_31 + Catch1_31 = 1
invariant :Fork_13 + -1'Think_14 + -1'Think_13 + -1'Catch2_14 + -1'Catch1_13 = -1
invariant :Eat_11 + Think_11 + Catch2_11 + Catch1_11 = 1
invariant :Eat_35 + Think_35 + Catch2_35 + Catch1_35 = 1
invariant :Eat_16 + Think_16 + Catch2_16 + Catch1_16 = 1
invariant :Fork_33 + -1'Think_34 + -1'Think_33 + -1'Catch2_34 + -1'Catch1_33 = -1
invariant :Eat_42 + Think_42 + Catch2_42 + Catch1_42 = 1
invariant :Eat_23 + Think_23 + Catch2_23 + Catch1_23 = 1
invariant :Fork_41 + -1'Think_41 + -1'Think_42 + -1'Catch2_42 + -1'Catch1_41 = -1
invariant :Eat_1 + Think_1 + Catch2_1 + Catch1_1 = 1
invariant :Eat_7 + Think_7 + Catch2_7 + Catch1_7 = 1
invariant :Fork_3 + -1'Think_4 + -1'Think_3 + -1'Catch2_4 + -1'Catch1_3 = -1
invariant :Fork_24 + -1'Think_25 + -1'Think_24 + -1'Catch2_25 + -1'Catch1_24 = -1
invariant :Fork_2 + -1'Think_2 + -1'Think_3 + -1'Catch2_3 + -1'Catch1_2 = -1
invariant :Eat_4 + Think_4 + Catch2_4 + Catch1_4 = 1
invariant :Eat_8 + Think_8 + Catch2_8 + Catch1_8 = 1
invariant :Fork_34 + -1'Think_35 + -1'Think_34 + -1'Catch2_35 + -1'Catch1_34 = -1
invariant :Fork_31 + -1'Think_31 + -1'Think_32 + -1'Catch2_32 + -1'Catch1_31 = -1
invariant :Eat_19 + Think_19 + Catch2_19 + Catch1_19 = 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
329 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,3.38626,95116,1,0,254,479041,20,203,6102,444331,515
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(F(("((((((((((((((((((((((((((((((((((((((((((((((((((Eat_2>=1)||(Eat_3>=1))||(Eat_1>=1))||(Eat_23>=1))||(Eat_22>=1))||(Eat_21>=1))||(Eat_20>=1))||(Eat_27>=1))||(Eat_26>=1))||(Eat_25>=1))||(Eat_24>=1))||(Eat_31>=1))||(Eat_30>=1))||(Eat_29>=1))||(Eat_28>=1))||(Eat_35>=1))||(Eat_34>=1))||(Eat_33>=1))||(Eat_32>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(Eat_10>=1))||(Eat_11>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_14>=1))||(Eat_15>=1))||(Eat_12>=1))||(Eat_13>=1))||(Eat_18>=1))||(Eat_19>=1))||(Eat_16>=1))||(Eat_17>=1))||(Eat_36>=1))||(Eat_37>=1))||(Eat_38>=1))||(Eat_39>=1))||(Eat_40>=1))||(Eat_41>=1))||(Eat_42>=1))||(Eat_43>=1))||(Eat_44>=1))||(Eat_45>=1))||(Eat_46>=1))||(Eat_47>=1))||(Eat_48>=1))||(Eat_49>=1))||(Eat_50>=1))")U(X("(((((((((((((((((((((((((((((((((((((((((((((((((((Think_8>=1)&&(Fork_8>=1))||((Think_9>=1)&&(Fork_9>=1)))||((Fork_6>=1)&&(Think_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Think_12>=1)&&(Fork_12>=1)))||((Think_13>=1)&&(Fork_13>=1)))||((Think_10>=1)&&(Fork_10>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Fork_1>=1)&&(Think_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Fork_38>=1)&&(Think_38>=1)))||((Fork_39>=1)&&(Think_39>=1)))||((Fork_40>=1)&&(Think_40>=1)))||((Think_41>=1)&&(Fork_41>=1)))||((Fork_42>=1)&&(Think_42>=1)))||((Think_43>=1)&&(Fork_43>=1)))||((Fork_44>=1)&&(Think_44>=1)))||((Think_45>=1)&&(Fork_45>=1)))||((Think_30>=1)&&(Fork_30>=1)))||((Think_31>=1)&&(Fork_31>=1)))||((Think_32>=1)&&(Fork_32>=1)))||((Think_33>=1)&&(Fork_33>=1)))||((Fork_34>=1)&&(Think_34>=1)))||((Fork_35>=1)&&(Think_35>=1)))||((Fork_36>=1)&&(Think_36>=1)))||((Think_37>=1)&&(Fork_37>=1)))||((Fork_23>=1)&&(Think_23>=1)))||((Think_22>=1)&&(Fork_22>=1)))||((Fork_25>=1)&&(Think_25>=1)))||((Fork_24>=1)&&(Think_24>=1)))||((Fork_27>=1)&&(Think_27>=1)))||((Fork_26>=1)&&(Think_26>=1)))||((Think_29>=1)&&(Fork_29>=1)))||((Fork_28>=1)&&(Think_28>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Fork_14>=1)&&(Think_14>=1)))||((Think_17>=1)&&(Fork_17>=1)))||((Fork_16>=1)&&(Think_16>=1)))||((Fork_19>=1)&&(Think_19>=1)))||((Think_18>=1)&&(Fork_18>=1)))||((Fork_21>=1)&&(Think_21>=1)))||((Think_20>=1)&&(Fork_20>=1)))||((Fork_50>=1)&&(Think_50>=1)))||((Think_49>=1)&&(Fork_49>=1)))||((Think_48>=1)&&(Fork_48>=1)))||((Fork_47>=1)&&(Think_47>=1)))||((Think_46>=1)&&(Fork_46>=1)))"))))))
Formula 1 simplified : !GF("((((((((((((((((((((((((((((((((((((((((((((((((((Eat_2>=1)||(Eat_3>=1))||(Eat_1>=1))||(Eat_23>=1))||(Eat_22>=1))||(Eat_21>=1))||(Eat_20>=1))||(Eat_27>=1))||(Eat_26>=1))||(Eat_25>=1))||(Eat_24>=1))||(Eat_31>=1))||(Eat_30>=1))||(Eat_29>=1))||(Eat_28>=1))||(Eat_35>=1))||(Eat_34>=1))||(Eat_33>=1))||(Eat_32>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(Eat_10>=1))||(Eat_11>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_14>=1))||(Eat_15>=1))||(Eat_12>=1))||(Eat_13>=1))||(Eat_18>=1))||(Eat_19>=1))||(Eat_16>=1))||(Eat_17>=1))||(Eat_36>=1))||(Eat_37>=1))||(Eat_38>=1))||(Eat_39>=1))||(Eat_40>=1))||(Eat_41>=1))||(Eat_42>=1))||(Eat_43>=1))||(Eat_44>=1))||(Eat_45>=1))||(Eat_46>=1))||(Eat_47>=1))||(Eat_48>=1))||(Eat_49>=1))||(Eat_50>=1))" U X"(((((((((((((((((((((((((((((((((((((((((((((((((((Think_8>=1)&&(Fork_8>=1))||((Think_9>=1)&&(Fork_9>=1)))||((Fork_6>=1)&&(Think_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Think_12>=1)&&(Fork_12>=1)))||((Think_13>=1)&&(Fork_13>=1)))||((Think_10>=1)&&(Fork_10>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Fork_1>=1)&&(Think_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Fork_38>=1)&&(Think_38>=1)))||((Fork_39>=1)&&(Think_39>=1)))||((Fork_40>=1)&&(Think_40>=1)))||((Think_41>=1)&&(Fork_41>=1)))||((Fork_42>=1)&&(Think_42>=1)))||((Think_43>=1)&&(Fork_43>=1)))||((Fork_44>=1)&&(Think_44>=1)))||((Think_45>=1)&&(Fork_45>=1)))||((Think_30>=1)&&(Fork_30>=1)))||((Think_31>=1)&&(Fork_31>=1)))||((Think_32>=1)&&(Fork_32>=1)))||((Think_33>=1)&&(Fork_33>=1)))||((Fork_34>=1)&&(Think_34>=1)))||((Fork_35>=1)&&(Think_35>=1)))||((Fork_36>=1)&&(Think_36>=1)))||((Think_37>=1)&&(Fork_37>=1)))||((Fork_23>=1)&&(Think_23>=1)))||((Think_22>=1)&&(Fork_22>=1)))||((Fork_25>=1)&&(Think_25>=1)))||((Fork_24>=1)&&(Think_24>=1)))||((Fork_27>=1)&&(Think_27>=1)))||((Fork_26>=1)&&(Think_26>=1)))||((Think_29>=1)&&(Fork_29>=1)))||((Fork_28>=1)&&(Think_28>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Fork_14>=1)&&(Think_14>=1)))||((Think_17>=1)&&(Fork_17>=1)))||((Fork_16>=1)&&(Think_16>=1)))||((Fork_19>=1)&&(Think_19>=1)))||((Think_18>=1)&&(Fork_18>=1)))||((Fork_21>=1)&&(Think_21>=1)))||((Think_20>=1)&&(Fork_20>=1)))||((Fork_50>=1)&&(Think_50>=1)))||((Think_49>=1)&&(Fork_49>=1)))||((Think_48>=1)&&(Fork_48>=1)))||((Fork_47>=1)&&(Think_47>=1)))||((Think_46>=1)&&(Fork_46>=1)))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
284 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,6.23538,156376,1,0,332,766361,33,258,6649,840319,664
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X((F(X("(((((((((((((((((((((((((((((((((((((((((((((((((((Catch1_21>=1)&&(Fork_21>=1))||((Catch1_20>=1)&&(Fork_20>=1)))||((Fork_23>=1)&&(Catch1_23>=1)))||((Fork_22>=1)&&(Catch1_22>=1)))||((Fork_17>=1)&&(Catch1_17>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))||((Fork_29>=1)&&(Catch1_29>=1)))||((Catch1_28>=1)&&(Fork_28>=1)))||((Fork_31>=1)&&(Catch1_31>=1)))||((Catch1_30>=1)&&(Fork_30>=1)))||((Fork_25>=1)&&(Catch1_25>=1)))||((Fork_24>=1)&&(Catch1_24>=1)))||((Fork_27>=1)&&(Catch1_27>=1)))||((Fork_26>=1)&&(Catch1_26>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Catch1_6>=1)&&(Fork_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_12>=1)&&(Catch1_12>=1)))||((Fork_13>=1)&&(Catch1_13>=1)))||((Fork_14>=1)&&(Catch1_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))||((Catch1_11>=1)&&(Fork_11>=1)))||((Fork_50>=1)&&(Catch1_50>=1)))||((Fork_48>=1)&&(Catch1_48>=1)))||((Catch1_49>=1)&&(Fork_49>=1)))||((Fork_43>=1)&&(Catch1_43>=1)))||((Fork_42>=1)&&(Catch1_42>=1)))||((Catch1_41>=1)&&(Fork_41>=1)))||((Fork_40>=1)&&(Catch1_40>=1)))||((Fork_47>=1)&&(Catch1_47>=1)))||((Catch1_46>=1)&&(Fork_46>=1)))||((Catch1_45>=1)&&(Fork_45>=1)))||((Catch1_44>=1)&&(Fork_44>=1)))||((Catch1_35>=1)&&(Fork_35>=1)))||((Catch1_34>=1)&&(Fork_34>=1)))||((Catch1_33>=1)&&(Fork_33>=1)))||((Catch1_32>=1)&&(Fork_32>=1)))||((Catch1_39>=1)&&(Fork_39>=1)))||((Fork_38>=1)&&(Catch1_38>=1)))||((Catch1_37>=1)&&(Fork_37>=1)))||((Catch1_36>=1)&&(Fork_36>=1)))")))U(F(F("(((((((((((((((((((((((((((((((((((((((((((((((((((Fork_25>=1)&&(Think_26>=1))||((Fork_26>=1)&&(Think_27>=1)))||((Think_24>=1)&&(Fork_23>=1)))||((Fork_24>=1)&&(Think_25>=1)))||((Think_22>=1)&&(Fork_21>=1)))||((Think_23>=1)&&(Fork_22>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_21>=1)&&(Fork_20>=1)))||((Fork_17>=1)&&(Think_18>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Fork_15>=1)&&(Think_16>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_13>=1)&&(Fork_12>=1)))||((Fork_10>=1)&&(Think_11>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Fork_5>=1)&&(Think_6>=1)))||((Think_5>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_4>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_1>=1)&&(Think_2>=1)))||((Think_1>=1)&&(Fork_50>=1)))||((Think_48>=1)&&(Fork_47>=1)))||((Think_49>=1)&&(Fork_48>=1)))||((Think_50>=1)&&(Fork_49>=1)))||((Think_44>=1)&&(Fork_43>=1)))||((Fork_44>=1)&&(Think_45>=1)))||((Think_46>=1)&&(Fork_45>=1)))||((Fork_46>=1)&&(Think_47>=1)))||((Fork_40>=1)&&(Think_41>=1)))||((Fork_39>=1)&&(Think_40>=1)))||((Think_43>=1)&&(Fork_42>=1)))||((Think_42>=1)&&(Fork_41>=1)))||((Fork_36>=1)&&(Think_37>=1)))||((Fork_35>=1)&&(Think_36>=1)))||((Think_39>=1)&&(Fork_38>=1)))||((Fork_37>=1)&&(Think_38>=1)))||((Fork_32>=1)&&(Think_33>=1)))||((Think_32>=1)&&(Fork_31>=1)))||((Fork_34>=1)&&(Think_35>=1)))||((Think_34>=1)&&(Fork_33>=1)))||((Fork_28>=1)&&(Think_29>=1)))||((Fork_27>=1)&&(Think_28>=1)))||((Fork_30>=1)&&(Think_31>=1)))||((Fork_29>=1)&&(Think_30>=1)))"))))))
Formula 2 simplified : !X(FX"(((((((((((((((((((((((((((((((((((((((((((((((((((Catch1_21>=1)&&(Fork_21>=1))||((Catch1_20>=1)&&(Fork_20>=1)))||((Fork_23>=1)&&(Catch1_23>=1)))||((Fork_22>=1)&&(Catch1_22>=1)))||((Fork_17>=1)&&(Catch1_17>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))||((Fork_29>=1)&&(Catch1_29>=1)))||((Catch1_28>=1)&&(Fork_28>=1)))||((Fork_31>=1)&&(Catch1_31>=1)))||((Catch1_30>=1)&&(Fork_30>=1)))||((Fork_25>=1)&&(Catch1_25>=1)))||((Fork_24>=1)&&(Catch1_24>=1)))||((Fork_27>=1)&&(Catch1_27>=1)))||((Fork_26>=1)&&(Catch1_26>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Catch1_6>=1)&&(Fork_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_12>=1)&&(Catch1_12>=1)))||((Fork_13>=1)&&(Catch1_13>=1)))||((Fork_14>=1)&&(Catch1_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))||((Catch1_11>=1)&&(Fork_11>=1)))||((Fork_50>=1)&&(Catch1_50>=1)))||((Fork_48>=1)&&(Catch1_48>=1)))||((Catch1_49>=1)&&(Fork_49>=1)))||((Fork_43>=1)&&(Catch1_43>=1)))||((Fork_42>=1)&&(Catch1_42>=1)))||((Catch1_41>=1)&&(Fork_41>=1)))||((Fork_40>=1)&&(Catch1_40>=1)))||((Fork_47>=1)&&(Catch1_47>=1)))||((Catch1_46>=1)&&(Fork_46>=1)))||((Catch1_45>=1)&&(Fork_45>=1)))||((Catch1_44>=1)&&(Fork_44>=1)))||((Catch1_35>=1)&&(Fork_35>=1)))||((Catch1_34>=1)&&(Fork_34>=1)))||((Catch1_33>=1)&&(Fork_33>=1)))||((Catch1_32>=1)&&(Fork_32>=1)))||((Catch1_39>=1)&&(Fork_39>=1)))||((Fork_38>=1)&&(Catch1_38>=1)))||((Catch1_37>=1)&&(Fork_37>=1)))||((Catch1_36>=1)&&(Fork_36>=1)))" U F"(((((((((((((((((((((((((((((((((((((((((((((((((((Fork_25>=1)&&(Think_26>=1))||((Fork_26>=1)&&(Think_27>=1)))||((Think_24>=1)&&(Fork_23>=1)))||((Fork_24>=1)&&(Think_25>=1)))||((Think_22>=1)&&(Fork_21>=1)))||((Think_23>=1)&&(Fork_22>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_21>=1)&&(Fork_20>=1)))||((Fork_17>=1)&&(Think_18>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Fork_15>=1)&&(Think_16>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_13>=1)&&(Fork_12>=1)))||((Fork_10>=1)&&(Think_11>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Fork_5>=1)&&(Think_6>=1)))||((Think_5>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_4>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_1>=1)&&(Think_2>=1)))||((Think_1>=1)&&(Fork_50>=1)))||((Think_48>=1)&&(Fork_47>=1)))||((Think_49>=1)&&(Fork_48>=1)))||((Think_50>=1)&&(Fork_49>=1)))||((Think_44>=1)&&(Fork_43>=1)))||((Fork_44>=1)&&(Think_45>=1)))||((Think_46>=1)&&(Fork_45>=1)))||((Fork_46>=1)&&(Think_47>=1)))||((Fork_40>=1)&&(Think_41>=1)))||((Fork_39>=1)&&(Think_40>=1)))||((Think_43>=1)&&(Fork_42>=1)))||((Think_42>=1)&&(Fork_41>=1)))||((Fork_36>=1)&&(Think_37>=1)))||((Fork_35>=1)&&(Think_36>=1)))||((Think_39>=1)&&(Fork_38>=1)))||((Fork_37>=1)&&(Think_38>=1)))||((Fork_32>=1)&&(Think_33>=1)))||((Think_32>=1)&&(Fork_31>=1)))||((Fork_34>=1)&&(Think_35>=1)))||((Think_34>=1)&&(Fork_33>=1)))||((Fork_28>=1)&&(Think_29>=1)))||((Fork_27>=1)&&(Think_28>=1)))||((Fork_30>=1)&&(Think_31>=1)))||((Fork_29>=1)&&(Think_30>=1)))")
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
2 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,6.24853,157020,1,0,332,766366,42,258,6799,840319,668
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(X(F(F(F("(((((((((((((((((((((((((((((((((((((((((((((((((((Fork_2>=1)&&(Catch2_3>=1))||((Fork_1>=1)&&(Catch2_2>=1)))||((Catch2_5>=1)&&(Fork_4>=1)))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Catch2_6>=1)&&(Fork_5>=1)))||((Catch2_9>=1)&&(Fork_8>=1)))||((Catch2_8>=1)&&(Fork_7>=1)))||((Catch2_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Catch2_10>=1)))||((Catch2_13>=1)&&(Fork_12>=1)))||((Fork_11>=1)&&(Catch2_12>=1)))||((Fork_14>=1)&&(Catch2_15>=1)))||((Catch2_14>=1)&&(Fork_13>=1)))||((Fork_16>=1)&&(Catch2_17>=1)))||((Catch2_16>=1)&&(Fork_15>=1)))||((Fork_50>=1)&&(Catch2_1>=1)))||((Catch2_41>=1)&&(Fork_40>=1)))||((Fork_39>=1)&&(Catch2_40>=1)))||((Fork_38>=1)&&(Catch2_39>=1)))||((Fork_37>=1)&&(Catch2_38>=1)))||((Catch2_37>=1)&&(Fork_36>=1)))||((Fork_35>=1)&&(Catch2_36>=1)))||((Fork_34>=1)&&(Catch2_35>=1)))||((Catch2_34>=1)&&(Fork_33>=1)))||((Fork_48>=1)&&(Catch2_49>=1)))||((Fork_47>=1)&&(Catch2_48>=1)))||((Catch2_47>=1)&&(Fork_46>=1)))||((Fork_45>=1)&&(Catch2_46>=1)))||((Catch2_45>=1)&&(Fork_44>=1)))||((Catch2_44>=1)&&(Fork_43>=1)))||((Catch2_43>=1)&&(Fork_42>=1)))||((Catch2_42>=1)&&(Fork_41>=1)))||((Fork_23>=1)&&(Catch2_24>=1)))||((Fork_24>=1)&&(Catch2_25>=1)))||((Fork_21>=1)&&(Catch2_22>=1)))||((Fork_22>=1)&&(Catch2_23>=1)))||((Fork_19>=1)&&(Catch2_20>=1)))||((Fork_20>=1)&&(Catch2_21>=1)))||((Catch2_18>=1)&&(Fork_17>=1)))||((Catch2_19>=1)&&(Fork_18>=1)))||((Catch2_32>=1)&&(Fork_31>=1)))||((Fork_32>=1)&&(Catch2_33>=1)))||((Catch2_30>=1)&&(Fork_29>=1)))||((Fork_30>=1)&&(Catch2_31>=1)))||((Fork_27>=1)&&(Catch2_28>=1)))||((Fork_28>=1)&&(Catch2_29>=1)))||((Fork_25>=1)&&(Catch2_26>=1)))||((Catch2_27>=1)&&(Fork_26>=1)))||((Fork_49>=1)&&(Catch2_50>=1)))")))))))
Formula 3 simplified : !XXF"(((((((((((((((((((((((((((((((((((((((((((((((((((Fork_2>=1)&&(Catch2_3>=1))||((Fork_1>=1)&&(Catch2_2>=1)))||((Catch2_5>=1)&&(Fork_4>=1)))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Catch2_6>=1)&&(Fork_5>=1)))||((Catch2_9>=1)&&(Fork_8>=1)))||((Catch2_8>=1)&&(Fork_7>=1)))||((Catch2_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Catch2_10>=1)))||((Catch2_13>=1)&&(Fork_12>=1)))||((Fork_11>=1)&&(Catch2_12>=1)))||((Fork_14>=1)&&(Catch2_15>=1)))||((Catch2_14>=1)&&(Fork_13>=1)))||((Fork_16>=1)&&(Catch2_17>=1)))||((Catch2_16>=1)&&(Fork_15>=1)))||((Fork_50>=1)&&(Catch2_1>=1)))||((Catch2_41>=1)&&(Fork_40>=1)))||((Fork_39>=1)&&(Catch2_40>=1)))||((Fork_38>=1)&&(Catch2_39>=1)))||((Fork_37>=1)&&(Catch2_38>=1)))||((Catch2_37>=1)&&(Fork_36>=1)))||((Fork_35>=1)&&(Catch2_36>=1)))||((Fork_34>=1)&&(Catch2_35>=1)))||((Catch2_34>=1)&&(Fork_33>=1)))||((Fork_48>=1)&&(Catch2_49>=1)))||((Fork_47>=1)&&(Catch2_48>=1)))||((Catch2_47>=1)&&(Fork_46>=1)))||((Fork_45>=1)&&(Catch2_46>=1)))||((Catch2_45>=1)&&(Fork_44>=1)))||((Catch2_44>=1)&&(Fork_43>=1)))||((Catch2_43>=1)&&(Fork_42>=1)))||((Catch2_42>=1)&&(Fork_41>=1)))||((Fork_23>=1)&&(Catch2_24>=1)))||((Fork_24>=1)&&(Catch2_25>=1)))||((Fork_21>=1)&&(Catch2_22>=1)))||((Fork_22>=1)&&(Catch2_23>=1)))||((Fork_19>=1)&&(Catch2_20>=1)))||((Fork_20>=1)&&(Catch2_21>=1)))||((Catch2_18>=1)&&(Fork_17>=1)))||((Catch2_19>=1)&&(Fork_18>=1)))||((Catch2_32>=1)&&(Fork_31>=1)))||((Fork_32>=1)&&(Catch2_33>=1)))||((Catch2_30>=1)&&(Fork_29>=1)))||((Fork_30>=1)&&(Catch2_31>=1)))||((Fork_27>=1)&&(Catch2_28>=1)))||((Fork_28>=1)&&(Catch2_29>=1)))||((Fork_25>=1)&&(Catch2_26>=1)))||((Catch2_27>=1)&&(Fork_26>=1)))||((Fork_49>=1)&&(Catch2_50>=1)))"
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
595 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,12.2028,275784,1,0,481,1.30856e+06,51,359,6999,1.93618e+06,926
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(G(F("(((((((((((((((((((((((((((((((((((((((((((((((((((Think_8>=1)&&(Fork_8>=1))||((Think_9>=1)&&(Fork_9>=1)))||((Fork_6>=1)&&(Think_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Think_12>=1)&&(Fork_12>=1)))||((Think_13>=1)&&(Fork_13>=1)))||((Think_10>=1)&&(Fork_10>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Fork_1>=1)&&(Think_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Fork_38>=1)&&(Think_38>=1)))||((Fork_39>=1)&&(Think_39>=1)))||((Fork_40>=1)&&(Think_40>=1)))||((Think_41>=1)&&(Fork_41>=1)))||((Fork_42>=1)&&(Think_42>=1)))||((Think_43>=1)&&(Fork_43>=1)))||((Fork_44>=1)&&(Think_44>=1)))||((Think_45>=1)&&(Fork_45>=1)))||((Think_30>=1)&&(Fork_30>=1)))||((Think_31>=1)&&(Fork_31>=1)))||((Think_32>=1)&&(Fork_32>=1)))||((Think_33>=1)&&(Fork_33>=1)))||((Fork_34>=1)&&(Think_34>=1)))||((Fork_35>=1)&&(Think_35>=1)))||((Fork_36>=1)&&(Think_36>=1)))||((Think_37>=1)&&(Fork_37>=1)))||((Fork_23>=1)&&(Think_23>=1)))||((Think_22>=1)&&(Fork_22>=1)))||((Fork_25>=1)&&(Think_25>=1)))||((Fork_24>=1)&&(Think_24>=1)))||((Fork_27>=1)&&(Think_27>=1)))||((Fork_26>=1)&&(Think_26>=1)))||((Think_29>=1)&&(Fork_29>=1)))||((Fork_28>=1)&&(Think_28>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Fork_14>=1)&&(Think_14>=1)))||((Think_17>=1)&&(Fork_17>=1)))||((Fork_16>=1)&&(Think_16>=1)))||((Fork_19>=1)&&(Think_19>=1)))||((Think_18>=1)&&(Fork_18>=1)))||((Fork_21>=1)&&(Think_21>=1)))||((Think_20>=1)&&(Fork_20>=1)))||((Fork_50>=1)&&(Think_50>=1)))||((Think_49>=1)&&(Fork_49>=1)))||((Think_48>=1)&&(Fork_48>=1)))||((Fork_47>=1)&&(Think_47>=1)))||((Think_46>=1)&&(Fork_46>=1)))")))))
Formula 4 simplified : !XGF"(((((((((((((((((((((((((((((((((((((((((((((((((((Think_8>=1)&&(Fork_8>=1))||((Think_9>=1)&&(Fork_9>=1)))||((Fork_6>=1)&&(Think_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Think_12>=1)&&(Fork_12>=1)))||((Think_13>=1)&&(Fork_13>=1)))||((Think_10>=1)&&(Fork_10>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Fork_1>=1)&&(Think_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Fork_38>=1)&&(Think_38>=1)))||((Fork_39>=1)&&(Think_39>=1)))||((Fork_40>=1)&&(Think_40>=1)))||((Think_41>=1)&&(Fork_41>=1)))||((Fork_42>=1)&&(Think_42>=1)))||((Think_43>=1)&&(Fork_43>=1)))||((Fork_44>=1)&&(Think_44>=1)))||((Think_45>=1)&&(Fork_45>=1)))||((Think_30>=1)&&(Fork_30>=1)))||((Think_31>=1)&&(Fork_31>=1)))||((Think_32>=1)&&(Fork_32>=1)))||((Think_33>=1)&&(Fork_33>=1)))||((Fork_34>=1)&&(Think_34>=1)))||((Fork_35>=1)&&(Think_35>=1)))||((Fork_36>=1)&&(Think_36>=1)))||((Think_37>=1)&&(Fork_37>=1)))||((Fork_23>=1)&&(Think_23>=1)))||((Think_22>=1)&&(Fork_22>=1)))||((Fork_25>=1)&&(Think_25>=1)))||((Fork_24>=1)&&(Think_24>=1)))||((Fork_27>=1)&&(Think_27>=1)))||((Fork_26>=1)&&(Think_26>=1)))||((Think_29>=1)&&(Fork_29>=1)))||((Fork_28>=1)&&(Think_28>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Fork_14>=1)&&(Think_14>=1)))||((Think_17>=1)&&(Fork_17>=1)))||((Fork_16>=1)&&(Think_16>=1)))||((Fork_19>=1)&&(Think_19>=1)))||((Think_18>=1)&&(Fork_18>=1)))||((Fork_21>=1)&&(Think_21>=1)))||((Think_20>=1)&&(Fork_20>=1)))||((Fork_50>=1)&&(Think_50>=1)))||((Think_49>=1)&&(Fork_49>=1)))||((Think_48>=1)&&(Fork_48>=1)))||((Fork_47>=1)&&(Think_47>=1)))||((Think_46>=1)&&(Fork_46>=1)))"
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,12.269,277248,1,0,481,1.31424e+06,51,360,6999,1.95906e+06,930
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(G(G("(((((((((((((((((((((((((((((((((((((((((((((((((((Fork_25>=1)&&(Think_26>=1))||((Fork_26>=1)&&(Think_27>=1)))||((Think_24>=1)&&(Fork_23>=1)))||((Fork_24>=1)&&(Think_25>=1)))||((Think_22>=1)&&(Fork_21>=1)))||((Think_23>=1)&&(Fork_22>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_21>=1)&&(Fork_20>=1)))||((Fork_17>=1)&&(Think_18>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Fork_15>=1)&&(Think_16>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_13>=1)&&(Fork_12>=1)))||((Fork_10>=1)&&(Think_11>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Fork_5>=1)&&(Think_6>=1)))||((Think_5>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_4>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_1>=1)&&(Think_2>=1)))||((Think_1>=1)&&(Fork_50>=1)))||((Think_48>=1)&&(Fork_47>=1)))||((Think_49>=1)&&(Fork_48>=1)))||((Think_50>=1)&&(Fork_49>=1)))||((Think_44>=1)&&(Fork_43>=1)))||((Fork_44>=1)&&(Think_45>=1)))||((Think_46>=1)&&(Fork_45>=1)))||((Fork_46>=1)&&(Think_47>=1)))||((Fork_40>=1)&&(Think_41>=1)))||((Fork_39>=1)&&(Think_40>=1)))||((Think_43>=1)&&(Fork_42>=1)))||((Think_42>=1)&&(Fork_41>=1)))||((Fork_36>=1)&&(Think_37>=1)))||((Fork_35>=1)&&(Think_36>=1)))||((Think_39>=1)&&(Fork_38>=1)))||((Fork_37>=1)&&(Think_38>=1)))||((Fork_32>=1)&&(Think_33>=1)))||((Think_32>=1)&&(Fork_31>=1)))||((Fork_34>=1)&&(Think_35>=1)))||((Think_34>=1)&&(Fork_33>=1)))||((Fork_28>=1)&&(Think_29>=1)))||((Fork_27>=1)&&(Think_28>=1)))||((Fork_30>=1)&&(Think_31>=1)))||((Fork_29>=1)&&(Think_30>=1)))")))))
Formula 5 simplified : !G"(((((((((((((((((((((((((((((((((((((((((((((((((((Fork_25>=1)&&(Think_26>=1))||((Fork_26>=1)&&(Think_27>=1)))||((Think_24>=1)&&(Fork_23>=1)))||((Fork_24>=1)&&(Think_25>=1)))||((Think_22>=1)&&(Fork_21>=1)))||((Think_23>=1)&&(Fork_22>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_21>=1)&&(Fork_20>=1)))||((Fork_17>=1)&&(Think_18>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Fork_15>=1)&&(Think_16>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_13>=1)&&(Fork_12>=1)))||((Fork_10>=1)&&(Think_11>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Fork_5>=1)&&(Think_6>=1)))||((Think_5>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_4>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_1>=1)&&(Think_2>=1)))||((Think_1>=1)&&(Fork_50>=1)))||((Think_48>=1)&&(Fork_47>=1)))||((Think_49>=1)&&(Fork_48>=1)))||((Think_50>=1)&&(Fork_49>=1)))||((Think_44>=1)&&(Fork_43>=1)))||((Fork_44>=1)&&(Think_45>=1)))||((Think_46>=1)&&(Fork_45>=1)))||((Fork_46>=1)&&(Think_47>=1)))||((Fork_40>=1)&&(Think_41>=1)))||((Fork_39>=1)&&(Think_40>=1)))||((Think_43>=1)&&(Fork_42>=1)))||((Think_42>=1)&&(Fork_41>=1)))||((Fork_36>=1)&&(Think_37>=1)))||((Fork_35>=1)&&(Think_36>=1)))||((Think_39>=1)&&(Fork_38>=1)))||((Fork_37>=1)&&(Think_38>=1)))||((Fork_32>=1)&&(Think_33>=1)))||((Think_32>=1)&&(Fork_31>=1)))||((Fork_34>=1)&&(Think_35>=1)))||((Think_34>=1)&&(Fork_33>=1)))||((Fork_28>=1)&&(Think_29>=1)))||((Fork_27>=1)&&(Think_28>=1)))||((Fork_30>=1)&&(Think_31>=1)))||((Fork_29>=1)&&(Think_30>=1)))"
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
204 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,14.3118,326432,1,0,556,1.55433e+06,56,458,7047,2.30267e+06,1187
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G("(((((((((((((((((((((((((((((((((((((((((((((((((((Fork_25>=1)&&(Think_26>=1))||((Fork_26>=1)&&(Think_27>=1)))||((Think_24>=1)&&(Fork_23>=1)))||((Fork_24>=1)&&(Think_25>=1)))||((Think_22>=1)&&(Fork_21>=1)))||((Think_23>=1)&&(Fork_22>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_21>=1)&&(Fork_20>=1)))||((Fork_17>=1)&&(Think_18>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Fork_15>=1)&&(Think_16>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_13>=1)&&(Fork_12>=1)))||((Fork_10>=1)&&(Think_11>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Fork_5>=1)&&(Think_6>=1)))||((Think_5>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_4>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_1>=1)&&(Think_2>=1)))||((Think_1>=1)&&(Fork_50>=1)))||((Think_48>=1)&&(Fork_47>=1)))||((Think_49>=1)&&(Fork_48>=1)))||((Think_50>=1)&&(Fork_49>=1)))||((Think_44>=1)&&(Fork_43>=1)))||((Fork_44>=1)&&(Think_45>=1)))||((Think_46>=1)&&(Fork_45>=1)))||((Fork_46>=1)&&(Think_47>=1)))||((Fork_40>=1)&&(Think_41>=1)))||((Fork_39>=1)&&(Think_40>=1)))||((Think_43>=1)&&(Fork_42>=1)))||((Think_42>=1)&&(Fork_41>=1)))||((Fork_36>=1)&&(Think_37>=1)))||((Fork_35>=1)&&(Think_36>=1)))||((Think_39>=1)&&(Fork_38>=1)))||((Fork_37>=1)&&(Think_38>=1)))||((Fork_32>=1)&&(Think_33>=1)))||((Think_32>=1)&&(Fork_31>=1)))||((Fork_34>=1)&&(Think_35>=1)))||((Think_34>=1)&&(Fork_33>=1)))||((Fork_28>=1)&&(Think_29>=1)))||((Fork_27>=1)&&(Think_28>=1)))||((Fork_30>=1)&&(Think_31>=1)))||((Fork_29>=1)&&(Think_30>=1)))")))
Formula 6 simplified : !G"(((((((((((((((((((((((((((((((((((((((((((((((((((Fork_25>=1)&&(Think_26>=1))||((Fork_26>=1)&&(Think_27>=1)))||((Think_24>=1)&&(Fork_23>=1)))||((Fork_24>=1)&&(Think_25>=1)))||((Think_22>=1)&&(Fork_21>=1)))||((Think_23>=1)&&(Fork_22>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_21>=1)&&(Fork_20>=1)))||((Fork_17>=1)&&(Think_18>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Fork_15>=1)&&(Think_16>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_13>=1)&&(Fork_12>=1)))||((Fork_10>=1)&&(Think_11>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Fork_5>=1)&&(Think_6>=1)))||((Think_5>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_4>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_1>=1)&&(Think_2>=1)))||((Think_1>=1)&&(Fork_50>=1)))||((Think_48>=1)&&(Fork_47>=1)))||((Think_49>=1)&&(Fork_48>=1)))||((Think_50>=1)&&(Fork_49>=1)))||((Think_44>=1)&&(Fork_43>=1)))||((Fork_44>=1)&&(Think_45>=1)))||((Think_46>=1)&&(Fork_45>=1)))||((Fork_46>=1)&&(Think_47>=1)))||((Fork_40>=1)&&(Think_41>=1)))||((Fork_39>=1)&&(Think_40>=1)))||((Think_43>=1)&&(Fork_42>=1)))||((Think_42>=1)&&(Fork_41>=1)))||((Fork_36>=1)&&(Think_37>=1)))||((Fork_35>=1)&&(Think_36>=1)))||((Think_39>=1)&&(Fork_38>=1)))||((Fork_37>=1)&&(Think_38>=1)))||((Fork_32>=1)&&(Think_33>=1)))||((Think_32>=1)&&(Fork_31>=1)))||((Fork_34>=1)&&(Think_35>=1)))||((Think_34>=1)&&(Fork_33>=1)))||((Fork_28>=1)&&(Think_29>=1)))||((Fork_27>=1)&&(Think_28>=1)))||((Fork_30>=1)&&(Think_31>=1)))||((Fork_29>=1)&&(Think_30>=1)))"
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
2 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,14.3287,326788,1,0,556,1.55433e+06,56,458,7047,2.30267e+06,1187
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(G(("((((((((((((((((((((((((((((((((((((((((((((((((((Eat_2>=1)||(Eat_3>=1))||(Eat_1>=1))||(Eat_23>=1))||(Eat_22>=1))||(Eat_21>=1))||(Eat_20>=1))||(Eat_27>=1))||(Eat_26>=1))||(Eat_25>=1))||(Eat_24>=1))||(Eat_31>=1))||(Eat_30>=1))||(Eat_29>=1))||(Eat_28>=1))||(Eat_35>=1))||(Eat_34>=1))||(Eat_33>=1))||(Eat_32>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(Eat_10>=1))||(Eat_11>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_14>=1))||(Eat_15>=1))||(Eat_12>=1))||(Eat_13>=1))||(Eat_18>=1))||(Eat_19>=1))||(Eat_16>=1))||(Eat_17>=1))||(Eat_36>=1))||(Eat_37>=1))||(Eat_38>=1))||(Eat_39>=1))||(Eat_40>=1))||(Eat_41>=1))||(Eat_42>=1))||(Eat_43>=1))||(Eat_44>=1))||(Eat_45>=1))||(Eat_46>=1))||(Eat_47>=1))||(Eat_48>=1))||(Eat_49>=1))||(Eat_50>=1))")U(F("((((((((((((((((((((((((((((((((((((((((((((((((((Eat_2>=1)||(Eat_3>=1))||(Eat_1>=1))||(Eat_23>=1))||(Eat_22>=1))||(Eat_21>=1))||(Eat_20>=1))||(Eat_27>=1))||(Eat_26>=1))||(Eat_25>=1))||(Eat_24>=1))||(Eat_31>=1))||(Eat_30>=1))||(Eat_29>=1))||(Eat_28>=1))||(Eat_35>=1))||(Eat_34>=1))||(Eat_33>=1))||(Eat_32>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(Eat_10>=1))||(Eat_11>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_14>=1))||(Eat_15>=1))||(Eat_12>=1))||(Eat_13>=1))||(Eat_18>=1))||(Eat_19>=1))||(Eat_16>=1))||(Eat_17>=1))||(Eat_36>=1))||(Eat_37>=1))||(Eat_38>=1))||(Eat_39>=1))||(Eat_40>=1))||(Eat_41>=1))||(Eat_42>=1))||(Eat_43>=1))||(Eat_44>=1))||(Eat_45>=1))||(Eat_46>=1))||(Eat_47>=1))||(Eat_48>=1))||(Eat_49>=1))||(Eat_50>=1))"))))))
Formula 7 simplified : !FG("((((((((((((((((((((((((((((((((((((((((((((((((((Eat_2>=1)||(Eat_3>=1))||(Eat_1>=1))||(Eat_23>=1))||(Eat_22>=1))||(Eat_21>=1))||(Eat_20>=1))||(Eat_27>=1))||(Eat_26>=1))||(Eat_25>=1))||(Eat_24>=1))||(Eat_31>=1))||(Eat_30>=1))||(Eat_29>=1))||(Eat_28>=1))||(Eat_35>=1))||(Eat_34>=1))||(Eat_33>=1))||(Eat_32>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(Eat_10>=1))||(Eat_11>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_14>=1))||(Eat_15>=1))||(Eat_12>=1))||(Eat_13>=1))||(Eat_18>=1))||(Eat_19>=1))||(Eat_16>=1))||(Eat_17>=1))||(Eat_36>=1))||(Eat_37>=1))||(Eat_38>=1))||(Eat_39>=1))||(Eat_40>=1))||(Eat_41>=1))||(Eat_42>=1))||(Eat_43>=1))||(Eat_44>=1))||(Eat_45>=1))||(Eat_46>=1))||(Eat_47>=1))||(Eat_48>=1))||(Eat_49>=1))||(Eat_50>=1))" U F"((((((((((((((((((((((((((((((((((((((((((((((((((Eat_2>=1)||(Eat_3>=1))||(Eat_1>=1))||(Eat_23>=1))||(Eat_22>=1))||(Eat_21>=1))||(Eat_20>=1))||(Eat_27>=1))||(Eat_26>=1))||(Eat_25>=1))||(Eat_24>=1))||(Eat_31>=1))||(Eat_30>=1))||(Eat_29>=1))||(Eat_28>=1))||(Eat_35>=1))||(Eat_34>=1))||(Eat_33>=1))||(Eat_32>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(Eat_10>=1))||(Eat_11>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_14>=1))||(Eat_15>=1))||(Eat_12>=1))||(Eat_13>=1))||(Eat_18>=1))||(Eat_19>=1))||(Eat_16>=1))||(Eat_17>=1))||(Eat_36>=1))||(Eat_37>=1))||(Eat_38>=1))||(Eat_39>=1))||(Eat_40>=1))||(Eat_41>=1))||(Eat_42>=1))||(Eat_43>=1))||(Eat_44>=1))||(Eat_45>=1))||(Eat_46>=1))||(Eat_47>=1))||(Eat_48>=1))||(Eat_49>=1))||(Eat_50>=1))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 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,14.3404,326788,1,0,556,1.55433e+06,56,459,7047,2.30497e+06,1191
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(G("((Think_34>=1)&&(Fork_33>=1))"))))
Formula 8 simplified : !G"((Think_34>=1)&&(Fork_33>=1))"
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
68 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,15.0275,341808,1,0,657,1.64172e+06,62,559,7047,2.43211e+06,1449
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(G(F(X(F("((Fork_7>=1)&&(Think_8>=1))")))))))
Formula 9 simplified : !FGFXF"((Fork_7>=1)&&(Think_8>=1))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
32 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,15.3492,349664,1,0,659,1.64879e+06,71,562,7047,2.4415e+06,1462
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X((X("((Fork_28>=1)&&(Catch2_29>=1))"))U(("(Eat_21>=1)")U("((Think_21>=1)&&(Fork_20>=1))")))))
Formula 10 simplified : !X(X"((Fork_28>=1)&&(Catch2_29>=1))" U ("(Eat_21>=1)" U "((Think_21>=1)&&(Fork_20>=1))"))
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
194 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,17.2962,373932,1,0,763,1.79379e+06,94,660,7057,2.65238e+06,1730
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("((Fork_2>=1)&&(Think_3>=1))"))
Formula 11 simplified : !"((Fork_2>=1)&&(Think_3>=1))"
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,17.297,373932,1,0,763,1.79379e+06,97,660,7057,2.65238e+06,1732
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((F(("((Catch2_43>=1)&&(Fork_42>=1))")U("((Fork_3>=1)&&(Think_4>=1))")))U((X("((Think_45>=1)&&(Fork_45>=1))"))U(X("((Think_9>=1)&&(Fork_9>=1))")))))
Formula 12 simplified : !(F("((Catch2_43>=1)&&(Fork_42>=1))" U "((Fork_3>=1)&&(Think_4>=1))") U (X"((Think_45>=1)&&(Fork_45>=1))" U X"((Think_9>=1)&&(Fork_9>=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
148 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,18.7731,409872,1,0,877,1.99123e+06,118,777,7063,2.9372e+06,2023
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X(G(G(G("((Think_22>=1)&&(Fork_22>=1))"))))))
Formula 13 simplified : !XG"((Think_22>=1)&&(Fork_22>=1))"
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
119 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,19.9582,435176,1,0,980,2.13298e+06,124,877,7063,3.13842e+06,2279
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("((Fork_27>=1)&&(Think_28>=1))"))
Formula 14 simplified : !"((Fork_27>=1)&&(Think_28>=1))"
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,19.9608,435176,1,0,980,2.13298e+06,127,877,7063,3.13842e+06,2281
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(X((F("((Catch2_5>=1)&&(Fork_4>=1))"))U(F("((Fork_16>=1)&&(Think_16>=1))"))))))
Formula 15 simplified : !GX(F"((Catch2_5>=1)&&(Fork_4>=1))" U F"((Fork_16>=1)&&(Think_16>=1))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
8 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,20.0375,436376,1,0,982,2.13832e+06,136,880,7063,3.14561e+06,2294
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552956019005

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -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 LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -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 19, 2019 12:39:53 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Mar 19, 2019 12:39:53 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 19, 2019 12:39:53 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 92 ms
Mar 19, 2019 12:39:53 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 places.
Mar 19, 2019 12:39:53 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 transitions.
Mar 19, 2019 12:39:53 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 20 ms
Mar 19, 2019 12:39:53 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 105 ms
Mar 19, 2019 12:39:53 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
Mar 19, 2019 12:39:53 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 ms
Mar 19, 2019 12:39:54 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 250 transitions.
Mar 19, 2019 12:39:54 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 100 place invariants in 95 ms
Mar 19, 2019 12:39:55 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 250 variables to be positive in 552 ms
Mar 19, 2019 12:39:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 250 transitions.
Mar 19, 2019 12:39:55 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 19, 2019 12:39:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 19, 2019 12:39:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 250 transitions.
Mar 19, 2019 12:39:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 19, 2019 12:40:18 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 24649ms conformant to PINS in folder :/home/mcc/execution

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Philosophers-PT-000050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r107-oct2-155272231600817"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000050.tgz
mv Philosophers-PT-000050 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;