Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2019-input.r200-ebro-155286406200088.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is ResAllocation-PT-R005C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r200-ebro-155286406200088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.6K Feb 12 14:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 12 14:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 8 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 8 16:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 01:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 4 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 4 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 1 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 1 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 9 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 21K 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 ResAllocation-PT-R005C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R005C002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553668431202

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]

Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 12 rows 20 cols
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("((p_0_0>=1)&&(r_0_1>=1))")))
Formula 0 simplified : !X"((p_0_0>=1)&&(r_0_1>=1))"
Reverse transition relation is NOT exact ! Due to transitions t5, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/10/2/12
Computing Next relation with stutter on 4 deadlock states
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,0.054345,16520,1,0,41,1566,50,20,601,1582,49
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F((X(F("(r_0_0>=1)")))U("(((r_1_3>=1)&&(p_1_4>=1))&&(r_0_3>=1))"))))
Formula 1 simplified : !F(XF"(r_0_0>=1)" U "(((r_1_3>=1)&&(p_1_4>=1))&&(r_0_3>=1))")
Computing Next relation with stutter on 4 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.06074,16988,1,0,76,2257,59,54,606,2976,131
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((X(X(X("((p_0_1>=1)&&(r_0_2>=1))"))))U(F(F("((p_0_0>=1)&&(r_0_1>=1))")))))
Formula 2 simplified : !(XXX"((p_0_1>=1)&&(r_0_2>=1))" U F"((p_0_0>=1)&&(r_0_1>=1))")
invariant :p_0_0 + r_0_0 + -1'r_1_0 = 0
invariant :p_1_1 + r_1_1 = 1
invariant :p_1_0 + r_1_0 = 1
invariant :p_0_1 + r_0_1 + -1'r_1_1 = 0
invariant :p_0_4 + r_0_4 + -1'r_1_4 = 0
invariant :p_0_2 + r_0_2 + -1'r_1_2 = 0
invariant :p_1_3 + r_1_3 = 1
invariant :p_0_3 + r_0_3 + -1'r_1_3 = 0
invariant :p_1_4 + r_1_4 = 1
invariant :p_1_2 + r_1_2 = 1
Computing Next relation with stutter on 4 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.081584,17564,1,0,110,3007,65,87,606,4233,213
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(X(X(("(((r_1_3>=1)&&(p_1_4>=1))&&(r_0_3>=1))")U("(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))"))))))
Formula 3 simplified : !XXX("(((r_1_3>=1)&&(p_1_4>=1))&&(r_0_3>=1))" U "(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))")
Computing Next relation with stutter on 4 deadlock states
11 unique states visited
11 strongly connected components in search stack
11 transitions explored
11 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.090473,17748,1,0,152,3705,75,125,617,5734,341
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G((("((p_0_3>=1)&&(r_0_4>=1))")U("((p_0_1>=1)&&(r_0_2>=1))"))U(X("((r_1_4>=1)&&(r_0_4>=1))")))))
Formula 4 simplified : !G(("((p_0_3>=1)&&(r_0_4>=1))" U "((p_0_1>=1)&&(r_0_2>=1))") U X"((r_1_4>=1)&&(r_0_4>=1))")
Computing Next relation with stutter on 4 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.103468,19072,1,0,158,3988,88,130,630,6076,360
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(G(X("((p_0_2>=1)&&(r_0_3>=1))")))))
Formula 5 simplified : !GX"((p_0_2>=1)&&(r_0_3>=1))"
Computing Next relation with stutter on 4 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.104744,19072,1,0,158,4003,94,130,632,6091,367
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((G(F("((r_1_4>=1)&&(r_0_4>=1))")))U((F("(p_0_4>=1)"))U(G("((p_0_3>=1)&&(r_0_4>=1))")))))
Formula 6 simplified : !(GF"((r_1_4>=1)&&(r_0_4>=1))" U (F"(p_0_4>=1)" U G"((p_0_3>=1)&&(r_0_4>=1))"))
Computing Next relation with stutter on 4 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.120245,19804,1,0,163,4060,111,135,640,6222,399
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X(G(G(G(X("(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))")))))))
Formula 7 simplified : !XGX"(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))"
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.121676,19804,1,0,163,4068,115,135,641,6237,406
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(F("(((r_1_3>=1)&&(p_1_4>=1))&&(r_0_3>=1))"))))
Formula 8 simplified : !GF"(((r_1_3>=1)&&(p_1_4>=1))&&(r_0_3>=1))"
Computing Next relation with stutter on 4 deadlock states
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.127533,19804,1,0,200,4653,115,164,641,7171,482
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G("(p_1_0>=1)")))
Formula 9 simplified : !G"(p_1_0>=1)"
Computing Next relation with stutter on 4 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.128219,19956,1,0,200,4653,121,164,642,7171,487
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(("(p_0_4>=1)")U(X(X("((r_1_4>=1)&&(r_0_4>=1))"))))))
Formula 10 simplified : !G("(p_0_4>=1)" U XX"((r_1_4>=1)&&(r_0_4>=1))")
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.144709,20164,1,0,205,4704,122,170,642,7221,502
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(X(X(X(F("(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))")))))))
Formula 11 simplified : !GXXXF"(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))"
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.148925,20164,1,0,229,5252,128,195,642,7999,570
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((X(("(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))")U("(((r_1_1>=1)&&(p_1_2>=1))&&(r_0_1>=1))")))U((G("((p_0_0>=1)&&(r_0_1>=1))"))U(X("(((r_1_2>=1)&&(p_1_3>=1))&&(r_0_2>=1))")))))
Formula 12 simplified : !(X("(((r_1_0>=1)&&(p_1_1>=1))&&(r_0_0>=1))" U "(((r_1_1>=1)&&(p_1_2>=1))&&(r_0_1>=1))") U (G"((p_0_0>=1)&&(r_0_1>=1))" U X"(((r_1_2>=1)&&(p_1_3>=1))&&(r_0_2>=1))"))
Computing Next relation with stutter on 4 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.172583,20536,1,0,229,5252,151,195,672,8004,580
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((false))
Formula 13 simplified : 1
Computing Next relation with stutter on 4 deadlock states
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,0.172817,20536,1,0,229,5252,151,195,672,8004,580
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((G(F("((p_0_1>=1)&&(r_0_2>=1))")))U(X(("((p_0_3>=1)&&(r_0_4>=1))")U("(p_1_0>=1)")))))
Formula 14 simplified : !(GF"((p_0_1>=1)&&(r_0_2>=1))" U X("((p_0_3>=1)&&(r_0_4>=1))" U "(p_1_0>=1)"))
Computing Next relation with stutter on 4 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.197066,20536,1,0,262,5998,164,228,677,9697,659
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(("(((r_1_2>=1)&&(p_1_3>=1))&&(r_0_2>=1))")U(G(F("(p_0_4>=1)"))))))
Formula 15 simplified : !G("(((r_1_2>=1)&&(p_1_3>=1))&&(r_0_2>=1))" U GF"(p_0_4>=1)")
Computing Next relation with stutter on 4 deadlock states
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.203487,20536,1,0,262,5998,170,228,677,9697,665
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-LTLFireability-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 1553668436312

--------------------
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 27, 2019 6:33:54 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 27, 2019 6:33:54 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 6:33:54 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 54 ms
Mar 27, 2019 6:33:54 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 20 places.
Mar 27, 2019 6:33:55 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 12 transitions.
Mar 27, 2019 6:33:55 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Mar 27, 2019 6:33:55 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 43 ms
Mar 27, 2019 6:33:55 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 52 ms
Mar 27, 2019 6:33:55 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 12 transitions.
Mar 27, 2019 6:33:55 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 20 places.
Mar 27, 2019 6:33:55 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 12 transitions.
Mar 27, 2019 6:33:55 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 12 transitions.
Mar 27, 2019 6:33:55 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Mar 27, 2019 6:33:55 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 8 ms
Mar 27, 2019 6:33:55 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 43 ms
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 27, 2019 6:33:55 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 372ms 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="ResAllocation-PT-R005C002"
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 ResAllocation-PT-R005C002, 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 r200-ebro-155286406200088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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