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 216K
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 3.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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 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 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Philosophers-PT-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732586100218
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527507457028

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph8534642073446260629.txt, -o, /tmp/graph8534642073446260629.bin, -w, /tmp/graph8534642073446260629.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph8534642073446260629.bin, -l, -1, -v, -w, /tmp/graph8534642073446260629.weights, -q, 0, -e, 0.001], workingDir=null]
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.201805241334/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.201805241334/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(X(X(G("((((((u3.Catch1_1>=1)&&(u0.Fork_1>=1))||((u0.Catch1_2>=1)&&(u4.Fork_2>=1)))||((u3.Fork_5>=1)&&(u2.Catch1_5>=1)))||((u4.Catch1_3>=1)&&(u1.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u2.Fork_4>=1)))")))))))
Formula 0 simplified : !FXXG"((((((u3.Catch1_1>=1)&&(u0.Fork_1>=1))||((u0.Catch1_2>=1)&&(u4.Fork_2>=1)))||((u3.Fork_5>=1)&&(u2.Catch1_5>=1)))||((u4.Catch1_3>=1)&&(u1.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u2.Fork_4>=1)))"
built 5 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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.076616,17420,1,0,2160,174,239,1578,140,262,4314
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(G("((((((u0.Think_2>=1)&&(u4.Fork_2>=1))||((u1.Fork_3>=1)&&(u4.Think_3>=1)))||((u3.Think_1>=1)&&(u0.Fork_1>=1)))||((u2.Fork_4>=1)&&(u1.Think_4>=1)))||((u3.Fork_5>=1)&&(u2.Think_5>=1)))")))))
Formula 1 simplified : !FG"((((((u0.Think_2>=1)&&(u4.Fork_2>=1))||((u1.Fork_3>=1)&&(u4.Think_3>=1)))||((u3.Think_1>=1)&&(u0.Fork_1>=1)))||((u2.Fork_4>=1)&&(u1.Think_4>=1)))||((u3.Fork_5>=1)&&(u2.Think_5>=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
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.093719,17924,1,0,3610,176,276,2830,140,268,7288
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("((((((u0.Think_2>=1)&&(u4.Fork_2>=1))||((u1.Fork_3>=1)&&(u4.Think_3>=1)))||((u3.Think_1>=1)&&(u0.Fork_1>=1)))||((u2.Fork_4>=1)&&(u1.Think_4>=1)))||((u3.Fork_5>=1)&&(u2.Think_5>=1)))")))
Formula 2 simplified : !F"((((((u0.Think_2>=1)&&(u4.Fork_2>=1))||((u1.Fork_3>=1)&&(u4.Think_3>=1)))||((u3.Think_1>=1)&&(u0.Fork_1>=1)))||((u2.Fork_4>=1)&&(u1.Think_4>=1)))||((u3.Fork_5>=1)&&(u2.Think_5>=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.095374,18188,1,0,3610,176,282,2830,140,268,7292
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((X(X("((((((u0.Think_2>=1)&&(u4.Fork_2>=1))||((u1.Fork_3>=1)&&(u4.Think_3>=1)))||((u3.Think_1>=1)&&(u0.Fork_1>=1)))||((u2.Fork_4>=1)&&(u1.Think_4>=1)))||((u3.Fork_5>=1)&&(u2.Think_5>=1)))")))U(G(F("(((((u1.Eat_4>=1)||(u4.Eat_3>=1))||(u0.Eat_2>=1))||(u3.Eat_1>=1))||(u2.Eat_5>=1))"))))))
Formula 3 simplified : !G(XX"((((((u0.Think_2>=1)&&(u4.Fork_2>=1))||((u1.Fork_3>=1)&&(u4.Think_3>=1)))||((u3.Think_1>=1)&&(u0.Fork_1>=1)))||((u2.Fork_4>=1)&&(u1.Think_4>=1)))||((u3.Fork_5>=1)&&(u2.Think_5>=1)))" U GF"(((((u1.Eat_4>=1)||(u4.Eat_3>=1))||(u0.Eat_2>=1))||(u3.Eat_1>=1))||(u2.Eat_5>=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,0.103317,19128,1,0,4205,187,361,3337,144,314,8971
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F("((((((u0.Think_2>=1)&&(u4.Fork_2>=1))||((u1.Fork_3>=1)&&(u4.Think_3>=1)))||((u3.Think_1>=1)&&(u0.Fork_1>=1)))||((u2.Fork_4>=1)&&(u1.Think_4>=1)))||((u3.Fork_5>=1)&&(u2.Think_5>=1)))"))))
Formula 4 simplified : !XF"((((((u0.Think_2>=1)&&(u4.Fork_2>=1))||((u1.Fork_3>=1)&&(u4.Think_3>=1)))||((u3.Think_1>=1)&&(u0.Fork_1>=1)))||((u2.Fork_4>=1)&&(u1.Think_4>=1)))||((u3.Fork_5>=1)&&(u2.Think_5>=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.10501,19128,1,0,4215,187,361,3347,144,314,8994
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X(("((((((u0.Fork_1>=1)&&(u0.Think_2>=1))||((u3.Fork_5>=1)&&(u3.Think_1>=1)))||((u1.Think_4>=1)&&(u1.Fork_3>=1)))||((u4.Fork_2>=1)&&(u4.Think_3>=1)))||((u2.Fork_4>=1)&&(u2.Think_5>=1)))")U("((((((u0.Fork_1>=1)&&(u0.Think_2>=1))||((u3.Fork_5>=1)&&(u3.Think_1>=1)))||((u1.Think_4>=1)&&(u1.Fork_3>=1)))||((u4.Fork_2>=1)&&(u4.Think_3>=1)))||((u2.Fork_4>=1)&&(u2.Think_5>=1)))")))U(("((((((u3.Fork_5>=1)&&(u3.Catch2_1>=1))||((u1.Catch2_4>=1)&&(u1.Fork_3>=1)))||((u2.Fork_4>=1)&&(u2.Catch2_5>=1)))||((u0.Fork_1>=1)&&(u0.Catch2_2>=1)))||((u4.Fork_2>=1)&&(u4.Catch2_3>=1)))")U("(((((u1.Eat_4>=1)||(u4.Eat_3>=1))||(u0.Eat_2>=1))||(u3.Eat_1>=1))||(u2.Eat_5>=1))"))))
Formula 5 simplified : !(X"((((((u0.Fork_1>=1)&&(u0.Think_2>=1))||((u3.Fork_5>=1)&&(u3.Think_1>=1)))||((u1.Think_4>=1)&&(u1.Fork_3>=1)))||((u4.Fork_2>=1)&&(u4.Think_3>=1)))||((u2.Fork_4>=1)&&(u2.Think_5>=1)))" U ("((((((u3.Fork_5>=1)&&(u3.Catch2_1>=1))||((u1.Catch2_4>=1)&&(u1.Fork_3>=1)))||((u2.Fork_4>=1)&&(u2.Catch2_5>=1)))||((u0.Fork_1>=1)&&(u0.Catch2_2>=1)))||((u4.Fork_2>=1)&&(u4.Catch2_3>=1)))" U "(((((u1.Eat_4>=1)||(u4.Eat_3>=1))||(u0.Eat_2>=1))||(u3.Eat_1>=1))||(u2.Eat_5>=1))"))
Computing Next relation with stutter on 2 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 25 cols
invariant :u3:Think_1 + u3:Catch1_1 + u3:Catch2_1 + u3:Eat_1 = 1
invariant :u1:Think_4 + u1:Catch1_4 + -1'u2:Fork_4 + -1'u2:Catch1_5 + u2:Catch2_5 + u3:Fork_5 + u3:Catch1_1 + u3:Eat_1 = 1
invariant :u4:Think_3 + u4:Catch1_3 + u4:Catch2_3 + u4:Eat_3 = 1
invariant :u1:Catch2_4 + u1:Eat_4 + u2:Fork_4 + u2:Catch1_5 + -1'u2:Catch2_5 + -1'u3:Fork_5 + -1'u3:Catch1_1 + -1'u3:Eat_1 = 0
invariant :u1:Fork_3 + u1:Catch1_4 + -1'u1:Catch2_4 + -1'u2:Fork_4 + -1'u2:Catch1_5 + u2:Catch2_5 + u3:Fork_5 + u3:Catch1_1 + u3:Eat_1 + u4:Catch2_3 + u4:Eat_3 = 1
invariant :u2:Catch2_5 + u2:Eat_5 + u3:Fork_5 + u3:Catch1_1 + u3:Eat_1 = 1
invariant :u0:Catch2_2 + u0:Eat_2 + u4:Fork_2 + u4:Catch1_3 + u4:Eat_3 = 1
invariant :u0:Think_2 + u0:Catch1_2 + -1'u4:Fork_2 + -1'u4:Catch1_3 + -1'u4:Eat_3 = 0
invariant :u0:Fork_1 + u0:Catch1_2 + -1'u0:Catch2_2 + u3:Catch2_1 + u3:Eat_1 + -1'u4:Fork_2 + -1'u4:Catch1_3 + -1'u4:Eat_3 = 0
invariant :u2:Think_5 + u2:Catch1_5 + -1'u3:Fork_5 + -1'u3:Catch1_1 + -1'u3:Eat_1 = 0
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 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.121797,20108,1,0,5291,190,434,4309,154,339,12484
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((((((u3.Catch1_1>=1)&&(u0.Fork_1>=1))||((u0.Catch1_2>=1)&&(u4.Fork_2>=1)))||((u3.Fork_5>=1)&&(u2.Catch1_5>=1)))||((u4.Catch1_3>=1)&&(u1.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u2.Fork_4>=1)))"))
Formula 6 simplified : !"((((((u3.Catch1_1>=1)&&(u0.Fork_1>=1))||((u0.Catch1_2>=1)&&(u4.Fork_2>=1)))||((u3.Fork_5>=1)&&(u2.Catch1_5>=1)))||((u4.Catch1_3>=1)&&(u1.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u2.Fork_4>=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.12388,20108,1,0,5304,190,434,4327,154,339,12581
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G("((((((u3.Fork_5>=1)&&(u3.Catch2_1>=1))||((u1.Catch2_4>=1)&&(u1.Fork_3>=1)))||((u2.Fork_4>=1)&&(u2.Catch2_5>=1)))||((u0.Fork_1>=1)&&(u0.Catch2_2>=1)))||((u4.Fork_2>=1)&&(u4.Catch2_3>=1)))"))))
Formula 7 simplified : !XG"((((((u3.Fork_5>=1)&&(u3.Catch2_1>=1))||((u1.Catch2_4>=1)&&(u1.Fork_3>=1)))||((u2.Fork_4>=1)&&(u2.Catch2_5>=1)))||((u0.Fork_1>=1)&&(u0.Catch2_2>=1)))||((u4.Fork_2>=1)&&(u4.Catch2_3>=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
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.135378,20368,1,0,5662,190,438,4634,154,339,13446
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(G(F(F("((u1.Catch2_4>=1)&&(u1.Fork_3>=1))"))))))
Formula 8 simplified : !GF"((u1.Catch2_4>=1)&&(u1.Fork_3>=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
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.137963,20368,1,0,5766,190,460,4744,157,341,13729
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G(F(X(G("((u2.Fork_4>=1)&&(u2.Catch2_5>=1))")))))))
Formula 9 simplified : !XGFXG"((u2.Fork_4>=1)&&(u2.Catch2_5>=1))"
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
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.140077,20368,1,0,5893,190,484,4863,157,341,14106
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(F(G("((u2.Fork_4>=1)&&(u2.Catch2_5>=1))"))))))
Formula 10 simplified : !FGFG"((u2.Fork_4>=1)&&(u2.Catch2_5>=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.14295,20368,1,0,6140,190,484,5083,157,341,14644
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((((X("((u3.Fork_5>=1)&&(u3.Catch2_1>=1))"))U(F("((u1.Fork_3>=1)&&(u4.Think_3>=1))")))U("((u1.Catch1_4>=1)&&(u2.Fork_4>=1))")))
Formula 11 simplified : !((X"((u3.Fork_5>=1)&&(u3.Catch2_1>=1))" U F"((u1.Fork_3>=1)&&(u4.Think_3>=1))") U "((u1.Catch1_4>=1)&&(u2.Fork_4>=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
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.150974,20784,1,0,6572,190,513,5619,157,342,15766
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(("((u4.Fork_2>=1)&&(u4.Catch2_3>=1))")U("((u1.Catch1_4>=1)&&(u2.Fork_4>=1))")))U("(u3.Eat_1>=1)")))
Formula 12 simplified : !(X("((u4.Fork_2>=1)&&(u4.Catch2_3>=1))" U "((u1.Catch1_4>=1)&&(u2.Fork_4>=1))") U "(u3.Eat_1>=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
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.154233,21008,1,0,6732,190,541,5788,158,342,16199
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((X(("(u0.Eat_2>=1)")U("((u1.Fork_3>=1)&&(u4.Think_3>=1))")))U(F(F("((u0.Fork_1>=1)&&(u0.Catch2_2>=1))")))))
Formula 13 simplified : !(X("(u0.Eat_2>=1)" U "((u1.Fork_3>=1)&&(u4.Think_3>=1))") U F"((u0.Fork_1>=1)&&(u0.Catch2_2>=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.156266,21268,1,0,6814,190,564,5892,158,342,16565
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(G(X(("((u2.Fork_4>=1)&&(u2.Catch2_5>=1))")U("(u4.Eat_3>=1)"))))))
Formula 14 simplified : !GX("((u2.Fork_4>=1)&&(u2.Catch2_5>=1))" U "(u4.Eat_3>=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
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.157884,21268,1,0,6868,190,582,5957,158,342,16697
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("((u0.Fork_1>=1)&&(u0.Think_2>=1))"))
Formula 15 simplified : !"((u0.Fork_1>=1)&&(u0.Think_2>=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.158257,21268,1,0,6868,190,585,5957,160,342,16704
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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 1527507460500

--------------------
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/ -louvain -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/ -louvain -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 11:37:39 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/, -louvain, -smt]
May 28, 2018 11:37:39 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 11:37:39 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 33 ms
May 28, 2018 11:37:39 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
May 28, 2018 11:37:39 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
May 28, 2018 11:37:39 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 12 ms
May 28, 2018 11:37:39 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 11:37:39 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 30 ms
May 28, 2018 11:37:39 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 15 ms
Begin: Mon May 28 11:37:39 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Mon May 28 11:37:39 2018
network size: 25 nodes, 90 links, 50 weight
quality increased from -0.0447778 to 0.533333
end computation: Mon May 28 11:37:39 2018
level 1:
start computation: Mon May 28 11:37:39 2018
network size: 5 nodes, 15 links, 50 weight
quality increased from 0.533333 to 0.533333
end computation: Mon May 28 11:37:39 2018
End: Mon May 28 11:37:39 2018
Total duration: 0 sec
0.533333
May 28, 2018 11:37:39 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 11:37:39 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 7 ms
May 28, 2018 11:37:39 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 28, 2018 11:37:39 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 5 redundant transitions.
May 28, 2018 11:37:39 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
May 28, 2018 11:37:39 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
May 28, 2018 11:37:40 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
May 28, 2018 11:37:40 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 7 ms
May 28, 2018 11:37:40 AM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:318)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
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 11:37:40 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 224ms 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-000005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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-000005.tgz
mv Philosophers-PT-000005 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 itstoolsl"
echo " Input is Philosophers-PT-000005, 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 r261-csrt-152732586100218"
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 ;