About the Execution of ITS-Tools.M for HexagonalGrid-PT-110
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
441.910 | 7934.00 | 20489.00 | 129.40 | FFFFFFTFTFFFFFTF | normal |
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-155246554600546.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r195-csrt-155246554600546
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-01
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-02
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-03
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-04
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-05
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-06
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-07
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-08
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-09
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-10
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-11
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-12
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-13
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-14
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1553739800526
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]
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 : !((G(F(("(pol2_1_1<=pbl_1_1)")U("(pi2_1_1>=2)")))))
Formula 0 simplified : !GF("(pol2_1_1<=pbl_1_1)" U "(pi2_1_1>=2)")
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.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
44 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.473974,26300,1,0,5,48481,24,0,933,42465,16
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(G(G("(pi2_1_1>=3)")))))
Formula 1 simplified : !FG"(pi2_1_1>=3)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
110 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.57725,50448,1,0,27,160330,37,18,935,203489,153
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(X("(pb4_1_1>=3)"))))
Formula 2 simplified : !XX"(pb4_1_1>=3)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
28 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.85313,54648,1,0,29,174989,42,18,937,226815,165
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((F("(pol5_1_1<=pb5_1_1)"))U(("(pil5_1_1<=pol3_1_1)")U("(pb3_1_1>=3)"))))
Formula 3 simplified : !(F"(pol5_1_1<=pb5_1_1)" U ("(pil5_1_1<=pol3_1_1)" U "(pb3_1_1>=3)"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
20 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.0436,58456,1,0,73,196340,59,40,962,245111,304
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((G("(po1_1_1<=pol3_1_1)"))U(F(F("(pol3_1_1>=2)")))))
Formula 4 simplified : !(G"(po1_1_1<=pol3_1_1)" U F"(pol3_1_1>=2)")
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,2.06064,59204,1,0,73,196340,68,40,964,245449,347
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((X(G("(pi5_1_1<=pil2_1_1)")))U(X(F("(pol6_1_1>=1)")))))
Formula 5 simplified : !(XG"(pi5_1_1<=pil2_1_1)" U XF"(pol6_1_1>=1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
42 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.49715,68908,1,0,121,245255,77,57,965,308778,437
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-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,2.49739,68908,1,0,121,245255,77,57,965,308778,437
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((X(F("(po1_1_1>=3)")))U(G(G("(po1_1_1<=pb4_1_1)")))))
Formula 7 simplified : !(XF"(po1_1_1>=3)" U G"(po1_1_1<=pb4_1_1)")
1 unique states visited
1 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
72 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,3.21043,86244,1,0,140,325902,83,57,980,407730,535
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F("(po5_1_1<=pb4_1_1)")))
Formula 8 simplified : !F"(po5_1_1<=pb4_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,3.21093,86244,1,0,140,325902,92,57,983,407730,539
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((F("(po2_1_1>=1)"))U(G("(pi1_1_1>=1)"))))
Formula 9 simplified : !(F"(po2_1_1>=1)" U G"(pi1_1_1>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 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,3.28241,88016,1,0,144,337863,103,57,987,415133,563
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((F(X("(pb5_1_1>=1)")))U(X("(pol1_1_1>=3)"))))
Formula 10 simplified : !(FX"(pb5_1_1>=1)" U X"(pol1_1_1>=3)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.32479,89560,1,0,146,340322,116,57,992,417504,609
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(X(X(G("(pol3_1_1>=1)"))))))
Formula 11 simplified : !GXXG"(pol3_1_1>=1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
87 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,4.20114,103284,1,0,169,420302,122,62,993,483420,703
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(("(pi3_1_1>=1)")U(F("(pil4_1_1>=3)")))))
Formula 12 simplified : !F("(pi3_1_1>=1)" U F"(pil4_1_1>=3)")
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,4.21995,104076,1,0,169,420302,131,62,995,483456,746
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((false))
Formula 13 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,4.22019,104076,1,0,169,420302,131,62,995,483456,746
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((true))
Formula 14 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,4.22029,104076,1,0,169,420302,131,62,995,483456,746
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G((G("(pi5_1_1<=pbl_1_1)"))U(F("(po3_1_1>=3)")))))
Formula 15 simplified : !G(G"(pi5_1_1<=pbl_1_1)" U F"(po3_1_1>=3)")
3 unique states visited
3 strongly connected components in search stack
4 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,4.22142,104284,1,0,169,420302,140,62,997,483489,752
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLCardinality-15 FALSE 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 1553739808460
--------------------
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 28, 2019 2:23:22 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 28, 2019 2:23:22 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 28, 2019 2:23:22 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 43 ms
Mar 28, 2019 2:23:22 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 31 places.
Mar 28, 2019 2:23:22 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 42 transitions.
Mar 28, 2019 2:23:22 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 8 ms
Mar 28, 2019 2:23:23 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 87 ms
Mar 28, 2019 2:23:23 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 24 ms
Mar 28, 2019 2:23:23 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 42 transitions.
Mar 28, 2019 2:23:23 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 31 places.
Mar 28, 2019 2:23:23 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 42 transitions.
Mar 28, 2019 2:23:23 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 11 ms
Mar 28, 2019 2:23:23 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Mar 28, 2019 2:23:23 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 42 transitions.
Mar 28, 2019 2:23:23 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 14 place invariants in 25 ms
Mar 28, 2019 2:23:23 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 31 variables to be positive in 420 ms
Mar 28, 2019 2:23:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 42 transitions.
Mar 28, 2019 2:23:23 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:23 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:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 42 transitions.
Mar 28, 2019 2:23:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 28, 2019 2:23:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 42 transitions.
Mar 28, 2019 2:23:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(6/42) took 1811 ms. Total solver calls (SAT/UNSAT): 266(230/36)
SMT solver raised 'unknown', retrying with same input.
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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:490)
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:28 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 4811ms 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="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 HexagonalGrid-PT-110, 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 r195-csrt-155246554600546"
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 [ "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 '
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 ;