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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585400193
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527491322515

07:08:44.747 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
07:08:44.750 [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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(G(F(X("((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)<=(((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9))"))))))
Formula 0 simplified : !FGFX"((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)<=(((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 50 rows 50 cols
invariant :think_5 + catch1_5 + catch2_5 + eat_5 = 1
invariant :think_7 + catch1_7 + catch2_7 + eat_7 = 1
invariant :fork_0 + catch1_1 + catch2_0 + eat_0 + eat_1 = 1
invariant :fork_9 + catch1_0 + catch2_9 + eat_0 + eat_9 = 1
invariant :fork_5 + catch1_6 + catch2_5 + eat_5 + eat_6 = 1
invariant :fork_3 + catch1_4 + catch2_3 + eat_3 + eat_4 = 1
invariant :think_1 + catch1_1 + catch2_1 + eat_1 = 1
invariant :think_8 + catch1_8 + catch2_8 + eat_8 = 1
invariant :fork_6 + catch1_7 + catch2_6 + eat_6 + eat_7 = 1
invariant :think_4 + catch1_4 + catch2_4 + eat_4 = 1
invariant :think_3 + catch1_3 + catch2_3 + eat_3 = 1
invariant :think_2 + catch1_2 + catch2_2 + eat_2 = 1
invariant :fork_8 + catch1_9 + catch2_8 + eat_8 + eat_9 = 1
invariant :fork_2 + catch1_3 + catch2_2 + eat_2 + eat_3 = 1
invariant :fork_7 + catch1_8 + catch2_7 + eat_7 + eat_8 = 1
invariant :think_6 + catch1_6 + catch2_6 + eat_6 = 1
invariant :think_9 + catch1_9 + catch2_9 + eat_9 = 1
invariant :fork_1 + catch1_2 + catch2_1 + eat_1 + eat_2 = 1
invariant :fork_4 + catch1_5 + catch2_4 + eat_4 + eat_5 = 1
invariant :think_0 + catch1_0 + catch2_0 + eat_0 = 1
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
28 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.309949,24692,1,0,20,33226,24,17,1823,52182,49
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)>=1)")U(F(F("((((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9)<=(((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9))")))))
Formula 1 simplified : !("((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)>=1)" U F"((((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9)<=(((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9))")
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.311492,24692,1,0,20,33226,33,17,1845,52182,53
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G("((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9)>=1)")))
Formula 2 simplified : !G"((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_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
6 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.366999,25996,1,0,31,37642,41,38,1968,59231,119
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((F("((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9)>=2)"))U(X("((((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9)<=(((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9))")))))
Formula 3 simplified : !X(F"((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9)>=2)" U X"((((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9)<=(((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9))")
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
19 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.562,30612,1,0,65,56119,55,67,2375,94765,195
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)<=(((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9))"))
Formula 4 simplified : !"((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)<=(((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9))"
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.563237,30876,1,0,65,56119,58,67,2396,94765,197
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F("((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9)<=(((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9))"))U(X(X("((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)<=(((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9))")))))
Formula 5 simplified : !(F"((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9)<=(((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9))" U XX"((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)<=(((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9))")
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
0 strongly connected components in search stack
5 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.572054,31380,1,0,65,56119,69,67,2576,94765,206
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F("((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)<=(((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9))"))))
Formula 6 simplified : !GF"((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)<=(((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9))"
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
12 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.694749,33488,1,0,71,65976,78,71,2907,109402,229
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G("((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)>=1)")))
Formula 7 simplified : !G"((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_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
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.697091,33752,1,0,71,65976,84,71,2925,109425,238
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(G(G("((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)<=(((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9))"))))))
Formula 8 simplified : !GXG"((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)<=(((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9))"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 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.755412,34544,1,0,72,66150,90,74,3726,109786,265
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((F("((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9)>=3)"))U(G("((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)>=1)")))))
Formula 9 simplified : !X(F"((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9)>=3)" U G"((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)>=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.774005,35208,1,0,75,66595,96,76,3835,110198,294
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)>=2)")U(F(X("((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)<=(((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9))")))))
Formula 10 simplified : !("((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)>=2)" U FX"((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)<=(((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9))")
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.775611,35468,1,0,75,66595,96,76,3835,110198,298
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((("((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9)>=1)")U("((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)>=2)")))
Formula 11 simplified : !("((((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9)>=1)" U "((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)>=2)")
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
9 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.861677,36780,1,0,93,73837,106,93,3869,122972,358
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X((X("((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)<=(((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9))"))U(F("((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)>=2)")))))
Formula 12 simplified : !X(X"((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)<=(((((((((think_0+think_1)+think_2)+think_3)+think_4)+think_5)+think_6)+think_7)+think_8)+think_9))" U F"((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)>=2)")
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.863538,37040,1,0,94,73869,113,95,3869,123101,386
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((X(X("((((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9)>=3)")))U(G(G("((((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9)<=(((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9))")))))
Formula 13 simplified : !(XX"((((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9)>=3)" U G"((((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9)<=(((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9))")
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
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,1.02258,41332,1,0,118,91477,116,118,4259,154566,456
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((("((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)>=1)")U("((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)<=(((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9))"))U(("((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)<=(((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9))")U("((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)>=2)"))))
Formula 14 simplified : !(("((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)>=1)" U "((((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9)<=(((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9))") U ("((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)<=(((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9))" U "((((((((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)+eat_5)+eat_6)+eat_7)+eat_8)+eat_9)>=2)"))
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
27 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,1.28958,46528,1,0,133,111457,147,133,4975,185564,516
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((X(F("((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)>=3)")))U(F(F("((((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9)<=(((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9))")))))
Formula 15 simplified : !(XF"((((((((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)+fork_5)+fork_6)+fork_7)+fork_8)+fork_9)>=3)" U F"((((((((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)+catch2_5)+catch2_6)+catch2_7)+catch2_8)+catch2_9)<=(((((((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)+catch1_5)+catch1_6)+catch1_7)+catch1_8)+catch1_9))")
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,1.29056,46528,1,0,133,111457,147,133,4975,185564,516
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLCardinality-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 1527491327332

--------------------
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 LTLCardinality -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 LTLCardinality -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:08:44 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:08:44 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 7:08:44 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:08:45 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 809 ms
May 28, 2018 7:08:45 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
May 28, 2018 7:08:45 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 28, 2018 7:08:45 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

May 28, 2018 7:08:45 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
May 28, 2018 7:08:45 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 28, 2018 7:08:45 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:08:45 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 54 ms
May 28, 2018 7:08:45 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
May 28, 2018 7:08:45 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
May 28, 2018 7:08:45 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 50 transitions.
May 28, 2018 7:08:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 14 ms
May 28, 2018 7:08:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 50 variables to be positive in 207 ms
May 28, 2018 7:08:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 50 transitions.
May 28, 2018 7:08:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/50 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 7:08:45 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:08:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 50 transitions.
May 28, 2018 7:08:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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:08:47 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1494ms 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="LTLCardinality"
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 LTLCardinality"
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-152732585400193"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;