Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r195-csrt-155246554600547.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off 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 HexagonalGrid-PT-110, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r195-csrt-155246554600547
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.7K Feb 11 01:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 11 01:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 7 01:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 01:25 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 107 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 345 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 23:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 3 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Jan 31 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Jan 31 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rwxr-xr-x 1 mcc users 29K 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 HexagonalGrid-PT-110-LTLFireability-00
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-01
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-02
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-03
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-04
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-05
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-06
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-07
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-08
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-09
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-10
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-11
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-12
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-13
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-14
FORMULA_NAME HexagonalGrid-PT-110-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553739814894

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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.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 : !((X((G(X("((pbl_1_1>=1)&&(pi2_1_1>=1))")))U(X("((pbl_1_1>=1)&&(pi2_1_1>=1))")))))
Formula 0 simplified : !X(GX"((pbl_1_1>=1)&&(pi2_1_1>=1))" U X"((pbl_1_1>=1)&&(pi2_1_1>=1))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 42 rows 31 cols
invariant :po2_1_1 + pol2_1_1 = 1
invariant :pi4_1_1 + pil4_1_1 = 1
invariant :po3_1_1 + pol3_1_1 = 1
invariant :pi2_1_1 + pil2_1_1 = 1
invariant :po1_1_1 + pol1_1_1 = 1
invariant :po5_1_1 + pol5_1_1 = 1
invariant :pbl_1_1 + pil1_1_1 + pil2_1_1 + pil3_1_1 + pil4_1_1 + pil5_1_1 + pil6_1_1 + pol1_1_1 + pol2_1_1 + pol3_1_1 + pol4_1_1 + pol5_1_1 + pol6_1_1 = 12
invariant :pi5_1_1 + pil5_1_1 = 1
invariant :po4_1_1 + pol4_1_1 = 1
invariant :po6_1_1 + pol6_1_1 = 1
invariant :pi3_1_1 + pil3_1_1 = 1
invariant :pb1_1_1 + pb2_1_1 + pb3_1_1 + pb4_1_1 + pb5_1_1 + pb6_1_1 + -1'pil1_1_1 + -1'pil2_1_1 + -1'pil3_1_1 + -1'pil4_1_1 + -1'pil5_1_1 + -1'pil6_1_1 + -1'pol1_1_1 + -1'pol2_1_1 + -1'pol3_1_1 + -1'pol4_1_1 + -1'pol5_1_1 + -1'pol6_1_1 = -6
invariant :pi6_1_1 + pil6_1_1 = 1
invariant :pi1_1_1 + pil1_1_1 = 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
59 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.62134,27300,1,0,9,54422,20,0,935,49995,23
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(F(F(("((pi4_1_1>=1)&&(pbl_1_1>=1))")U("((pbl_1_1>=1)&&(pi2_1_1>=1))"))))))
Formula 1 simplified : !GF("((pi4_1_1>=1)&&(pbl_1_1>=1))" U "((pbl_1_1>=1)&&(pi2_1_1>=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.642882,28264,1,0,11,56028,26,0,935,51880,36
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((X(G("((pbl_1_1>=1)&&(pi3_1_1>=1))")))U((X("((pi5_1_1>=1)&&(pbl_1_1>=1))"))U(X("((pi4_1_1>=1)&&(pbl_1_1>=1))")))))
Formula 2 simplified : !(XG"((pbl_1_1>=1)&&(pi3_1_1>=1))" U (X"((pi5_1_1>=1)&&(pbl_1_1>=1))" U X"((pi4_1_1>=1)&&(pbl_1_1>=1))"))
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.674968,30044,1,0,11,56344,48,0,957,52640,46
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F("((pb1_1_1>=1)&&(pol1_1_1>=1))")))
Formula 3 simplified : !F"((pb1_1_1>=1)&&(pol1_1_1>=1))"
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.675668,30044,1,0,11,56344,57,0,961,52640,50
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(X((G("((pbl_1_1>=1)&&(pi3_1_1>=1))"))U(X("((pbl_1_1>=1)&&(pi6_1_1>=1))"))))))
Formula 4 simplified : !XX(G"((pbl_1_1>=1)&&(pi3_1_1>=1))" U X"((pbl_1_1>=1)&&(pi6_1_1>=1))")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
23 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.904689,35504,1,0,17,84497,62,0,964,81883,67
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X("((pbl_1_1>=1)&&(pi3_1_1>=1))")))
Formula 5 simplified : !X"((pbl_1_1>=1)&&(pi3_1_1>=1))"
4 unique states visited
4 strongly connected components in search stack
4 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.90535,35768,1,0,17,84497,62,0,964,81883,69
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((true))
Formula 6 simplified : 0
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.905469,35768,1,0,17,84497,62,0,964,81883,69
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(F((F("((pb2_1_1>=1)&&(pol2_1_1>=1))"))U("((pbl_1_1>=1)&&(pi1_1_1>=1))")))))
Formula 7 simplified : !GF(F"((pb2_1_1>=1)&&(pol2_1_1>=1))" U "((pbl_1_1>=1)&&(pi1_1_1>=1))")
3 unique states visited
3 strongly connected components in search stack
4 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.929366,36296,1,0,19,89482,71,0,967,84835,80
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((G(("((pbl_1_1>=1)&&(pi3_1_1>=1))")U("((pbl_1_1>=1)&&(pi1_1_1>=1))")))U("((pbl_1_1>=1)&&(pi2_1_1>=1))")))
Formula 8 simplified : !(G("((pbl_1_1>=1)&&(pi3_1_1>=1))" U "((pbl_1_1>=1)&&(pi1_1_1>=1))") U "((pbl_1_1>=1)&&(pi2_1_1>=1))")
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.93425,36988,1,0,19,89516,87,0,983,84941,88
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(G(X(X(G("((pbl_1_1>=1)&&(pi1_1_1>=1))")))))))
Formula 9 simplified : !FGXXG"((pbl_1_1>=1)&&(pi1_1_1>=1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.978564,37472,1,0,21,97720,90,0,983,89964,98
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X("((pbl_1_1>=1)&&(pi6_1_1>=1))")))
Formula 10 simplified : !X"((pbl_1_1>=1)&&(pi6_1_1>=1))"
4 unique states visited
4 strongly connected components in search stack
4 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.979299,37736,1,0,21,97720,90,0,983,89964,100
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(F((X("((pbl_1_1>=1)&&(pi3_1_1>=1))"))U("((pi4_1_1>=1)&&(pbl_1_1>=1))")))))
Formula 11 simplified : !GF(X"((pbl_1_1>=1)&&(pi3_1_1>=1))" U "((pi4_1_1>=1)&&(pbl_1_1>=1))")
3 unique states visited
3 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,1.00937,38264,1,0,23,102292,97,0,983,93132,111
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((false))
Formula 12 simplified : 1
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,1.00966,38264,1,0,23,102292,97,0,983,93132,111
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F("((pbl_1_1>=1)&&(pi3_1_1>=1))")))
Formula 13 simplified : !F"((pbl_1_1>=1)&&(pi3_1_1>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
63 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.63658,52620,1,0,59,176927,103,17,983,189098,200
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((((X("((po3_1_1>=1)&&(pil3_1_1>=1))"))U(G("((pbl_1_1>=1)&&(pi6_1_1>=1))")))U(X(F(F("((pbl_1_1>=1)&&(pi5_1_1>=1))"))))))
Formula 14 simplified : !((X"((po3_1_1>=1)&&(pil3_1_1>=1))" U G"((pbl_1_1>=1)&&(pi6_1_1>=1))") U XF"((pbl_1_1>=1)&&(pi5_1_1>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
74 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,2.38516,68644,1,0,93,249243,110,33,983,288999,284
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((X(("((pi4_1_1>=1)&&(pbl_1_1>=1))")U("((pi4_1_1>=1)&&(pbl_1_1>=1))")))U(F("((pb6_1_1>=1)&&(pol6_1_1>=1))"))))
Formula 15 simplified : !(X"((pi4_1_1>=1)&&(pbl_1_1>=1))" U F"((pb6_1_1>=1)&&(pol6_1_1>=1))")
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,2.38589,68644,1,0,93,249243,119,33,987,288999,288
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1553739820726

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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 28, 2019 2:23:37 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 39 ms
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 31 places.
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 42 transitions.
Mar 28, 2019 2:23:37 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 40 ms
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 12 ms
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 42 transitions.
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 31 places.
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 42 transitions.
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 42 transitions.
Mar 28, 2019 2:23:37 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Mar 28, 2019 2:23:37 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 14 place invariants in 12 ms
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 31 variables to be positive in 85 ms
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 42 transitions.
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/42 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 42 transitions.
Mar 28, 2019 2:23:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 2:23:39 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 42 transitions.
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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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 28, 2019 2:23:40 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2832ms 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="HexagonalGrid-PT-110"
export BK_EXAMINATION="LTLFireability"
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 HexagonalGrid-PT-110, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r195-csrt-155246554600547"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HexagonalGrid-PT-110.tgz
mv HexagonalGrid-PT-110 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;