Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r107-oct2-155272230600313.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 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 itstools
Input is Parking-PT-104, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-oct2-155272230600313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.2K Feb 12 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 12 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 8 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 8 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 101 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 339 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.2K Feb 5 00:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K Feb 5 00:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 4 07:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 4 07:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 1 01:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 1 01:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:22 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 23K 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 Parking-PT-104-LTLFireability-00
FORMULA_NAME Parking-PT-104-LTLFireability-01
FORMULA_NAME Parking-PT-104-LTLFireability-02
FORMULA_NAME Parking-PT-104-LTLFireability-03
FORMULA_NAME Parking-PT-104-LTLFireability-04
FORMULA_NAME Parking-PT-104-LTLFireability-05
FORMULA_NAME Parking-PT-104-LTLFireability-06
FORMULA_NAME Parking-PT-104-LTLFireability-07
FORMULA_NAME Parking-PT-104-LTLFireability-08
FORMULA_NAME Parking-PT-104-LTLFireability-09
FORMULA_NAME Parking-PT-104-LTLFireability-10
FORMULA_NAME Parking-PT-104-LTLFireability-11
FORMULA_NAME Parking-PT-104-LTLFireability-12
FORMULA_NAME Parking-PT-104-LTLFireability-13
FORMULA_NAME Parking-PT-104-LTLFireability-14
FORMULA_NAME Parking-PT-104-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552922867879

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/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.201903111103/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(X(G(F(G("((u4.p8>=1)&&(u13.p51>=1))")))))))
Formula 0 simplified : !XXGFG"((u4.p8>=1)&&(u13.p51>=1))"
built 26 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t94, t95, u15.t3, u15.t4, u15.t5, u15.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :41/50/6/97
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.111603,21344,1,0,9971,941,685,12272,250,5343,20080
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X((X("((u12.p48>=1)&&(u14.p59>=1))"))U(X("(u2.p4>=1)"))))))
Formula 1 simplified : !FX(X"((u12.p48>=1)&&(u14.p59>=1))" U X"(u2.p4>=1)")
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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.123956,21856,1,0,10638,971,833,13196,259,5643,22104
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("(u10.p28>=1)"))
Formula 2 simplified : !"(u10.p28>=1)"
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 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.130668,22120,1,0,11018,979,877,13854,260,5762,23595
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(F((X("(u11.p37>=1)"))U(G("((u7.p13>=1)&&(u13.p57>=1))"))))))
Formula 3 simplified : !F(X"(u11.p37>=1)" U G"((u7.p13>=1)&&(u13.p57>=1))")
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.188076,24896,1,0,17482,1044,908,22659,260,6808,36811
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G(G(F("(u12.p45>=1)"))))))
Formula 4 simplified : !GF"(u12.p45>=1)"
Computing Next relation with stutter on 16 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.193846,25412,1,0,18021,1047,925,23175,261,6855,38778
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X("((u3.p6>=1)&&(u10.p26>=1))")))
Formula 5 simplified : !X"((u3.p6>=1)&&(u10.p26>=1))"
Computing Next relation with stutter on 16 deadlock states
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.194915,25672,1,0,18035,1047,930,23192,261,6855,38887
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((G(F("(u7.p14>=1)")))U(X(G("(u11.p36>=1)"))))))
Formula 6 simplified : !G(GF"(u7.p14>=1)" U XG"(u11.p36>=1)")
Computing Next relation with stutter on 16 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.238298,27864,1,0,22323,1104,976,27775,261,7799,48279
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((G(X("((u13.p49>=1)&&(u14.p60>=1))")))U(F(G("((u15.p64>=1)&&(u11.p38>=1))"))))))
Formula 7 simplified : !G(GX"((u13.p49>=1)&&(u14.p60>=1))" U FG"((u15.p64>=1)&&(u11.p38>=1))")
// Phase 1: matrix 56 rows 65 cols
Computing Next relation with stutter on 16 deadlock states
invariant :u10:p25 + u10:p26 + u10:p27 + u10:p28 + u10:p29 + u10:p30 + u10:p31 + u10:p32 + u16:p0 = 1
invariant :u7:p13 + u7:p14 + u16:p0 = 1
invariant :u9:p17 + u9:p18 + u9:p19 + u9:p20 + u9:p21 + u9:p22 + u9:p23 + -1'u10:p32 + -1'u11:p40 + -1'u12:p48 + -1'u13:p58 + -1'u14:p60 + -4'u16:p0 = -4
invariant :u8:p15 + u8:p16 + u16:p0 = 1
invariant :u3:p5 + u3:p6 + u16:p0 = 1
invariant :u14:p59 + u14:p60 + u16:p0 = 1
invariant :u9:p24 + u10:p32 + u11:p40 + u12:p48 + u13:p58 + u14:p60 + 5'u16:p0 = 5
invariant :u13:p49 + u13:p50 + u13:p51 + u13:p52 + u13:p53 + u13:p54 + u13:p55 + u13:p56 + u13:p57 + u13:p58 + u16:p0 = 1
invariant :u12:p41 + u12:p42 + u12:p43 + u12:p44 + u12:p45 + u12:p46 + u12:p47 + u12:p48 + u16:p0 = 1
invariant :u1:p1 + u1:p2 + u16:p0 = 1
invariant :u4:p7 + u4:p8 + u16:p0 = 1
invariant :u11:p33 + u11:p34 + u11:p35 + u11:p36 + u11:p37 + u11:p38 + u11:p39 + u11:p40 + u16:p0 = 1
invariant :u5:p9 + u5:p10 + u16:p0 = 1
invariant :u2:p3 + u2:p4 + u16:p0 = 1
invariant :u15:p61 + u15:p62 + u15:p63 + u15:p64 + u16:p0 = 1
invariant :u6:p11 + u6:p12 + u16:p0 = 1
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.263128,29060,1,0,24528,1117,1004,30618,261,8113,52904
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("((u12.p48>=1)&&(u14.p59>=1))"))
Formula 8 simplified : !"((u12.p48>=1)&&(u14.p59>=1))"
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.263679,29324,1,0,24528,1117,1011,30618,261,8113,52909
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F("(u15.p61>=1)")))
Formula 9 simplified : !F"(u15.p61>=1)"
Computing Next relation with stutter on 16 deadlock states
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,0.266735,29324,1,0,24784,1117,1030,31018,262,8210,53637
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F((G("((u6.p11>=1)&&(u11.p39>=1))"))U(X("((u8.p16>=1)&&(u13.p53>=1))"))))))
Formula 10 simplified : !XF(G"((u6.p11>=1)&&(u11.p39>=1))" U X"((u8.p16>=1)&&(u13.p53>=1))")
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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.279529,29852,1,0,26197,1117,1083,33422,262,8293,57791
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((X(X("((u3.p6>=1)&&(u10.p27>=1))")))U(X(X(G("(u9.p20>=1)"))))))
Formula 11 simplified : !(XX"((u3.p6>=1)&&(u10.p27>=1))" U XXG"(u9.p20>=1)")
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.297592,30652,1,0,26301,1127,1097,33637,262,8343,58376
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F((X(X("((u1.p1>=1)&&(u13.p54>=1))")))U(F(G("(u4.p8>=1)"))))))
Formula 12 simplified : !F(XX"((u1.p1>=1)&&(u13.p54>=1))" U FG"(u4.p8>=1)")
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.455143,38232,1,0,46359,1152,1118,57480,262,9413,92691
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(X(G(("(u11.p36>=1)")U("(u9.p20>=1)"))))))
Formula 13 simplified : !FXG("(u11.p36>=1)" U "(u9.p20>=1)")
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.461698,38716,1,0,46662,1159,1168,57865,262,9544,93745
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("((u2.p4>=1)&&(u13.p50>=1))"))
Formula 14 simplified : !"((u2.p4>=1)&&(u13.p50>=1))"
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.462261,38716,1,0,46662,1159,1173,57865,262,9544,93763
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((F(("((u15.p64>=1)&&(u12.p46>=1))")U("(u1.p2>=1)")))U("(u11.p36>=1)")))
Formula 15 simplified : !(F("((u15.p64>=1)&&(u12.p46>=1))" U "(u1.p2>=1)") U "(u11.p36>=1)")
Computing Next relation with stutter on 16 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.472149,38972,1,0,47475,1175,1223,59133,262,9813,95915
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Parking-PT-104-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, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552922870824

--------------------
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/ -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/ -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 18, 2019 3:27:49 PM 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/, -smt]
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 36 ms
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 65 places.
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 97 transitions.
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Mar 18, 2019 3:27:49 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 8 ms
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 33 ms
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 14 ms
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t61,
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t59,
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t75,
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 6 events :t67,t65,t63,t59,t59,t59,
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 8 events :t92,t92,t92,t92,t87,t87,t87,t87,
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 1 events :t72,
Mar 18, 2019 3:27:49 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 18 redundant transitions.
Mar 18, 2019 3:27:50 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 41 ms
Mar 18, 2019 3:27:50 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 18, 2019 3:27:50 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 18, 2019 3:27:50 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 41 identical transitions.
Mar 18, 2019 3:27:50 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 56 transitions.
Mar 18, 2019 3:27:50 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 16 place invariants in 14 ms
Mar 18, 2019 3:27:50 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 65 variables to be positive in 109 ms
Mar 18, 2019 3:27:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 56 transitions.
Mar 18, 2019 3:27:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/56 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 3:27:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 3:27:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 56 transitions.
Mar 18, 2019 3:27:50 PM 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 18, 2019 3:27:50 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Mar 18, 2019 3:27:50 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error
Mar 18, 2019 3:27:50 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (not (>= (select s0 19) 1))) with error
Mar 18, 2019 3:27:50 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (>= (select s1 19) 1)) with error
Mar 18, 2019 3:27:50 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 20) 1) (>= (select s0 63) 1)) (= (store (store (store (store s0 20 (- (select s0 20) 1)) 19 (+ (select s0 19) 1)) 60 (+ (select s0 60) 1)) 63 (- (select s0 63) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 20) 1) (>= (select s0 63) 1)) (= (store (store (store (store s0 20 (- (select s0 20) 1)) 19 (+ (select s0 19) 1)) 60 (+ (select s0 60) 1)) 63 (- (select s0 63) 1)) s1))")
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.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 18, 2019 3:27:50 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 546ms 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="Parking-PT-104"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstools"
echo " Input is Parking-PT-104, 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 r107-oct2-155272230600313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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