Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389200698.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-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-4028
Executing tool itstools
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 r193-csrt-159033389200698
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.8K May 14 00:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 00:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 17:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 17:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 13 07:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 07:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 22K May 12 20:53 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-00
FORMULA_NAME ResAllocation-PT-R005C002-01
FORMULA_NAME ResAllocation-PT-R005C002-02
FORMULA_NAME ResAllocation-PT-R005C002-03
FORMULA_NAME ResAllocation-PT-R005C002-04
FORMULA_NAME ResAllocation-PT-R005C002-05
FORMULA_NAME ResAllocation-PT-R005C002-06
FORMULA_NAME ResAllocation-PT-R005C002-07
FORMULA_NAME ResAllocation-PT-R005C002-08
FORMULA_NAME ResAllocation-PT-R005C002-09
FORMULA_NAME ResAllocation-PT-R005C002-10
FORMULA_NAME ResAllocation-PT-R005C002-11
FORMULA_NAME ResAllocation-PT-R005C002-12
FORMULA_NAME ResAllocation-PT-R005C002-13
FORMULA_NAME ResAllocation-PT-R005C002-14
FORMULA_NAME ResAllocation-PT-R005C002-15

=== Now, execution of the tool begins

BK_START 1590556214760

[2020-05-27 05:10:17] [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, -timeout, 3600]
[2020-05-27 05:10:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:17] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2020-05-27 05:10:17] [INFO ] Transformed 20 places.
[2020-05-27 05:10:17] [INFO ] Transformed 12 transitions.
[2020-05-27 05:10:17] [INFO ] Parsed PT model containing 20 places and 12 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 166 steps, including 14 resets, run visited all 29 properties in 13 ms. (steps per millisecond=12 )
[2020-05-27 05:10:18] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-27 05:10:18] [INFO ] Flatten gal took : 67 ms
FORMULA ResAllocation-PT-R005C002-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R005C002-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 05:10:18] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 05:10:18] [INFO ] Applying decomposition
[2020-05-27 05:10:18] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph3372542249509185081.txt, -o, /tmp/graph3372542249509185081.bin, -w, /tmp/graph3372542249509185081.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph3372542249509185081.bin, -l, -1, -v, -w, /tmp/graph3372542249509185081.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:10:18] [INFO ] Input system was already deterministic with 12 transitions.
[2020-05-27 05:10:18] [INFO ] Decomposing Gal with order
[2020-05-27 05:10:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:10:18] [INFO ] Flatten gal took : 42 ms
[2020-05-27 05:10:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-27 05:10:18] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-27 05:10:18] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 12 rows 20 cols
[2020-05-27 05:10:18] [INFO ] Computed 10 place invariants in 4 ms
inv : p_0_3 + r_0_3 + p_1_3 = 1
inv : p_1_2 + r_1_2 = 1
inv : p_1_3 + r_1_3 = 1
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_0_4 + r_0_4 + p_1_4 = 1
inv : p_1_1 + r_1_1 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
inv : p_1_4 + r_1_4 = 1
inv : p_1_0 + r_1_0 = 1
Total of 10 invariants.
[2020-05-27 05:10:18] [INFO ] Computed 10 place invariants in 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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.202005100927/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 11 LTL properties
Checking formula 0 : !((G((!(F("(i1.u4.p_0_4>=1)")))||("(i2.u5.p_1_0<1)"))))
Formula 0 simplified : !G("(i2.u5.p_1_0<1)" | !F"(i1.u4.p_0_4>=1)")
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i1.u4.t_0_5, i2.t_1_0, 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
6 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.042651,16956,1,0,674,33,315,1040,51,62,1751
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(G(F("(i1.u4.p_0_4>=1)"))))U(X(G(("(i1.u4.p_0_4>=1)")U(X("(i1.u4.p_0_4<1)")))))))
Formula 1 simplified : !(XGF"(i1.u4.p_0_4>=1)" U XG("(i1.u4.p_0_4>=1)" U X"(i1.u4.p_0_4<1)"))
Computing Next relation with stutter on 4 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.04975,18908,1,0,685,33,326,1065,53,62,1811
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(!(((F(X(G("((i2.u1.p_0_1>=1)&&(i0.u2.r_0_2>=1))"))))||(X(G("((i2.u1.p_0_1>=1)&&(i0.u2.r_0_2>=1))"))))U(G("(((i0.u3.r_0_3>=1)&&(i3.u8.r_1_3>=1))&&(i1.u9.p_1_4>=1))"))))))
Formula 2 simplified : !F!((XG"((i2.u1.p_0_1>=1)&&(i0.u2.r_0_2>=1))" | FXG"((i2.u1.p_0_1>=1)&&(i0.u2.r_0_2>=1))") U G"(((i0.u3.r_0_3>=1)&&(i3.u8.r_1_3>=1))&&(i1.u9.p_1_4>=1))")
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
0 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.052083,18908,1,0,784,35,371,1162,53,68,2156
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R005C002-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G(("(i2.u0.r_0_0>=1)")U("((i1.u4.r_0_4<1)||(i1.u9.r_1_4<1))")))||(G("(i2.u0.r_0_0<1)"))))
Formula 3 simplified : !(G("(i2.u0.r_0_0>=1)" U "((i1.u4.r_0_4<1)||(i1.u9.r_1_4<1))") | G"(i2.u0.r_0_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.058664,19040,1,0,1200,35,449,1612,60,68,3186
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!((("(((i2.u0.r_0_0>=1)&&(i2.u5.r_1_0>=1))&&(i3.u6.p_1_1>=1))")U("((i1.u4.r_0_4>=1)&&(i1.u9.r_1_4>=1))"))U((F(!(G(X("(i2.u0.r_0_0>=1)")))))||("(((i2.u0.r_0_0>=1)&&(i2.u5.r_1_0>=1))&&(i3.u6.p_1_1>=1))")))))
Formula 4 simplified : ("(((i2.u0.r_0_0>=1)&&(i2.u5.r_1_0>=1))&&(i3.u6.p_1_1>=1))" U "((i1.u4.r_0_4>=1)&&(i1.u9.r_1_4>=1))") U ("(((i2.u0.r_0_0>=1)&&(i2.u5.r_1_0>=1))&&(i3.u6.p_1_1>=1))" | F!GX"(i2.u0.r_0_0>=1)")
Computing Next relation with stutter on 4 deadlock states
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 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.063741,19040,1,0,1435,35,518,1890,60,68,3928
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X((F((F(!(X("(i2.u5.p_1_0>=1)"))))&&(G("(i1.u4.p_0_4>=1)"))))U(X("(((i0.u3.r_0_3>=1)&&(i3.u8.r_1_3>=1))&&(i1.u9.p_1_4>=1))"))))))
Formula 5 simplified : !FX(F(F!X"(i2.u5.p_1_0>=1)" & G"(i1.u4.p_0_4>=1)") U X"(((i0.u3.r_0_3>=1)&&(i3.u8.r_1_3>=1))&&(i1.u9.p_1_4>=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.0667,19252,1,0,1752,35,534,2216,60,68,4597
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((X("((i0.u3.p_0_3>=1)&&(i1.u4.r_0_4>=1))"))U(F(G(!(X("((i2.u0.p_0_0<1)||(i2.u1.r_0_1<1))"))))))))
Formula 6 simplified : !X(X"((i0.u3.p_0_3>=1)&&(i1.u4.r_0_4>=1))" U FG!X"((i2.u0.p_0_0<1)||(i2.u1.r_0_1<1))")
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 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.068151,19252,1,0,1773,35,548,2288,60,68,4702
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G(X(((X("(((i0.u3.r_0_3>=1)&&(i3.u8.r_1_3>=1))&&(i1.u9.p_1_4>=1))"))U(F("(i1.u4.p_0_4>=1)")))||("(i1.u4.p_0_4>=1)"))))||(F(X(X("(i1.u4.p_0_4>=1)"))))))
Formula 7 simplified : !(GX("(i1.u4.p_0_4>=1)" | (X"(((i0.u3.r_0_3>=1)&&(i3.u8.r_1_3>=1))&&(i1.u9.p_1_4>=1))" U F"(i1.u4.p_0_4>=1)")) | FXX"(i1.u4.p_0_4>=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.06971,19252,1,0,1842,35,548,2416,60,68,4925
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(F(!(G(F(X(!(("(((i2.u0.r_0_0<1)||(i2.u5.r_1_0<1))||(i3.u6.p_1_1<1))")U(!(("(i1.u4.p_0_4>=1)")U("((i2.u1.p_0_1>=1)&&(i0.u2.r_0_2>=1))"))))))))))))
Formula 8 simplified : F!GFX!("(((i2.u0.r_0_0<1)||(i2.u5.r_1_0<1))||(i3.u6.p_1_1<1))" U !("(i1.u4.p_0_4>=1)" U "((i2.u1.p_0_1>=1)&&(i0.u2.r_0_2>=1))"))
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
2 strongly connected components in search stack
7 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.080815,19488,1,0,2718,35,581,3386,60,72,6754
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((F((F("((i2.u1.p_0_1>=1)&&(i0.u2.r_0_2>=1))"))U(F(G("(i2.u0.r_0_0<1)")))))&&(!(G("(i2.u0.r_0_0>=1)"))))))
Formula 9 simplified : !X(F(F"((i2.u1.p_0_1>=1)&&(i0.u2.r_0_2>=1))" U FG"(i2.u0.r_0_0<1)") & !G"(i2.u0.r_0_0>=1)")
Computing Next relation with stutter on 4 deadlock states
5 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.085341,19740,1,0,2957,35,599,3664,60,72,7325
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F((((X(X(X(((F("(((i2.u1.r_0_1>=1)&&(i3.u6.r_1_1>=1))&&(i3.u7.p_1_2>=1))"))&&("(i1.u4.r_0_4>=1)"))&&("(i1.u9.r_1_4>=1)")))))&&("(i2.u1.r_0_1>=1)"))&&("(i3.u6.r_1_1>=1)"))&&("(i3.u7.p_1_2>=1)")))||(G("((i2.u1.p_0_1>=1)&&(i0.u2.r_0_2>=1))"))))
Formula 10 simplified : !(F("(i2.u1.r_0_1>=1)" & "(i3.u6.r_1_1>=1)" & "(i3.u7.p_1_2>=1)" & XXX("(i1.u4.r_0_4>=1)" & "(i1.u9.r_1_4>=1)" & F"(((i2.u1.r_0_1>=1)&&(i3.u6.r_1_1>=1))&&(i3.u7.p_1_2>=1))")) | G"((i2.u1.p_0_1>=1)&&(i0.u2.r_0_2>=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
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.130761,20408,1,0,3182,35,707,3891,64,72,7874
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R005C002-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-27 05:10:19] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
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.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 05:10:19] [INFO ] Built C files in 464ms conformant to PINS in folder :/home/mcc/execution
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 1590556219554

--------------------
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 -timeout 3600
+ 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 -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="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-4028"
echo " Executing tool itstools"
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 r193-csrt-159033389200698"
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" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; 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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;