Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961389900122.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-PT-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961389900122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 82K Apr 27 15:14 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-000020-00
FORMULA_NAME Philosophers-PT-000020-01
FORMULA_NAME Philosophers-PT-000020-02
FORMULA_NAME Philosophers-PT-000020-03
FORMULA_NAME Philosophers-PT-000020-04
FORMULA_NAME Philosophers-PT-000020-05
FORMULA_NAME Philosophers-PT-000020-06
FORMULA_NAME Philosophers-PT-000020-07
FORMULA_NAME Philosophers-PT-000020-08
FORMULA_NAME Philosophers-PT-000020-09
FORMULA_NAME Philosophers-PT-000020-10
FORMULA_NAME Philosophers-PT-000020-11
FORMULA_NAME Philosophers-PT-000020-12
FORMULA_NAME Philosophers-PT-000020-13
FORMULA_NAME Philosophers-PT-000020-14
FORMULA_NAME Philosophers-PT-000020-15

=== Now, execution of the tool begins

BK_START 1589786683735

[2020-05-18 07:24:45] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 07:24:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 07:24:45] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2020-05-18 07:24:45] [INFO ] Transformed 100 places.
[2020-05-18 07:24:45] [INFO ] Transformed 100 transitions.
[2020-05-18 07:24:45] [INFO ] Parsed PT model containing 100 places and 100 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 413 steps, including 1 resets, run visited all 60 properties in 13 ms. (steps per millisecond=31 )
[2020-05-18 07:24:46] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-18 07:24:46] [INFO ] Flatten gal took : 46 ms
FORMULA Philosophers-PT-000020-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 07:24:46] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
[2020-05-18 07:24:46] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-18 07:24:46] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph400724345882897104.txt, -o, /tmp/graph400724345882897104.bin, -w, /tmp/graph400724345882897104.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph400724345882897104.bin, -l, -1, -v, -w, /tmp/graph400724345882897104.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 07:24:46] [INFO ] Input system was already deterministic with 100 transitions.
[2020-05-18 07:24:46] [INFO ] Decomposing Gal with order
[2020-05-18 07:24:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 07:24:46] [INFO ] Removed a total of 20 redundant transitions.
[2020-05-18 07:24:46] [INFO ] Flatten gal took : 43 ms
[2020-05-18 07:24:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 6 ms.
[2020-05-18 07:24:46] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-18 07:24:46] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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.202005100927/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 11 LTL properties
Checking formula 0 : !((G(F(X(F(!(G((G("((((((((((((((((((((i6.u9.Eat_17>=1)||(i6.u12.Eat_16>=1))||(i6.u11.Eat_15>=1))||(i4.u19.Eat_14>=1))||(i0.u0.Eat_3>=1))||(i1.u17.Eat_5>=1))||(i0.u16.Eat_2>=1))||(i0.u2.Eat_4>=1))||(i7.u13.Eat_1>=1))||(i8.u15.Eat_11>=1))||(i4.u6.Eat_13>=1))||(i3.u7.Eat_10>=1))||(i2.u4.Eat_7>=1))||(i8.u8.Eat_12>=1))||(i3.u5.Eat_9>=1))||(i1.u3.Eat_6>=1))||(i7.u1.Eat_20>=1))||(i2.u18.Eat_8>=1))||(i5.u14.Eat_19>=1))||(i5.u10.Eat_18>=1))"))U("((((((((((((((((((((((i7.u13.Fork_20>=1)&&(i7.u13.Catch2_1>=1))||((i5.u10.Fork_17>=1)&&(i5.u10.Catch2_18>=1)))||((i3.u7.Fork_10>=1)&&(i8.u15.Catch2_11>=1)))||((i5.u14.Fork_18>=1)&&(i5.u14.Catch2_19>=1)))||((i4.u6.Fork_12>=1)&&(i4.u6.Catch2_13>=1)))||((i0.u2.Fork_3>=1)&&(i0.u2.Catch2_4>=1)))||((i6.u11.Fork_14>=1)&&(i6.u11.Catch2_15>=1)))||((i2.u4.Fork_7>=1)&&(i2.u18.Catch2_8>=1)))||((i1.u3.Fork_5>=1)&&(i1.u3.Catch2_6>=1)))||((i6.u9.Fork_16>=1)&&(i6.u9.Catch2_17>=1)))||((i8.u8.Fork_11>=1)&&(i8.u8.Catch2_12>=1)))||((i1.u17.Fork_4>=1)&&(i1.u17.Catch2_5>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Catch2_3>=1)))||((i3.u5.Fork_9>=1)&&(i3.u7.Catch2_10>=1)))||((i0.u16.Fork_1>=1)&&(i0.u16.Catch2_2>=1)))||((i7.u1.Fork_19>=1)&&(i7.u1.Catch2_20>=1)))||((i6.u12.Fork_15>=1)&&(i6.u12.Catch2_16>=1)))||((i2.u18.Fork_8>=1)&&(i3.u5.Catch2_9>=1)))||((i2.u4.Fork_6>=1)&&(i2.u4.Catch2_7>=1)))||((i4.u19.Fork_13>=1)&&(i4.u19.Catch2_14>=1)))&&((((((((((((((((((((i6.u9.Eat_17>=1)||(i6.u12.Eat_16>=1))||(i6.u11.Eat_15>=1))||(i4.u19.Eat_14>=1))||(i0.u0.Eat_3>=1))||(i1.u17.Eat_5>=1))||(i0.u16.Eat_2>=1))||(i0.u2.Eat_4>=1))||(i7.u13.Eat_1>=1))||(i8.u15.Eat_11>=1))||(i4.u6.Eat_13>=1))||(i3.u7.Eat_10>=1))||(i2.u4.Eat_7>=1))||(i8.u8.Eat_12>=1))||(i3.u5.Eat_9>=1))||(i1.u3.Eat_6>=1))||(i7.u1.Eat_20>=1))||(i2.u18.Eat_8>=1))||(i5.u14.Eat_19>=1))||(i5.u10.Eat_18>=1)))")))))))))
Formula 0 simplified : !GFXF!G(G"((((((((((((((((((((i6.u9.Eat_17>=1)||(i6.u12.Eat_16>=1))||(i6.u11.Eat_15>=1))||(i4.u19.Eat_14>=1))||(i0.u0.Eat_3>=1))||(i1.u17.Eat_5>=1))||(i0.u16.Eat_2>=1))||(i0.u2.Eat_4>=1))||(i7.u13.Eat_1>=1))||(i8.u15.Eat_11>=1))||(i4.u6.Eat_13>=1))||(i3.u7.Eat_10>=1))||(i2.u4.Eat_7>=1))||(i8.u8.Eat_12>=1))||(i3.u5.Eat_9>=1))||(i1.u3.Eat_6>=1))||(i7.u1.Eat_20>=1))||(i2.u18.Eat_8>=1))||(i5.u14.Eat_19>=1))||(i5.u10.Eat_18>=1))" U "((((((((((((((((((((((i7.u13.Fork_20>=1)&&(i7.u13.Catch2_1>=1))||((i5.u10.Fork_17>=1)&&(i5.u10.Catch2_18>=1)))||((i3.u7.Fork_10>=1)&&(i8.u15.Catch2_11>=1)))||((i5.u14.Fork_18>=1)&&(i5.u14.Catch2_19>=1)))||((i4.u6.Fork_12>=1)&&(i4.u6.Catch2_13>=1)))||((i0.u2.Fork_3>=1)&&(i0.u2.Catch2_4>=1)))||((i6.u11.Fork_14>=1)&&(i6.u11.Catch2_15>=1)))||((i2.u4.Fork_7>=1)&&(i2.u18.Catch2_8>=1)))||((i1.u3.Fork_5>=1)&&(i1.u3.Catch2_6>=1)))||((i6.u9.Fork_16>=1)&&(i6.u9.Catch2_17>=1)))||((i8.u8.Fork_11>=1)&&(i8.u8.Catch2_12>=1)))||((i1.u17.Fork_4>=1)&&(i1.u17.Catch2_5>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Catch2_3>=1)))||((i3.u5.Fork_9>=1)&&(i3.u7.Catch2_10>=1)))||((i0.u16.Fork_1>=1)&&(i0.u16.Catch2_2>=1)))||((i7.u1.Fork_19>=1)&&(i7.u1.Catch2_20>=1)))||((i6.u12.Fork_15>=1)&&(i6.u12.Catch2_16>=1)))||((i2.u18.Fork_8>=1)&&(i3.u5.Catch2_9>=1)))||((i2.u4.Fork_6>=1)&&(i2.u4.Catch2_7>=1)))||((i4.u19.Fork_13>=1)&&(i4.u19.Catch2_14>=1)))&&((((((((((((((((((((i6.u9.Eat_17>=1)||(i6.u12.Eat_16>=1))||(i6.u11.Eat_15>=1))||(i4.u19.Eat_14>=1))||(i0.u0.Eat_3>=1))||(i1.u17.Eat_5>=1))||(i0.u16.Eat_2>=1))||(i0.u2.Eat_4>=1))||(i7.u13.Eat_1>=1))||(i8.u15.Eat_11>=1))||(i4.u6.Eat_13>=1))||(i3.u7.Eat_10>=1))||(i2.u4.Eat_7>=1))||(i8.u8.Eat_12>=1))||(i3.u5.Eat_9>=1))||(i1.u3.Eat_6>=1))||(i7.u1.Eat_20>=1))||(i2.u18.Eat_8>=1))||(i5.u14.Eat_19>=1))||(i5.u10.Eat_18>=1)))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 100 rows 100 cols
[2020-05-18 07:24:46] [INFO ] Computed 40 place invariants in 6 ms
inv : Think_14 + Catch1_14 + Catch2_14 + Eat_14 = 1
inv : Think_7 + Catch1_7 + Catch2_7 + Eat_7 = 1
inv : Fork_15 + Catch1_16 + Catch2_15 + Eat_16 + Eat_15 = 1
inv : Fork_17 + Catch1_18 + Catch2_17 + Eat_18 + Eat_17 = 1
inv : Think_6 + Catch1_6 + Catch2_6 + Eat_6 = 1
inv : Think_13 + Catch1_13 + Catch2_13 + Eat_13 = 1
inv : Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
inv : Think_20 + Catch1_20 + Catch2_20 + Eat_20 = 1
inv : Think_8 + Catch1_8 + Catch2_8 + Eat_8 = 1
inv : Fork_6 + Catch1_7 + Catch2_6 + Eat_7 + Eat_6 = 1
inv : Think_12 + Catch1_12 + Catch2_12 + Eat_12 = 1
inv : Think_9 + Catch1_9 + Catch2_9 + Eat_9 = 1
inv : Fork_10 + Catch1_11 + Catch2_10 + Eat_11 + Eat_10 = 1
inv : Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
inv : Think_11 + Catch1_11 + Catch2_11 + Eat_11 = 1
inv : Fork_11 + Catch1_12 + Catch2_11 + Eat_11 + Eat_12 = 1
inv : Think_17 + Catch1_17 + Catch2_17 + Eat_17 = 1
inv : Fork_12 + Catch1_13 + Catch2_12 + Eat_13 + Eat_12 = 1
inv : Fork_13 + Catch1_14 + Catch2_13 + Eat_13 + Eat_14 = 1
inv : Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
inv : Think_15 + Catch1_15 + Catch2_15 + Eat_15 = 1
inv : Fork_19 + Catch1_20 + Catch2_19 + Eat_20 + Eat_19 = 1
inv : Think_16 + Catch1_16 + Catch2_16 + Eat_16 = 1
inv : Think_18 + Catch1_18 + Catch2_18 + Eat_18 = 1
inv : Fork_4 + Catch1_5 + Catch2_4 + Eat_5 + Eat_4 = 1
inv : Fork_1 + Catch1_2 + Catch2_1 + Eat_2 + Eat_1 = 1
inv : Fork_16 + Catch1_17 + Catch2_16 + Eat_16 + Eat_17 = 1
inv : Fork_14 + Catch1_15 + Catch2_14 + Eat_14 + Eat_15 = 1
inv : Fork_18 + Catch1_19 + Catch2_18 + Eat_18 + Eat_19 = 1
inv : Think_10 + Catch1_10 + Catch2_10 + Eat_10 = 1
inv : Think_19 + Catch1_19 + Catch2_19 + Eat_19 = 1
inv : Fork_2 + Catch1_3 + Catch2_2 + Eat_3 + Eat_2 = 1
inv : Fork_5 + Catch1_6 + Catch2_5 + Eat_5 + Eat_6 = 1
inv : Fork_20 + Catch1_1 + Eat_1 + Catch2_20 + Eat_20 = 1
inv : Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
inv : Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
inv : Fork_9 + Catch1_10 + Catch2_9 + Eat_10 + Eat_9 = 1
inv : Fork_7 + Catch1_8 + Catch2_7 + Eat_7 + Eat_8 = 1
inv : Fork_8 + Catch1_9 + Catch2_8 + Eat_9 + Eat_8 = 1
inv : Fork_3 + Catch1_4 + Catch2_3 + Eat_3 + Eat_4 = 1
Total of 40 invariants.
[2020-05-18 07:24:46] [INFO ] Computed 40 place invariants in 9 ms
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
[2020-05-18 07:24:46] [INFO ] Proved 100 variables to be positive in 140 ms
[2020-05-18 07:24:46] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2020-05-18 07:24:46] [INFO ] Computation of disable matrix completed :0/100 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:24:46] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:24:46] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2020-05-18 07:24:46] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
18 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,0.208554,24060,1,0,13252,358,893,30967,233,849,22552
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F(X(F((G(!(F("(((((((((((((((((((((i1.u3.Think_6>=1)&&(i1.u3.Fork_5>=1))||((i3.u5.Think_9>=1)&&(i2.u18.Fork_8>=1)))||((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1)))||((i0.u2.Think_4>=1)&&(i0.u2.Fork_3>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))||((i0.u0.Think_3>=1)&&(i0.u0.Fork_2>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_6>=1)))||((i8.u15.Think_11>=1)&&(i3.u7.Fork_10>=1)))||((i7.u13.Think_1>=1)&&(i7.u13.Fork_20>=1)))||((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1)))||((i1.u17.Think_5>=1)&&(i1.u17.Fork_4>=1)))||((i7.u1.Think_20>=1)&&(i7.u1.Fork_19>=1)))||((i0.u16.Think_2>=1)&&(i0.u16.Fork_1>=1)))||((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1)))||((i4.u6.Think_13>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u4.Fork_7>=1)))||((i6.u9.Think_17>=1)&&(i6.u9.Fork_16>=1)))||((i8.u8.Think_12>=1)&&(i8.u8.Fork_11>=1)))||((i6.u11.Think_15>=1)&&(i6.u11.Fork_14>=1)))||((i5.u14.Think_19>=1)&&(i5.u14.Fork_18>=1)))"))))||(F(X(("(((((((((((((((((((((i1.u3.Think_6>=1)&&(i1.u3.Fork_5>=1))||((i3.u5.Think_9>=1)&&(i2.u18.Fork_8>=1)))||((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1)))||((i0.u2.Think_4>=1)&&(i0.u2.Fork_3>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))||((i0.u0.Think_3>=1)&&(i0.u0.Fork_2>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_6>=1)))||((i8.u15.Think_11>=1)&&(i3.u7.Fork_10>=1)))||((i7.u13.Think_1>=1)&&(i7.u13.Fork_20>=1)))||((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1)))||((i1.u17.Think_5>=1)&&(i1.u17.Fork_4>=1)))||((i7.u1.Think_20>=1)&&(i7.u1.Fork_19>=1)))||((i0.u16.Think_2>=1)&&(i0.u16.Fork_1>=1)))||((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1)))||((i4.u6.Think_13>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u4.Fork_7>=1)))||((i6.u9.Think_17>=1)&&(i6.u9.Fork_16>=1)))||((i8.u8.Think_12>=1)&&(i8.u8.Fork_11>=1)))||((i6.u11.Think_15>=1)&&(i6.u11.Fork_14>=1)))||((i5.u14.Think_19>=1)&&(i5.u14.Fork_18>=1)))")U(F("(((((((((((((((((((((i1.u3.Think_6>=1)&&(i1.u3.Fork_5>=1))||((i3.u5.Think_9>=1)&&(i2.u18.Fork_8>=1)))||((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1)))||((i0.u2.Think_4>=1)&&(i0.u2.Fork_3>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))||((i0.u0.Think_3>=1)&&(i0.u0.Fork_2>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_6>=1)))||((i8.u15.Think_11>=1)&&(i3.u7.Fork_10>=1)))||((i7.u13.Think_1>=1)&&(i7.u13.Fork_20>=1)))||((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1)))||((i1.u17.Think_5>=1)&&(i1.u17.Fork_4>=1)))||((i7.u1.Think_20>=1)&&(i7.u1.Fork_19>=1)))||((i0.u16.Think_2>=1)&&(i0.u16.Fork_1>=1)))||((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1)))||((i4.u6.Think_13>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u4.Fork_7>=1)))||((i6.u9.Think_17>=1)&&(i6.u9.Fork_16>=1)))||((i8.u8.Think_12>=1)&&(i8.u8.Fork_11>=1)))||((i6.u11.Think_15>=1)&&(i6.u11.Fork_14>=1)))||((i5.u14.Think_19>=1)&&(i5.u14.Fork_18>=1)))")))))))))))
Formula 1 simplified : !XFXF(G!F"(((((((((((((((((((((i1.u3.Think_6>=1)&&(i1.u3.Fork_5>=1))||((i3.u5.Think_9>=1)&&(i2.u18.Fork_8>=1)))||((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1)))||((i0.u2.Think_4>=1)&&(i0.u2.Fork_3>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))||((i0.u0.Think_3>=1)&&(i0.u0.Fork_2>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_6>=1)))||((i8.u15.Think_11>=1)&&(i3.u7.Fork_10>=1)))||((i7.u13.Think_1>=1)&&(i7.u13.Fork_20>=1)))||((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1)))||((i1.u17.Think_5>=1)&&(i1.u17.Fork_4>=1)))||((i7.u1.Think_20>=1)&&(i7.u1.Fork_19>=1)))||((i0.u16.Think_2>=1)&&(i0.u16.Fork_1>=1)))||((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1)))||((i4.u6.Think_13>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u4.Fork_7>=1)))||((i6.u9.Think_17>=1)&&(i6.u9.Fork_16>=1)))||((i8.u8.Think_12>=1)&&(i8.u8.Fork_11>=1)))||((i6.u11.Think_15>=1)&&(i6.u11.Fork_14>=1)))||((i5.u14.Think_19>=1)&&(i5.u14.Fork_18>=1)))" | FX("(((((((((((((((((((((i1.u3.Think_6>=1)&&(i1.u3.Fork_5>=1))||((i3.u5.Think_9>=1)&&(i2.u18.Fork_8>=1)))||((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1)))||((i0.u2.Think_4>=1)&&(i0.u2.Fork_3>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))||((i0.u0.Think_3>=1)&&(i0.u0.Fork_2>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_6>=1)))||((i8.u15.Think_11>=1)&&(i3.u7.Fork_10>=1)))||((i7.u13.Think_1>=1)&&(i7.u13.Fork_20>=1)))||((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1)))||((i1.u17.Think_5>=1)&&(i1.u17.Fork_4>=1)))||((i7.u1.Think_20>=1)&&(i7.u1.Fork_19>=1)))||((i0.u16.Think_2>=1)&&(i0.u16.Fork_1>=1)))||((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1)))||((i4.u6.Think_13>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u4.Fork_7>=1)))||((i6.u9.Think_17>=1)&&(i6.u9.Fork_16>=1)))||((i8.u8.Think_12>=1)&&(i8.u8.Fork_11>=1)))||((i6.u11.Think_15>=1)&&(i6.u11.Fork_14>=1)))||((i5.u14.Think_19>=1)&&(i5.u14.Fork_18>=1)))" U F"(((((((((((((((((((((i1.u3.Think_6>=1)&&(i1.u3.Fork_5>=1))||((i3.u5.Think_9>=1)&&(i2.u18.Fork_8>=1)))||((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1)))||((i0.u2.Think_4>=1)&&(i0.u2.Fork_3>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))||((i0.u0.Think_3>=1)&&(i0.u0.Fork_2>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_6>=1)))||((i8.u15.Think_11>=1)&&(i3.u7.Fork_10>=1)))||((i7.u13.Think_1>=1)&&(i7.u13.Fork_20>=1)))||((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1)))||((i1.u17.Think_5>=1)&&(i1.u17.Fork_4>=1)))||((i7.u1.Think_20>=1)&&(i7.u1.Fork_19>=1)))||((i0.u16.Think_2>=1)&&(i0.u16.Fork_1>=1)))||((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1)))||((i4.u6.Think_13>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u4.Fork_7>=1)))||((i6.u9.Think_17>=1)&&(i6.u9.Fork_16>=1)))||((i8.u8.Think_12>=1)&&(i8.u8.Fork_11>=1)))||((i6.u11.Think_15>=1)&&(i6.u11.Fork_14>=1)))||((i5.u14.Think_19>=1)&&(i5.u14.Fork_18>=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,0.209048,24288,1,0,13252,358,893,30967,233,849,22552
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("(((((((((((((((((((((i7.u13.Fork_20>=1)&&(i7.u1.Catch1_20>=1))||((i4.u6.Fork_12>=1)&&(i8.u8.Catch1_12>=1)))||((i5.u10.Fork_17>=1)&&(i6.u9.Catch1_17>=1)))||((i1.u17.Fork_4>=1)&&(i0.u2.Catch1_4>=1)))||((i8.u8.Fork_11>=1)&&(i8.u15.Catch1_11>=1)))||((i6.u12.Fork_15>=1)&&(i6.u11.Catch1_15>=1)))||((i0.u0.Fork_2>=1)&&(i0.u16.Catch1_2>=1)))||((i2.u18.Fork_8>=1)&&(i2.u18.Catch1_8>=1)))||((i7.u1.Fork_19>=1)&&(i5.u14.Catch1_19>=1)))||((i2.u4.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i6.u9.Fork_16>=1)&&(i6.u12.Catch1_16>=1)))||((i4.u19.Fork_13>=1)&&(i4.u6.Catch1_13>=1)))||((i0.u16.Fork_1>=1)&&(i7.u13.Catch1_1>=1)))||((i6.u11.Fork_14>=1)&&(i4.u19.Catch1_14>=1)))||((i5.u14.Fork_18>=1)&&(i5.u10.Catch1_18>=1)))||((i3.u7.Fork_10>=1)&&(i3.u7.Catch1_10>=1)))||((i3.u5.Fork_9>=1)&&(i3.u5.Catch1_9>=1)))||((i1.u3.Fork_5>=1)&&(i1.u17.Catch1_5>=1)))||((i0.u2.Fork_3>=1)&&(i0.u0.Catch1_3>=1)))||((i2.u4.Fork_7>=1)&&(i2.u4.Catch1_7>=1)))")U(X((G("(((((((((((((((((((((i7.u13.Fork_20<1)||(i7.u1.Catch1_20<1))&&((i4.u6.Fork_12<1)||(i8.u8.Catch1_12<1)))&&((i5.u10.Fork_17<1)||(i6.u9.Catch1_17<1)))&&((i1.u17.Fork_4<1)||(i0.u2.Catch1_4<1)))&&((i8.u8.Fork_11<1)||(i8.u15.Catch1_11<1)))&&((i6.u12.Fork_15<1)||(i6.u11.Catch1_15<1)))&&((i0.u0.Fork_2<1)||(i0.u16.Catch1_2<1)))&&((i2.u18.Fork_8<1)||(i2.u18.Catch1_8<1)))&&((i7.u1.Fork_19<1)||(i5.u14.Catch1_19<1)))&&((i2.u4.Fork_6<1)||(i1.u3.Catch1_6<1)))&&((i6.u9.Fork_16<1)||(i6.u12.Catch1_16<1)))&&((i4.u19.Fork_13<1)||(i4.u6.Catch1_13<1)))&&((i0.u16.Fork_1<1)||(i7.u13.Catch1_1<1)))&&((i6.u11.Fork_14<1)||(i4.u19.Catch1_14<1)))&&((i5.u14.Fork_18<1)||(i5.u10.Catch1_18<1)))&&((i3.u7.Fork_10<1)||(i3.u7.Catch1_10<1)))&&((i3.u5.Fork_9<1)||(i3.u5.Catch1_9<1)))&&((i1.u3.Fork_5<1)||(i1.u17.Catch1_5<1)))&&((i0.u2.Fork_3<1)||(i0.u0.Catch1_3<1)))&&((i2.u4.Fork_7<1)||(i2.u4.Catch1_7<1)))"))U("(((((((((((((((((((((i1.u3.Think_6>=1)&&(i2.u4.Fork_6>=1))||((i0.u2.Think_4>=1)&&(i1.u17.Fork_4>=1)))||((i3.u5.Think_9>=1)&&(i3.u5.Fork_9>=1)))||((i0.u0.Think_3>=1)&&(i0.u2.Fork_3>=1)))||((i7.u13.Think_1>=1)&&(i0.u16.Fork_1>=1)))||((i6.u12.Think_16>=1)&&(i6.u9.Fork_16>=1)))||((i8.u15.Think_11>=1)&&(i8.u8.Fork_11>=1)))||((i4.u19.Think_14>=1)&&(i6.u11.Fork_14>=1)))||((i5.u10.Think_18>=1)&&(i5.u14.Fork_18>=1)))||((i0.u16.Think_2>=1)&&(i0.u0.Fork_2>=1)))||((i4.u6.Think_13>=1)&&(i4.u19.Fork_13>=1)))||((i1.u17.Think_5>=1)&&(i1.u3.Fork_5>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_7>=1)))||((i7.u1.Think_20>=1)&&(i7.u13.Fork_20>=1)))||((i6.u9.Think_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u8.Think_12>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u18.Fork_8>=1)))||((i6.u11.Think_15>=1)&&(i6.u12.Fork_15>=1)))||((i5.u14.Think_19>=1)&&(i7.u1.Fork_19>=1)))||((i3.u7.Think_10>=1)&&(i3.u7.Fork_10>=1)))")))))
Formula 2 simplified : !("(((((((((((((((((((((i7.u13.Fork_20>=1)&&(i7.u1.Catch1_20>=1))||((i4.u6.Fork_12>=1)&&(i8.u8.Catch1_12>=1)))||((i5.u10.Fork_17>=1)&&(i6.u9.Catch1_17>=1)))||((i1.u17.Fork_4>=1)&&(i0.u2.Catch1_4>=1)))||((i8.u8.Fork_11>=1)&&(i8.u15.Catch1_11>=1)))||((i6.u12.Fork_15>=1)&&(i6.u11.Catch1_15>=1)))||((i0.u0.Fork_2>=1)&&(i0.u16.Catch1_2>=1)))||((i2.u18.Fork_8>=1)&&(i2.u18.Catch1_8>=1)))||((i7.u1.Fork_19>=1)&&(i5.u14.Catch1_19>=1)))||((i2.u4.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i6.u9.Fork_16>=1)&&(i6.u12.Catch1_16>=1)))||((i4.u19.Fork_13>=1)&&(i4.u6.Catch1_13>=1)))||((i0.u16.Fork_1>=1)&&(i7.u13.Catch1_1>=1)))||((i6.u11.Fork_14>=1)&&(i4.u19.Catch1_14>=1)))||((i5.u14.Fork_18>=1)&&(i5.u10.Catch1_18>=1)))||((i3.u7.Fork_10>=1)&&(i3.u7.Catch1_10>=1)))||((i3.u5.Fork_9>=1)&&(i3.u5.Catch1_9>=1)))||((i1.u3.Fork_5>=1)&&(i1.u17.Catch1_5>=1)))||((i0.u2.Fork_3>=1)&&(i0.u0.Catch1_3>=1)))||((i2.u4.Fork_7>=1)&&(i2.u4.Catch1_7>=1)))" U X(G"(((((((((((((((((((((i7.u13.Fork_20<1)||(i7.u1.Catch1_20<1))&&((i4.u6.Fork_12<1)||(i8.u8.Catch1_12<1)))&&((i5.u10.Fork_17<1)||(i6.u9.Catch1_17<1)))&&((i1.u17.Fork_4<1)||(i0.u2.Catch1_4<1)))&&((i8.u8.Fork_11<1)||(i8.u15.Catch1_11<1)))&&((i6.u12.Fork_15<1)||(i6.u11.Catch1_15<1)))&&((i0.u0.Fork_2<1)||(i0.u16.Catch1_2<1)))&&((i2.u18.Fork_8<1)||(i2.u18.Catch1_8<1)))&&((i7.u1.Fork_19<1)||(i5.u14.Catch1_19<1)))&&((i2.u4.Fork_6<1)||(i1.u3.Catch1_6<1)))&&((i6.u9.Fork_16<1)||(i6.u12.Catch1_16<1)))&&((i4.u19.Fork_13<1)||(i4.u6.Catch1_13<1)))&&((i0.u16.Fork_1<1)||(i7.u13.Catch1_1<1)))&&((i6.u11.Fork_14<1)||(i4.u19.Catch1_14<1)))&&((i5.u14.Fork_18<1)||(i5.u10.Catch1_18<1)))&&((i3.u7.Fork_10<1)||(i3.u7.Catch1_10<1)))&&((i3.u5.Fork_9<1)||(i3.u5.Catch1_9<1)))&&((i1.u3.Fork_5<1)||(i1.u17.Catch1_5<1)))&&((i0.u2.Fork_3<1)||(i0.u0.Catch1_3<1)))&&((i2.u4.Fork_7<1)||(i2.u4.Catch1_7<1)))" U "(((((((((((((((((((((i1.u3.Think_6>=1)&&(i2.u4.Fork_6>=1))||((i0.u2.Think_4>=1)&&(i1.u17.Fork_4>=1)))||((i3.u5.Think_9>=1)&&(i3.u5.Fork_9>=1)))||((i0.u0.Think_3>=1)&&(i0.u2.Fork_3>=1)))||((i7.u13.Think_1>=1)&&(i0.u16.Fork_1>=1)))||((i6.u12.Think_16>=1)&&(i6.u9.Fork_16>=1)))||((i8.u15.Think_11>=1)&&(i8.u8.Fork_11>=1)))||((i4.u19.Think_14>=1)&&(i6.u11.Fork_14>=1)))||((i5.u10.Think_18>=1)&&(i5.u14.Fork_18>=1)))||((i0.u16.Think_2>=1)&&(i0.u0.Fork_2>=1)))||((i4.u6.Think_13>=1)&&(i4.u19.Fork_13>=1)))||((i1.u17.Think_5>=1)&&(i1.u3.Fork_5>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_7>=1)))||((i7.u1.Think_20>=1)&&(i7.u13.Fork_20>=1)))||((i6.u9.Think_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u8.Think_12>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u18.Fork_8>=1)))||((i6.u11.Think_15>=1)&&(i6.u12.Fork_15>=1)))||((i5.u14.Think_19>=1)&&(i7.u1.Fork_19>=1)))||((i3.u7.Think_10>=1)&&(i3.u7.Fork_10>=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
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,0.221866,25048,1,0,13378,358,1323,31103,249,849,23171
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(!(F(X(G(F(X(("(((((((((((((((((((((i1.u3.Think_6>=1)&&(i2.u4.Fork_6>=1))||((i0.u2.Think_4>=1)&&(i1.u17.Fork_4>=1)))||((i3.u5.Think_9>=1)&&(i3.u5.Fork_9>=1)))||((i0.u0.Think_3>=1)&&(i0.u2.Fork_3>=1)))||((i7.u13.Think_1>=1)&&(i0.u16.Fork_1>=1)))||((i6.u12.Think_16>=1)&&(i6.u9.Fork_16>=1)))||((i8.u15.Think_11>=1)&&(i8.u8.Fork_11>=1)))||((i4.u19.Think_14>=1)&&(i6.u11.Fork_14>=1)))||((i5.u10.Think_18>=1)&&(i5.u14.Fork_18>=1)))||((i0.u16.Think_2>=1)&&(i0.u0.Fork_2>=1)))||((i4.u6.Think_13>=1)&&(i4.u19.Fork_13>=1)))||((i1.u17.Think_5>=1)&&(i1.u3.Fork_5>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_7>=1)))||((i7.u1.Think_20>=1)&&(i7.u13.Fork_20>=1)))||((i6.u9.Think_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u8.Think_12>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u18.Fork_8>=1)))||((i6.u11.Think_15>=1)&&(i6.u12.Fork_15>=1)))||((i5.u14.Think_19>=1)&&(i7.u1.Fork_19>=1)))||((i3.u7.Think_10>=1)&&(i3.u7.Fork_10>=1)))")U(X("(((((((((((((((((((((i1.u3.Think_6>=1)&&(i2.u4.Fork_6>=1))||((i0.u2.Think_4>=1)&&(i1.u17.Fork_4>=1)))||((i3.u5.Think_9>=1)&&(i3.u5.Fork_9>=1)))||((i0.u0.Think_3>=1)&&(i0.u2.Fork_3>=1)))||((i7.u13.Think_1>=1)&&(i0.u16.Fork_1>=1)))||((i6.u12.Think_16>=1)&&(i6.u9.Fork_16>=1)))||((i8.u15.Think_11>=1)&&(i8.u8.Fork_11>=1)))||((i4.u19.Think_14>=1)&&(i6.u11.Fork_14>=1)))||((i5.u10.Think_18>=1)&&(i5.u14.Fork_18>=1)))||((i0.u16.Think_2>=1)&&(i0.u0.Fork_2>=1)))||((i4.u6.Think_13>=1)&&(i4.u19.Fork_13>=1)))||((i1.u17.Think_5>=1)&&(i1.u3.Fork_5>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_7>=1)))||((i7.u1.Think_20>=1)&&(i7.u13.Fork_20>=1)))||((i6.u9.Think_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u8.Think_12>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u18.Fork_8>=1)))||((i6.u11.Think_15>=1)&&(i6.u12.Fork_15>=1)))||((i5.u14.Think_19>=1)&&(i7.u1.Fork_19>=1)))||((i3.u7.Think_10>=1)&&(i3.u7.Fork_10>=1)))")))))))))))
Formula 3 simplified : !G!FXGFX("(((((((((((((((((((((i1.u3.Think_6>=1)&&(i2.u4.Fork_6>=1))||((i0.u2.Think_4>=1)&&(i1.u17.Fork_4>=1)))||((i3.u5.Think_9>=1)&&(i3.u5.Fork_9>=1)))||((i0.u0.Think_3>=1)&&(i0.u2.Fork_3>=1)))||((i7.u13.Think_1>=1)&&(i0.u16.Fork_1>=1)))||((i6.u12.Think_16>=1)&&(i6.u9.Fork_16>=1)))||((i8.u15.Think_11>=1)&&(i8.u8.Fork_11>=1)))||((i4.u19.Think_14>=1)&&(i6.u11.Fork_14>=1)))||((i5.u10.Think_18>=1)&&(i5.u14.Fork_18>=1)))||((i0.u16.Think_2>=1)&&(i0.u0.Fork_2>=1)))||((i4.u6.Think_13>=1)&&(i4.u19.Fork_13>=1)))||((i1.u17.Think_5>=1)&&(i1.u3.Fork_5>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_7>=1)))||((i7.u1.Think_20>=1)&&(i7.u13.Fork_20>=1)))||((i6.u9.Think_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u8.Think_12>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u18.Fork_8>=1)))||((i6.u11.Think_15>=1)&&(i6.u12.Fork_15>=1)))||((i5.u14.Think_19>=1)&&(i7.u1.Fork_19>=1)))||((i3.u7.Think_10>=1)&&(i3.u7.Fork_10>=1)))" U X"(((((((((((((((((((((i1.u3.Think_6>=1)&&(i2.u4.Fork_6>=1))||((i0.u2.Think_4>=1)&&(i1.u17.Fork_4>=1)))||((i3.u5.Think_9>=1)&&(i3.u5.Fork_9>=1)))||((i0.u0.Think_3>=1)&&(i0.u2.Fork_3>=1)))||((i7.u13.Think_1>=1)&&(i0.u16.Fork_1>=1)))||((i6.u12.Think_16>=1)&&(i6.u9.Fork_16>=1)))||((i8.u15.Think_11>=1)&&(i8.u8.Fork_11>=1)))||((i4.u19.Think_14>=1)&&(i6.u11.Fork_14>=1)))||((i5.u10.Think_18>=1)&&(i5.u14.Fork_18>=1)))||((i0.u16.Think_2>=1)&&(i0.u0.Fork_2>=1)))||((i4.u6.Think_13>=1)&&(i4.u19.Fork_13>=1)))||((i1.u17.Think_5>=1)&&(i1.u3.Fork_5>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_7>=1)))||((i7.u1.Think_20>=1)&&(i7.u13.Fork_20>=1)))||((i6.u9.Think_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u8.Think_12>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u18.Fork_8>=1)))||((i6.u11.Think_15>=1)&&(i6.u12.Fork_15>=1)))||((i5.u14.Think_19>=1)&&(i7.u1.Fork_19>=1)))||((i3.u7.Think_10>=1)&&(i3.u7.Fork_10>=1)))")
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
4 strongly connected components in search stack
8 transitions explored
5 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,0.23345,25376,1,0,14735,362,1326,33290,249,879,25185
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X("(((((((((((((((((((((i7.u13.Fork_20>=1)&&(i7.u1.Catch1_20>=1))||((i4.u6.Fork_12>=1)&&(i8.u8.Catch1_12>=1)))||((i5.u10.Fork_17>=1)&&(i6.u9.Catch1_17>=1)))||((i1.u17.Fork_4>=1)&&(i0.u2.Catch1_4>=1)))||((i8.u8.Fork_11>=1)&&(i8.u15.Catch1_11>=1)))||((i6.u12.Fork_15>=1)&&(i6.u11.Catch1_15>=1)))||((i0.u0.Fork_2>=1)&&(i0.u16.Catch1_2>=1)))||((i2.u18.Fork_8>=1)&&(i2.u18.Catch1_8>=1)))||((i7.u1.Fork_19>=1)&&(i5.u14.Catch1_19>=1)))||((i2.u4.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i6.u9.Fork_16>=1)&&(i6.u12.Catch1_16>=1)))||((i4.u19.Fork_13>=1)&&(i4.u6.Catch1_13>=1)))||((i0.u16.Fork_1>=1)&&(i7.u13.Catch1_1>=1)))||((i6.u11.Fork_14>=1)&&(i4.u19.Catch1_14>=1)))||((i5.u14.Fork_18>=1)&&(i5.u10.Catch1_18>=1)))||((i3.u7.Fork_10>=1)&&(i3.u7.Catch1_10>=1)))||((i3.u5.Fork_9>=1)&&(i3.u5.Catch1_9>=1)))||((i1.u3.Fork_5>=1)&&(i1.u17.Catch1_5>=1)))||((i0.u2.Fork_3>=1)&&(i0.u0.Catch1_3>=1)))||((i2.u4.Fork_7>=1)&&(i2.u4.Catch1_7>=1)))"))U(X((X(X("(((((((((((((((((((((i7.u13.Fork_20>=1)&&(i7.u1.Catch1_20>=1))||((i4.u6.Fork_12>=1)&&(i8.u8.Catch1_12>=1)))||((i5.u10.Fork_17>=1)&&(i6.u9.Catch1_17>=1)))||((i1.u17.Fork_4>=1)&&(i0.u2.Catch1_4>=1)))||((i8.u8.Fork_11>=1)&&(i8.u15.Catch1_11>=1)))||((i6.u12.Fork_15>=1)&&(i6.u11.Catch1_15>=1)))||((i0.u0.Fork_2>=1)&&(i0.u16.Catch1_2>=1)))||((i2.u18.Fork_8>=1)&&(i2.u18.Catch1_8>=1)))||((i7.u1.Fork_19>=1)&&(i5.u14.Catch1_19>=1)))||((i2.u4.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i6.u9.Fork_16>=1)&&(i6.u12.Catch1_16>=1)))||((i4.u19.Fork_13>=1)&&(i4.u6.Catch1_13>=1)))||((i0.u16.Fork_1>=1)&&(i7.u13.Catch1_1>=1)))||((i6.u11.Fork_14>=1)&&(i4.u19.Catch1_14>=1)))||((i5.u14.Fork_18>=1)&&(i5.u10.Catch1_18>=1)))||((i3.u7.Fork_10>=1)&&(i3.u7.Catch1_10>=1)))||((i3.u5.Fork_9>=1)&&(i3.u5.Catch1_9>=1)))||((i1.u3.Fork_5>=1)&&(i1.u17.Catch1_5>=1)))||((i0.u2.Fork_3>=1)&&(i0.u0.Catch1_3>=1)))||((i2.u4.Fork_7>=1)&&(i2.u4.Catch1_7>=1)))")))||(("(((((((((((((((((((((i7.u13.Fork_20>=1)&&(i7.u1.Catch1_20>=1))||((i4.u6.Fork_12>=1)&&(i8.u8.Catch1_12>=1)))||((i5.u10.Fork_17>=1)&&(i6.u9.Catch1_17>=1)))||((i1.u17.Fork_4>=1)&&(i0.u2.Catch1_4>=1)))||((i8.u8.Fork_11>=1)&&(i8.u15.Catch1_11>=1)))||((i6.u12.Fork_15>=1)&&(i6.u11.Catch1_15>=1)))||((i0.u0.Fork_2>=1)&&(i0.u16.Catch1_2>=1)))||((i2.u18.Fork_8>=1)&&(i2.u18.Catch1_8>=1)))||((i7.u1.Fork_19>=1)&&(i5.u14.Catch1_19>=1)))||((i2.u4.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i6.u9.Fork_16>=1)&&(i6.u12.Catch1_16>=1)))||((i4.u19.Fork_13>=1)&&(i4.u6.Catch1_13>=1)))||((i0.u16.Fork_1>=1)&&(i7.u13.Catch1_1>=1)))||((i6.u11.Fork_14>=1)&&(i4.u19.Catch1_14>=1)))||((i5.u14.Fork_18>=1)&&(i5.u10.Catch1_18>=1)))||((i3.u7.Fork_10>=1)&&(i3.u7.Catch1_10>=1)))||((i3.u5.Fork_9>=1)&&(i3.u5.Catch1_9>=1)))||((i1.u3.Fork_5>=1)&&(i1.u17.Catch1_5>=1)))||((i0.u2.Fork_3>=1)&&(i0.u0.Catch1_3>=1)))||((i2.u4.Fork_7>=1)&&(i2.u4.Catch1_7>=1)))")U("(((((((((((((((((((((i1.u3.Think_6>=1)&&(i1.u3.Fork_5>=1))||((i3.u5.Think_9>=1)&&(i2.u18.Fork_8>=1)))||((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1)))||((i0.u2.Think_4>=1)&&(i0.u2.Fork_3>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))||((i0.u0.Think_3>=1)&&(i0.u0.Fork_2>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_6>=1)))||((i8.u15.Think_11>=1)&&(i3.u7.Fork_10>=1)))||((i7.u13.Think_1>=1)&&(i7.u13.Fork_20>=1)))||((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1)))||((i1.u17.Think_5>=1)&&(i1.u17.Fork_4>=1)))||((i7.u1.Think_20>=1)&&(i7.u1.Fork_19>=1)))||((i0.u16.Think_2>=1)&&(i0.u16.Fork_1>=1)))||((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1)))||((i4.u6.Think_13>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u4.Fork_7>=1)))||((i6.u9.Think_17>=1)&&(i6.u9.Fork_16>=1)))||((i8.u8.Think_12>=1)&&(i8.u8.Fork_11>=1)))||((i6.u11.Think_15>=1)&&(i6.u11.Fork_14>=1)))||((i5.u14.Think_19>=1)&&(i5.u14.Fork_18>=1)))"))))))
Formula 4 simplified : !(X"(((((((((((((((((((((i7.u13.Fork_20>=1)&&(i7.u1.Catch1_20>=1))||((i4.u6.Fork_12>=1)&&(i8.u8.Catch1_12>=1)))||((i5.u10.Fork_17>=1)&&(i6.u9.Catch1_17>=1)))||((i1.u17.Fork_4>=1)&&(i0.u2.Catch1_4>=1)))||((i8.u8.Fork_11>=1)&&(i8.u15.Catch1_11>=1)))||((i6.u12.Fork_15>=1)&&(i6.u11.Catch1_15>=1)))||((i0.u0.Fork_2>=1)&&(i0.u16.Catch1_2>=1)))||((i2.u18.Fork_8>=1)&&(i2.u18.Catch1_8>=1)))||((i7.u1.Fork_19>=1)&&(i5.u14.Catch1_19>=1)))||((i2.u4.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i6.u9.Fork_16>=1)&&(i6.u12.Catch1_16>=1)))||((i4.u19.Fork_13>=1)&&(i4.u6.Catch1_13>=1)))||((i0.u16.Fork_1>=1)&&(i7.u13.Catch1_1>=1)))||((i6.u11.Fork_14>=1)&&(i4.u19.Catch1_14>=1)))||((i5.u14.Fork_18>=1)&&(i5.u10.Catch1_18>=1)))||((i3.u7.Fork_10>=1)&&(i3.u7.Catch1_10>=1)))||((i3.u5.Fork_9>=1)&&(i3.u5.Catch1_9>=1)))||((i1.u3.Fork_5>=1)&&(i1.u17.Catch1_5>=1)))||((i0.u2.Fork_3>=1)&&(i0.u0.Catch1_3>=1)))||((i2.u4.Fork_7>=1)&&(i2.u4.Catch1_7>=1)))" U X(XX"(((((((((((((((((((((i7.u13.Fork_20>=1)&&(i7.u1.Catch1_20>=1))||((i4.u6.Fork_12>=1)&&(i8.u8.Catch1_12>=1)))||((i5.u10.Fork_17>=1)&&(i6.u9.Catch1_17>=1)))||((i1.u17.Fork_4>=1)&&(i0.u2.Catch1_4>=1)))||((i8.u8.Fork_11>=1)&&(i8.u15.Catch1_11>=1)))||((i6.u12.Fork_15>=1)&&(i6.u11.Catch1_15>=1)))||((i0.u0.Fork_2>=1)&&(i0.u16.Catch1_2>=1)))||((i2.u18.Fork_8>=1)&&(i2.u18.Catch1_8>=1)))||((i7.u1.Fork_19>=1)&&(i5.u14.Catch1_19>=1)))||((i2.u4.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i6.u9.Fork_16>=1)&&(i6.u12.Catch1_16>=1)))||((i4.u19.Fork_13>=1)&&(i4.u6.Catch1_13>=1)))||((i0.u16.Fork_1>=1)&&(i7.u13.Catch1_1>=1)))||((i6.u11.Fork_14>=1)&&(i4.u19.Catch1_14>=1)))||((i5.u14.Fork_18>=1)&&(i5.u10.Catch1_18>=1)))||((i3.u7.Fork_10>=1)&&(i3.u7.Catch1_10>=1)))||((i3.u5.Fork_9>=1)&&(i3.u5.Catch1_9>=1)))||((i1.u3.Fork_5>=1)&&(i1.u17.Catch1_5>=1)))||((i0.u2.Fork_3>=1)&&(i0.u0.Catch1_3>=1)))||((i2.u4.Fork_7>=1)&&(i2.u4.Catch1_7>=1)))" | ("(((((((((((((((((((((i7.u13.Fork_20>=1)&&(i7.u1.Catch1_20>=1))||((i4.u6.Fork_12>=1)&&(i8.u8.Catch1_12>=1)))||((i5.u10.Fork_17>=1)&&(i6.u9.Catch1_17>=1)))||((i1.u17.Fork_4>=1)&&(i0.u2.Catch1_4>=1)))||((i8.u8.Fork_11>=1)&&(i8.u15.Catch1_11>=1)))||((i6.u12.Fork_15>=1)&&(i6.u11.Catch1_15>=1)))||((i0.u0.Fork_2>=1)&&(i0.u16.Catch1_2>=1)))||((i2.u18.Fork_8>=1)&&(i2.u18.Catch1_8>=1)))||((i7.u1.Fork_19>=1)&&(i5.u14.Catch1_19>=1)))||((i2.u4.Fork_6>=1)&&(i1.u3.Catch1_6>=1)))||((i6.u9.Fork_16>=1)&&(i6.u12.Catch1_16>=1)))||((i4.u19.Fork_13>=1)&&(i4.u6.Catch1_13>=1)))||((i0.u16.Fork_1>=1)&&(i7.u13.Catch1_1>=1)))||((i6.u11.Fork_14>=1)&&(i4.u19.Catch1_14>=1)))||((i5.u14.Fork_18>=1)&&(i5.u10.Catch1_18>=1)))||((i3.u7.Fork_10>=1)&&(i3.u7.Catch1_10>=1)))||((i3.u5.Fork_9>=1)&&(i3.u5.Catch1_9>=1)))||((i1.u3.Fork_5>=1)&&(i1.u17.Catch1_5>=1)))||((i0.u2.Fork_3>=1)&&(i0.u0.Catch1_3>=1)))||((i2.u4.Fork_7>=1)&&(i2.u4.Catch1_7>=1)))" U "(((((((((((((((((((((i1.u3.Think_6>=1)&&(i1.u3.Fork_5>=1))||((i3.u5.Think_9>=1)&&(i2.u18.Fork_8>=1)))||((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1)))||((i0.u2.Think_4>=1)&&(i0.u2.Fork_3>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))||((i0.u0.Think_3>=1)&&(i0.u0.Fork_2>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_6>=1)))||((i8.u15.Think_11>=1)&&(i3.u7.Fork_10>=1)))||((i7.u13.Think_1>=1)&&(i7.u13.Fork_20>=1)))||((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1)))||((i1.u17.Think_5>=1)&&(i1.u17.Fork_4>=1)))||((i7.u1.Think_20>=1)&&(i7.u1.Fork_19>=1)))||((i0.u16.Think_2>=1)&&(i0.u16.Fork_1>=1)))||((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1)))||((i4.u6.Think_13>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u4.Fork_7>=1)))||((i6.u9.Think_17>=1)&&(i6.u9.Fork_16>=1)))||((i8.u8.Think_12>=1)&&(i8.u8.Fork_11>=1)))||((i6.u11.Think_15>=1)&&(i6.u11.Fork_14>=1)))||((i5.u14.Think_19>=1)&&(i5.u14.Fork_18>=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
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,0.239316,25908,1,0,14765,362,1434,33345,255,879,25441
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(!(G((G(F(((((((((((((((((((((!(F("(((((((((((((((((((((i7.u13.Fork_20<1)||(i7.u1.Catch1_20<1))&&((i4.u6.Fork_12<1)||(i8.u8.Catch1_12<1)))&&((i5.u10.Fork_17<1)||(i6.u9.Catch1_17<1)))&&((i1.u17.Fork_4<1)||(i0.u2.Catch1_4<1)))&&((i8.u8.Fork_11<1)||(i8.u15.Catch1_11<1)))&&((i6.u12.Fork_15<1)||(i6.u11.Catch1_15<1)))&&((i0.u0.Fork_2<1)||(i0.u16.Catch1_2<1)))&&((i2.u18.Fork_8<1)||(i2.u18.Catch1_8<1)))&&((i7.u1.Fork_19<1)||(i5.u14.Catch1_19<1)))&&((i2.u4.Fork_6<1)||(i1.u3.Catch1_6<1)))&&((i6.u9.Fork_16<1)||(i6.u12.Catch1_16<1)))&&((i4.u19.Fork_13<1)||(i4.u6.Catch1_13<1)))&&((i0.u16.Fork_1<1)||(i7.u13.Catch1_1<1)))&&((i6.u11.Fork_14<1)||(i4.u19.Catch1_14<1)))&&((i5.u14.Fork_18<1)||(i5.u10.Catch1_18<1)))&&((i3.u7.Fork_10<1)||(i3.u7.Catch1_10<1)))&&((i3.u5.Fork_9<1)||(i3.u5.Catch1_9<1)))&&((i1.u3.Fork_5<1)||(i1.u17.Catch1_5<1)))&&((i0.u2.Fork_3<1)||(i0.u0.Catch1_3<1)))&&((i2.u4.Fork_7<1)||(i2.u4.Catch1_7<1)))")))&&("((i1.u3.Think_6<1)||(i2.u4.Fork_6<1))"))&&("((i0.u2.Think_4<1)||(i1.u17.Fork_4<1))"))&&("((i3.u5.Think_9<1)||(i3.u5.Fork_9<1))"))&&("((i0.u0.Think_3<1)||(i0.u2.Fork_3<1))"))&&("((i7.u13.Think_1<1)||(i0.u16.Fork_1<1))"))&&("((i6.u12.Think_16<1)||(i6.u9.Fork_16<1))"))&&("((i8.u15.Think_11<1)||(i8.u8.Fork_11<1))"))&&("((i4.u19.Think_14<1)||(i6.u11.Fork_14<1))"))&&("((i5.u10.Think_18<1)||(i5.u14.Fork_18<1))"))&&("((i0.u16.Think_2<1)||(i0.u0.Fork_2<1))"))&&("((i4.u6.Think_13<1)||(i4.u19.Fork_13<1))"))&&("((i1.u17.Think_5<1)||(i1.u3.Fork_5<1))"))&&("((i2.u4.Think_7<1)||(i2.u4.Fork_7<1))"))&&("((i7.u1.Think_20<1)||(i7.u13.Fork_20<1))"))&&("((i6.u9.Think_17<1)||(i5.u10.Fork_17<1))"))&&("((i8.u8.Think_12<1)||(i4.u6.Fork_12<1))"))&&("((i2.u18.Think_8<1)||(i2.u18.Fork_8<1))"))&&("((i6.u11.Think_15<1)||(i6.u12.Fork_15<1))"))&&("((i5.u14.Think_19<1)||(i7.u1.Fork_19<1))"))&&("((i3.u7.Think_10<1)||(i3.u7.Fork_10<1))"))))&&("(((((((((((((((((((((i1.u3.Think_6>=1)&&(i1.u3.Fork_5>=1))||((i3.u5.Think_9>=1)&&(i2.u18.Fork_8>=1)))||((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1)))||((i0.u2.Think_4>=1)&&(i0.u2.Fork_3>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))||((i0.u0.Think_3>=1)&&(i0.u0.Fork_2>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_6>=1)))||((i8.u15.Think_11>=1)&&(i3.u7.Fork_10>=1)))||((i7.u13.Think_1>=1)&&(i7.u13.Fork_20>=1)))||((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1)))||((i1.u17.Think_5>=1)&&(i1.u17.Fork_4>=1)))||((i7.u1.Think_20>=1)&&(i7.u1.Fork_19>=1)))||((i0.u16.Think_2>=1)&&(i0.u16.Fork_1>=1)))||((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1)))||((i4.u6.Think_13>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u4.Fork_7>=1)))||((i6.u9.Think_17>=1)&&(i6.u9.Fork_16>=1)))||((i8.u8.Think_12>=1)&&(i8.u8.Fork_11>=1)))||((i6.u11.Think_15>=1)&&(i6.u11.Fork_14>=1)))||((i5.u14.Think_19>=1)&&(i5.u14.Fork_18>=1)))"))))))
Formula 5 simplified : !X!G("(((((((((((((((((((((i1.u3.Think_6>=1)&&(i1.u3.Fork_5>=1))||((i3.u5.Think_9>=1)&&(i2.u18.Fork_8>=1)))||((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1)))||((i0.u2.Think_4>=1)&&(i0.u2.Fork_3>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))||((i0.u0.Think_3>=1)&&(i0.u0.Fork_2>=1)))||((i2.u4.Think_7>=1)&&(i2.u4.Fork_6>=1)))||((i8.u15.Think_11>=1)&&(i3.u7.Fork_10>=1)))||((i7.u13.Think_1>=1)&&(i7.u13.Fork_20>=1)))||((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1)))||((i1.u17.Think_5>=1)&&(i1.u17.Fork_4>=1)))||((i7.u1.Think_20>=1)&&(i7.u1.Fork_19>=1)))||((i0.u16.Think_2>=1)&&(i0.u16.Fork_1>=1)))||((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1)))||((i4.u6.Think_13>=1)&&(i4.u6.Fork_12>=1)))||((i2.u18.Think_8>=1)&&(i2.u4.Fork_7>=1)))||((i6.u9.Think_17>=1)&&(i6.u9.Fork_16>=1)))||((i8.u8.Think_12>=1)&&(i8.u8.Fork_11>=1)))||((i6.u11.Think_15>=1)&&(i6.u11.Fork_14>=1)))||((i5.u14.Think_19>=1)&&(i5.u14.Fork_18>=1)))" & GF("((i0.u0.Think_3<1)||(i0.u2.Fork_3<1))" & "((i0.u2.Think_4<1)||(i1.u17.Fork_4<1))" & "((i0.u16.Think_2<1)||(i0.u0.Fork_2<1))" & "((i1.u3.Think_6<1)||(i2.u4.Fork_6<1))" & "((i1.u17.Think_5<1)||(i1.u3.Fork_5<1))" & "((i2.u4.Think_7<1)||(i2.u4.Fork_7<1))" & "((i2.u18.Think_8<1)||(i2.u18.Fork_8<1))" & "((i3.u5.Think_9<1)||(i3.u5.Fork_9<1))" & "((i3.u7.Think_10<1)||(i3.u7.Fork_10<1))" & "((i4.u6.Think_13<1)||(i4.u19.Fork_13<1))" & "((i4.u19.Think_14<1)||(i6.u11.Fork_14<1))" & "((i5.u10.Think_18<1)||(i5.u14.Fork_18<1))" & "((i5.u14.Think_19<1)||(i7.u1.Fork_19<1))" & "((i6.u9.Think_17<1)||(i5.u10.Fork_17<1))" & "((i6.u11.Think_15<1)||(i6.u12.Fork_15<1))" & "((i6.u12.Think_16<1)||(i6.u9.Fork_16<1))" & "((i7.u1.Think_20<1)||(i7.u13.Fork_20<1))" & "((i7.u13.Think_1<1)||(i0.u16.Fork_1<1))" & "((i8.u8.Think_12<1)||(i4.u6.Fork_12<1))" & "((i8.u15.Think_11<1)||(i8.u8.Fork_11<1))" & !F"(((((((((((((((((((((i7.u13.Fork_20<1)||(i7.u1.Catch1_20<1))&&((i4.u6.Fork_12<1)||(i8.u8.Catch1_12<1)))&&((i5.u10.Fork_17<1)||(i6.u9.Catch1_17<1)))&&((i1.u17.Fork_4<1)||(i0.u2.Catch1_4<1)))&&((i8.u8.Fork_11<1)||(i8.u15.Catch1_11<1)))&&((i6.u12.Fork_15<1)||(i6.u11.Catch1_15<1)))&&((i0.u0.Fork_2<1)||(i0.u16.Catch1_2<1)))&&((i2.u18.Fork_8<1)||(i2.u18.Catch1_8<1)))&&((i7.u1.Fork_19<1)||(i5.u14.Catch1_19<1)))&&((i2.u4.Fork_6<1)||(i1.u3.Catch1_6<1)))&&((i6.u9.Fork_16<1)||(i6.u12.Catch1_16<1)))&&((i4.u19.Fork_13<1)||(i4.u6.Catch1_13<1)))&&((i0.u16.Fork_1<1)||(i7.u13.Catch1_1<1)))&&((i6.u11.Fork_14<1)||(i4.u19.Catch1_14<1)))&&((i5.u14.Fork_18<1)||(i5.u10.Catch1_18<1)))&&((i3.u7.Fork_10<1)||(i3.u7.Catch1_10<1)))&&((i3.u5.Fork_9<1)||(i3.u5.Catch1_9<1)))&&((i1.u3.Fork_5<1)||(i1.u17.Catch1_5<1)))&&((i0.u2.Fork_3<1)||(i0.u0.Catch1_3<1)))&&((i2.u4.Fork_7<1)||(i2.u4.Catch1_7<1)))"))
[2020-05-18 07:24:54] [INFO ] Computing symmetric co enabling matrix : 100 transitions.
[2020-05-18 07:24:54] [INFO ] Computation of co-enabling matrix(0/100) took 24 ms. Total solver calls (SAT/UNSAT): 8(3/5)
[2020-05-18 07:24:56] [INFO ] Computation of Finished co-enabling matrix. took 1785 ms. Total solver calls (SAT/UNSAT): 520(100/420)
[2020-05-18 07:24:56] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2020-05-18 07:24:56] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:24:56] [INFO ] Built C files in 10066ms conformant to PINS in folder :/home/mcc/execution
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 1686 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 72 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(!( [](( [](<>(( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( !( <>((LTLAP4==true))) ) && ( (LTLAP6==true) ) ) && ( (LTLAP7==true) ) ) && ( (LTLAP8==true) ) ) && ( (LTLAP9==true) ) ) && ( (LTLAP10==true) ) ) && ( (LTLAP11==true) ) ) && ( (LTLAP12==true) ) ) && ( (LTLAP13==true) ) ) && ( (LTLAP14==true) ) ) && ( (LTLAP15==true) ) ) && ( (LTLAP16==true) ) ) && ( (LTLAP17==true) ) ) && ( (LTLAP18==true) ) ) && ( (LTLAP19==true) ) ) && ( (LTLAP20==true) ) ) && ( (LTLAP21==true) ) ) && ( (LTLAP22==true) ) ) && ( (LTLAP23==true) ) ) && ( (LTLAP24==true) ) ) && ( (LTLAP25==true) ))) ) && ( (LTLAP2==true) ))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
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(!( [](( [](<>(( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( !( <>((LTLAP4==true))) ) && ( (LTLAP6==true) ) ) && ( (LTLAP7==true) ) ) && ( (LTLAP8==true) ) ) && ( (LTLAP9==true) ) ) && ( (LTLAP10==true) ) ) && ( (LTLAP11==true) ) ) && ( (LTLAP12==true) ) ) && ( (LTLAP13==true) ) ) && ( (LTLAP14==true) ) ) && ( (LTLAP15==true) ) ) && ( (LTLAP16==true) ) ) && ( (LTLAP17==true) ) ) && ( (LTLAP18==true) ) ) && ( (LTLAP19==true) ) ) && ( (LTLAP20==true) ) ) && ( (LTLAP21==true) ) ) && ( (LTLAP22==true) ) ) && ( (LTLAP23==true) ) ) && ( (LTLAP24==true) ) ) && ( (LTLAP25==true) ))) ) && ( (LTLAP2==true) ))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
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(!( [](( [](<>(( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( !( <>((LTLAP4==true))) ) && ( (LTLAP6==true) ) ) && ( (LTLAP7==true) ) ) && ( (LTLAP8==true) ) ) && ( (LTLAP9==true) ) ) && ( (LTLAP10==true) ) ) && ( (LTLAP11==true) ) ) && ( (LTLAP12==true) ) ) && ( (LTLAP13==true) ) ) && ( (LTLAP14==true) ) ) && ( (LTLAP15==true) ) ) && ( (LTLAP16==true) ) ) && ( (LTLAP17==true) ) ) && ( (LTLAP18==true) ) ) && ( (LTLAP19==true) ) ) && ( (LTLAP20==true) ) ) && ( (LTLAP21==true) ) ) && ( (LTLAP22==true) ) ) && ( (LTLAP23==true) ) ) && ( (LTLAP24==true) ) ) && ( (LTLAP25==true) ))) ) && ( (LTLAP2==true) ))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
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
1828 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,266.852,852412,1,0,895081,389,1737,1.31922e+06,258,1191,812043
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(G(((G((!(F("((i4.u6.Fork_12>=1)&&(i8.u8.Catch1_12>=1))")))||("((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1))")))||("(i4.u19.Think_14<1)"))||("(i4.u19.Fork_13<1)")))))
Formula 6 simplified : G("(i4.u19.Fork_13<1)" | "(i4.u19.Think_14<1)" | G("((i4.u19.Think_14>=1)&&(i4.u19.Fork_13>=1))" | !F"((i4.u6.Fork_12>=1)&&(i8.u8.Catch1_12>=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
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,266.858,852940,1,0,895353,389,1803,1.31951e+06,269,1191,812743
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(!(F((X(F(G((G("(i0.u0.Eat_3>=1)"))U(G("((i6.u11.Fork_14>=1)&&(i4.u19.Catch1_14>=1))"))))))||("(i0.u0.Eat_3>=1)"))))))
Formula 7 simplified : !G!F("(i0.u0.Eat_3>=1)" | XFG(G"(i0.u0.Eat_3>=1)" U G"((i6.u11.Fork_14>=1)&&(i4.u19.Catch1_14>=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,266.865,852940,1,0,896175,389,1832,1.32017e+06,269,1191,814201
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((F(((X("((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1))"))&&("(i6.u12.Think_16>=1)"))&&("(i6.u12.Fork_15>=1)")))&&(("((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1))")U((X("(i7.u1.Eat_20>=1)"))||("(i4.u6.Eat_13>=1)"))))))
Formula 8 simplified : !F(F("(i6.u12.Fork_15>=1)" & "(i6.u12.Think_16>=1)" & X"((i6.u12.Think_16>=1)&&(i6.u12.Fork_15>=1))") & ("((i3.u7.Think_10>=1)&&(i3.u5.Fork_9>=1))" U ("(i4.u6.Eat_13>=1)" | X"(i7.u1.Eat_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
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,266.885,853732,1,0,898560,389,1935,1.32218e+06,269,1200,817407
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G((X((G("((i3.u5.Fork_9>=1)&&(i3.u5.Catch1_9>=1))"))||("((i6.u9.Fork_16>=1)&&(i6.u12.Catch1_16>=1))")))||("((i0.u2.Fork_3>=1)&&(i0.u2.Catch2_4>=1))")))&&(X(((X("((i0.u2.Fork_3>=1)&&(i0.u2.Catch2_4>=1))"))||("(i7.u1.Fork_19<1)"))||("(i7.u1.Catch2_20<1)")))))
Formula 9 simplified : !(G("((i0.u2.Fork_3>=1)&&(i0.u2.Catch2_4>=1))" | X("((i6.u9.Fork_16>=1)&&(i6.u12.Catch1_16>=1))" | G"((i3.u5.Fork_9>=1)&&(i3.u5.Catch1_9>=1))")) & X("(i7.u1.Catch2_20<1)" | "(i7.u1.Fork_19<1)" | X"((i0.u2.Fork_3>=1)&&(i0.u2.Catch2_4>=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
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,266.891,853996,1,0,898971,389,1967,1.3225e+06,270,1207,818476
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(!(G(!(G(((X((!(F("((i6.u12.Fork_15>=1)&&(i6.u12.Catch2_16>=1))")))||(!(X(F("((i6.u9.Think_17>=1)&&(i5.u10.Fork_17>=1))"))))))&&("(i6.u9.Think_17>=1)"))&&("(i5.u10.Fork_17>=1)"))))))))
Formula 10 simplified : !G!G!G("(i5.u10.Fork_17>=1)" & "(i6.u9.Think_17>=1)" & X(!F"((i6.u12.Fork_15>=1)&&(i6.u12.Catch2_16>=1))" | !XF"((i6.u9.Think_17>=1)&&(i5.u10.Fork_17>=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,266.903,854260,1,0,899975,389,1994,1.32343e+06,270,1207,820013
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589786957420

--------------------
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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-000020"
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-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000020, 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 r126-tajo-158961389900122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; 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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;