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)
......
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is S_LamportFastMutEx-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157kn-blw3-146416412700240
=====================================================================

--------------------
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 LamportFastMutEx-COL-2-LTLFireability-0
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-1
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-15
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-2
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-3
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-4
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-5
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-6
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-7
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-8
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1464182130397


its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((F(X((((((("y_1>=1")&&("P_ify0_4_0>=1"))||(("y_2>=1")&&("P_ify0_4_0>=1")))||(("y_1>=1")&&("P_ify0_4_1>=1")))||(("y_2>=1")&&("P_ify0_4_1>=1")))||(("y_1>=1")&&("P_ify0_4_2>=1")))||(("y_2>=1")&&("P_ify0_4_2>=1")))))U(X(G(G((((((("x_1>=1")&&("P_ifxi_10_0>=1"))||(("x_2>=1")&&("P_ifxi_10_0>=1")))||(("x_0>=1")&&("P_ifxi_10_1>=1")))||(("x_2>=1")&&("P_ifxi_10_1>=1")))||(("x_0>=1")&&("P_ifxi_10_2>=1")))||(("x_1>=1")&&("P_ifxi_10_2>=1"))))))))
Formula 0 simplified : !(FX(("P_ify0_4_0>=1" & "y_1>=1") | ("P_ify0_4_0>=1" & "y_2>=1") | ("P_ify0_4_1>=1" & "y_1>=1") | ("P_ify0_4_1>=1" & "y_2>=1") | ("P_ify0_4_2>=1" & "y_1>=1") | ("P_ify0_4_2>=1" & "y_2>=1")) U XG(("P_ifxi_10_0>=1" & "x_1>=1") | ("P_ifxi_10_0>=1" & "x_2>=1") | ("P_ifxi_10_1>=1" & "x_0>=1") | ("P_ifxi_10_1>=1" & "x_2>=1") | ("P_ifxi_10_2>=1" & "x_0>=1") | ("P_ifxi_10_2>=1" & "x_1>=1")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.223246,33324,1,0,197,24392,300,75,2196,26631,292
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(G(X(X(G((((((("y_1>=1")&&("P_ifyi_15_0>=1"))||(("y_2>=1")&&("P_ifyi_15_0>=1")))||(("y_0>=1")&&("P_ifyi_15_1>=1")))||(("y_2>=1")&&("P_ifyi_15_1>=1")))||(("y_0>=1")&&("P_ifyi_15_2>=1")))||(("y_1>=1")&&("P_ifyi_15_2>=1")))))))))
Formula 1 simplified : !GXXG(("P_ifyi_15_0>=1" & "y_1>=1") | ("P_ifyi_15_0>=1" & "y_2>=1") | ("P_ifyi_15_1>=1" & "y_0>=1") | ("P_ifyi_15_1>=1" & "y_2>=1") | ("P_ifyi_15_2>=1" & "y_0>=1") | ("P_ifyi_15_2>=1" & "y_1>=1"))
5 unique states visited
5 strongly connected components in search stack
5 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.236751,33724,1,0,198,25378,386,75,2356,28933,307
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G((G(G((((((("y_1>=1")&&("P_ifyi_15_0>=1"))||(("y_2>=1")&&("P_ifyi_15_0>=1")))||(("y_0>=1")&&("P_ifyi_15_1>=1")))||(("y_2>=1")&&("P_ifyi_15_1>=1")))||(("y_0>=1")&&("P_ifyi_15_2>=1")))||(("y_1>=1")&&("P_ifyi_15_2>=1")))))U((((((("P_b_0_false>=1")&&("P_setbi_24_0>=1"))||(("P_b_0_true>=1")&&("P_setbi_24_0>=1")))||(("P_b_1_false>=1")&&("P_setbi_24_1>=1")))||(("P_b_1_true>=1")&&("P_setbi_24_1>=1")))||(("P_b_2_false>=1")&&("P_setbi_24_2>=1")))||(("P_b_2_true>=1")&&("P_setbi_24_2>=1"))))))
Formula 2 simplified : !G(G(("P_ifyi_15_0>=1" & "y_1>=1") | ("P_ifyi_15_0>=1" & "y_2>=1") | ("P_ifyi_15_1>=1" & "y_0>=1") | ("P_ifyi_15_1>=1" & "y_2>=1") | ("P_ifyi_15_2>=1" & "y_0>=1") | ("P_ifyi_15_2>=1" & "y_1>=1")) U (("P_b_0_false>=1" & "P_setbi_24_0>=1") | ("P_b_0_true>=1" & "P_setbi_24_0>=1") | ("P_b_1_false>=1" & "P_setbi_24_1>=1") | ("P_b_1_true>=1" & "P_setbi_24_1>=1") | ("P_b_2_false>=1" & "P_setbi_24_2>=1") | ("P_b_2_true>=1" & "P_setbi_24_2>=1")))
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,3.67251,43816,1,0,200,25579,602,75,2564,29399,325
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(F((F(((((((((("y_0>=1")&&("P_sety_9_0>=1"))||(("y_1>=1")&&("P_sety_9_0>=1")))||(("y_2>=1")&&("P_sety_9_0>=1")))||(("y_0>=1")&&("P_sety_9_1>=1")))||(("y_1>=1")&&("P_sety_9_1>=1")))||(("y_2>=1")&&("P_sety_9_1>=1")))||(("y_0>=1")&&("P_sety_9_2>=1")))||(("y_1>=1")&&("P_sety_9_2>=1")))||(("y_2>=1")&&("P_sety_9_2>=1"))))U(G(((("y_0>=1")&&("P_ifyi_15_0>=1"))||(("y_1>=1")&&("P_ifyi_15_1>=1")))||(("y_2>=1")&&("P_ifyi_15_2>=1"))))))))
Formula 3 simplified : !XF(F(("P_sety_9_0>=1" & "y_0>=1") | ("P_sety_9_0>=1" & "y_1>=1") | ("P_sety_9_0>=1" & "y_2>=1") | ("P_sety_9_1>=1" & "y_0>=1") | ("P_sety_9_1>=1" & "y_1>=1") | ("P_sety_9_1>=1" & "y_2>=1") | ("P_sety_9_2>=1" & "y_0>=1") | ("P_sety_9_2>=1" & "y_1>=1") | ("P_sety_9_2>=1" & "y_2>=1")) U G(("P_ifyi_15_0>=1" & "y_0>=1") | ("P_ifyi_15_1>=1" & "y_1>=1") | ("P_ifyi_15_2>=1" & "y_2>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,3.74871,44320,1,0,267,35541,689,113,2642,47464,529
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(X(X((((((("x_1>=1")&&("P_ifxi_10_0>=1"))||(("x_2>=1")&&("P_ifxi_10_0>=1")))||(("x_0>=1")&&("P_ifxi_10_1>=1")))||(("x_2>=1")&&("P_ifxi_10_1>=1")))||(("x_0>=1")&&("P_ifxi_10_2>=1")))||(("x_1>=1")&&("P_ifxi_10_2>=1")))))))
Formula 4 simplified : !XXX(("P_ifxi_10_0>=1" & "x_1>=1") | ("P_ifxi_10_0>=1" & "x_2>=1") | ("P_ifxi_10_1>=1" & "x_0>=1") | ("P_ifxi_10_1>=1" & "x_2>=1") | ("P_ifxi_10_2>=1" & "x_0>=1") | ("P_ifxi_10_2>=1" & "x_1>=1"))
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,3.75556,44320,1,0,268,35836,690,113,2643,47963,536
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(G((G(((((((((("y_0>=1")&&("P_sety_9_0>=1"))||(("y_1>=1")&&("P_sety_9_0>=1")))||(("y_2>=1")&&("P_sety_9_0>=1")))||(("y_0>=1")&&("P_sety_9_1>=1")))||(("y_1>=1")&&("P_sety_9_1>=1")))||(("y_2>=1")&&("P_sety_9_1>=1")))||(("y_0>=1")&&("P_sety_9_2>=1")))||(("y_1>=1")&&("P_sety_9_2>=1")))||(("y_2>=1")&&("P_sety_9_2>=1"))))U((((((("P_b_0_false>=1")&&("P_setbi_24_0>=1"))||(("P_b_0_true>=1")&&("P_setbi_24_0>=1")))||(("P_b_1_false>=1")&&("P_setbi_24_1>=1")))||(("P_b_1_true>=1")&&("P_setbi_24_1>=1")))||(("P_b_2_false>=1")&&("P_setbi_24_2>=1")))||(("P_b_2_true>=1")&&("P_setbi_24_2>=1")))))))
Formula 5 simplified : !XG(G(("P_sety_9_0>=1" & "y_0>=1") | ("P_sety_9_0>=1" & "y_1>=1") | ("P_sety_9_0>=1" & "y_2>=1") | ("P_sety_9_1>=1" & "y_0>=1") | ("P_sety_9_1>=1" & "y_1>=1") | ("P_sety_9_1>=1" & "y_2>=1") | ("P_sety_9_2>=1" & "y_0>=1") | ("P_sety_9_2>=1" & "y_1>=1") | ("P_sety_9_2>=1" & "y_2>=1")) U (("P_b_0_false>=1" & "P_setbi_24_0>=1") | ("P_b_0_true>=1" & "P_setbi_24_0>=1") | ("P_b_1_false>=1" & "P_setbi_24_1>=1") | ("P_b_1_true>=1" & "P_setbi_24_1>=1") | ("P_b_2_false>=1" & "P_setbi_24_2>=1") | ("P_b_2_true>=1" & "P_setbi_24_2>=1")))
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,8.35965,49352,1,0,268,35873,796,113,2747,48138,548
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((F(G((((((("y_1>=1")&&("P_ifyi_15_0>=1"))||(("y_2>=1")&&("P_ifyi_15_0>=1")))||(("y_0>=1")&&("P_ifyi_15_1>=1")))||(("y_2>=1")&&("P_ifyi_15_1>=1")))||(("y_0>=1")&&("P_ifyi_15_2>=1")))||(("y_1>=1")&&("P_ifyi_15_2>=1")))))U((F(((("y_0>=1")&&("P_ify0_4_0>=1"))||(("y_0>=1")&&("P_ify0_4_1>=1")))||(("y_0>=1")&&("P_ify0_4_2>=1"))))U(G((((((("P_b_0_false>=1")&&("P_setbi_11_0>=1"))||(("P_b_0_true>=1")&&("P_setbi_11_0>=1")))||(("P_b_1_false>=1")&&("P_setbi_11_1>=1")))||(("P_b_1_true>=1")&&("P_setbi_11_1>=1")))||(("P_b_2_false>=1")&&("P_setbi_11_2>=1")))||(("P_b_2_true>=1")&&("P_setbi_11_2>=1")))))))
Formula 6 simplified : !(FG(("P_ifyi_15_0>=1" & "y_1>=1") | ("P_ifyi_15_0>=1" & "y_2>=1") | ("P_ifyi_15_1>=1" & "y_0>=1") | ("P_ifyi_15_1>=1" & "y_2>=1") | ("P_ifyi_15_2>=1" & "y_0>=1") | ("P_ifyi_15_2>=1" & "y_1>=1")) U (F(("P_ify0_4_0>=1" & "y_0>=1") | ("P_ify0_4_1>=1" & "y_0>=1") | ("P_ify0_4_2>=1" & "y_0>=1")) U G(("P_b_0_false>=1" & "P_setbi_11_0>=1") | ("P_b_0_true>=1" & "P_setbi_11_0>=1") | ("P_b_1_false>=1" & "P_setbi_11_1>=1") | ("P_b_1_true>=1" & "P_setbi_11_1>=1") | ("P_b_2_false>=1" & "P_setbi_11_2>=1") | ("P_b_2_true>=1" & "P_setbi_11_2>=1"))))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,34.4871,54432,1,0,277,37371,933,114,2885,49839,592
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((F((((((("x_1>=1")&&("P_ifxi_10_0>=1"))||(("x_2>=1")&&("P_ifxi_10_0>=1")))||(("x_0>=1")&&("P_ifxi_10_1>=1")))||(("x_2>=1")&&("P_ifxi_10_1>=1")))||(("x_0>=1")&&("P_ifxi_10_2>=1")))||(("x_1>=1")&&("P_ifxi_10_2>=1"))))U(G(((("y_0>=1")&&("P_ifyi_15_0>=1"))||(("y_1>=1")&&("P_ifyi_15_1>=1")))||(("y_2>=1")&&("P_ifyi_15_2>=1"))))))
Formula 7 simplified : !(F(("P_ifxi_10_0>=1" & "x_1>=1") | ("P_ifxi_10_0>=1" & "x_2>=1") | ("P_ifxi_10_1>=1" & "x_0>=1") | ("P_ifxi_10_1>=1" & "x_2>=1") | ("P_ifxi_10_2>=1" & "x_0>=1") | ("P_ifxi_10_2>=1" & "x_1>=1")) U G(("P_ifyi_15_0>=1" & "y_0>=1") | ("P_ifyi_15_1>=1" & "y_1>=1") | ("P_ifyi_15_2>=1" & "y_2>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,34.6216,54432,1,0,305,39444,1009,123,2952,53020,670
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(((((((((((("y_0>=1")&&("P_sety_9_0>=1"))||(("y_1>=1")&&("P_sety_9_0>=1")))||(("y_2>=1")&&("P_sety_9_0>=1")))||(("y_0>=1")&&("P_sety_9_1>=1")))||(("y_1>=1")&&("P_sety_9_1>=1")))||(("y_2>=1")&&("P_sety_9_1>=1")))||(("y_0>=1")&&("P_sety_9_2>=1")))||(("y_1>=1")&&("P_sety_9_2>=1")))||(("y_2>=1")&&("P_sety_9_2>=1")))U(((((((((("x_0>=1")&&("P_setx_3_0>=1"))||(("x_1>=1")&&("P_setx_3_0>=1")))||(("x_2>=1")&&("P_setx_3_0>=1")))||(("x_0>=1")&&("P_setx_3_1>=1")))||(("x_1>=1")&&("P_setx_3_1>=1")))||(("x_2>=1")&&("P_setx_3_1>=1")))||(("x_0>=1")&&("P_setx_3_2>=1")))||(("x_1>=1")&&("P_setx_3_2>=1")))||(("x_2>=1")&&("P_setx_3_2>=1"))))U(X(G((("P_fordo_12_0>=1")||("P_fordo_12_1>=1"))||("P_fordo_12_2>=1")))))))
Formula 8 simplified : !G(((("P_sety_9_0>=1" & "y_0>=1") | ("P_sety_9_0>=1" & "y_1>=1") | ("P_sety_9_0>=1" & "y_2>=1") | ("P_sety_9_1>=1" & "y_0>=1") | ("P_sety_9_1>=1" & "y_1>=1") | ("P_sety_9_1>=1" & "y_2>=1") | ("P_sety_9_2>=1" & "y_0>=1") | ("P_sety_9_2>=1" & "y_1>=1") | ("P_sety_9_2>=1" & "y_2>=1")) U (("P_setx_3_0>=1" & "x_0>=1") | ("P_setx_3_0>=1" & "x_1>=1") | ("P_setx_3_0>=1" & "x_2>=1") | ("P_setx_3_1>=1" & "x_0>=1") | ("P_setx_3_1>=1" & "x_1>=1") | ("P_setx_3_1>=1" & "x_2>=1") | ("P_setx_3_2>=1" & "x_0>=1") | ("P_setx_3_2>=1" & "x_1>=1") | ("P_setx_3_2>=1" & "x_2>=1"))) U XG("P_fordo_12_0>=1" | "P_fordo_12_1>=1" | "P_fordo_12_2>=1"))
4 unique states visited
4 strongly connected components in search stack
4 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,38.2461,68120,1,0,315,43718,1218,124,3177,57127,703
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((((((((((("y_0>=1")&&("P_CS_21_0>=1"))||(("y_1>=1")&&("P_CS_21_0>=1")))||(("y_2>=1")&&("P_CS_21_0>=1")))||(("y_0>=1")&&("P_CS_21_1>=1")))||(("y_1>=1")&&("P_CS_21_1>=1")))||(("y_2>=1")&&("P_CS_21_1>=1")))||(("y_0>=1")&&("P_CS_21_2>=1")))||(("y_1>=1")&&("P_CS_21_2>=1")))||(("y_2>=1")&&("P_CS_21_2>=1"))))
Formula 9 simplified : !(("P_CS_21_0>=1" & "y_0>=1") | ("P_CS_21_0>=1" & "y_1>=1") | ("P_CS_21_0>=1" & "y_2>=1") | ("P_CS_21_1>=1" & "y_0>=1") | ("P_CS_21_1>=1" & "y_1>=1") | ("P_CS_21_1>=1" & "y_2>=1") | ("P_CS_21_2>=1" & "y_0>=1") | ("P_CS_21_2>=1" & "y_1>=1") | ("P_CS_21_2>=1" & "y_2>=1"))
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,38.2478,68120,1,0,315,43718,1249,124,3207,57130,705
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F(G(G(X((("P_fordo_12_0>=1")||("P_fordo_12_1>=1"))||("P_fordo_12_2>=1")))))))
Formula 10 simplified : !FGX("P_fordo_12_0>=1" | "P_fordo_12_1>=1" | "P_fordo_12_2>=1")
5 unique states visited
4 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,38.2545,68120,1,0,322,44826,1252,128,3207,58559,735
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X((F(G(((("y_0>=1")&&("P_ifyi_15_0>=1"))||(("y_1>=1")&&("P_ifyi_15_1>=1")))||(("y_2>=1")&&("P_ifyi_15_2>=1")))))U(((((((((("y_0>=1")&&("P_CS_21_0>=1"))||(("y_1>=1")&&("P_CS_21_0>=1")))||(("y_2>=1")&&("P_CS_21_0>=1")))||(("y_0>=1")&&("P_CS_21_1>=1")))||(("y_1>=1")&&("P_CS_21_1>=1")))||(("y_2>=1")&&("P_CS_21_1>=1")))||(("y_0>=1")&&("P_CS_21_2>=1")))||(("y_1>=1")&&("P_CS_21_2>=1")))||(("y_2>=1")&&("P_CS_21_2>=1"))))))
Formula 11 simplified : !X(FG(("P_ifyi_15_0>=1" & "y_0>=1") | ("P_ifyi_15_1>=1" & "y_1>=1") | ("P_ifyi_15_2>=1" & "y_2>=1")) U (("P_CS_21_0>=1" & "y_0>=1") | ("P_CS_21_0>=1" & "y_1>=1") | ("P_CS_21_0>=1" & "y_2>=1") | ("P_CS_21_1>=1" & "y_0>=1") | ("P_CS_21_1>=1" & "y_1>=1") | ("P_CS_21_1>=1" & "y_2>=1") | ("P_CS_21_2>=1" & "y_0>=1") | ("P_CS_21_2>=1" & "y_1>=1") | ("P_CS_21_2>=1" & "y_2>=1")))
18 unique states visited
17 strongly connected components in search stack
18 transitions explored
17 items max in DFS search stack
10 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,38.3739,68128,1,0,436,54323,1273,197,3222,77159,1104
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((F(((((((("P_b_0_false>=1")&&("P_setbi_11_0>=1"))||(("P_b_0_true>=1")&&("P_setbi_11_0>=1")))||(("P_b_1_false>=1")&&("P_setbi_11_1>=1")))||(("P_b_1_true>=1")&&("P_setbi_11_1>=1")))||(("P_b_2_false>=1")&&("P_setbi_11_2>=1")))||(("P_b_2_true>=1")&&("P_setbi_11_2>=1")))U((("P_fordo_12_0>=1")||("P_fordo_12_1>=1"))||("P_fordo_12_2>=1"))))U((((((((((("x_0>=1")&&("P_setx_3_0>=1"))||(("x_1>=1")&&("P_setx_3_0>=1")))||(("x_2>=1")&&("P_setx_3_0>=1")))||(("x_0>=1")&&("P_setx_3_1>=1")))||(("x_1>=1")&&("P_setx_3_1>=1")))||(("x_2>=1")&&("P_setx_3_1>=1")))||(("x_0>=1")&&("P_setx_3_2>=1")))||(("x_1>=1")&&("P_setx_3_2>=1")))||(("x_2>=1")&&("P_setx_3_2>=1")))U(F((((((((((("P_b_0_false>=1")&&("P_wait_0_0>=1"))&&("P_await_13_0>=1"))||((("P_b_1_false>=1")&&("P_wait_0_1>=1"))&&("P_await_13_0>=1")))||((("P_b_2_false>=1")&&("P_wait_0_2>=1"))&&("P_await_13_0>=1")))||((("P_b_0_false>=1")&&("P_wait_1_0>=1"))&&("P_await_13_1>=1")))||((("P_b_1_false>=1")&&("P_wait_1_1>=1"))&&("P_await_13_1>=1")))||((("P_b_2_false>=1")&&("P_wait_1_2>=1"))&&("P_await_13_1>=1")))||((("P_b_0_false>=1")&&("P_wait_2_0>=1"))&&("P_await_13_2>=1")))||((("P_b_1_false>=1")&&("P_wait_2_1>=1"))&&("P_await_13_2>=1")))||((("P_b_2_false>=1")&&("P_wait_2_2>=1"))&&("P_await_13_2>=1")))))))
Formula 12 simplified : !(F((("P_b_0_false>=1" & "P_setbi_11_0>=1") | ("P_b_0_true>=1" & "P_setbi_11_0>=1") | ("P_b_1_false>=1" & "P_setbi_11_1>=1") | ("P_b_1_true>=1" & "P_setbi_11_1>=1") | ("P_b_2_false>=1" & "P_setbi_11_2>=1") | ("P_b_2_true>=1" & "P_setbi_11_2>=1")) U ("P_fordo_12_0>=1" | "P_fordo_12_1>=1" | "P_fordo_12_2>=1")) U ((("P_setx_3_0>=1" & "x_0>=1") | ("P_setx_3_0>=1" & "x_1>=1") | ("P_setx_3_0>=1" & "x_2>=1") | ("P_setx_3_1>=1" & "x_0>=1") | ("P_setx_3_1>=1" & "x_1>=1") | ("P_setx_3_1>=1" & "x_2>=1") | ("P_setx_3_2>=1" & "x_0>=1") | ("P_setx_3_2>=1" & "x_1>=1") | ("P_setx_3_2>=1" & "x_2>=1")) U F(("P_await_13_0>=1" & "P_b_0_false>=1" & "P_wait_0_0>=1") | ("P_await_13_0>=1" & "P_b_1_false>=1" & "P_wait_0_1>=1") | ("P_await_13_0>=1" & "P_b_2_false>=1" & "P_wait_0_2>=1") | ("P_await_13_1>=1" & "P_b_0_false>=1" & "P_wait_1_0>=1") | ("P_await_13_1>=1" & "P_b_1_false>=1" & "P_wait_1_1>=1") | ("P_await_13_1>=1" & "P_b_2_false>=1" & "P_wait_1_2>=1") | ("P_await_13_2>=1" & "P_b_0_false>=1" & "P_wait_2_0>=1") | ("P_await_13_2>=1" & "P_b_1_false>=1" & "P_wait_2_1>=1") | ("P_await_13_2>=1" & "P_b_2_false>=1" & "P_wait_2_2>=1"))))
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,606.13,856576,1,0,474,57433,1496,215,3434,82326,1209
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G(G(G(((((("P_await_13_0>=1")&&("P_done_0_1>=1"))&&("P_done_0_2>=1"))||((("P_await_13_1>=1")&&("P_done_1_1>=1"))&&("P_done_1_2>=1")))||((("P_await_13_2>=1")&&("P_done_2_1>=1"))&&("P_done_2_2>=1")))U((((((("P_b_0_false>=1")&&("P_setbi_11_0>=1"))||(("P_b_0_true>=1")&&("P_setbi_11_0>=1")))||(("P_b_1_false>=1")&&("P_setbi_11_1>=1")))||(("P_b_1_true>=1")&&("P_setbi_11_1>=1")))||(("P_b_2_false>=1")&&("P_setbi_11_2>=1")))||(("P_b_2_true>=1")&&("P_setbi_11_2>=1"))))))))
Formula 13 simplified : !G((("P_await_13_0>=1" & "P_done_0_1>=1" & "P_done_0_2>=1") | ("P_await_13_1>=1" & "P_done_1_1>=1" & "P_done_1_2>=1") | ("P_await_13_2>=1" & "P_done_2_1>=1" & "P_done_2_2>=1")) U (("P_b_0_false>=1" & "P_setbi_11_0>=1") | ("P_b_0_true>=1" & "P_setbi_11_0>=1") | ("P_b_1_false>=1" & "P_setbi_11_1>=1") | ("P_b_1_true>=1" & "P_setbi_11_1>=1") | ("P_b_2_false>=1" & "P_setbi_11_2>=1") | ("P_b_2_true>=1" & "P_setbi_11_2>=1")))
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,626.509,888704,1,0,474,57433,1624,215,3554,82326,1216
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((X(F(((("y_0>=1")&&("P_awaity_0>=1"))||(("y_0>=1")&&("P_awaity_1>=1")))||(("y_0>=1")&&("P_awaity_2>=1")))))U(G(X(F((((((("y_1>=1")&&("P_ifyi_15_0>=1"))||(("y_2>=1")&&("P_ifyi_15_0>=1")))||(("y_0>=1")&&("P_ifyi_15_1>=1")))||(("y_2>=1")&&("P_ifyi_15_1>=1")))||(("y_0>=1")&&("P_ifyi_15_2>=1")))||(("y_1>=1")&&("P_ifyi_15_2>=1"))))))))
Formula 14 simplified : !(XF(("P_awaity_0>=1" & "y_0>=1") | ("P_awaity_1>=1" & "y_0>=1") | ("P_awaity_2>=1" & "y_0>=1")) U GXF(("P_ifyi_15_0>=1" & "y_1>=1") | ("P_ifyi_15_0>=1" & "y_2>=1") | ("P_ifyi_15_1>=1" & "y_0>=1") | ("P_ifyi_15_1>=1" & "y_2>=1") | ("P_ifyi_15_2>=1" & "y_0>=1") | ("P_ifyi_15_2>=1" & "y_1>=1")))
6 unique states visited
6 strongly connected components in search stack
7 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,626.52,888704,1,0,475,57556,1664,215,3588,82586,1225
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((((((((("P_b_0_false>=1")&&("P_setbi_24_0>=1"))||(("P_b_0_true>=1")&&("P_setbi_24_0>=1")))||(("P_b_1_false>=1")&&("P_setbi_24_1>=1")))||(("P_b_1_true>=1")&&("P_setbi_24_1>=1")))||(("P_b_2_false>=1")&&("P_setbi_24_2>=1")))||(("P_b_2_true>=1")&&("P_setbi_24_2>=1")))U(G(X(X((((((("x_1>=1")&&("P_ifxi_10_0>=1"))||(("x_2>=1")&&("P_ifxi_10_0>=1")))||(("x_0>=1")&&("P_ifxi_10_1>=1")))||(("x_2>=1")&&("P_ifxi_10_1>=1")))||(("x_0>=1")&&("P_ifxi_10_2>=1")))||(("x_1>=1")&&("P_ifxi_10_2>=1"))))))))
Formula 15 simplified : !((("P_b_0_false>=1" & "P_setbi_24_0>=1") | ("P_b_0_true>=1" & "P_setbi_24_0>=1") | ("P_b_1_false>=1" & "P_setbi_24_1>=1") | ("P_b_1_true>=1" & "P_setbi_24_1>=1") | ("P_b_2_false>=1" & "P_setbi_24_2>=1") | ("P_b_2_true>=1" & "P_setbi_24_2>=1")) U GXX(("P_ifxi_10_0>=1" & "x_1>=1") | ("P_ifxi_10_0>=1" & "x_2>=1") | ("P_ifxi_10_1>=1" & "x_0>=1") | ("P_ifxi_10_1>=1" & "x_2>=1") | ("P_ifxi_10_2>=1" & "x_0>=1") | ("P_ifxi_10_2>=1" & "x_1>=1")))
5 unique states visited
5 strongly connected components in search stack
5 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,630.086,902740,1,0,497,63122,1668,222,3588,89811,1274
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1464182763813

--------------------
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
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 25, 2016 1:15:32 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 25, 2016 1:15:32 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 36 ms
May 25, 2016 1:15:32 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 69 places.
May 25, 2016 1:15:32 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 96 transitions.
May 25, 2016 1:15:32 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 44 ms
May 25, 2016 1:15:32 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 11 ms
May 25, 2016 1:15:32 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms

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="S_LamportFastMutEx-PT-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/home/hulinhub/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/S_LamportFastMutEx-PT-2.tgz
mv S_LamportFastMutEx-PT-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_LamportFastMutEx-PT-2, 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 r157kn-blw3-146416412700240"
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 ;