About the Execution of ITS-Tools.L for HexagonalGrid-PT-110
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15751.710 | 6423.00 | 12970.00 | 378.50 | FFFFFFFFFFFFFFFF | normal |
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 200K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 29K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
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 r213-smll-152732264200264
=====================================================================
--------------------
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 1527918718567
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph7310768528766244722.txt, -o, /tmp/graph7310768528766244722.bin, -w, /tmp/graph7310768528766244722.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph7310768528766244722.bin, -l, -1, -v, -w, /tmp/graph7310768528766244722.weights, -q, 0, -e, 0.001], workingDir=null]
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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((X("((i1.u9.pol4_1_1>=1)&&(u0.pb4_1_1>=1))"))U(X("((i1.u9.po4_1_1>=1)&&(i1.u2.pil4_1_1>=1))"))))
Formula 0 simplified : !(X"((i1.u9.pol4_1_1>=1)&&(u0.pb4_1_1>=1))" U X"((i1.u9.po4_1_1>=1)&&(i1.u2.pil4_1_1>=1))")
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.21733,23296,1,0,8638,10322,383,13708,245,45222,9646
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 USE_NUPN
Checking formula 1 : !((X(G("((u0.pbl_1_1>=1)&&(i6.u1.pi3_1_1>=1))"))))
Formula 1 simplified : !XG"((u0.pbl_1_1>=1)&&(i6.u1.pi3_1_1>=1))"
// Phase 1: matrix 42 rows 31 cols
invariant :i4:u10:po5_1_1 + i4:u10:pol5_1_1 = 1
invariant :i3:u4:pi1_1_1 + i3:u4:pil1_1_1 = 1
invariant :i2:u3:pi6_1_1 + i2:u3:pil6_1_1 = 1
invariant :u0:pb1_1_1 + u0:pb2_1_1 + u0:pb3_1_1 + u0:pb4_1_1 + u0:pb5_1_1 + u0:pb6_1_1 + -1'i1:u2:pil4_1_1 + -1'i1:u9:pol4_1_1 + -1'i2:u3:pil6_1_1 + -1'i2:u12:pol6_1_1 + -1'i3:u4:pil1_1_1 + -1'i3:u7:pol1_1_1 + -1'i4:u6:pil5_1_1 + -1'i4:u10:pol5_1_1 + -1'i5:u5:pil2_1_1 + -1'i5:u8:pol2_1_1 + -1'i6:u1:pil3_1_1 + -1'i6:u11:pol3_1_1 = -6
invariant :i5:u5:pi2_1_1 + i5:u5:pil2_1_1 = 1
invariant :i5:u8:po2_1_1 + i5:u8:pol2_1_1 = 1
invariant :i3:u7:po1_1_1 + i3:u7:pol1_1_1 = 1
invariant :i6:u1:pi3_1_1 + i6:u1:pil3_1_1 = 1
invariant :i6:u11:po3_1_1 + i6:u11:pol3_1_1 = 1
invariant :i1:u9:po4_1_1 + i1:u9:pol4_1_1 = 1
invariant :i2:u12:po6_1_1 + i2:u12:pol6_1_1 = 1
invariant :u0:pbl_1_1 + i1:u2:pil4_1_1 + i1:u9:pol4_1_1 + i2:u3:pil6_1_1 + i2:u12:pol6_1_1 + i3:u4:pil1_1_1 + i3:u7:pol1_1_1 + i4:u6:pil5_1_1 + i4:u10:pol5_1_1 + i5:u5:pil2_1_1 + i5:u8:pol2_1_1 + i6:u1:pil3_1_1 + i6:u11:pol3_1_1 = 12
invariant :i4:u6:pi5_1_1 + i4:u6:pil5_1_1 = 1
invariant :i1:u2:pi4_1_1 + i1:u2:pil4_1_1 = 1
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.277097,25024,1,0,11260,12824,450,17439,245,55318,12907
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 USE_NUPN
Checking formula 2 : !((((X("((u0.pbl_1_1>=1)&&(i6.u1.pi3_1_1>=1))"))U("((u0.pbl_1_1>=1)&&(i5.u5.pi2_1_1>=1))"))U(G(X(X("((u0.pb6_1_1>=1)&&(i2.u12.pol6_1_1>=1))"))))))
Formula 2 simplified : !((X"((u0.pbl_1_1>=1)&&(i6.u1.pi3_1_1>=1))" U "((u0.pbl_1_1>=1)&&(i5.u5.pi2_1_1>=1))") U GXX"((u0.pb6_1_1>=1)&&(i2.u12.pol6_1_1>=1))")
6 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 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.313882,27996,1,0,13041,13175,493,20985,245,59267,14939
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 USE_NUPN
Checking formula 3 : !(("((u0.pbl_1_1>=1)&&(i4.u6.pi5_1_1>=1))"))
Formula 3 simplified : !"((u0.pbl_1_1>=1)&&(i4.u6.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
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.314895,28260,1,0,13075,13177,498,21013,245,59290,14986
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(F(G(F(X("((i5.u8.po2_1_1>=1)&&(i5.u5.pil2_1_1>=1))")))))))
Formula 4 simplified : !FGFX"((i5.u8.po2_1_1>=1)&&(i5.u5.pil2_1_1>=1))"
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,0.316231,28524,1,0,13103,13177,519,21041,245,59290,15058
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 USE_NUPN
Checking formula 5 : !((G(G(G(F("((i3.u4.pi1_1_1>=1)&&(u0.pbl_1_1>=1))"))))))
Formula 5 simplified : !GF"((i3.u4.pi1_1_1>=1)&&(u0.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
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.325758,28524,1,0,13317,13223,546,21432,245,59676,15388
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 USE_NUPN
Checking formula 6 : !((X(X(F(X(X("((u0.pbl_1_1>=1)&&(i3.u4.pi1_1_1>=1))")))))))
Formula 6 simplified : !XXFXX"((u0.pbl_1_1>=1)&&(i3.u4.pi1_1_1>=1))"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
77 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.09216,53076,1,0,39358,47482,561,97027,245,290935,33988
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(("((i5.u8.po2_1_1>=1)&&(i5.u5.pil2_1_1>=1))")U(F("((i1.u2.pi4_1_1>=1)&&(u0.pbl_1_1>=1))"))))))
Formula 7 simplified : !XX("((i5.u8.po2_1_1>=1)&&(i5.u5.pil2_1_1>=1))" U F"((i1.u2.pi4_1_1>=1)&&(u0.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
35 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.4365,63108,1,0,51292,55565,577,128249,245,369037,46656
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 USE_NUPN
Checking formula 8 : !((G("((u0.pbl_1_1>=1)&&(i6.u1.pi3_1_1>=1))")))
Formula 8 simplified : !G"((u0.pbl_1_1>=1)&&(i6.u1.pi3_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,1.43738,63372,1,0,51292,55565,577,128249,245,369037,46665
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 USE_NUPN
Checking formula 9 : !((F("((u0.pbl_1_1>=1)&&(i6.u1.pi3_1_1>=1))")))
Formula 9 simplified : !F"((u0.pbl_1_1>=1)&&(i6.u1.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
18 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.61622,68124,1,0,57207,63056,594,142699,245,412771,51573
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 USE_NUPN
Checking formula 10 : !((F(G(G(G(X("((u0.pb3_1_1>=1)&&(i6.u11.pol3_1_1>=1))")))))))
Formula 10 simplified : !FGX"((u0.pb3_1_1>=1)&&(i6.u11.pol3_1_1>=1))"
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 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,1.7453,69444,1,0,58057,64109,608,144917,245,421367,52404
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 USE_NUPN
Checking formula 11 : !((G(X(G(G(G("((i3.u7.po1_1_1>=1)&&(i3.u4.pil1_1_1>=1))")))))))
Formula 11 simplified : !GXG"((i3.u7.po1_1_1>=1)&&(i3.u4.pil1_1_1>=1))"
4 unique states visited
4 strongly connected components in search stack
4 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,1.76171,69972,1,0,58657,64212,630,145862,245,422567,53422
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 USE_NUPN
Checking formula 12 : !(((F(F(F("((u0.pbl_1_1>=1)&&(i4.u6.pi5_1_1>=1))"))))U("((i1.u2.pi4_1_1>=1)&&(u0.pbl_1_1>=1))")))
Formula 12 simplified : !(F"((u0.pbl_1_1>=1)&&(i4.u6.pi5_1_1>=1))" U "((i1.u2.pi4_1_1>=1)&&(u0.pbl_1_1>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
15 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.91665,75724,1,0,66405,71469,647,164003,245,468846,59995
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 USE_NUPN
Checking formula 13 : !(("((u0.pbl_1_1>=1)&&(i6.u1.pi3_1_1>=1))"))
Formula 13 simplified : !"((u0.pbl_1_1>=1)&&(i6.u1.pi3_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,1.91731,75988,1,0,66405,71469,647,164003,245,468846,59995
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 USE_NUPN
Checking formula 14 : !((X("((u0.pbl_1_1>=1)&&(i5.u5.pi2_1_1>=1))")))
Formula 14 simplified : !X"((u0.pbl_1_1>=1)&&(i5.u5.pi2_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,1.91768,75988,1,0,66405,71469,647,164003,245,468846,60003
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 USE_NUPN
Checking formula 15 : !(("((i1.u9.po4_1_1>=1)&&(i1.u2.pil4_1_1>=1))"))
Formula 15 simplified : !"((i1.u9.po4_1_1>=1)&&(i1.u2.pil4_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,1.91815,76252,1,0,66405,71469,647,164003,245,468846,60011
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA HexagonalGrid-PT-110-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1527918724990
--------------------
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 LTLFireability -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 LTLFireability -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
Jun 02, 2018 5:52:00 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/, -louvain, -smt]
Jun 02, 2018 5:52:00 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 5:52:00 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 48 ms
Jun 02, 2018 5:52:00 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 31 places.
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 42 transitions.
Jun 02, 2018 5:52:01 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 49 ms
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 21 ms
Begin: Sat Jun 2 05:52:01 2018
Computation of communities with the Newman-Girvan Modularity quality function
level 0:
start computation: Sat Jun 2 05:52:01 2018
network size: 31 nodes, 156 links, 84 weight
quality increased from -0.0705782 to 0.282313
end computation: Sat Jun 2 05:52:01 2018
level 1:
start computation: Sat Jun 2 05:52:01 2018
network size: 13 nodes, 49 links, 84 weight
quality increased from 0.282313 to 0.333333
end computation: Sat Jun 2 05:52:01 2018
level 2:
start computation: Sat Jun 2 05:52:01 2018
network size: 7 nodes, 19 links, 84 weight
quality increased from 0.333333 to 0.333333
end computation: Sat Jun 2 05:52:01 2018
End: Sat Jun 2 05:52:01 2018
Total duration: 0 sec
0.333333
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 16 ms
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 48 redundant transitions.
Jun 02, 2018 5:52:01 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Jun 02, 2018 5:52:01 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 42 transitions.
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 14 place invariants in 25 ms
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 31 variables to be positive in 246 ms
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 42 transitions.
Jun 02, 2018 5:52:01 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)
Jun 02, 2018 5:52:01 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)
Jun 02, 2018 5:52:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 42 transitions.
Jun 02, 2018 5:52:01 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)
Jun 02, 2018 5:52:03 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)
Jun 02, 2018 5:52:03 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2278ms 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="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/HexagonalGrid-PT-110.tgz
mv HexagonalGrid-PT-110 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 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 r213-smll-152732264200264"
echo "====================================================================="
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 '
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 ;