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-159033389200714.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-R015C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200714
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.4K May 14 00:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 00:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 17:36 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 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 07:35 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 64K 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-R015C002-00
FORMULA_NAME ResAllocation-PT-R015C002-01
FORMULA_NAME ResAllocation-PT-R015C002-02
FORMULA_NAME ResAllocation-PT-R015C002-03
FORMULA_NAME ResAllocation-PT-R015C002-04
FORMULA_NAME ResAllocation-PT-R015C002-05
FORMULA_NAME ResAllocation-PT-R015C002-06
FORMULA_NAME ResAllocation-PT-R015C002-07
FORMULA_NAME ResAllocation-PT-R015C002-08
FORMULA_NAME ResAllocation-PT-R015C002-09
FORMULA_NAME ResAllocation-PT-R015C002-10
FORMULA_NAME ResAllocation-PT-R015C002-11
FORMULA_NAME ResAllocation-PT-R015C002-12
FORMULA_NAME ResAllocation-PT-R015C002-13
FORMULA_NAME ResAllocation-PT-R015C002-14
FORMULA_NAME ResAllocation-PT-R015C002-15

=== Now, execution of the tool begins

BK_START 1590556232616

[2020-05-27 05:10:34] [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:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:34] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2020-05-27 05:10:34] [INFO ] Transformed 60 places.
[2020-05-27 05:10:34] [INFO ] Transformed 32 transitions.
[2020-05-27 05:10:34] [INFO ] Parsed PT model containing 60 places and 32 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1452 resets, run finished after 195 ms. (steps per millisecond=512 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 32 rows 60 cols
[2020-05-27 05:10:34] [INFO ] Computed 30 place invariants in 5 ms
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 39 ms returned sat
[2020-05-27 05:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-05-27 05:10:35] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 7 ms.
[2020-05-27 05:10:35] [INFO ] Added : 13 causal constraints over 3 iterations in 46 ms. Result :sat
[2020-05-27 05:10:35] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-27 05:10:35] [INFO ] Flatten gal took : 43 ms
FORMULA ResAllocation-PT-R015C002-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 05:10:35] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 05:10:35] [INFO ] Applying decomposition
[2020-05-27 05:10:35] [INFO ] Flatten gal took : 15 ms
[2020-05-27 05:10:35] [INFO ] Input system was already deterministic with 32 transitions.
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/graph17670977777577657915.txt, -o, /tmp/graph17670977777577657915.bin, -w, /tmp/graph17670977777577657915.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 32 rows 60 cols
[2020-05-27 05:10:35] [INFO ] Computed 30 place invariants in 7 ms
inv : p_1_0 + r_1_0 = 1
inv : p_0_11 + r_0_11 + p_1_11 = 1
inv : p_0_7 + r_0_7 + p_1_7 = 1
inv : p_1_5 + r_1_5 = 1
inv : p_1_1 + r_1_1 = 1
inv : p_0_6 + r_0_6 + p_1_6 = 1
inv : p_1_11 + r_1_11 = 1
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_0_10 + r_0_10 + p_1_10 = 1
inv : p_1_4 + r_1_4 = 1
inv : p_1_12 + r_1_12 = 1
inv : p_0_12 + r_0_12 + p_1_12 = 1
inv : p_0_3 + r_0_3 + p_1_3 = 1
inv : p_0_4 + r_0_4 + p_1_4 = 1
inv : p_1_8 + r_1_8 = 1
inv : p_0_9 + r_0_9 + p_1_9 = 1
inv : p_0_5 + r_0_5 + p_1_5 = 1
inv : p_0_13 + r_0_13 + p_1_13 = 1
inv : p_1_3 + r_1_3 = 1
inv : p_1_13 + r_1_13 = 1
inv : p_1_7 + r_1_7 = 1
inv : p_1_9 + r_1_9 = 1
inv : p_0_8 + r_0_8 + p_1_8 = 1
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_0_14 + r_0_14 + p_1_14 = 1
inv : p_1_6 + r_1_6 = 1
inv : p_1_2 + r_1_2 = 1
inv : p_1_14 + r_1_14 = 1
inv : p_1_10 + r_1_10 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
Total of 30 invariants.
[2020-05-27 05:10:35] [INFO ] Computed 30 place invariants in 12 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph17670977777577657915.bin, -l, -1, -v, -w, /tmp/graph17670977777577657915.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:10:35] [INFO ] Decomposing Gal with order
[2020-05-27 05:10:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:10:35] [INFO ] Flatten gal took : 46 ms
[2020-05-27 05:10:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-27 05:10:35] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-27 05:10:35] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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 14 LTL properties
Checking formula 0 : !((!(F(!(F("(((i3.i0.u9.r_0_9<1)||(i3.i0.u24.r_1_9<1))||(i3.i1.u25.p_1_10<1))"))))))
Formula 0 simplified : F!F"(((i3.i0.u9.r_0_9<1)||(i3.i0.u24.r_1_9<1))||(i3.i1.u25.p_1_10<1))"
[2020-05-27 05:10:35] [INFO ] Proved 60 variables to be positive in 197 ms
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-27 05:10:35] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2020-05-27 05:10:35] [INFO ] Computation of disable matrix completed :0/32 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:35] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2020-05-27 05:10:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.t_1_0, i4.i1.u14.t_0_15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.111491,19224,1,0,7110,27,531,8415,51,28,9439
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R015C002-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(X((!(X(F(!(F("((i3.i0.u8.p_0_8>=1)&&(i3.i0.u9.r_0_9>=1))"))))))U((G("((i3.i0.u8.p_0_8>=1)&&(i3.i0.u9.r_0_9>=1))"))||("(((i0.u1.r_0_1>=1)&&(i0.u16.r_1_1>=1))&&(i1.u17.p_1_2>=1))")))))))
Formula 1 simplified : !GXX(!XF!F"((i3.i0.u8.p_0_8>=1)&&(i3.i0.u9.r_0_9>=1))" U ("(((i0.u1.r_0_1>=1)&&(i0.u16.r_1_1>=1))&&(i1.u17.p_1_2>=1))" | G"((i3.i0.u8.p_0_8>=1)&&(i3.i0.u9.r_0_9>=1))"))
Computing Next relation with stutter on 14 deadlock states
97 unique states visited
97 strongly connected components in search stack
98 transitions explored
97 items max in DFS search stack
28 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.389082,26520,1,0,21072,27,594,28481,51,28,22539
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(F("(((i3.i0.u9.r_0_9>=1)&&(i3.i0.u24.r_1_9>=1))&&(i3.i1.u25.p_1_10>=1))")))&&(X(F(!(X(F(X(G("(((i3.i1.u11.r_0_11>=1)&&(i3.i1.u26.r_1_11>=1))&&(i4.i0.u27.p_1_12>=1))"))))))))))
Formula 2 simplified : !(GF"(((i3.i0.u9.r_0_9>=1)&&(i3.i0.u24.r_1_9>=1))&&(i3.i1.u25.p_1_10>=1))" & XF!XFXG"(((i3.i1.u11.r_0_11>=1)&&(i3.i1.u26.r_1_11>=1))&&(i4.i0.u27.p_1_12>=1))")
Computing Next relation with stutter on 14 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.46956,28948,1,0,26298,27,618,33277,51,28,27666
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(X((F("(((i0.u1.r_0_1>=1)&&(i0.u16.r_1_1>=1))&&(i1.u17.p_1_2>=1))"))&&(G("(((i0.u1.r_0_1>=1)&&(i0.u16.r_1_1>=1))&&(i1.u17.p_1_2>=1))")))))))
Formula 3 simplified : !FGX(F"(((i0.u1.r_0_1>=1)&&(i0.u16.r_1_1>=1))&&(i1.u17.p_1_2>=1))" & G"(((i0.u1.r_0_1>=1)&&(i0.u16.r_1_1>=1))&&(i1.u17.p_1_2>=1))")
Computing Next relation with stutter on 14 deadlock states
3 unique states visited
2 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.472831,29164,1,0,26380,27,618,33401,51,28,27983
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X("(((i3.i0.u9.r_0_9>=1)&&(i3.i0.u24.r_1_9>=1))&&(i3.i1.u25.p_1_10>=1))"))))
Formula 4 simplified : !GX"(((i3.i0.u9.r_0_9>=1)&&(i3.i0.u24.r_1_9>=1))&&(i3.i1.u25.p_1_10>=1))"
Computing Next relation with stutter on 14 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.475135,29164,1,0,26433,27,628,33448,51,28,28157
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((!(X("(((i1.u3.r_0_3>=1)&&(i1.u18.r_1_3>=1))&&(i1.u19.p_1_4>=1))")))&&(G(F((G("(((i1.u3.r_0_3>=1)&&(i1.u18.r_1_3>=1))&&(i1.u19.p_1_4>=1))"))U(G("(((i2.u6.r_0_6>=1)&&(i2.u21.r_1_6>=1))&&(i2.u22.p_1_7>=1))"))))))))
Formula 5 simplified : !G(!X"(((i1.u3.r_0_3>=1)&&(i1.u18.r_1_3>=1))&&(i1.u19.p_1_4>=1))" & GF(G"(((i1.u3.r_0_3>=1)&&(i1.u18.r_1_3>=1))&&(i1.u19.p_1_4>=1))" U G"(((i2.u6.r_0_6>=1)&&(i2.u21.r_1_6>=1))&&(i2.u22.p_1_7>=1))"))
Computing Next relation with stutter on 14 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.480659,29608,1,0,26683,27,668,34018,51,28,28781
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(!(X(F((F("((i3.i1.u11.p_0_11<1)||(i4.i0.u12.r_0_12<1))"))&&((F("(((i0.u0.r_0_0>=1)&&(i0.u15.r_1_0>=1))&&(i0.u16.p_1_1>=1))"))||(F("(((i3.i0.u8.r_0_8>=1)&&(i3.i0.u23.r_1_8>=1))&&(i3.i0.u24.p_1_9>=1))")))))))))
Formula 6 simplified : !G!XF(F"((i3.i1.u11.p_0_11<1)||(i4.i0.u12.r_0_12<1))" & (F"(((i0.u0.r_0_0>=1)&&(i0.u15.r_1_0>=1))&&(i0.u16.p_1_1>=1))" | F"(((i3.i0.u8.r_0_8>=1)&&(i3.i0.u23.r_1_8>=1))&&(i3.i0.u24.p_1_9>=1))"))
Computing Next relation with stutter on 14 deadlock states
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.513748,31532,1,0,29740,27,753,39058,51,28,33285
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(((((((((F("(i0.u0.r_0_0>=1)"))&&("(i0.u0.r_0_0>=1)"))&&("(i1.u3.r_0_3>=1)"))&&("(i1.u18.r_1_3>=1)"))&&("(i1.u19.p_1_4>=1)"))&&("(i3.i1.u10.r_0_10>=1)"))&&("(i3.i1.u25.r_1_10>=1)"))&&("(i3.i1.u26.p_1_11>=1)"))&&((F("(((i4.i0.u13.r_0_13>=1)&&(i4.i0.u28.r_1_13>=1))&&(i4.i1.u29.p_1_14>=1))"))||(G("(i0.u0.r_0_0>=1)"))))))
Formula 7 simplified : !X("(i0.u0.r_0_0>=1)" & "(i1.u3.r_0_3>=1)" & "(i1.u18.r_1_3>=1)" & "(i1.u19.p_1_4>=1)" & "(i3.i1.u10.r_0_10>=1)" & "(i3.i1.u25.r_1_10>=1)" & "(i3.i1.u26.p_1_11>=1)" & F"(i0.u0.r_0_0>=1)" & (F"(((i4.i0.u13.r_0_13>=1)&&(i4.i0.u28.r_1_13>=1))&&(i4.i1.u29.p_1_14>=1))" | G"(i0.u0.r_0_0>=1)"))
Computing Next relation with stutter on 14 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.519635,31808,1,0,29740,27,853,39058,51,28,33404
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(X(X((F("((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))"))U(F("(((i1.u4.r_0_4>=1)&&(i1.u19.r_1_4>=1))&&(i2.u20.p_1_5>=1))"))))))))
Formula 8 simplified : !FXXX(F"((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))" U F"(((i1.u4.r_0_4>=1)&&(i1.u19.r_1_4>=1))&&(i2.u20.p_1_5>=1))")
Computing Next relation with stutter on 14 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.549771,32300,1,0,31985,27,883,42876,51,28,37451
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(((!(G("(((i3.i1.u11.r_0_11>=1)&&(i3.i1.u26.r_1_11>=1))&&(i4.i0.u27.p_1_12>=1))")))||(!(G(X("(((i1.u4.r_0_4>=1)&&(i1.u19.r_1_4>=1))&&(i2.u20.p_1_5>=1))")))))U(F((G("(((i3.i1.u11.r_0_11>=1)&&(i3.i1.u26.r_1_11>=1))&&(i4.i0.u27.p_1_12>=1))"))||("(((i3.i0.u8.r_0_8>=1)&&(i3.i0.u23.r_1_8>=1))&&(i3.i0.u24.p_1_9>=1))"))))))
Formula 9 simplified : !F((!G"(((i3.i1.u11.r_0_11>=1)&&(i3.i1.u26.r_1_11>=1))&&(i4.i0.u27.p_1_12>=1))" | !GX"(((i1.u4.r_0_4>=1)&&(i1.u19.r_1_4>=1))&&(i2.u20.p_1_5>=1))") U F("(((i3.i0.u8.r_0_8>=1)&&(i3.i0.u23.r_1_8>=1))&&(i3.i0.u24.p_1_9>=1))" | G"(((i3.i1.u11.r_0_11>=1)&&(i3.i1.u26.r_1_11>=1))&&(i4.i0.u27.p_1_12>=1))"))
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
19 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.754824,37580,1,0,42451,27,923,58986,51,28,45434
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((!(F("((i1.u4.p_0_4>=1)&&(i2.u5.r_0_5>=1))")))||("((i3.i0.u9.p_0_9>=1)&&(i3.i1.u10.r_0_10>=1))"))))
Formula 10 simplified : !X("((i3.i0.u9.p_0_9>=1)&&(i3.i1.u10.r_0_10>=1))" | !F"((i1.u4.p_0_4>=1)&&(i2.u5.r_0_5>=1))")
Computing Next relation with stutter on 14 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.775489,38636,1,0,44332,27,956,61975,51,28,48773
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(G(!(F(G(("(((i2.u5.r_0_5>=1)&&(i2.u20.r_1_5>=1))&&(i2.u21.p_1_6>=1))")U(X("((i2.u5.p_0_5>=1)&&(i2.u6.r_0_6>=1))")))))))))
Formula 11 simplified : G!FG("(((i2.u5.r_0_5>=1)&&(i2.u20.r_1_5>=1))&&(i2.u21.p_1_6>=1))" U X"((i2.u5.p_0_5>=1)&&(i2.u6.r_0_6>=1))")
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 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.784127,38900,1,0,44753,27,1002,63478,51,28,49620
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(F("(((i1.u3.r_0_3>=1)&&(i1.u18.r_1_3>=1))&&(i1.u19.p_1_4>=1))")))U("(((i0.u1.r_0_1>=1)&&(i0.u16.r_1_1>=1))&&(i1.u17.p_1_2>=1))")))
Formula 12 simplified : !(XF"(((i1.u3.r_0_3>=1)&&(i1.u18.r_1_3>=1))&&(i1.u19.p_1_4>=1))" U "(((i0.u1.r_0_1>=1)&&(i0.u16.r_1_1>=1))&&(i1.u17.p_1_2>=1))")
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.820508,39956,1,0,47708,27,1018,67578,51,28,54600
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X((("((i4.i0.u12.p_0_12>=1)&&(i4.i0.u13.r_0_13>=1))")U(X("((i4.i0.u12.p_0_12>=1)&&(i4.i0.u13.r_0_13>=1))")))&&(((G("((i2.u5.p_0_5>=1)&&(i2.u6.r_0_6>=1))"))U("((i3.i0.u9.p_0_9>=1)&&(i3.i1.u10.r_0_10>=1))"))||("((i3.i0.u9.p_0_9>=1)&&(i3.i1.u10.r_0_10>=1))")))))
Formula 13 simplified : !X(("((i4.i0.u12.p_0_12>=1)&&(i4.i0.u13.r_0_13>=1))" U X"((i4.i0.u12.p_0_12>=1)&&(i4.i0.u13.r_0_13>=1))") & ("((i3.i0.u9.p_0_9>=1)&&(i3.i1.u10.r_0_10>=1))" | (G"((i2.u5.p_0_5>=1)&&(i2.u6.r_0_6>=1))" U "((i3.i0.u9.p_0_9>=1)&&(i3.i1.u10.r_0_10>=1))")))
Computing Next relation with stutter on 14 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.823866,40220,1,0,47708,27,1038,67578,51,28,54637
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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:36] [INFO ] Built C files in 1245ms 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 1590556237041

--------------------
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-R015C002"
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-R015C002, 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-159033389200714"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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