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-3254
Executing tool itstools
Input is S_SimpleLoadBal-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-csrt-149443435000375
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496667569727


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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(((((((((("P_lb_routing_1_1>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_0>=1"))||((("P_lb_routing_1_1>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_routing_1_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_routing_1_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_2>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_0>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_2>=1"))))U(F(F(((((("P_lb_routing_1_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_0>=1"))||((("P_lb_routing_1_1>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_0>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_1>=1")))))))
Formula 0 simplified : !(X(("P_lb_load_1_0>=1" & "P_lb_load_2_0>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_0>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_1>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_1>=1" & "P_lb_load_2_2>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_0>=1" & "P_lb_load_2_0>=1" & "P_lb_routing_1_2>=1") | ("P_lb_load_1_0>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_2>=1") | ("P_lb_load_1_1>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_2>=1") | ("P_lb_load_1_1>=1" & "P_lb_load_2_2>=1" & "P_lb_routing_1_2>=1")) U F(("P_lb_load_1_1>=1" & "P_lb_load_2_0>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_2>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_1>=1" & "P_lb_load_2_0>=1" & "P_lb_routing_1_2>=1") | ("P_lb_load_1_2>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_2>=1")))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 45 rows 32 cols
invariant : -1'P_server_waiting_2 + 1'P_server_notification_2 + 1'P_server_notification_ack_2= 0
invariant : 1'P_server_idle_2 + 1'P_server_waiting_2 + 1'P_server_processed_2= 1
invariant : 1'P_client_idle_1 + 1'P_client_request_1 + 1'P_client_ack_1 + 1'P_server_request_1_1 + 1'P_server_request_1_2 + 1'P_lb_routing_1_1= 1
invariant : -1'P_client_idle_1 + -1'P_client_idle_2 + -1'P_client_request_1 + -1'P_client_request_2 + -1'P_client_ack_1 + -1'P_client_ack_2 + -1'P_server_request_1_1 + -1'P_server_request_1_2 + -1'P_server_request_2_1 + -1'P_server_request_2_2 + 1'P_lb_idle_1 + 1'P_lb_balancing_1= -1
invariant : 1'P_client_idle_1 + 1'P_client_waiting_1= 1
invariant : 1'P_server_idle_1 + 1'P_server_waiting_1 + -1'P_server_notification_1 + -1'P_server_request_1_1 + -1'P_server_request_2_1 + -1'P_lb_load_1_0 + 1'P_lb_load_1_2= 0
invariant : 1'P_server_idle_2 + 1'P_server_waiting_2 + -1'P_server_notification_2 + -1'P_server_request_1_2 + -1'P_server_request_2_2 + -1'P_lb_load_2_0 + 1'P_lb_load_2_2= 0
invariant : 1'P_client_idle_2 + 1'P_client_waiting_2= 1
invariant : -1'P_server_waiting_1 + 1'P_server_notification_1 + 1'P_server_notification_ack_1= 0
invariant : -1'P_server_idle_1 + -1'P_server_waiting_1 + 1'P_server_notification_1 + 1'P_server_request_1_1 + 1'P_server_request_2_1 + 2'P_lb_load_1_0 + 1'P_lb_load_1_1= 1
invariant : 1'P_client_idle_2 + 1'P_client_request_2 + 1'P_client_ack_2 + 1'P_server_request_2_1 + 1'P_server_request_2_2 + 1'P_lb_routing_1_2= 1
invariant : -1'P_server_idle_2 + -1'P_server_waiting_2 + 1'P_server_notification_2 + 1'P_server_request_1_2 + 1'P_server_request_2_2 + 2'P_lb_load_2_0 + 1'P_lb_load_2_1= 1
invariant : 1'P_server_idle_1 + 1'P_server_waiting_1 + 1'P_server_processed_1= 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
12 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.173272,30516,1,0,136,14838,167,63,1503,13956,185
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((("P_client_request_1>=1")&&("P_lb_idle_1>=1"))||(("P_client_request_2>=1")&&("P_lb_idle_1>=1"))))
Formula 1 simplified : !(("P_client_request_1>=1" & "P_lb_idle_1>=1") | ("P_client_request_2>=1" & "P_lb_idle_1>=1"))
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.190287,31264,1,0,136,16081,188,63,1549,17269,197
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X((X(X((((("P_server_request_1_2>=1")&&("P_lb_balancing_1>=1"))&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_2>=1"))||(((("P_server_request_2_2>=1")&&("P_lb_balancing_1>=1"))&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_2>=1")))))U((((((((((("P_lb_routing_1_1>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_0>=1"))||((("P_lb_routing_1_1>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_routing_1_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_routing_1_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_2>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_0>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_2>=1")))U(((((("P_lb_routing_1_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_0>=1"))||((("P_lb_routing_1_1>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_0>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_1>=1")))))))
Formula 2 simplified : !X(XX(("P_lb_balancing_1>=1" & "P_lb_load_1_0>=1" & "P_lb_load_2_2>=1" & "P_server_request_1_2>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_0>=1" & "P_lb_load_2_2>=1" & "P_server_request_2_2>=1")) U ((("P_lb_load_1_0>=1" & "P_lb_load_2_0>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_0>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_1>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_1>=1" & "P_lb_load_2_2>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_0>=1" & "P_lb_load_2_0>=1" & "P_lb_routing_1_2>=1") | ("P_lb_load_1_0>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_2>=1") | ("P_lb_load_1_1>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_2>=1") | ("P_lb_load_1_1>=1" & "P_lb_load_2_2>=1" & "P_lb_routing_1_2>=1")) U (("P_lb_load_1_1>=1" & "P_lb_load_2_0>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_2>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_1>=1" & "P_lb_load_2_0>=1" & "P_lb_routing_1_2>=1") | ("P_lb_load_1_2>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_2>=1"))))
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.381527,32032,1,0,154,16978,366,71,1728,19118,258
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((((((((("P_lb_balancing_1>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_0>=1"))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_0>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_2>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_2>=1"))))
Formula 3 simplified : !(("P_lb_balancing_1>=1" & "P_lb_load_1_0>=1" & "P_lb_load_2_0>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_0>=1" & "P_lb_load_2_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_1>=1" & "P_lb_load_2_0>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_1>=1" & "P_lb_load_2_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_1>=1" & "P_lb_load_2_2>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_2>=1" & "P_lb_load_2_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_2>=1" & "P_lb_load_2_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,0.383876,32032,1,0,154,16978,396,71,1757,19118,260
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((F(G(X((((((((("P_lb_balancing_1>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_0>=1"))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_0>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_2>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_2>=1"))))))U(X((("P_server_waiting_1>=1")&&("P_server_notification_ack_1>=1"))||(("P_server_waiting_2>=1")&&("P_server_notification_ack_2>=1"))))))
Formula 4 simplified : !(FGX(("P_lb_balancing_1>=1" & "P_lb_load_1_0>=1" & "P_lb_load_2_0>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_0>=1" & "P_lb_load_2_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_1>=1" & "P_lb_load_2_0>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_1>=1" & "P_lb_load_2_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_1>=1" & "P_lb_load_2_2>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_2>=1" & "P_lb_load_2_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_2>=1" & "P_lb_load_2_2>=1")) U X(("P_server_notification_ack_1>=1" & "P_server_waiting_1>=1") | ("P_server_notification_ack_2>=1" & "P_server_waiting_2>=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]
26 unique states visited
6 strongly connected components in search stack
26 transitions explored
23 items max in DFS search stack
48 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.00274,45112,1,0,677,70613,455,272,1809,115092,1283
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(X(G(G((((((((("P_lb_balancing_1>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_0>=1"))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_0>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_2>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_balancing_1>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_2>=1"))))))))
Formula 5 simplified : !FXG(("P_lb_balancing_1>=1" & "P_lb_load_1_0>=1" & "P_lb_load_2_0>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_0>=1" & "P_lb_load_2_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_1>=1" & "P_lb_load_2_0>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_1>=1" & "P_lb_load_2_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_1>=1" & "P_lb_load_2_2>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_2>=1" & "P_lb_load_2_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_2>=1" & "P_lb_load_2_2>=1"))
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,1.09098,48448,1,0,808,86671,462,323,1809,142094,1543
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((((F((("P_server_waiting_1>=1")&&("P_server_notification_ack_1>=1"))||(("P_server_waiting_2>=1")&&("P_server_notification_ack_2>=1"))))U(((((("P_lb_routing_1_1>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_0>=1"))||((("P_lb_routing_1_1>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_1>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_1>=1"))&&("P_lb_load_2_0>=1")))||((("P_lb_routing_1_2>=1")&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_1>=1"))))U(("P_server_processed_1>=1")||("P_server_processed_2>=1"))))
Formula 6 simplified : !((F(("P_server_notification_ack_1>=1" & "P_server_waiting_1>=1") | ("P_server_notification_ack_2>=1" & "P_server_waiting_2>=1")) U (("P_lb_load_1_1>=1" & "P_lb_load_2_0>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_2>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_1>=1") | ("P_lb_load_1_1>=1" & "P_lb_load_2_0>=1" & "P_lb_routing_1_2>=1") | ("P_lb_load_1_2>=1" & "P_lb_load_2_1>=1" & "P_lb_routing_1_2>=1"))) U ("P_server_processed_1>=1" | "P_server_processed_2>=1"))
11 unique states visited
8 strongly connected components in search stack
11 transitions explored
9 items max in DFS search stack
12 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.32996,52564,1,0,1093,101422,571,429,1908,163246,2249
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((("P_server_waiting_1>=1")&&("P_server_notification_ack_1>=1"))||(("P_server_waiting_2>=1")&&("P_server_notification_ack_2>=1"))))
Formula 7 simplified : !(("P_server_notification_ack_1>=1" & "P_server_waiting_1>=1") | ("P_server_notification_ack_2>=1" & "P_server_waiting_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,1.33088,52824,1,0,1093,101422,571,429,1908,163246,2251
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(((((((("P_server_notification_1>=1")&&("P_lb_balancing_1>=1"))&&("P_lb_load_1_1>=1"))||((("P_server_notification_1>=1")&&("P_lb_balancing_1>=1"))&&("P_lb_load_1_2>=1")))||((("P_server_notification_2>=1")&&("P_lb_balancing_1>=1"))&&("P_lb_load_2_1>=1")))||((("P_server_notification_2>=1")&&("P_lb_balancing_1>=1"))&&("P_lb_load_2_2>=1")))U((("P_server_waiting_1>=1")&&("P_server_notification_ack_1>=1"))||(("P_server_waiting_2>=1")&&("P_server_notification_ack_2>=1"))))U(((("P_server_waiting_1>=1")&&("P_server_notification_ack_1>=1"))||(("P_server_waiting_2>=1")&&("P_server_notification_ack_2>=1")))U(((((("P_server_notification_1>=1")&&("P_lb_idle_1>=1"))&&("P_lb_load_1_1>=1"))||((("P_server_notification_1>=1")&&("P_lb_idle_1>=1"))&&("P_lb_load_1_2>=1")))||((("P_server_notification_2>=1")&&("P_lb_idle_1>=1"))&&("P_lb_load_2_1>=1")))||((("P_server_notification_2>=1")&&("P_lb_idle_1>=1"))&&("P_lb_load_2_2>=1")))))))
Formula 8 simplified : !X(((("P_lb_balancing_1>=1" & "P_lb_load_1_1>=1" & "P_server_notification_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_2>=1" & "P_server_notification_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_2_1>=1" & "P_server_notification_2>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_2_2>=1" & "P_server_notification_2>=1")) U (("P_server_notification_ack_1>=1" & "P_server_waiting_1>=1") | ("P_server_notification_ack_2>=1" & "P_server_waiting_2>=1"))) U ((("P_server_notification_ack_1>=1" & "P_server_waiting_1>=1") | ("P_server_notification_ack_2>=1" & "P_server_waiting_2>=1")) U (("P_lb_idle_1>=1" & "P_lb_load_1_1>=1" & "P_server_notification_1>=1") | ("P_lb_idle_1>=1" & "P_lb_load_1_2>=1" & "P_server_notification_1>=1") | ("P_lb_idle_1>=1" & "P_lb_load_2_1>=1" & "P_server_notification_2>=1") | ("P_lb_idle_1>=1" & "P_lb_load_2_2>=1" & "P_server_notification_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,1.63677,53972,1,0,1093,101436,748,429,2081,163274,2260
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X((((("P_server_request_1_1>=1")&&("P_lb_balancing_1>=1"))&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_0>=1"))||(((("P_server_request_2_1>=1")&&("P_lb_balancing_1>=1"))&&("P_lb_load_1_2>=1"))&&("P_lb_load_2_0>=1")))))
Formula 9 simplified : !X(("P_lb_balancing_1>=1" & "P_lb_load_1_2>=1" & "P_lb_load_2_0>=1" & "P_server_request_1_1>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_2>=1" & "P_lb_load_2_0>=1" & "P_server_request_2_1>=1"))
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,1.63841,53972,1,0,1093,101436,773,429,2103,163276,2262
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SimpleLoadBal-COL-02-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((F(G(F((((("P_server_request_1_2>=1")&&("P_lb_balancing_1>=1"))&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_2>=1"))||(((("P_server_request_2_2>=1")&&("P_lb_balancing_1>=1"))&&("P_lb_load_1_0>=1"))&&("P_lb_load_2_2>=1"))))))U(G(((("P_server_waiting_1>=1")&&("P_server_notification_ack_1>=1"))||(("P_server_waiting_2>=1")&&("P_server_notification_ack_2>=1")))U((((("P_server_idle_1>=1")&&("P_server_request_1_1>=1"))||(("P_server_idle_1>=1")&&("P_server_request_2_1>=1")))||(("P_server_idle_2>=1")&&("P_server_request_1_2>=1")))||(("P_server_idle_2>=1")&&("P_server_request_2_2>=1")))))))
Formula 10 simplified : !(FGF(("P_lb_balancing_1>=1" & "P_lb_load_1_0>=1" & "P_lb_load_2_2>=1" & "P_server_request_1_2>=1") | ("P_lb_balancing_1>=1" & "P_lb_load_1_0>=1" & "P_lb_load_2_2>=1" & "P_server_request_2_2>=1")) U G((("P_server_notification_ack_1>=1" & "P_server_waiting_1>=1") | ("P_server_notification_ack_2>=1" & "P_server_waiting_2>=1")) U (("P_server_idle_1>=1" & "P_server_request_1_1>=1") | ("P_server_idle_1>=1" & "P_server_request_2_1>=1") | ("P_server_idle_2>=1" & "P_server_request_1_2>=1") | ("P_server_idle_2>=1" & "P_server_request_2_2>=1"))))
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0
Exit code :1
FORMULA SimpleLoadBal-COL-02-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA SimpleLoadBal-COL-02-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA SimpleLoadBal-COL-02-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA SimpleLoadBal-COL-02-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA SimpleLoadBal-COL-02-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA SimpleLoadBal-COL-02-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.

BK_STOP 1496667574654

--------------------
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/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.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 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 05, 2017 12:59:31 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 05, 2017 12:59:31 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 47 ms
Jun 05, 2017 12:59:31 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 32 places.
Jun 05, 2017 12:59:31 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 45 transitions.
Jun 05, 2017 12:59:31 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 37 ms
Jun 05, 2017 12:59:31 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
Jun 05, 2017 12:59:31 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 13 place invariants in 15 ms
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 32 variables to be positive in 88 ms
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 45 transitions.
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/45 took 5 ms. Total solver calls (SAT/UNSAT): 20(5/15)
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 163 ms. Total solver calls (SAT/UNSAT): 885(115/770)
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 45 transitions.
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 248 ms. Total solver calls (SAT/UNSAT): 885(146/739)
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 45 transitions.
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 155 ms. Total solver calls (SAT/UNSAT): 1035(303/732)
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 45 transitions.
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 05, 2017 12:59:32 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 909ms conformant to PINS in folder :/home/mcc/execution
Jun 05, 2017 12:59:34 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (<>([](<>((LTLAP3==true)))))U([](((LTLAP5==true))U((LTLAP10==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.001: Registering PINS so language module
pins2lts-seq, 0.001: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 57, guards 45
pins2lts-seq, 0.005: LTL layer: formula: (<>([](<>((LTLAP3==true)))))U([](((LTLAP5==true))U((LTLAP10==true))))
pins2lts-seq, 0.005: Expression is: ((<> ([] (<> (LTLAP3 == true )))) U ([] ((LTLAP5 == true ) U (LTLAP10 == true ))))
pins2lts-seq, 0.005: buchi has 9 states
pins2lts-seq, 0.005: state 0: non-accepting
pins2lts-seq, 0.005: -> 1, | !(LTLAP10 == true )
pins2lts-seq, 0.005: -> 2, | !(LTLAP10 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.005: -> 3, | !(LTLAP10 == true )
pins2lts-seq, 0.005: -> 4, | !(LTLAP10 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.005: -> 5, | !(LTLAP10 == true ) && !(LTLAP5 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.005: -> 6, | !(LTLAP10 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.005: -> 0, | true
pins2lts-seq, 0.005: -> 7, | !(LTLAP3 == true )
pins2lts-seq, 0.005: -> 8, | true
pins2lts-seq, 0.005: state 1: accepting
pins2lts-seq, 0.005: -> 1, | !(LTLAP10 == true )
pins2lts-seq, 0.005: -> 2, | !(LTLAP10 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.005: -> 3, | !(LTLAP10 == true )
pins2lts-seq, 0.005: -> 4, | !(LTLAP10 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.005: -> 5, | !(LTLAP10 == true ) && !(LTLAP5 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: -> 6, | !(LTLAP10 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.006: state 2: accepting
pins2lts-seq, 0.006: -> 2, | !(LTLAP10 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: -> 5, | !(LTLAP10 == true ) && !(LTLAP5 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: state 3: non-accepting
pins2lts-seq, 0.006: -> 3, | !(LTLAP10 == true )
pins2lts-seq, 0.006: -> 2, | !(LTLAP10 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: -> 6, | !(LTLAP10 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.006: -> 5, | !(LTLAP10 == true ) && !(LTLAP5 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: state 4: accepting
pins2lts-seq, 0.006: -> 1, | !(LTLAP10 == true )
pins2lts-seq, 0.006: -> 2, | !(LTLAP10 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: -> 3, | !(LTLAP10 == true )
pins2lts-seq, 0.006: -> 4, | !(LTLAP10 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.006: -> 5, | !(LTLAP10 == true ) && !(LTLAP5 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: -> 6, | !(LTLAP10 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.006: -> 0, | true
pins2lts-seq, 0.006: -> 7, | !(LTLAP3 == true )
pins2lts-seq, 0.006: -> 8, | true
pins2lts-seq, 0.006: state 5: accepting
pins2lts-seq, 0.006: -> 5, | !(LTLAP3 == true )
pins2lts-seq, 0.006: state 6: non-accepting
pins2lts-seq, 0.006: -> 6, | true
pins2lts-seq, 0.006: -> 5, | !(LTLAP3 == true )
pins2lts-seq, 0.006: state 7: non-accepting
pins2lts-seq, 0.006: -> 7, | !(LTLAP3 == true )
pins2lts-seq, 0.006: -> 5, | !(LTLAP10 == true ) && !(LTLAP5 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: -> 2, | !(LTLAP10 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: state 8: non-accepting
pins2lts-seq, 0.006: -> 8, | true
pins2lts-seq, 0.006: -> 7, | !(LTLAP3 == true )
pins2lts-seq, 0.006: -> 6, | !(LTLAP10 == true ) && !(LTLAP5 == true )
pins2lts-seq, 0.006: -> 5, | !(LTLAP10 == true ) && !(LTLAP5 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: -> 3, | !(LTLAP10 == true )
pins2lts-seq, 0.006: -> 2, | !(LTLAP10 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.007: There are 58 state labels and 1 edge labels
pins2lts-seq, 0.007: State length is 33, there are 87 groups
pins2lts-seq, 0.007: Running scc search strategy
pins2lts-seq, 0.007: Using a tree for state storage
pins2lts-seq, 0.007: Visible groups: 273 / 87, labels: 3 / 58
pins2lts-seq, 0.007: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.009: accepting cycle found!
pins2lts-seq, 0.009: exiting now

Jun 05, 2017 12:59:34 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP11==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 57, guards 45
pins2lts-seq, 0.002: LTL layer: formula: (LTLAP11==true)
pins2lts-seq, 0.002: Expression is: (LTLAP11 == true )
pins2lts-seq, 0.002: buchi has 2 states
pins2lts-seq, 0.002: state 0: accepting
pins2lts-seq, 0.003: -> 1, | !(LTLAP11 == true )
pins2lts-seq, 0.003: state 1: accepting
pins2lts-seq, 0.003: -> 1, | true
pins2lts-seq, 0.003: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.003: There are 58 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 33, there are 47 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.003: Visible groups: 0 / 47, labels: 1 / 58
pins2lts-seq, 0.003: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.005: accepting cycle found!
pins2lts-seq, 0.005: exiting now

Jun 05, 2017 12:59:34 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (<>(<>(<>((LTLAP11==true)))))U(<>(X((LTLAP0==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: (<>(<>(<>((LTLAP11==true)))))U(<>(X((LTLAP0==true))))
pins2lts-seq, 0.000: Expression is: ((<> (<> (<> (LTLAP11 == true )))) U (<> (X (LTLAP0 == true ))))
pins2lts-seq, 0.000: buchi has 3 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.001: -> 2, | !(LTLAP11 == true )
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.001: -> 2, | !(LTLAP0 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 2, | !(LTLAP0 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.001: There are 58 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 33, there are 50 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.003: state space 4 levels, 15 states 22 transitions

Jun 05, 2017 12:59:34 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP4==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 57, guards 45
pins2lts-seq, 0.002: LTL layer: formula: (LTLAP4==true)
pins2lts-seq, 0.002: Expression is: (LTLAP4 == true )
pins2lts-seq, 0.002: buchi has 2 states
pins2lts-seq, 0.002: state 0: accepting
pins2lts-seq, 0.002: -> 1, | !(LTLAP4 == true )
pins2lts-seq, 0.002: state 1: accepting
pins2lts-seq, 0.002: -> 1, | true
pins2lts-seq, 0.002: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.003: There are 58 state labels and 1 edge labels
pins2lts-seq, 0.003: State length is 33, there are 47 groups
pins2lts-seq, 0.003: Running scc search strategy
pins2lts-seq, 0.003: Using a tree for state storage
pins2lts-seq, 0.003: Visible groups: 0 / 47, labels: 1 / 58
pins2lts-seq, 0.003: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now

Jun 05, 2017 12:59:34 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, X((LTLAP11==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: X((LTLAP11==true))
pins2lts-seq, 0.000: Expression is: (X (LTLAP11 == true ))
pins2lts-seq, 0.000: buchi has 3 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 2, | !(LTLAP11 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 2, | true
pins2lts-seq, 0.001: There are 58 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 33, there are 48 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.003: accepting cycle found!
pins2lts-seq, 0.003: exiting now

Jun 05, 2017 12:59:34 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>((LTLAP7==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 57, guards 45
pins2lts-seq, 0.001: LTL layer: formula: <>((LTLAP7==true))
pins2lts-seq, 0.002: Expression is: (<> (LTLAP7 == true ))
pins2lts-seq, 0.002: buchi has 1 states
pins2lts-seq, 0.002: state 0: accepting
pins2lts-seq, 0.002: -> 0, | !(LTLAP7 == true )
pins2lts-seq, 0.002: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.002: There are 58 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 33, there are 46 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.002: Visible groups: 0 / 46, labels: 1 / 58
pins2lts-seq, 0.002: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.005: accepting cycle found!
pins2lts-seq, 0.005: exiting now

Jun 05, 2017 12:59:34 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 05, 2017 12:59:34 PM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
Jun 05, 2017 12:59:34 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed

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_SimpleLoadBal-PT-02"
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

tar xzf /home/mcc/BenchKit/INPUTS/S_SimpleLoadBal-PT-02.tgz
mv S_SimpleLoadBal-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is S_SimpleLoadBal-PT-02, 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 r150-csrt-149443435000375"
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 ;