Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r118-smll-155272319100051.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-3957
Executing tool itstools
Input is PhilosophersDyn-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-smll-155272319100051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 7.3K Feb 12 09:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 12 09:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 8 08:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 8 08:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.5K Feb 5 00:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 00:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 4 22:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 4 12:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 4 12:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 1 07:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 1 07:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Feb 4 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 87K 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 PhilosophersDyn-PT-03-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552819002575

Working with output stream class java.io.PrintStream
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.201903111103/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.201903111103/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(F(("(((Think_3+Think_2)+Think_1)>=2)")U("(((((((((Neighbourhood_1_2+Neighbourhood_2_2)+Neighbourhood_3_3)+Neighbourhood_1_1)+Neighbourhood_2_3)+Neighbourhood_2_1)+Neighbourhood_1_3)+Neighbourhood_3_2)+Neighbourhood_3_1)<=((WaitLeft_2+WaitLeft_3)+WaitLeft_1))")))))
Formula 0 simplified : !F("(((Think_3+Think_2)+Think_1)>=2)" U "(((((((((Neighbourhood_1_2+Neighbourhood_2_2)+Neighbourhood_3_3)+Neighbourhood_1_1)+Neighbourhood_2_3)+Neighbourhood_2_1)+Neighbourhood_1_3)+Neighbourhood_3_2)+Neighbourhood_3_1)<=((WaitLeft_2+WaitLeft_3)+WaitLeft_1))")
Reverse transition relation is NOT exact ! Due to transitions Leave_2_1_1, Leave_3_1_1, Leave_2_3_3, Leave_1_3_2, Leave_2_3_1, Leave_1_3_3, Leave_1_2_2, Leave_3_2_1, Leave_2_1_3, Leave_3_2_2, Leave_3_1_2, Leave_1_2_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :40/32/12/84
Computing Next relation with stutter on 45 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
16 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.21065,19316,1,0,98,11727,153,41,2343,8533,137
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(("(((HasLeft_2+HasLeft_3)+HasLeft_1)>=2)"))
Formula 1 simplified : !"(((HasLeft_2+HasLeft_3)+HasLeft_1)>=2)"
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.236794,20264,1,0,100,12252,162,44,2407,10857,153
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(("(((Think_3+Think_2)+Think_1)<=((HasRight_2+HasRight_1)+HasRight_3))"))
Formula 2 simplified : !"(((Think_3+Think_2)+Think_1)<=((HasRight_2+HasRight_1)+HasRight_3))"
Computing Next relation with stutter on 45 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.237729,20264,1,0,100,12252,165,44,2415,10857,155
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((X(G("(((HasRight_2+HasRight_1)+HasRight_3)<=((HasLeft_2+HasLeft_3)+HasLeft_1))")))U(F(G("(((Outside_3+Outside_2)+Outside_1)>=3)")))))
Formula 3 simplified : !(XG"(((HasRight_2+HasRight_1)+HasRight_3)<=((HasLeft_2+HasLeft_3)+HasLeft_1))" U FG"(((Outside_3+Outside_2)+Outside_1)>=3)")
Computing Next relation with stutter on 45 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 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.313249,22180,1,0,117,14827,178,69,2427,16082,216
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G("(((HasLeft_2+HasLeft_3)+HasLeft_1)>=2)")))
Formula 4 simplified : !G"(((HasLeft_2+HasLeft_3)+HasLeft_1)>=2)"
Computing Next relation with stutter on 45 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.315445,22428,1,0,117,14827,181,69,2429,16082,219
Normalized transition count is 57
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G((X("(((HasLeft_2+HasLeft_3)+HasLeft_1)<=((HasRight_2+HasRight_1)+HasRight_3))"))U(G("(((HasRight_2+HasRight_1)+HasRight_3)>=1)")))))
// Phase 1: matrix 57 rows 30 cols
Formula 5 simplified : !G(X"(((HasLeft_2+HasLeft_3)+HasLeft_1)<=((HasRight_2+HasRight_1)+HasRight_3))" U G"(((HasRight_2+HasRight_1)+HasRight_3)>=1)")
Computing Next relation with stutter on 45 deadlock states
invariant :Think_1 + HasLeft_1 + WaitLeft_1 + Outside_1 = 1
invariant :-1'WaitLeft_2 + HasRight_2 + WaitRight_2 + -1'HasLeft_2 = 0
invariant :Neighbourhood_1_1 + Neighbourhood_2_1 + Neighbourhood_3_1 + Outside_1 = 1
invariant :Neighbourhood_1_2 + Think_3 + Neighbourhood_2_2 + -1'Neighbourhood_3_3 + Neighbourhood_1_1 + Neighbourhood_2_1 + WaitRight_3 + HasRight_3 + Outside_2 + Outside_1 = 2
invariant :Neighbourhood_1_2 + Neighbourhood_1_1 + Neighbourhood_1_3 + Outside_1 = 1
invariant :WaitRight_1 + HasRight_1 + -1'HasLeft_1 + -1'WaitLeft_1 = 0
invariant :Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_1 + Outside_2 = 1
invariant :HasLeft_3 + WaitLeft_3 + -1'WaitRight_3 + -1'HasRight_3 = 0
invariant :WaitLeft_2 + Think_2 + HasLeft_2 + Outside_2 = 1
invariant :-1'Neighbourhood_1_2 + -1'Neighbourhood_2_2 + Outside_3 + Neighbourhood_3_3 + -1'Neighbourhood_1_1 + -1'Neighbourhood_2_1 + -1'Outside_2 + -1'Outside_1 = -1
invariant :Neighbourhood_1_2 + Neighbourhood_2_2 + Neighbourhood_3_2 + Outside_2 = 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.345002,23008,1,0,127,16248,187,76,2440,18988,242
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(X(G(G("(((((((((Neighbourhood_1_2+Neighbourhood_2_2)+Neighbourhood_3_3)+Neighbourhood_1_1)+Neighbourhood_2_3)+Neighbourhood_2_1)+Neighbourhood_1_3)+Neighbourhood_3_2)+Neighbourhood_3_1)>=3)"))))))
Formula 6 simplified : !XXG"(((((((((Neighbourhood_1_2+Neighbourhood_2_2)+Neighbourhood_3_3)+Neighbourhood_1_1)+Neighbourhood_2_3)+Neighbourhood_2_1)+Neighbourhood_1_3)+Neighbourhood_3_2)+Neighbourhood_3_1)>=3)"
Computing Next relation with stutter on 45 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.386952,23676,1,0,147,18094,193,91,2504,22557,283
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X(F(("(((Outside_3+Outside_2)+Outside_1)<=((((((((Neighbourhood_1_2+Neighbourhood_2_2)+Neighbourhood_3_3)+Neighbourhood_1_1)+Neighbourhood_2_3)+Neighbourhood_2_1)+Neighbourhood_1_3)+Neighbourhood_3_2)+Neighbourhood_3_1))")U("(((Outside_3+Outside_2)+Outside_1)<=((WaitRight_1+WaitRight_2)+WaitRight_3))")))))
Formula 7 simplified : !XF("(((Outside_3+Outside_2)+Outside_1)<=((((((((Neighbourhood_1_2+Neighbourhood_2_2)+Neighbourhood_3_3)+Neighbourhood_1_1)+Neighbourhood_2_3)+Neighbourhood_2_1)+Neighbourhood_1_3)+Neighbourhood_3_2)+Neighbourhood_3_1))" U "(((Outside_3+Outside_2)+Outside_1)<=((WaitRight_1+WaitRight_2)+WaitRight_3))")
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 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.398106,23940,1,0,156,18317,202,103,2528,23242,321
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(G("(HasLeft_2<=Think_2)"))))
Formula 8 simplified : !G"(HasLeft_2<=Think_2)"
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.434226,24732,1,0,170,19764,208,122,2533,25769,381
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(F(X(X("(WaitRight_1<=Neighbourhood_3_3)"))))))
Formula 9 simplified : !FXX"(WaitRight_1<=Neighbourhood_3_3)"
Computing Next relation with stutter on 45 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.476039,25524,1,0,190,21832,217,138,2538,30164,419
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F(X(F(X("(Forks_3<=Think_1)"))))))
Formula 10 simplified : !FXFX"(Forks_3<=Think_1)"
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.495687,25788,1,0,213,22977,226,153,2542,32267,470
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X("(HasLeft_2<=WaitLeft_3)")))
Formula 11 simplified : !X"(HasLeft_2<=WaitLeft_3)"
Computing Next relation with stutter on 45 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.49825,26052,1,0,213,22977,229,153,2545,32268,472
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((F(F("(Forks_3<=Neighbourhood_1_1)")))U(F(X("(Neighbourhood_3_1<=HasRight_3)")))))
Formula 12 simplified : !(F"(Forks_3<=Neighbourhood_1_1)" U FX"(Neighbourhood_3_1<=HasRight_3)")
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 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.514339,26052,1,0,233,23858,238,170,2550,34108,515
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(G(F(G("(WaitLeft_2<=Neighbourhood_3_3)"))))))
Formula 13 simplified : !FGFG"(WaitLeft_2<=Neighbourhood_3_3)"
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.576513,27304,1,0,278,28219,251,219,2555,42747,623
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(G(G(F("(Think_1<=WaitLeft_2)"))))))
Formula 14 simplified : !GF"(Think_1<=WaitLeft_2)"
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.602527,27828,1,0,294,29420,260,230,2560,44603,680
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(("(HasRight_3<=Neighbourhood_3_1)"))
Formula 15 simplified : !"(HasRight_3<=Neighbourhood_3_1)"
Computing Next relation with stutter on 45 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.604802,27828,1,0,294,29420,263,230,2563,44604,682
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552819008414

--------------------
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/ -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/ -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 17, 2019 10:36:45 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]
Mar 17, 2019 10:36:45 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 17, 2019 10:36:45 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 69 ms
Mar 17, 2019 10:36:45 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 places.
Mar 17, 2019 10:36:46 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 84 transitions.
Mar 17, 2019 10:36:46 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 15 ms
Mar 17, 2019 10:36:46 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 109 ms
Mar 17, 2019 10:36:46 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
Mar 17, 2019 10:36:46 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Mar 17, 2019 10:36:46 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 84 transitions.
Mar 17, 2019 10:36:46 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 23 ms
Mar 17, 2019 10:36:46 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 30 variables to be positive in 264 ms
Mar 17, 2019 10:36:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 84 transitions.
Mar 17, 2019 10:36:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/84 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 10:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 10:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 84 transitions.
Mar 17, 2019 10:36:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
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 17, 2019 10:36:47 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 740ms 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="PhilosophersDyn-PT-03"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-PT-03, 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 r118-smll-155272319100051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 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 ;