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 324K
-rw-r--r-- 1 mcc users 5.0K 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 6.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 87K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
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 r261-csrt-152732586100249
=====================================================================

--------------------
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 1527509917012

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/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.201805241334/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(X(F("(((WaitLeft_2+WaitLeft_3)+WaitLeft_1)>=2)"))))))
Formula 0 simplified : !FXF"(((WaitLeft_2+WaitLeft_3)+WaitLeft_1)>=2)"
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) :41/31/12/84
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
13 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.190418,20956,1,0,117,15188,151,59,2309,15141,174
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((("(((WaitRight_1+WaitRight_2)+WaitRight_3)>=1)")U("(((WaitRight_1+WaitRight_2)+WaitRight_3)>=3)"))U(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)<=((HasRight_2+HasRight_1)+HasRight_3))"))))
Formula 1 simplified : !(("(((WaitRight_1+WaitRight_2)+WaitRight_3)>=1)" U "(((WaitRight_1+WaitRight_2)+WaitRight_3)>=3)") U 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)<=((HasRight_2+HasRight_1)+HasRight_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
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.228974,22860,1,0,118,15642,198,61,2438,16868,201
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 USE_NUPN
Checking formula 2 : !(((X(X("(((Outside_3+Outside_2)+Outside_1)>=1)")))U(("(((WaitLeft_2+WaitLeft_3)+WaitLeft_1)<=((HasRight_2+HasRight_1)+HasRight_3))")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)<=((HasLeft_2+HasLeft_3)+HasLeft_1))"))))
Formula 2 simplified : !(XX"(((Outside_3+Outside_2)+Outside_1)>=1)" U ("(((WaitLeft_2+WaitLeft_3)+WaitLeft_1)<=((HasRight_2+HasRight_1)+HasRight_3))" 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)<=((HasLeft_2+HasLeft_3)+HasLeft_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.24246,23548,1,0,118,15642,209,61,2458,16868,207
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(F(G(G("(((WaitLeft_2+WaitLeft_3)+WaitLeft_1)>=3)"))))))
Formula 3 simplified : !FG"(((WaitLeft_2+WaitLeft_3)+WaitLeft_1)>=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
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.266895,23812,1,0,138,17083,222,86,2470,20756,280
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 USE_NUPN
Checking formula 4 : !(((("(((((((((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)")U("(((Think_3+Think_2)+Think_1)>=3)"))U(G(G("(((HasRight_2+HasRight_1)+HasRight_3)<=((((((((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))")))))
Formula 4 simplified : !(("(((((((((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)" U "(((Think_3+Think_2)+Think_1)>=3)") U G"(((HasRight_2+HasRight_1)+HasRight_3)<=((((((((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))")
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 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.280956,24076,1,0,140,17274,263,95,2690,21274,321
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(X(X("(((HasRight_2+HasRight_1)+HasRight_3)>=3)"))))))
Formula 5 simplified : !XFXX"(((HasRight_2+HasRight_1)+HasRight_3)>=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
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.298403,24604,1,0,146,18692,272,104,2697,25209,348
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 USE_NUPN
Checking formula 6 : !((X(X(X(G("(((HasLeft_2+HasLeft_3)+HasLeft_1)>=1)"))))))
Formula 6 simplified : !XXXG"(((HasLeft_2+HasLeft_3)+HasLeft_1)>=1)"
Computing Next relation with stutter on 45 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.319971,25380,1,0,162,19664,278,117,2708,27762,379
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 USE_NUPN
Checking formula 7 : !(("(((HasRight_2+HasRight_1)+HasRight_3)<=((WaitRight_1+WaitRight_2)+WaitRight_3))"))
Formula 7 simplified : !"(((HasRight_2+HasRight_1)+HasRight_3)<=((WaitRight_1+WaitRight_2)+WaitRight_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.320565,25380,1,0,162,19664,281,117,2716,27762,381
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("(HasLeft_3<=WaitLeft_3)"))
Formula 8 simplified : !"(HasLeft_3<=WaitLeft_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.321467,25644,1,0,162,19664,284,117,2720,27764,383
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(F("(HasRight_2<=Neighbourhood_1_3)"))))
Formula 9 simplified : !GF"(HasRight_2<=Neighbourhood_1_3)"
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
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.328346,25644,1,0,175,20173,293,129,2725,28796,425
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 USE_NUPN
Checking formula 10 : !(("(Neighbourhood_3_2<=Outside_2)"))
Formula 10 simplified : !"(Neighbourhood_3_2<=Outside_2)"
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.328696,25644,1,0,175,20173,296,129,2728,28796,427
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(F(G("(Forks_2<=Neighbourhood_1_3)")))))
Formula 11 simplified : !XFG"(Forks_2<=Neighbourhood_1_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
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.394092,27484,1,0,252,27084,309,196,2732,43476,563
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X(X(X("(Think_3<=HasRight_2)"))))))
Formula 12 simplified : !GXXX"(Think_3<=HasRight_2)"
Computing Next relation with stutter on 45 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.405764,27988,1,0,273,27838,315,217,2736,45101,613
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 USE_NUPN
Checking formula 13 : !((G(F("(Neighbourhood_2_1<=Think_3)"))))
Formula 13 simplified : !GF"(Neighbourhood_2_1<=Think_3)"
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
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.420366,28516,1,0,289,29068,324,230,2741,47160,653
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 USE_NUPN
Checking formula 14 : !((X(F(F("(Neighbourhood_1_2<=Neighbourhood_2_1)")))))
Formula 14 simplified : !XF"(Neighbourhood_1_2<=Neighbourhood_2_1)"
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.420988,28780,1,0,289,29068,333,230,2746,47160,657
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((F("(Outside_2<=Think_3)"))U(G(F("(HasRight_1<=WaitLeft_1)")))))
Formula 15 simplified : !(F"(Outside_2<=Think_3)" U GF"(HasRight_1<=WaitLeft_1)")
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 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.450115,29016,1,0,295,29214,342,234,2750,47414,678
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527509920961

--------------------
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/ -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 LTLCardinality -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 12:18:39 PM 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/, -louvain, -smt]
May 28, 2018 12:18:39 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 12:18:39 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 74 ms
May 28, 2018 12:18:39 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 places.
May 28, 2018 12:18:39 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 84 transitions.
May 28, 2018 12:18:39 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 15 ms
May 28, 2018 12:18:39 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 125 ms
May 28, 2018 12:18:39 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
May 28, 2018 12:18:39 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
May 28, 2018 12:18:40 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 84 transitions.
May 28, 2018 12:18:40 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (define-fun tr29 ((step Int)) Bool (trsrc29 (select s step) (select s (+ step 1)))) with error
May 28, 2018 12:18:40 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (define-fun _enabledsrc__30 ((src (Array Int Int))) Bool (and (and (and (>= (select src 7) 1) (>= (select src 12) 1)) (>= (select src 6) 1)) (>= (select src 19) 1))) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Skipping mayMatrices nes/nds Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:59)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 28, 2018 12:18:40 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 560ms 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="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/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 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 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 r261-csrt-152732586100249"
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 ;