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 192K
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K 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 9.4K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 34K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is ResAllocation-PT-R003C005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-qhx2-152732140900136
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528325011335

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/graph5367319672836423820.txt, -o, /tmp/graph5367319672836423820.bin, -w, /tmp/graph5367319672836423820.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/graph5367319672836423820.bin, -l, -1, -v, -w, /tmp/graph5367319672836423820.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 : !((X(F((F("(((i4.u12.p_4_1>=1)&&(i5.u13.r_4_2>=1))&&(i5.u10.r_3_2>=1))"))U("((i5.u10.r_3_2>=1)&&(i3.u7.r_2_2>=1))")))))
Formula 0 simplified : !XF(F"(((i4.u12.p_4_1>=1)&&(i5.u13.r_4_2>=1))&&(i5.u10.r_3_2>=1))" U "((i5.u10.r_3_2>=1)&&(i3.u7.r_2_2>=1))")
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t_1_0, t_2_3, t_3_0, t_4_3, i1.u2.t_0_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/15/5/20
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
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.103398,17364,1,0,1456,64,384,1515,89,106,2825
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("(((i2.u3.r_1_0>=1)&&(i2.u4.p_1_1>=1))&&(u0.r_0_0>=1))"))
Formula 1 simplified : !"(((i2.u3.r_1_0>=1)&&(i2.u4.p_1_1>=1))&&(u0.r_0_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
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.107674,17364,1,0,1539,64,431,1690,89,106,3358
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X("(((i2.u3.p_2_0>=1)&&(i2.u6.r_2_1>=1))&&(i2.u4.r_1_1>=1))"))))
Formula 2 simplified : !FX"(((i2.u3.p_2_0>=1)&&(i2.u6.r_2_1>=1))&&(i2.u4.r_1_1>=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.114032,17364,1,0,2110,64,469,2291,89,107,4774
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G(X(F("(((i2.u3.p_2_0>=1)&&(i2.u6.r_2_1>=1))&&(i2.u4.r_1_1>=1))"))))U(F(X("(((i2.u4.r_1_1>=1)&&(i3.u5.p_1_2>=1))&&(i1.u1.r_0_1>=1))")))))
Formula 3 simplified : !(GXF"(((i2.u3.p_2_0>=1)&&(i2.u6.r_2_1>=1))&&(i2.u4.r_1_1>=1))" U FX"(((i2.u4.r_1_1>=1)&&(i3.u5.p_1_2>=1))&&(i1.u1.r_0_1>=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.128677,18184,1,0,3264,64,498,3240,89,107,7477
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X("((i3.u5.r_1_2>=1)&&(i1.u2.r_0_2>=1))"))))
Formula 4 simplified : !GX"((i3.u5.r_1_2>=1)&&(i1.u2.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
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.137067,18948,1,0,3757,64,524,3716,89,109,8673
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G((G("(((i2.u6.p_2_1>=1)&&(i3.u7.r_2_2>=1))&&(i3.u5.r_1_2>=1))"))U("(u0.r_0_0>=1)")))))
Formula 5 simplified : !XG(G"(((i2.u6.p_2_1>=1)&&(i3.u7.r_2_2>=1))&&(i3.u5.r_1_2>=1))" U "(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
5 transitions explored
4 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.164745,20248,1,0,5799,64,589,5418,90,109,12986
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G(F(F(X("(((i2.u6.p_2_1>=1)&&(i3.u7.r_2_2>=1))&&(i3.u5.r_1_2>=1))")))))))
Formula 6 simplified : !XGFX"(((i2.u6.p_2_1>=1)&&(i3.u7.r_2_2>=1))&&(i3.u5.r_1_2>=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
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.169749,20248,1,0,5851,64,601,5487,90,109,13123
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F(F(X(F("(((i2.u6.p_2_1>=1)&&(i3.u7.r_2_2>=1))&&(i3.u5.r_1_2>=1))")))))))
Formula 7 simplified : !XFXF"(((i2.u6.p_2_1>=1)&&(i3.u7.r_2_2>=1))&&(i3.u5.r_1_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
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.184285,20500,1,0,7045,64,601,6531,90,109,15581
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(F(("((i5.u10.r_3_2>=1)&&(i3.u7.r_2_2>=1))")U("((i4.u11.r_4_0>=1)&&(i4.u8.r_3_0>=1))"))))))
Formula 8 simplified : !GXF("((i5.u10.r_3_2>=1)&&(i3.u7.r_2_2>=1))" U "((i4.u11.r_4_0>=1)&&(i4.u8.r_3_0>=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
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.189175,20756,1,0,7074,64,625,6600,90,109,15727
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("(((i2.u6.p_2_1>=1)&&(i3.u7.r_2_2>=1))&&(i3.u5.r_1_2>=1))")U(X(G(F("(u0.r_0_0>=1)"))))))
Formula 9 simplified : !("(((i2.u6.p_2_1>=1)&&(i3.u7.r_2_2>=1))&&(i3.u5.r_1_2>=1))" U XGF"(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
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.19325,20964,1,0,7279,64,646,6813,90,109,16209
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(X(X(("(i3.u7.p_2_2>=1)")U("((i4.u11.r_4_0>=1)&&(i4.u8.r_3_0>=1))"))))))
Formula 10 simplified : !GXX("(i3.u7.p_2_2>=1)" U "((i4.u11.r_4_0>=1)&&(i4.u8.r_3_0>=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
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.195576,20964,1,0,7325,64,669,6846,91,109,16389
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(("(u0.r_0_0>=1)")U(X("(i5.u13.p_4_2>=1)")))))
Formula 11 simplified : !F("(u0.r_0_0>=1)" U X"(i5.u13.p_4_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
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.196979,20964,1,0,7367,64,684,6912,91,109,16547
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G(F(G("(i5.u13.p_4_2>=1)"))))))
Formula 12 simplified : !XGFG"(i5.u13.p_4_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.205926,20964,1,0,8251,64,699,7750,91,109,18251
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G((X(F("((u0.p_0_0>=1)&&(i1.u1.r_0_1>=1))")))U(X(F("((u0.p_0_0>=1)&&(i1.u1.r_0_1>=1))"))))))
Formula 13 simplified : !GXF"((u0.p_0_0>=1)&&(i1.u1.r_0_1>=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.212295,21196,1,0,8475,64,725,7955,91,109,18714
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((((F("(((i2.u3.p_2_0>=1)&&(i2.u6.r_2_1>=1))&&(i2.u4.r_1_1>=1))"))U(G("(((i2.u3.r_1_0>=1)&&(i2.u4.p_1_1>=1))&&(u0.r_0_0>=1))")))U(F("(u0.r_0_0>=1)"))))
Formula 14 simplified : !((F"(((i2.u3.p_2_0>=1)&&(i2.u6.r_2_1>=1))&&(i2.u4.r_1_1>=1))" U G"(((i2.u3.r_1_0>=1)&&(i2.u4.p_1_1>=1))&&(u0.r_0_0>=1))") U F"(u0.r_0_0>=1)")
Computing Next relation with stutter on 4 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.217362,21852,1,0,8475,64,725,7955,91,109,18727
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(X("(((i2.u3.p_2_0>=1)&&(i2.u6.r_2_1>=1))&&(i2.u4.r_1_1>=1))"))))
Formula 15 simplified : !GX"(((i2.u3.p_2_0>=1)&&(i2.u6.r_2_1>=1))&&(i2.u4.r_1_1>=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.222783,22028,1,0,8768,64,733,8225,91,109,19498
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C005-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 20 rows 30 cols
invariant :i2:u4:p_1_1 + i2:u4:r_1_1 + -1'i2:u6:r_2_1 + i4:u9:r_3_1 + -1'i4:u12:r_4_1 = 0
invariant :i1:u2:p_0_2 + i1:u2:r_0_2 + -1'i3:u5:r_1_2 + i3:u7:r_2_2 + -1'i5:u10:r_3_2 + i5:u13:r_4_2 = 1
invariant :i2:u3:p_2_0 + i2:u3:r_2_0 + -1'i4:u8:r_3_0 + i4:u11:r_4_0 = 1
invariant :i3:u7:p_2_2 + i3:u7:r_2_2 + -1'i5:u10:r_3_2 + i5:u13:r_4_2 = 1
invariant :i4:u9:p_3_1 + i4:u9:r_3_1 + -1'i4:u12:r_4_1 = 0
invariant :i5:u10:p_3_2 + i5:u10:r_3_2 + -1'i5:u13:r_4_2 = 0
invariant :i5:u13:p_4_2 + i5:u13:r_4_2 = 1
invariant :i4:u12:p_4_1 + i4:u12:r_4_1 = 1
invariant :u0:p_0_0 + u0:r_0_0 + -1'i2:u3:r_1_0 + i2:u3:r_2_0 + -1'i4:u8:r_3_0 + i4:u11:r_4_0 = 1
invariant :i2:u6:p_2_1 + i2:u6:r_2_1 + -1'i4:u9:r_3_1 + i4:u12:r_4_1 = 1
invariant :u0:p_1_0 + i2:u3:r_1_0 + -1'i2:u3:r_2_0 + i4:u8:r_3_0 + -1'i4:u11:r_4_0 = 0
invariant :i4:u11:p_4_0 + i4:u11:r_4_0 = 1
invariant :i3:u5:p_1_2 + i3:u5:r_1_2 + -1'i3:u7:r_2_2 + i5:u10:r_3_2 + -1'i5:u13:r_4_2 = 0
invariant :i4:u8:p_3_0 + i4:u8:r_3_0 + -1'i4:u11:r_4_0 = 0
invariant :i1:u1:p_0_1 + i1:u1:r_0_1 + -1'i2:u4:r_1_1 + i2:u6:r_2_1 + -1'i4:u9:r_3_1 + i4:u12:r_4_1 = 1
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 1528325018338

--------------------
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:43:35 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:43:35 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 10:43:35 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 65 ms
Jun 06, 2018 10:43:35 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 places.
Jun 06, 2018 10:43:35 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 20 transitions.
Jun 06, 2018 10:43:35 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Jun 06, 2018 10:43:35 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 06, 2018 10:43:35 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 79 ms
Jun 06, 2018 10:43:35 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 70 ms
Begin: Wed Jun 6 22:43:36 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Wed Jun 6 22:43:36 2018
network size: 30 nodes, 126 links, 40 weight
quality increased from -0.036875 to 0.388542
end computation: Wed Jun 6 22:43:36 2018
level 1:
start computation: Wed Jun 6 22:43:36 2018
network size: 14 nodes, 84 links, 40 weight
quality increased from 0.388542 to 0.517292
end computation: Wed Jun 6 22:43:36 2018
level 2:
start computation: Wed Jun 6 22:43:36 2018
network size: 6 nodes, 26 links, 40 weight
quality increased from 0.517292 to 0.517292
end computation: Wed Jun 6 22:43:36 2018
End: Wed Jun 6 22:43:36 2018
Total duration: 0 sec
0.517292
Jun 06, 2018 10:43:36 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 06, 2018 10:43:36 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 31 ms
Jun 06, 2018 10:43:36 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 06, 2018 10:43:36 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 25 ms
Jun 06, 2018 10:43:36 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 06, 2018 10:43:36 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 20 transitions.
Jun 06, 2018 10:43:36 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 15 place invariants in 62 ms
Skipping mayMatrices nes/nds SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.computeAndDeclareInvariants(KInductionSolver.java:293)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:71)
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:43:36 PM 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-R003C005"
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-R003C005.tgz
mv ResAllocation-PT-R003C005 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-R003C005, 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-152732140900136"
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 ;