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 184K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 2.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 9.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Philosophers-COL-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585400194
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-000010-LTLFireability-00
FORMULA_NAME Philosophers-COL-000010-LTLFireability-01
FORMULA_NAME Philosophers-COL-000010-LTLFireability-02
FORMULA_NAME Philosophers-COL-000010-LTLFireability-03
FORMULA_NAME Philosophers-COL-000010-LTLFireability-04
FORMULA_NAME Philosophers-COL-000010-LTLFireability-05
FORMULA_NAME Philosophers-COL-000010-LTLFireability-06
FORMULA_NAME Philosophers-COL-000010-LTLFireability-07
FORMULA_NAME Philosophers-COL-000010-LTLFireability-08
FORMULA_NAME Philosophers-COL-000010-LTLFireability-09
FORMULA_NAME Philosophers-COL-000010-LTLFireability-10
FORMULA_NAME Philosophers-COL-000010-LTLFireability-11
FORMULA_NAME Philosophers-COL-000010-LTLFireability-12
FORMULA_NAME Philosophers-COL-000010-LTLFireability-13
FORMULA_NAME Philosophers-COL-000010-LTLFireability-14
FORMULA_NAME Philosophers-COL-000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527491339552

07:09:01.945 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
07:09:01.947 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
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 : !((X((G(X("((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))")))U(X(X("(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))"))))))
Formula 0 simplified : !X(GX"((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))" U XX"(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))")
built 10 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
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,0.041428,18732,1,0,1798,147,521,1101,121,192,3887
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G("(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))")))
Formula 1 simplified : !G"(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=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,0.043861,19048,1,0,1802,147,524,1103,121,192,3943
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F("(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))"))))
Formula 2 simplified : !XF"(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=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.045632,19048,1,0,1803,147,574,1112,123,192,4054
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(X(F("(((((((((((Philo9.fork_9>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))"))))U(F("(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))"))))
Formula 3 simplified : !(FXF"(((((((((((Philo9.fork_9>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))" U F"(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=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.046901,19048,1,0,1803,147,574,1112,123,192,4061
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(("(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))")U("(((((((((((Philo9.fork_9>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))")))U(F(X(X("(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))"))))))
Formula 4 simplified : !(G("(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))" U "(((((((((((Philo9.fork_9>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))") U FXX"(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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,0.049028,19220,1,0,1818,147,574,1131,123,192,4168
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X((F("(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))"))U(F("(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))"))))))
Formula 5 simplified : !XX(F"(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))" U F"(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=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
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,0.084659,21144,1,0,7238,148,631,6583,123,198,13252
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(F(F("(((((((((((Philo9.fork_9>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))"))))))
Formula 6 simplified : !GXF"(((((((((((Philo9.fork_9>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=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
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,0.105912,22728,1,0,10668,150,691,9961,123,203,21555
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((X(F("(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))")))U(F(X("(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))"))))))
Formula 7 simplified : !F(XF"(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))" U FX"(((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=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.107725,22992,1,0,10668,150,691,9961,123,203,21555
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G(X(G(G("((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))")))))))
Formula 8 simplified : !XGXG"((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))"
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
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,0.137253,23784,1,0,13705,152,693,13262,123,207,26800
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))"))
Formula 9 simplified : !"(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=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,0.139013,24048,1,0,13705,152,693,13262,123,207,26800
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X("((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))"))))
Formula 10 simplified : !XX"((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))"
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
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.140225,24048,1,0,13713,152,693,13272,123,207,26907
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))"))
Formula 11 simplified : !"(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=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,0.141311,24048,1,0,13713,152,693,13272,123,207,26922
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X(X(G(X("(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))")))))))
Formula 12 simplified : !GXXGX"(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))"
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
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,0.171919,25628,1,0,18203,152,696,18224,123,207,35204
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((("(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))")U(X("(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))"))))
Formula 13 simplified : !("(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))" U X"(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=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,0.174508,25892,1,0,18228,153,696,18237,123,208,35269
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))"))
Formula 14 simplified : !"(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=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,0.17558,25892,1,0,18228,153,696,18237,123,208,35269
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((("(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))")U(G("(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))")))U(F(("(((((((((((Philo9.fork_9>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))")U("(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))")))))
Formula 15 simplified : !(("(((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))" U G"(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))") U F("(((((((((((Philo9.fork_9>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))" U "(((((((((((Philo0.catch2_0>=1)&&(Philo9.fork_9>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))"))
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.179636,26144,1,0,18557,153,696,18571,123,208,35853
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1527491343455

--------------------
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:09:01 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:09:01 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 7:09:01 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 28, 2018 7:09:02 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 827 ms
May 28, 2018 7:09:02 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
May 28, 2018 7:09:02 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 28, 2018 7:09:02 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

May 28, 2018 7:09:02 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
May 28, 2018 7:09:02 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 28, 2018 7:09:02 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 4 ms
May 28, 2018 7:09:02 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 7:09:02 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 7:09:02 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 34 ms
May 28, 2018 7:09:02 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays think, fork, catch1, catch2, eat to variables to allow decomposition.
May 28, 2018 7:09:02 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 10 redundant transitions.
May 28, 2018 7:09:02 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
May 28, 2018 7:09:02 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 ms
May 28, 2018 7:09:03 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 50 transitions.
May 28, 2018 7:09:03 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s () (Array Int (Array Int Int))) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Skipping mayMatrices nes/nds Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:59)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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:09:03 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 154ms 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-COL-000010"
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-COL-000010.tgz
mv Philosophers-COL-000010 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-COL-000010, 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-152732585400194"
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 ;