Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r197-oct2-155272231300672.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is Philosophers-COL-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-oct2-155272231300672
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.4K Feb 12 04:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 04:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 8 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 8 03:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 1 02:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 9.7K Mar 10 17:31 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1553684324579

10:59:11.731 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
10:59:11.734 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 25 cols
invariant :think_1 + catch1_1 + catch2_1 + eat_1 = 1
invariant :fork_2 + catch1_3 + catch2_2 + eat_2 + eat_3 = 1
invariant :fork_1 + catch1_2 + catch2_1 + eat_1 + eat_2 = 1
invariant :fork_4 + catch1_0 + catch2_4 + eat_0 + eat_4 = 1
invariant :think_4 + catch1_4 + catch2_4 + eat_4 = 1
invariant :think_3 + catch1_3 + catch2_3 + eat_3 = 1
invariant :fork_0 + catch1_1 + catch2_0 + eat_0 + eat_1 = 1
invariant :fork_3 + catch1_4 + catch2_3 + eat_3 + eat_4 = 1
invariant :think_2 + catch1_2 + catch2_2 + eat_2 = 1
invariant :think_0 + catch1_0 + catch2_0 + eat_0 = 1

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((false))
Formula 0 simplified : 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
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.040671,16752,1,0,7,1808,17,4,632,1017,13
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(G(G("(((((fork_0+fork_1)+fork_2)+fork_3)+fork_4)>=1)"))))))
Formula 1 simplified : !FG"(((((fork_0+fork_1)+fork_2)+fork_3)+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.093352,17472,1,0,22,3951,30,25,661,5330,74
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X(G(X("(((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)>=3)"))))))
Formula 2 simplified : !XXGX"(((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)>=3)"
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
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.110594,17880,1,0,24,4158,36,28,679,5582,90
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((false))
Formula 3 simplified : 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.110791,17880,1,0,24,4158,36,28,679,5582,90
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)<=((((think_0+think_1)+think_2)+think_3)+think_4))")U(F(X("(((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)<=((((think_0+think_1)+think_2)+think_3)+think_4))")))))
Formula 4 simplified : !("(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)<=((((think_0+think_1)+think_2)+think_3)+think_4))" U FX"(((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)<=((((think_0+think_1)+think_2)+think_3)+think_4))")
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.112107,18124,1,0,24,4158,45,28,709,5582,94
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G("(((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)<=((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4))"))U(("(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)<=((((eat_0+eat_1)+eat_2)+eat_3)+eat_4))")U("(((((think_0+think_1)+think_2)+think_3)+think_4)<=((((eat_0+eat_1)+eat_2)+eat_3)+eat_4))"))))
Formula 5 simplified : !(G"(((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)<=((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4))" U ("(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)<=((((eat_0+eat_1)+eat_2)+eat_3)+eat_4))" U "(((((think_0+think_1)+think_2)+think_3)+think_4)<=((((eat_0+eat_1)+eat_2)+eat_3)+eat_4))"))
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.130321,19260,1,0,36,5637,69,37,966,7581,131
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((false))
Formula 6 simplified : 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.137401,19260,1,0,36,5637,69,37,966,7581,131
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(("(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)>=2)")U("(((((think_0+think_1)+think_2)+think_3)+think_4)>=2)")))))
Formula 7 simplified : !XX("(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)>=2)" U "(((((think_0+think_1)+think_2)+think_3)+think_4)>=2)")
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
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.151279,19520,1,0,36,5673,79,37,1007,7581,135
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(X(G("(((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)>=1)"))))))
Formula 8 simplified : !GXXG"(((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)>=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.158728,19520,1,0,48,6787,85,46,1028,9517,166
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G("(((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)>=3)")))
Formula 9 simplified : !G"(((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)>=3)"
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.159626,19780,1,0,48,6787,91,46,1038,9534,173
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((G(G("(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)>=3)")))U("(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)<=((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4))")))
Formula 10 simplified : !(G"(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)>=3)" U "(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)<=((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4))")
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.160906,19948,1,0,48,6787,101,46,1063,9534,177
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(X("(((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)<=((((think_0+think_1)+think_2)+think_3)+think_4))"))))
Formula 11 simplified : !XX"(((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)<=((((think_0+think_1)+think_2)+think_3)+think_4))"
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
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.172674,19948,1,0,48,6787,104,46,1097,9534,179
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((true))
Formula 12 simplified : 0
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.172833,19948,1,0,48,6787,104,46,1097,9534,179
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X((X("(((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)>=3)"))U(F("(((((think_0+think_1)+think_2)+think_3)+think_4)<=((((eat_0+eat_1)+eat_2)+eat_3)+eat_4))")))))
Formula 13 simplified : !X(X"(((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)>=3)" U F"(((((think_0+think_1)+think_2)+think_3)+think_4)<=((((eat_0+eat_1)+eat_2)+eat_3)+eat_4))")
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.174529,19948,1,0,49,6830,111,49,1097,9693,197
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(G("(((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)<=((((think_0+think_1)+think_2)+think_3)+think_4))"))))
Formula 14 simplified : !G"(((((eat_0+eat_1)+eat_2)+eat_3)+eat_4)<=((((think_0+think_1)+think_2)+think_3)+think_4))"
Computing Next relation with stutter on 2 deadlock states
1 unique states visited
0 strongly connected components in search stack
1 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.179638,19948,1,0,49,6831,114,49,1188,9696,213
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((F(X("(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)>=3)")))U("(((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)>=3)")))
Formula 15 simplified : !(FX"(((((catch1_0+catch1_1)+catch1_2)+catch1_3)+catch1_4)>=3)" U "(((((catch2_0+catch2_1)+catch2_2)+catch2_3)+catch2_4)>=3)")
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.188525,19948,1,0,65,7589,119,66,1207,11004,267
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-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, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1553684354139

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 27, 2019 10:58:47 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 27, 2019 10:58:47 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 10:58:47 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 24919 ms
Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 27, 2019 10:59:12 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 50 ms
Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 63 ms
Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 25 places.
Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 25 transitions.
Mar 27, 2019 10:59:12 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Mar 27, 2019 10:59:13 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
Mar 27, 2019 10:59:13 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Mar 27, 2019 10:59:13 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 17 ms
Mar 27, 2019 10:59:13 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 25 variables to be positive in 295 ms
Mar 27, 2019 10:59:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 25 transitions.
Mar 27, 2019 10:59:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/25 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 10:59:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 10:59:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 25 transitions.
Mar 27, 2019 10:59:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 27, 2019 10:59:13 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Mar 27, 2019 10:59:13 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Mar 27, 2019 10:59:13 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 9) 1) (>= (select s0 0) 1)) (= (store (store (store s0 0 (- (select s0 0) 1)) 9 (- (select s0 9) 1)) 10 (+ (select s0 10) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s0 9) 1) (>= (select s0 0) 1)) (= (store (store (store s0 0 (- (select s0 0) 1)) 9 (- (select s0 9) 1)) 10 (+ (select s0 10) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java: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)
Mar 27, 2019 10:59:13 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 790ms 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-000005"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsm"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstoolsm"
echo " Input is Philosophers-COL-000005, 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 r197-oct2-155272231300672"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000005.tgz
mv Philosophers-COL-000005 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "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 ;