Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
............................
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 81K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is ResAllocation-PT-R020C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-qhx2-152732141000154
=====================================================================

--------------------
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-R020C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1528325991508

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph3109135196639363050.txt, -o, /tmp/graph3109135196639363050.bin, -w, /tmp/graph3109135196639363050.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph3109135196639363050.bin, -l, -1, -v, -w, /tmp/graph3109135196639363050.weights, -q, 0, -e, 0.001], workingDir=null]
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("(((i2.u25.r_1_5>=1)&&(i2.u26.p_1_6>=1))&&(i2.u5.r_0_5>=1))"))
Formula 0 simplified : !"(((i2.u25.r_1_5>=1)&&(i2.u26.p_1_6>=1))&&(i2.u5.r_0_5>=1))"
built 13 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t_1_0, i6.u19.t_0_20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/2/42
Computing Next relation with stutter on 19 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.18639,17896,1,0,3610,43,570,5647,49,38,6833
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("(((i0.u21.r_1_1>=1)&&(i1.u22.p_1_2>=1))&&(i0.u1.r_0_1>=1))"))
Formula 1 simplified : !"(((i0.u21.r_1_1>=1)&&(i1.u22.p_1_2>=1))&&(i0.u1.r_0_1>=1))"
Computing Next relation with stutter on 19 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.188963,18264,1,0,3610,43,584,5647,49,38,6845
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X(X("(((i3.u28.r_1_8>=1)&&(i3.u29.p_1_9>=1))&&(i3.u8.r_0_8>=1))")))))
Formula 2 simplified : !XXX"(((i3.u28.r_1_8>=1)&&(i3.u29.p_1_9>=1))&&(i3.u8.r_0_8>=1))"
Computing Next relation with stutter on 19 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.196063,18740,1,0,4026,43,593,6411,49,38,8198
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((i3.u30.r_1_10>=1)&&(i4.u31.p_1_11>=1))&&(i3.u10.r_0_10>=1))"))
Formula 3 simplified : !"(((i3.u30.r_1_10>=1)&&(i4.u31.p_1_11>=1))&&(i3.u10.r_0_10>=1))"
Computing Next relation with stutter on 19 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.196535,18740,1,0,4026,43,608,6411,49,38,8206
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X("(i0.u0.r_0_0>=1)"))U((F("((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))"))U(G("(((i6.u36.r_1_16>=1)&&(i6.u37.p_1_17>=1))&&(i6.u16.r_0_16>=1))")))))
Formula 4 simplified : !(X"(i0.u0.r_0_0>=1)" U (F"((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))" U G"(((i6.u36.r_1_16>=1)&&(i6.u37.p_1_17>=1))&&(i6.u16.r_0_16>=1))"))
Computing Next relation with stutter on 19 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.219088,20372,1,0,4283,43,643,7001,49,38,8877
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G((X("(((i3.u29.r_1_9>=1)&&(i3.u30.p_1_10>=1))&&(i3.u9.r_0_9>=1))"))U(F("(((i6.u38.r_1_18>=1)&&(i6.u39.p_1_19>=1))&&(i6.u18.r_0_18>=1))"))))))
Formula 5 simplified : !XG(X"(((i3.u29.r_1_9>=1)&&(i3.u30.p_1_10>=1))&&(i3.u9.r_0_9>=1))" U F"(((i6.u38.r_1_18>=1)&&(i6.u39.p_1_19>=1))&&(i6.u18.r_0_18>=1))")
Computing Next relation with stutter on 19 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
31 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.534486,29304,1,0,28474,43,671,23812,49,38,32937
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X("(((i4.u31.r_1_11>=1)&&(i4.u32.p_1_12>=1))&&(i4.u11.r_0_11>=1))"))U(X(G(X("(((i5.u33.r_1_13>=1)&&(i5.u34.p_1_14>=1))&&(i5.u13.r_0_13>=1))"))))))
Formula 6 simplified : !(X"(((i4.u31.r_1_11>=1)&&(i4.u32.p_1_12>=1))&&(i4.u11.r_0_11>=1))" U XGX"(((i5.u33.r_1_13>=1)&&(i5.u34.p_1_14>=1))&&(i5.u13.r_0_13>=1))")
Computing Next relation with stutter on 19 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.53983,29616,1,0,28488,43,712,23855,49,38,32977
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X("(((i2.u25.r_1_5>=1)&&(i2.u26.p_1_6>=1))&&(i2.u5.r_0_5>=1))")))
Formula 7 simplified : !X"(((i2.u25.r_1_5>=1)&&(i2.u26.p_1_6>=1))&&(i2.u5.r_0_5>=1))"
Computing Next relation with stutter on 19 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.540674,29616,1,0,28498,43,712,23865,49,38,32993
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("(((i0.u21.r_1_1>=1)&&(i1.u22.p_1_2>=1))&&(i0.u1.r_0_1>=1))"))
Formula 8 simplified : !"(((i0.u21.r_1_1>=1)&&(i1.u22.p_1_2>=1))&&(i0.u1.r_0_1>=1))"
Computing Next relation with stutter on 19 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.541076,29616,1,0,28498,43,712,23865,49,38,32993
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X("((i3.u9.p_0_9>=1)&&(i3.u10.r_0_10>=1))")))
Formula 9 simplified : !X"((i3.u9.p_0_9>=1)&&(i3.u10.r_0_10>=1))"
Computing Next relation with stutter on 19 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.541409,29616,1,0,28498,43,721,23865,49,38,33009
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(F(G("(i0.u20.p_1_0>=1)"))))U(F(F(X("(((i1.u22.r_1_2>=1)&&(i1.u23.p_1_3>=1))&&(i1.u2.r_0_2>=1))"))))))
Formula 10 simplified : !(FG"(i0.u20.p_1_0>=1)" U FX"(((i1.u22.r_1_2>=1)&&(i1.u23.p_1_3>=1))&&(i1.u2.r_0_2>=1))")
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5 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.595984,30900,1,0,31865,43,754,29027,49,38,37788
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((G("(((i2.u26.r_1_6>=1)&&(i2.u27.p_1_7>=1))&&(i2.u6.r_0_6>=1))"))U(F("(((i0.u20.r_1_0>=1)&&(i0.u21.p_1_1>=1))&&(i0.u0.r_0_0>=1))")))))
Formula 11 simplified : !X(G"(((i2.u26.r_1_6>=1)&&(i2.u27.p_1_7>=1))&&(i2.u6.r_0_6>=1))" U F"(((i0.u20.r_1_0>=1)&&(i0.u21.p_1_1>=1))&&(i0.u0.r_0_0>=1))")
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.632444,31944,1,0,34191,43,788,32140,49,38,41202
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(F(G("(((i2.u25.r_1_5>=1)&&(i2.u26.p_1_6>=1))&&(i2.u5.r_0_5>=1))"))))U((G("(i0.u0.r_0_0>=1)"))U("(i6.u19.p_0_19>=1)"))))
Formula 12 simplified : !(XFG"(((i2.u25.r_1_5>=1)&&(i2.u26.p_1_6>=1))&&(i2.u5.r_0_5>=1))" U (G"(i0.u0.r_0_0>=1)" U "(i6.u19.p_0_19>=1)"))
Computing Next relation with stutter on 19 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 42 rows 80 cols
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.676278,33616,1,0,37075,43,837,36953,51,38,45918
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(G(F(("((i3.u10.p_0_10>=1)&&(i4.u11.r_0_11>=1))")U("(((i1.u22.r_1_2>=1)&&(i1.u23.p_1_3>=1))&&(i1.u2.r_0_2>=1))"))))))
Formula 13 simplified : !GF("((i3.u10.p_0_10>=1)&&(i4.u11.r_0_11>=1))" U "(((i1.u22.r_1_2>=1)&&(i1.u23.p_1_3>=1))&&(i1.u2.r_0_2>=1))")
Computing Next relation with stutter on 19 deadlock states
invariant :i4:u12:p_0_12 + i4:u12:r_0_12 + -1'i4:u32:r_1_12 = 0
invariant :i6:u16:p_0_16 + i6:u16:r_0_16 + -1'i6:u36:r_1_16 = 0
invariant :i0:u0:p_0_0 + i0:u0:r_0_0 + -1'i0:u20:r_1_0 = 0
invariant :i1:u24:p_1_4 + i1:u24:r_1_4 = 1
invariant :i2:u27:p_1_7 + i2:u27:r_1_7 = 1
invariant :i2:u6:p_0_6 + i2:u6:r_0_6 + -1'i2:u26:r_1_6 = 0
invariant :i1:u2:p_0_2 + i1:u2:r_0_2 + -1'i1:u22:r_1_2 = 0
invariant :i1:u4:p_0_4 + i1:u4:r_0_4 + -1'i1:u24:r_1_4 = 0
invariant :i6:u17:p_0_17 + i6:u17:r_0_17 + -1'i6:u37:r_1_17 = 0
invariant :i5:u35:p_1_15 + i5:u35:r_1_15 = 1
invariant :i0:u1:p_0_1 + i0:u1:r_0_1 + -1'i0:u21:r_1_1 = 0
invariant :i6:u38:p_1_18 + i6:u38:r_1_18 = 1
invariant :i0:u20:p_1_0 + i0:u20:r_1_0 = 1
invariant :i6:u18:p_0_18 + i6:u18:r_0_18 + -1'i6:u38:r_1_18 = 0
invariant :i5:u13:p_0_13 + i5:u13:r_0_13 + -1'i5:u33:r_1_13 = 0
invariant :i5:u15:p_0_15 + i5:u15:r_0_15 + -1'i5:u35:r_1_15 = 0
invariant :i6:u36:p_1_16 + i6:u36:r_1_16 = 1
invariant :i4:u31:p_1_11 + i4:u31:r_1_11 = 1
invariant :i5:u14:p_0_14 + i5:u14:r_0_14 + -1'i5:u34:r_1_14 = 0
invariant :i3:u29:p_1_9 + i3:u29:r_1_9 = 1
invariant :i5:u33:p_1_13 + i5:u33:r_1_13 = 1
invariant :i3:u8:p_0_8 + i3:u8:r_0_8 + -1'i3:u28:r_1_8 = 0
invariant :i1:u23:p_1_3 + i1:u23:r_1_3 = 1
invariant :i4:u11:p_0_11 + i4:u11:r_0_11 + -1'i4:u31:r_1_11 = 0
invariant :i1:u22:p_1_2 + i1:u22:r_1_2 = 1
invariant :i3:u30:p_1_10 + i3:u30:r_1_10 = 1
invariant :i4:u32:p_1_12 + i4:u32:r_1_12 = 1
invariant :i0:u21:p_1_1 + i0:u21:r_1_1 = 1
invariant :i2:u5:p_0_5 + i2:u5:r_0_5 + -1'i2:u25:r_1_5 = 0
invariant :i6:u39:p_1_19 + i6:u39:r_1_19 = 1
invariant :i6:u19:p_0_19 + i6:u19:r_0_19 + -1'i6:u39:r_1_19 = 0
invariant :i2:u7:p_0_7 + i2:u7:r_0_7 + -1'i2:u27:r_1_7 = 0
invariant :i3:u10:p_0_10 + i3:u10:r_0_10 + -1'i3:u30:r_1_10 = 0
invariant :i3:u28:p_1_8 + i3:u28:r_1_8 = 1
invariant :i6:u37:p_1_17 + i6:u37:r_1_17 = 1
invariant :i5:u34:p_1_14 + i5:u34:r_1_14 = 1
invariant :i2:u25:p_1_5 + i2:u25:r_1_5 = 1
invariant :i3:u9:p_0_9 + i3:u9:r_0_9 + -1'i3:u29:r_1_9 = 0
invariant :i1:u3:p_0_3 + i1:u3:r_0_3 + -1'i1:u23:r_1_3 = 0
invariant :i2:u26:p_1_6 + i2:u26:r_1_6 = 1
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.833742,37836,1,0,49367,43,837,45559,51,38,54392
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F((X(F("((i2.u6.p_0_6>=1)&&(i2.u7.r_0_7>=1))")))U(G(F("(((i0.u20.r_1_0>=1)&&(i0.u21.p_1_1>=1))&&(i0.u0.r_0_0>=1))"))))))
Formula 14 simplified : !F(XF"((i2.u6.p_0_6>=1)&&(i2.u7.r_0_7>=1))" U GF"(((i0.u20.r_1_0>=1)&&(i0.u21.p_1_1>=1))&&(i0.u0.r_0_0>=1))")
Computing Next relation with stutter on 19 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
21 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.04362,42852,1,0,63127,43,837,53835,51,38,63075
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F("(((i2.u25.r_1_5>=1)&&(i2.u26.p_1_6>=1))&&(i2.u5.r_0_5>=1))")))
Formula 15 simplified : !F"(((i2.u25.r_1_5>=1)&&(i2.u26.p_1_6>=1))&&(i2.u5.r_0_5>=1))"
Computing Next relation with stutter on 19 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,1.06697,43380,1,0,64919,43,848,55657,51,38,65545
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1528325998712

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 06, 2018 10:59:54 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/, -louvain, -smt]
Jun 06, 2018 10:59:54 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 10:59:54 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 79 ms
Jun 06, 2018 10:59:54 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 80 places.
Jun 06, 2018 10:59:55 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 42 transitions.
Jun 06, 2018 10:59:55 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 14 ms
Jun 06, 2018 10:59:55 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 06, 2018 10:59:55 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 169 ms
Jun 06, 2018 10:59:55 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 46 ms
Begin: Wed Jun 6 22:59:55 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Wed Jun 6 22:59:55 2018
network size: 80 nodes, 348 links, 84 weight
quality increased from -0.0147865 to 0.369977
end computation: Wed Jun 6 22:59:55 2018
level 1:
start computation: Wed Jun 6 22:59:55 2018
network size: 40 nodes, 232 links, 84 weight
quality increased from 0.369977 to 0.693689
end computation: Wed Jun 6 22:59:55 2018
level 2:
start computation: Wed Jun 6 22:59:55 2018
network size: 8 nodes, 22 links, 84 weight
quality increased from 0.693689 to 0.698413
end computation: Wed Jun 6 22:59:55 2018
level 3:
start computation: Wed Jun 6 22:59:55 2018
network size: 7 nodes, 19 links, 84 weight
quality increased from 0.698413 to 0.698413
end computation: Wed Jun 6 22:59:55 2018
End: Wed Jun 6 22:59:55 2018
Total duration: 0 sec
0.698413
Jun 06, 2018 10:59:55 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 06, 2018 10:59:55 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 28 ms
Jun 06, 2018 10:59:55 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 06, 2018 10:59:56 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
Jun 06, 2018 10:59:56 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 06, 2018 10:59:56 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 42 transitions.
Jun 06, 2018 10:59:57 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 40 place invariants in 93 ms
Jun 06, 2018 10:59:57 PM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
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.NextBMCSolver.checkSat(NextBMCSolver.java:305)
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)
Jun 06, 2018 10:59:57 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1096ms 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-R020C002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R020C002.tgz
mv ResAllocation-PT-R020C002 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is ResAllocation-PT-R020C002, 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 r189-qhx2-152732141000154"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;