Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 11K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 82K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
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 r260-csrt-152732585500222
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527492342055

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.201805151631/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.201805151631/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(F(F(("(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=1)))")U("((((((((((((((((((((Eat_4>=1)||(Eat_5>=1))||(Eat_2>=1))||(Eat_3>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_1>=1))||(Eat_19>=1))||(Eat_18>=1))||(Eat_20>=1))||(Eat_15>=1))||(Eat_14>=1))||(Eat_17>=1))||(Eat_16>=1))||(Eat_11>=1))||(Eat_10>=1))||(Eat_13>=1))||(Eat_12>=1))"))))))
Formula 0 simplified : !F("(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=1)))" U "((((((((((((((((((((Eat_4>=1)||(Eat_5>=1))||(Eat_2>=1))||(Eat_3>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_1>=1))||(Eat_19>=1))||(Eat_18>=1))||(Eat_20>=1))||(Eat_15>=1))||(Eat_14>=1))||(Eat_17>=1))||(Eat_16>=1))||(Eat_11>=1))||(Eat_10>=1))||(Eat_13>=1))||(Eat_12>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
34 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.36018,28432,1,0,104,72018,20,83,2436,66926,215
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((((X("(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))"))U(G("(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=1)))")))U(F(G(G("(((((((((((((((((((((Think_5>=1)&&(Fork_5>=1))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_3>=1)))||((Think_2>=1)&&(Fork_2>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Think_14>=1)&&(Fork_14>=1)))||((Fork_17>=1)&&(Think_17>=1)))||((Fork_16>=1)&&(Think_16>=1)))||((Fork_19>=1)&&(Think_19>=1)))||((Fork_18>=1)&&(Think_18>=1)))||((Fork_20>=1)&&(Think_20>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Think_6>=1)))||((Think_9>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Think_10>=1)))||((Fork_13>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_12>=1)))"))))))
Formula 1 simplified : !((X"(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))" U G"(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=1)))") U FG"(((((((((((((((((((((Think_5>=1)&&(Fork_5>=1))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_3>=1)))||((Think_2>=1)&&(Fork_2>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Think_14>=1)&&(Fork_14>=1)))||((Fork_17>=1)&&(Think_17>=1)))||((Fork_16>=1)&&(Think_16>=1)))||((Fork_19>=1)&&(Think_19>=1)))||((Fork_18>=1)&&(Think_18>=1)))||((Fork_20>=1)&&(Think_20>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Think_6>=1)))||((Think_9>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Think_10>=1)))||((Fork_13>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_12>=1)))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Computing Next relation with stutter on 2 deadlock states
// Phase 1: matrix 100 rows 100 cols
invariant :Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
invariant :Think_9 + Catch1_9 + Catch2_9 + Eat_9 = 1
invariant :Think_16 + Catch1_16 + Catch2_16 + Eat_16 = 1
invariant :Fork_19 + Catch1_20 + Catch2_19 + Eat_20 + Eat_19 = 1
invariant :Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
invariant :Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
invariant :Think_18 + Catch1_18 + Catch2_18 + Eat_18 = 1
invariant :Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
invariant :Think_12 + Catch1_12 + Catch2_12 + Eat_12 = 1
invariant :Fork_3 + Catch1_4 + Catch2_3 + Eat_3 + Eat_4 = 1
invariant :Think_17 + Catch1_17 + Catch2_17 + Eat_17 = 1
invariant :Fork_13 + Catch1_14 + Catch2_13 + Eat_13 + Eat_14 = 1
invariant :Fork_9 + Catch1_10 + Catch2_9 + Eat_10 + Eat_9 = 1
invariant :Fork_6 + Catch1_7 + Catch2_6 + Eat_7 + Eat_6 = 1
invariant :Fork_5 + Catch1_6 + Catch2_5 + Eat_5 + Eat_6 = 1
invariant :Think_10 + Catch1_10 + Catch2_10 + Eat_10 = 1
invariant :Fork_14 + Catch1_15 + Catch2_14 + Eat_14 + Eat_15 = 1
invariant :Fork_16 + Catch1_17 + Catch2_16 + Eat_16 + Eat_17 = 1
invariant :Fork_11 + Catch1_12 + Catch2_11 + Eat_11 + Eat_12 = 1
invariant :Fork_18 + Catch1_19 + Catch2_18 + Eat_18 + Eat_19 = 1
invariant :Think_11 + Catch1_11 + Catch2_11 + Eat_11 = 1
invariant :Think_7 + Catch1_7 + Catch2_7 + Eat_7 = 1
invariant :Think_15 + Catch1_15 + Catch2_15 + Eat_15 = 1
invariant :Fork_4 + Catch1_5 + Catch2_4 + Eat_5 + Eat_4 = 1
invariant :Fork_12 + Catch1_13 + Catch2_12 + Eat_13 + Eat_12 = 1
invariant :Think_20 + Catch1_20 + Catch2_20 + Eat_20 = 1
invariant :Fork_7 + Catch1_8 + Catch2_7 + Eat_7 + Eat_8 = 1
invariant :Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
invariant :Fork_10 + Catch1_11 + Catch2_10 + Eat_11 + Eat_10 = 1
invariant :Think_8 + Catch1_8 + Catch2_8 + Eat_8 = 1
invariant :Think_19 + Catch1_19 + Catch2_19 + Eat_19 = 1
invariant :Think_14 + Catch1_14 + Catch2_14 + Eat_14 = 1
invariant :Fork_17 + Catch1_18 + Catch2_17 + Eat_18 + Eat_17 = 1
invariant :Fork_1 + Catch1_2 + Catch2_1 + Eat_2 + Eat_1 = 1
invariant :Fork_15 + Catch1_16 + Catch2_15 + Eat_16 + Eat_15 = 1
invariant :Fork_2 + Catch1_3 + Catch2_2 + Eat_3 + Eat_2 = 1
invariant :Think_6 + Catch1_6 + Catch2_6 + Eat_6 = 1
invariant :Fork_8 + Catch1_9 + Catch2_8 + Eat_9 + Eat_8 = 1
invariant :Think_13 + Catch1_13 + Catch2_13 + Eat_13 = 1
invariant :Fork_20 + Catch1_1 + Eat_1 + Catch2_20 + Eat_20 = 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
175 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,2.11572,76244,1,0,191,265012,33,182,2554,480232,461
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X("(((((((((((((((((((((Think_5>=1)&&(Fork_5>=1))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_3>=1)))||((Think_2>=1)&&(Fork_2>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Think_14>=1)&&(Fork_14>=1)))||((Fork_17>=1)&&(Think_17>=1)))||((Fork_16>=1)&&(Think_16>=1)))||((Fork_19>=1)&&(Think_19>=1)))||((Fork_18>=1)&&(Think_18>=1)))||((Fork_20>=1)&&(Think_20>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Think_6>=1)))||((Think_9>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Think_10>=1)))||((Fork_13>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_12>=1)))")))
Formula 2 simplified : !X"(((((((((((((((((((((Think_5>=1)&&(Fork_5>=1))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_3>=1)))||((Think_2>=1)&&(Fork_2>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Think_14>=1)&&(Fork_14>=1)))||((Fork_17>=1)&&(Think_17>=1)))||((Fork_16>=1)&&(Think_16>=1)))||((Fork_19>=1)&&(Think_19>=1)))||((Fork_18>=1)&&(Think_18>=1)))||((Fork_20>=1)&&(Think_20>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Think_6>=1)))||((Think_9>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Think_10>=1)))||((Fork_13>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_12>=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,2.11971,76508,1,0,191,265016,33,182,2554,480232,463
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=1)))"))
Formula 3 simplified : !"(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=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
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,2.12306,76772,1,0,191,265016,36,182,2614,480232,465
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(G("(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))"))))
Formula 4 simplified : !FG"(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
682 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,8.95396,237740,1,0,338,843287,49,297,2712,2.02635e+06,734
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F((F(G("(((((((((((((((((((((Fork_8>=1)&&(Catch2_9>=1))||((Catch2_8>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Fork_12>=1)&&(Catch2_13>=1)))||((Catch2_12>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Catch2_11>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch2_1>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((Catch2_2>=1)&&(Fork_1>=1)))||((Fork_15>=1)&&(Catch2_16>=1)))||((Catch2_17>=1)&&(Fork_16>=1)))||((Fork_13>=1)&&(Catch2_14>=1)))||((Catch2_15>=1)&&(Fork_14>=1)))||((Catch2_20>=1)&&(Fork_19>=1)))||((Fork_17>=1)&&(Catch2_18>=1)))||((Catch2_19>=1)&&(Fork_18>=1)))")))U(X(G("(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))"))))))
Formula 5 simplified : !F(FG"(((((((((((((((((((((Fork_8>=1)&&(Catch2_9>=1))||((Catch2_8>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Fork_12>=1)&&(Catch2_13>=1)))||((Catch2_12>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Catch2_11>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch2_1>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((Catch2_2>=1)&&(Fork_1>=1)))||((Fork_15>=1)&&(Catch2_16>=1)))||((Catch2_17>=1)&&(Fork_16>=1)))||((Fork_13>=1)&&(Catch2_14>=1)))||((Catch2_15>=1)&&(Fork_14>=1)))||((Catch2_20>=1)&&(Fork_19>=1)))||((Fork_17>=1)&&(Catch2_18>=1)))||((Catch2_19>=1)&&(Fork_18>=1)))" U XG"(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=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
25 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,9.19417,245576,1,0,396,880639,49,340,2712,2.09033e+06,839
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((("(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))")U(F("(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))")))U(G(F("(((((((((((((((((((((Fork_8>=1)&&(Catch2_9>=1))||((Catch2_8>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Fork_12>=1)&&(Catch2_13>=1)))||((Catch2_12>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Catch2_11>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch2_1>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((Catch2_2>=1)&&(Fork_1>=1)))||((Fork_15>=1)&&(Catch2_16>=1)))||((Catch2_17>=1)&&(Fork_16>=1)))||((Fork_13>=1)&&(Catch2_14>=1)))||((Catch2_15>=1)&&(Fork_14>=1)))||((Catch2_20>=1)&&(Fork_19>=1)))||((Fork_17>=1)&&(Catch2_18>=1)))||((Catch2_19>=1)&&(Fork_18>=1)))")))))
Formula 6 simplified : !(("(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))" U F"(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))") U GF"(((((((((((((((((((((Fork_8>=1)&&(Catch2_9>=1))||((Catch2_8>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Fork_12>=1)&&(Catch2_13>=1)))||((Catch2_12>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Catch2_11>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch2_1>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((Catch2_2>=1)&&(Fork_1>=1)))||((Fork_15>=1)&&(Catch2_16>=1)))||((Catch2_17>=1)&&(Fork_16>=1)))||((Fork_13>=1)&&(Catch2_14>=1)))||((Catch2_15>=1)&&(Fork_14>=1)))||((Catch2_20>=1)&&(Fork_19>=1)))||((Fork_17>=1)&&(Catch2_18>=1)))||((Catch2_19>=1)&&(Fork_18>=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
4 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,9.23456,247104,1,0,399,885472,62,344,2909,2.09635e+06,859
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(G((G("(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))"))U(G("((((((((((((((((((((Eat_4>=1)||(Eat_5>=1))||(Eat_2>=1))||(Eat_3>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_1>=1))||(Eat_19>=1))||(Eat_18>=1))||(Eat_20>=1))||(Eat_15>=1))||(Eat_14>=1))||(Eat_17>=1))||(Eat_16>=1))||(Eat_11>=1))||(Eat_10>=1))||(Eat_13>=1))||(Eat_12>=1))"))))))
Formula 7 simplified : !FG(G"(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))" U G"((((((((((((((((((((Eat_4>=1)||(Eat_5>=1))||(Eat_2>=1))||(Eat_3>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_1>=1))||(Eat_19>=1))||(Eat_18>=1))||(Eat_20>=1))||(Eat_15>=1))||(Eat_14>=1))||(Eat_17>=1))||(Eat_16>=1))||(Eat_11>=1))||(Eat_10>=1))||(Eat_13>=1))||(Eat_12>=1))")
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 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,9.27567,248256,1,0,403,887655,78,347,2975,2.09994e+06,886
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((((F("((Fork_6>=1)&&(Think_6>=1))"))U(X("(Eat_20>=1)")))U(X(X("(Eat_14>=1)")))))
Formula 8 simplified : !((F"((Fork_6>=1)&&(Think_6>=1))" U X"(Eat_20>=1)") U XX"(Eat_14>=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
15 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,9.43097,253136,1,0,445,914503,97,387,2982,2.14e+06,998
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((F(F(X("(Eat_16>=1)"))))U("((Think_11>=1)&&(Fork_10>=1))")))
Formula 9 simplified : !(FX"(Eat_16>=1)" U "((Think_11>=1)&&(Fork_10>=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,9.43173,253136,1,0,445,914503,100,387,2982,2.14e+06,1000
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("((Fork_10>=1)&&(Catch2_11>=1))"))
Formula 10 simplified : !"((Fork_10>=1)&&(Catch2_11>=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
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,9.43229,253400,1,0,445,914503,105,387,2982,2.14e+06,1004
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((((F("((Fork_8>=1)&&(Think_8>=1))"))U(F("((Catch1_19>=1)&&(Fork_19>=1))")))U((F("(Eat_13>=1)"))U("((Think_19>=1)&&(Fork_18>=1))"))))
Formula 11 simplified : !((F"((Fork_8>=1)&&(Think_8>=1))" U F"((Catch1_19>=1)&&(Fork_19>=1))") U (F"(Eat_13>=1)" U "((Think_19>=1)&&(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,9.43366,253400,1,0,445,914503,117,387,2986,2.14e+06,1008
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((G("(Eat_10>=1)"))U(G("((Fork_11>=1)&&(Catch1_11>=1))"))))
Formula 12 simplified : !(G"(Eat_10>=1)" U G"((Fork_11>=1)&&(Catch1_11>=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
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,9.43546,253400,1,0,445,914503,135,387,2996,2.14e+06,1017
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((X(("((Catch2_15>=1)&&(Fork_14>=1))")U("((Fork_2>=1)&&(Think_3>=1))")))U(G(("((Think_2>=1)&&(Fork_2>=1))")U("((Fork_20>=1)&&(Think_1>=1))")))))
Formula 13 simplified : !(X("((Catch2_15>=1)&&(Fork_14>=1))" U "((Fork_2>=1)&&(Think_3>=1))") U G("((Think_2>=1)&&(Fork_2>=1))" U "((Fork_20>=1)&&(Think_1>=1))"))
Computing Next relation with stutter on 2 deadlock states
1 unique states visited
1 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
15 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,9.59319,258112,1,0,465,939953,148,408,3002,2.17314e+06,1122
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G("((Think_18>=1)&&(Fork_17>=1))")))
Formula 14 simplified : !G"((Think_18>=1)&&(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
3 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,9.61824,258904,1,0,506,943609,154,448,3002,2.17813e+06,1230
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(("((Think_19>=1)&&(Fork_18>=1))"))
Formula 15 simplified : !"((Think_19>=1)&&(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,9.61872,259168,1,0,506,943609,154,448,3002,2.17813e+06,1230
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527492358666

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /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 -consoleLog -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
May 28, 2018 7:25:44 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]
May 28, 2018 7:25:44 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 7:25:44 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 62 ms
May 28, 2018 7:25:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 100 places.
May 28, 2018 7:25:45 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 100 transitions.
May 28, 2018 7:25:45 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 22 ms
May 28, 2018 7:25:45 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 92 ms
May 28, 2018 7:25:45 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
May 28, 2018 7:25:45 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 ms
May 28, 2018 7:25:45 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 100 transitions.
May 28, 2018 7:25:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 40 place invariants in 40 ms
May 28, 2018 7:25:46 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 100 variables to be positive in 272 ms
May 28, 2018 7:25:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 100 transitions.
May 28, 2018 7:25:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/100 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 7:25:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 7:25:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 100 transitions.
May 28, 2018 7:25:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 7:25:58 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
May 28, 2018 7:25:58 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
May 28, 2018 7:25:58 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 10) 1) (>= (select s0 31) 1)) (= (store (store (store s0 51 (+ (select s0 51) 1)) 31 (- (select s0 31) 1)) 10 (- (select s0 10) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 10) 1) (>= (select s0 31) 1)) (= (store (store (store s0 51 (+ (select s0 51) 1)) 31 (- (select s0 31) 1)) 10 (- (select s0 10) 1)) s1))")
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)
May 28, 2018 7:25:58 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 12628ms 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-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

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool 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 r260-csrt-152732585500222"
echo "====================================================================="
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 ;