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_NeoElection-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-blw7-149441652000266
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496442750225


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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X("(((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)<=0")))
Formula 0 simplified : !X"(((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)<=0"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 343 rows 177 cols
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
38 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.43622,36196,1,0,53,14816,382,24,5031,8784,373
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(X(F(F(false))))))
Formula 1 simplified : 1
invariant : 1'P_electedPrimary_1 + 1'P_electedSecondary_1 + 1'P_negotiation_1_2_NONE + 1'P_poll__handlingMessage_1 + 1'P_poll__pollEnd_1 + 1'P_poll__waitingMessage_1 + 1'P_polling_1 + 1'P_sendAnnPs__broadcasting_1_1 + 1'P_sendAnnPs__broadcasting_1_2 + 1'P_startNeg__broadcasting_1_2= 1
invariant : 1'P_negotiation_0_2_NONE= 0
invariant : 1'P_electedPrimary_0 + 1'P_electedSecondary_0 + 1'P_poll__handlingMessage_0 + 1'P_poll__pollEnd_0 + 1'P_poll__waitingMessage_0 + 1'P_polling_0 + 1'P_sendAnnPs__broadcasting_0_1 + 1'P_sendAnnPs__broadcasting_0_2 + 1'P_startNeg__broadcasting_0_2= 0
invariant : 1'P_negotiation_2_1_NONE + 1'P_negotiation_2_1_CO + 1'P_negotiation_2_1_DONE= 1
invariant : 1'P_masterState_0_F_0 + 1'P_masterState_0_F_1 + 1'P_masterState_0_F_2 + 1'P_masterState_0_T_0 + 1'P_masterState_0_T_1 + 1'P_masterState_0_T_2= 0
invariant : 1'P_electionInit_0 + 1'P_startNeg__broadcasting_0_1= 0
invariant : 1'P_negotiation_1_1_CO + 1'P_negotiation_1_1_DONE= 1
invariant : 1'P_negotiation_0_1_NONE= 0
invariant : 1'P_negotiation_0_0_NONE= 0
invariant : 1'P_electedPrimary_0 + 1'P_poll__waitingMessage_0 + 1'P_sendAnnPs__broadcasting_0_1 + 1'P_stage_0_SEC= 0
invariant : 1'P_masterState_2_F_0 + 1'P_masterState_2_F_1 + 1'P_masterState_2_F_2 + 1'P_masterState_2_T_0 + 1'P_masterState_2_T_1 + 1'P_masterState_2_T_2= 1
invariant : -1'P_poll__waitingMessage_1 + 1'P_stage_1_NEG= 1
invariant : 1'P_poll__waitingMessage_2 + 1'P_stage_2_PRIM + 1'P_stage_2_SEC= 0
invariant : 1'P_electedPrimary_2 + 1'P_electedSecondary_2 + 1'P_negotiation_2_1_NONE + 1'P_poll__handlingMessage_2 + 1'P_poll__pollEnd_2 + 1'P_poll__waitingMessage_2 + 1'P_polling_2 + 1'P_sendAnnPs__broadcasting_2_1 + 1'P_sendAnnPs__broadcasting_2_2 + 1'P_startNeg__broadcasting_2_2= 1
invariant : 1'P_negotiation_1_0_NONE= 0
invariant : 1'P_negotiation_1_0_CO + 1'P_negotiation_1_0_DONE= 0
invariant : -1'P_poll__waitingMessage_2 + 1'P_stage_2_NEG= 1
invariant : 1'P_negotiation_2_2_NONE= 0
invariant : 1'P_electionInit_2 + -1'P_negotiation_2_1_NONE + 1'P_startNeg__broadcasting_2_1= 0
invariant : 1'P_negotiation_2_2_CO + 1'P_negotiation_2_2_DONE= 1
invariant : -1'P_poll__waitingMessage_0 + 1'P_stage_0_NEG= 0
invariant : 1'P_poll__waitingMessage_1 + 1'P_stage_1_PRIM + 1'P_stage_1_SEC= 0
invariant : 1'P_masterState_1_F_0 + 1'P_masterState_1_F_1 + 1'P_masterState_1_F_2 + 1'P_masterState_1_T_0 + 1'P_masterState_1_T_1 + 1'P_masterState_1_T_2= 1
invariant : 1'P_electionInit_1 + -1'P_negotiation_1_2_NONE + 1'P_startNeg__broadcasting_1_1= 0
invariant : 1'P_negotiation_2_0_CO + 1'P_negotiation_2_0_DONE= 0
invariant : -1'P_electedPrimary_0 + -1'P_sendAnnPs__broadcasting_0_1 + 1'P_stage_0_PRIM= 0
invariant : 1'P_negotiation_0_0_CO + 1'P_negotiation_0_0_DONE= 0
invariant : 1'P_negotiation_1_2_NONE + 1'P_negotiation_1_2_CO + 1'P_negotiation_1_2_DONE= 1
invariant : 1'P_negotiation_2_0_NONE= 0
invariant : 1'P_negotiation_0_2_CO + 1'P_negotiation_0_2_DONE= 0
invariant : 1'P_negotiation_0_1_CO + 1'P_negotiation_0_1_DONE= 0
invariant : 1'P_negotiation_1_1_NONE= 0
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
15 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.592822,40244,1,0,84,27691,388,88,5194,20922,482
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((("((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)>=2")U("((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)>=0"))U("((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)<=((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)")))
Formula 2 simplified : !(("((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)>=2" U "((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)>=0") U "((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)<=((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)")
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.595117,41080,1,0,84,27691,410,88,5225,20923,488
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G((F("((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)>=3"))U(G("((P_electionInit_0+P_electionInit_1)+P_electionInit_2)<=0")))))
Formula 3 simplified : !G(F"((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)>=3" U G"((P_electionInit_0+P_electionInit_1)+P_electionInit_2)<=0")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.706315,45756,1,0,144,44262,428,151,5240,43457,724
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F("(((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2)>=3")))
Formula 4 simplified : !F"(((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2)>=3"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.722874,46292,1,0,174,44402,437,215,5260,44353,953
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G((X("((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)>=0"))U(F("((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)<=0")))))
Formula 5 simplified : !G(X"((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)>=0" U F"((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)<=0")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.818786,49280,1,0,226,54045,446,269,5267,54271,1099
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((false))
Formula 6 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.819024,49280,1,0,226,54045,446,269,5267,54271,1099
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)<=((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)"))
Formula 7 simplified : !"((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)<=((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)"
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.821656,49380,1,0,226,54045,449,269,5298,54271,1102
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(F(G(G("(((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)<=0"))))))
Formula 8 simplified : !FG"(((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)<=0"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.839195,50148,1,0,226,54045,459,269,5304,54272,1335
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((G(X("((P_polling_0+P_polling_1)+P_polling_2)>=3")))U(G(G("((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)>=0")))))
Formula 9 simplified : !(GX"((P_polling_0+P_polling_1)+P_polling_2)>=3" U G"((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)>=0")
96 unique states visited
0 strongly connected components in search stack
98 transitions explored
33 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.889176,52860,1,0,226,54087,481,298,5336,66139,1847
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((F(G("(((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2)>=2")))U("((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)>=0")))
Formula 10 simplified : !(FG"(((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2)>=2" U "((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)>=0")
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.890189,52868,1,0,226,54087,484,298,5340,66139,1849
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(F(G(F(false))))))
Formula 11 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.890335,52976,1,0,226,54087,484,298,5340,66139,1849
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((("((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)>=1")U("((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)>=3"))U(F(G("(((((P_startNeg__broadcasting_0_1+P_startNeg__broadcasting_0_2)+P_startNeg__broadcasting_1_1)+P_startNeg__broadcasting_1_2)+P_startNeg__broadcasting_2_1)+P_startNeg__broadcasting_2_2)>=3")))))
Formula 12 simplified : !(("((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)>=1" U "((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)>=3") U FG"(((((P_startNeg__broadcasting_0_1+P_startNeg__broadcasting_0_2)+P_startNeg__broadcasting_1_1)+P_startNeg__broadcasting_1_2)+P_startNeg__broadcasting_2_1)+P_startNeg__broadcasting_2_2)>=3")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.916009,54404,1,0,226,54231,497,298,5371,66302,2149
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((P_network_0_0_AskP_0+P_network_0_0_AnsP_0)+P_network_0_0_AnsP_1)+P_network_0_0_AnsP_2)+P_network_0_0_RI_0)+P_network_0_0_AI_0)+P_network_0_0_AnnP_0)+P_network_0_0_RP_0)+P_network_0_1_AskP_0)+P_network_0_1_AnsP_0)+P_network_0_1_AnsP_1)+P_network_0_1_AnsP_2)+P_network_0_1_RI_0)+P_network_0_1_AI_0)+P_network_0_1_AnnP_0)+P_network_0_1_RP_0)+P_network_0_2_AskP_0)+P_network_0_2_AnsP_0)+P_network_0_2_AnsP_1)+P_network_0_2_AnsP_2)+P_network_0_2_RI_0)+P_network_0_2_AI_0)+P_network_0_2_AnnP_0)+P_network_0_2_RP_0)+P_network_1_0_AskP_0)+P_network_1_0_AnsP_0)+P_network_1_0_AnsP_1)+P_network_1_0_AnsP_2)+P_network_1_0_RI_0)+P_network_1_0_AI_0)+P_network_1_0_AnnP_0)+P_network_1_0_RP_0)+P_network_1_1_AskP_0)+P_network_1_1_AnsP_0)+P_network_1_1_AnsP_1)+P_network_1_1_AnsP_2)+P_network_1_1_RI_0)+P_network_1_1_AI_0)+P_network_1_1_AnnP_0)+P_network_1_1_RP_0)+P_network_1_2_AskP_0)+P_network_1_2_AnsP_0)+P_network_1_2_AnsP_1)+P_network_1_2_AnsP_2)+P_network_1_2_RI_0)+P_network_1_2_AI_0)+P_network_1_2_AnnP_0)+P_network_1_2_RP_0)+P_network_2_0_AskP_0)+P_network_2_0_AnsP_0)+P_network_2_0_AnsP_1)+P_network_2_0_AnsP_2)+P_network_2_0_RI_0)+P_network_2_0_AI_0)+P_network_2_0_AnnP_0)+P_network_2_0_RP_0)+P_network_2_1_AskP_0)+P_network_2_1_AnsP_0)+P_network_2_1_AnsP_1)+P_network_2_1_AnsP_2)+P_network_2_1_RI_0)+P_network_2_1_AI_0)+P_network_2_1_AnnP_0)+P_network_2_1_RP_0)+P_network_2_2_AskP_0)+P_network_2_2_AnsP_0)+P_network_2_2_AnsP_1)+P_network_2_2_AnsP_2)+P_network_2_2_RI_0)+P_network_2_2_AI_0)+P_network_2_2_AnnP_0)+P_network_2_2_RP_0)"))
Formula 13 simplified : !"((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((P_network_0_0_AskP_0+P_network_0_0_AnsP_0)+P_network_0_0_AnsP_1)+P_network_0_0_AnsP_2)+P_network_0_0_RI_0)+P_network_0_0_AI_0)+P_network_0_0_AnnP_0)+P_network_0_0_RP_0)+P_network_0_1_AskP_0)+P_network_0_1_AnsP_0)+P_network_0_1_AnsP_1)+P_network_0_1_AnsP_2)+P_network_0_1_RI_0)+P_network_0_1_AI_0)+P_network_0_1_AnnP_0)+P_network_0_1_RP_0)+P_network_0_2_AskP_0)+P_network_0_2_AnsP_0)+P_network_0_2_AnsP_1)+P_network_0_2_AnsP_2)+P_network_0_2_RI_0)+P_network_0_2_AI_0)+P_network_0_2_AnnP_0)+P_network_0_2_RP_0)+P_network_1_0_AskP_0)+P_network_1_0_AnsP_0)+P_network_1_0_AnsP_1)+P_network_1_0_AnsP_2)+P_network_1_0_RI_0)+P_network_1_0_AI_0)+P_network_1_0_AnnP_0)+P_network_1_0_RP_0)+P_network_1_1_AskP_0)+P_network_1_1_AnsP_0)+P_network_1_1_AnsP_1)+P_network_1_1_AnsP_2)+P_network_1_1_RI_0)+P_network_1_1_AI_0)+P_network_1_1_AnnP_0)+P_network_1_1_RP_0)+P_network_1_2_AskP_0)+P_network_1_2_AnsP_0)+P_network_1_2_AnsP_1)+P_network_1_2_AnsP_2)+P_network_1_2_RI_0)+P_network_1_2_AI_0)+P_network_1_2_AnnP_0)+P_network_1_2_RP_0)+P_network_2_0_AskP_0)+P_network_2_0_AnsP_0)+P_network_2_0_AnsP_1)+P_network_2_0_AnsP_2)+P_network_2_0_RI_0)+P_network_2_0_AI_0)+P_network_2_0_AnnP_0)+P_network_2_0_RP_0)+P_network_2_1_AskP_0)+P_network_2_1_AnsP_0)+P_network_2_1_AnsP_1)+P_network_2_1_AnsP_2)+P_network_2_1_RI_0)+P_network_2_1_AI_0)+P_network_2_1_AnnP_0)+P_network_2_1_RP_0)+P_network_2_2_AskP_0)+P_network_2_2_AnsP_0)+P_network_2_2_AnsP_1)+P_network_2_2_AnsP_2)+P_network_2_2_RI_0)+P_network_2_2_AI_0)+P_network_2_2_AnnP_0)+P_network_2_2_RP_0)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.927083,54404,1,0,226,54231,500,298,5447,66302,2151
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(X(G(X("((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)>=2"))))))
Formula 14 simplified : !GXGX"((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)>=2"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.930388,54728,1,0,227,54280,506,299,5454,66421,2164
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(X(F(false)))))
Formula 15 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.930623,54728,1,0,227,54280,506,299,5454,66421,2164
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496442754335

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 02, 2017 10:32:31 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 10:32:31 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 108 ms
Jun 02, 2017 10:32:31 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 438 places.
Jun 02, 2017 10:32:31 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 357 transitions.
Jun 02, 2017 10:32:32 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 261 fixed domain variables (out of 438 variables) in GAL type NeoElection_PT_2
Jun 02, 2017 10:32:32 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Found a total of 261 constant array cells/variables (out of 438 variables) in type NeoElection_PT_2
Jun 02, 2017 10:32:32 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: P_network_1_0_AskP_1,P_poll__networl_0_2_RI_0,P_poll__networl_0_1_AnnP_1,P_network_0_0_RI_1,P_network_2_1_AnnP_2,P_poll__networl_2_1_AnnP_1,P_network_1_1_RP_1,P_network_2_2_AI_2,P_poll__networl_1_2_RI_1,P_poll__networl_1_1_AI_0,P_poll__networl_2_1_AskP_0,P_network_0_2_AI_2,P_poll__networl_2_1_AI_2,P_poll__networl_0_2_AI_2,P_poll__networl_1_2_AskP_0,P_poll__networl_0_1_AnnP_2,P_network_1_1_RP_2,P_poll__networl_1_0_AskP_2,P_network_1_0_AnnP_2,P_network_0_0_AskP_2,P_poll__networl_0_0_AI_1,P_poll__networl_0_0_RP_0,P_poll__networl_2_0_AnnP_1,P_masterList_0_1_2,P_poll__networl_1_1_RI_0,P_network_1_2_AnnP_2,P_network_2_1_AskP_2,P_masterList_2_2_0,P_network_1_1_AnnP_2,P_network_2_1_AskP_1,P_network_1_0_AskP_2,P_poll__networl_1_1_AnnP_2,P_poll__networl_0_2_AI_0,P_network_2_0_AnnP_2,P_network_2_0_AI_1,P_network_1_2_AI_2,P_poll__networl_1_1_AI_1,P_poll__networl_2_1_AnnP_2,P_network_2_0_AI_2,P_network_0_1_RP_2,P_poll__networl_0_1_AnsP_0,P_poll__networl_0_1_AI_0,P_poll__networl_2_0_RP_2,P_poll__networl_2_0_AI_2,P_poll__networl_0_0_AnnP_2,P_poll__networl_2_2_AskP_0,P_poll__networl_1_0_AnnP_2,P_network_2_1_RP_2,P_network_1_2_AI_1,P_network_2_1_AnnP_1,P_poll__networl_0_1_RP_0,P_poll__networl_0_0_RI_1,P_poll__networl_1_1_AnnP_1,P_poll__networl_1_0_RP_1,P_network_0_2_AnnP_2,P_poll__networl_0_1_RI_2,P_masterList_0_2_2,P_poll__networl_0_1_AnnP_0,P_poll__networl_0_0_AnnP_0,P_poll__networl_2_2_AI_2,P_poll__networl_1_0_AskP_0,P_poll__networl_1_2_AnnP_2,P_poll__networl_2_2_RI_0,P_poll__networl_0_2_AnnP_0,P_masterList_0_2_0,P_network_0_1_AI_1,P_poll__networl_0_2_RP_1,P_masterList_2_2_1,P_poll__networl_2_0_AnnP_0,P_poll__networl_2_1_RI_1,P_poll__networl_1_0_RP_2,P_poll__networl_1_1_RP_1,P_poll__networl_1_0_AnsP_0,P_dead_1,P_poll__networl_0_1_AI_1,P_network_2_1_AI_1,P_poll__networl_1_0_RI_0,P_network_0_2_RP_1,P_poll__networl_2_2_RI_2,P_masterList_1_1_0,P_masterList_1_2_0,P_poll__networl_2_0_AskP_0,P_poll__networl_1_0_AskP_1,P_poll__networl_0_2_AskP_1,P_poll__networl_2_2_RP_1,P_network_2_1_RI_1,P_network_0_0_AI_2,P_network_0_1_AI_2,P_crashed_0,P_poll__networl_2_0_RI_2,P_network_1_0_RP_1,P_network_2_0_AskP_2,P_poll__networl_0_2_RP_2,P_poll__networl_2_0_RI_1,P_network_1_1_AI_2,P_poll__networl_2_0_RI_0,P_poll__networl_2_1_RI_2,P_poll__networl_1_2_AnsP_0,P_poll__networl_2_1_RP_0,P_poll__networl_0_2_RI_1,P_crashed_2,P_electionFailed_0,P_network_2_2_RI_1,P_network_2_2_AskP_2,P_network_0_0_AskP_1,P_masterList_0_1_0,P_masterList_0_2_1,P_poll__networl_2_0_RP_0,P_network_2_2_RI_2,P_poll__networl_1_0_RP_0,P_poll__networl_0_1_RI_0,P_network_1_0_RP_2,P_network_2_2_AskP_1,P_poll__networl_0_2_AnnP_1,P_poll__networl_2_2_AI_0,P_network_1_0_RI_1,P_network_2_2_RP_1,P_poll__networl_0_0_RI_0,P_masterList_2_1_1,P_poll__networl_1_1_AskP_0,P_poll__networl_1_2_RP_0,P_poll__networl_2_1_AnsP_0,P_network_1_1_AskP_2,P_network_2_1_RI_2,P_poll__networl_0_2_AskP_0,P_poll__networl_0_1_AskP_1,P_poll__networl_0_1_RI_1,P_poll__networl_0_2_AskP_2,P_network_1_2_AskP_2,P_network_2_2_AnnP_1,P_poll__networl_0_1_AskP_0,P_network_0_1_AskP_2,P_network_1_0_AI_1,P_network_2_2_AI_1,P_masterList_0_1_1,P_poll__networl_0_0_RP_2,P_masterList_2_2_2,P_electionFailed_1,P_poll__networl_0_0_AI_0,P_network_0_0_AnnP_2,P_poll__networl_1_1_RI_1,P_poll__networl_0_2_AI_1,P_network_0_1_RP_1,P_poll__networl_2_1_RP_2,P_network_2_2_AnnP_2,P_network_2_1_AI_2,P_poll__networl_1_2_AI_1,P_poll__networl_1_0_AI_0,P_poll__networl_2_2_RP_0,P_poll__networl_2_2_AskP_2,P_network_1_1_AskP_1,P_poll__networl_2_0_AnnP_2,P_poll__networl_2_0_AskP_2,P_masterList_1_2_2,P_poll__networl_1_1_AskP_1,P_poll__networl_1_1_AnnP_0,P_poll__networl_2_0_AnsP_0,P_poll__networl_0_1_AI_2,P_network_2_0_RI_1,P_poll__networl_0_2_RI_2,P_crashed_1,P_poll__networl_0_0_AnnP_1,P_poll__networl_2_1_AskP_2,P_poll__networl_0_2_AnnP_2,P_network_0_0_RP_1,P_network_1_1_AI_1,P_poll__networl_1_2_AnnP_1,P_poll__networl_2_1_AskP_1,P_network_2_2_RP_2,P_poll__networl_1_2_RP_2,P_network_1_0_RI_2,P_poll__networl_0_0_AI_2,P_network_1_2_RI_2,P_poll__networl_2_1_AI_0,P_poll__networl_0_1_RP_2,P_poll__networl_0_1_AskP_2,P_masterList_2_1_2,P_poll__networl_2_2_AI_1,P_network_2_0_AnnP_1,P_poll__networl_1_0_AnnP_0,P_masterList_1_2_1,P_network_0_2_AI_1,P_network_1_2_AnnP_1,P_poll__networl_1_1_RP_0,P_network_1_2_RP_2,P_network_0_2_RI_2,P_network_1_2_RP_1,P_network_1_1_AnnP_1,P_masterList_1_1_1,P_network_2_0_AskP_1,P_network_2_0_RP_2,P_network_2_0_RP_1,P_poll__networl_0_1_RP_1,P_poll__networl_1_0_AnnP_1,P_poll__networl_0_2_RP_0,P_network_1_0_AI_2,P_poll__networl_0_0_AskP_1,P_poll__networl_1_2_RP_1,P_masterList_1_1_2,P_poll__networl_1_2_AI_0,P_poll__networl_2_2_RP_2,P_poll__networl_1_2_AnnP_0,P_network_1_1_RI_2,P_network_0_2_AskP_1,P_masterList_2_1_0,P_poll__networl_1_2_AI_2,P_poll__networl_2_0_AI_1,P_network_1_2_RI_1,P_network_0_1_AnnP_1,P_network_0_2_RI_1,P_poll__networl_0_0_AskP_2,P_poll__networl_1_0_AI_2,P_network_1_0_AnnP_1,P_network_0_0_AnnP_1,P_poll__networl_2_2_RI_1,P_network_0_2_AnnP_1,P_poll__networl_0_0_RP_1,P_poll__networl_1_1_AskP_2,P_poll__networl_2_2_AnnP_2,P_network_1_2_AskP_1,P_poll__networl_1_0_AI_1,P_poll__networl_0_0_RI_2,P_poll__networl_1_2_RI_2,P_network_0_1_AskP_1,P_poll__networl_1_2_RI_0,P_poll__networl_1_2_AskP_1,P_network_0_0_RP_2,P_poll__networl_0_0_AnsP_0,P_poll__networl_1_1_AnsP_0,P_poll__networl_2_1_AI_1,P_poll__networl_2_1_RI_0,P_dead_0,P_poll__networl_2_1_RP_1,P_poll__networl_1_1_RI_2,P_network_0_2_RP_2,P_network_0_1_AnnP_2,P_network_2_1_RP_1,P_dead_2,P_poll__networl_2_2_AnsP_0,P_poll__networl_0_0_AskP_0,P_poll__networl_2_0_AI_0,P_poll__networl_2_2_AskP_1,P_poll__networl_1_0_RI_2,P_network_0_1_RI_1,P_network_0_2_AskP_2,P_poll__networl_1_1_AI_2,P_poll__networl_0_2_AnsP_0,P_poll__networl_2_0_AskP_1,P_network_0_1_RI_2,P_poll__networl_1_0_RI_1,P_poll__networl_1_1_RP_2,P_poll__networl_2_2_AnnP_0,P_poll__networl_1_2_AskP_2,P_network_2_0_RI_2,P_poll__networl_2_2_AnnP_1,P_network_0_0_AI_1,P_network_1_1_RI_1,P_network_0_0_RI_2,P_poll__networl_2_0_RP_1,P_electionFailed_2,P_poll__networl_2_1_AnnP_0,
Jun 02, 2017 10:32:32 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 261 constant variables :P_network_1_0_AskP_1, P_poll__networl_0_2_RI_0, P_poll__networl_0_1_AnnP_1, P_network_0_0_RI_1, P_network_2_1_AnnP_2, P_poll__networl_2_1_AnnP_1, P_network_1_1_RP_1, P_network_2_2_AI_2, P_poll__networl_1_2_RI_1, P_poll__networl_1_1_AI_0, P_poll__networl_2_1_AskP_0, P_network_0_2_AI_2, P_poll__networl_2_1_AI_2, P_poll__networl_0_2_AI_2, P_poll__networl_1_2_AskP_0, P_poll__networl_0_1_AnnP_2, P_network_1_1_RP_2, P_poll__networl_1_0_AskP_2, P_network_1_0_AnnP_2, P_network_0_0_AskP_2, P_poll__networl_0_0_AI_1, P_poll__networl_0_0_RP_0, P_poll__networl_2_0_AnnP_1, P_masterList_0_1_2, P_poll__networl_1_1_RI_0, P_network_1_2_AnnP_2, P_network_2_1_AskP_2, P_masterList_2_2_0, P_network_1_1_AnnP_2, P_network_2_1_AskP_1, P_network_1_0_AskP_2, P_poll__networl_1_1_AnnP_2, P_poll__networl_0_2_AI_0, P_network_2_0_AnnP_2, P_network_2_0_AI_1, P_network_1_2_AI_2, P_poll__networl_1_1_AI_1, P_poll__networl_2_1_AnnP_2, P_network_2_0_AI_2, P_network_0_1_RP_2, P_poll__networl_0_1_AnsP_0, P_poll__networl_0_1_AI_0, P_poll__networl_2_0_RP_2, P_poll__networl_2_0_AI_2, P_poll__networl_0_0_AnnP_2, P_poll__networl_2_2_AskP_0, P_poll__networl_1_0_AnnP_2, P_network_2_1_RP_2, P_network_1_2_AI_1, P_network_2_1_AnnP_1, P_poll__networl_0_1_RP_0, P_poll__networl_0_0_RI_1, P_poll__networl_1_1_AnnP_1, P_poll__networl_1_0_RP_1, P_network_0_2_AnnP_2, P_poll__networl_0_1_RI_2, P_masterList_0_2_2, P_poll__networl_0_1_AnnP_0, P_poll__networl_0_0_AnnP_0, P_poll__networl_2_2_AI_2, P_poll__networl_1_0_AskP_0, P_poll__networl_1_2_AnnP_2, P_poll__networl_2_2_RI_0, P_poll__networl_0_2_AnnP_0, P_masterList_0_2_0, P_network_0_1_AI_1, P_poll__networl_0_2_RP_1, P_masterList_2_2_1, P_poll__networl_2_0_AnnP_0, P_poll__networl_2_1_RI_1, P_poll__networl_1_0_RP_2, P_poll__networl_1_1_RP_1, P_poll__networl_1_0_AnsP_0, P_dead_1, P_poll__networl_0_1_AI_1, P_network_2_1_AI_1, P_poll__networl_1_0_RI_0, P_network_0_2_RP_1, P_poll__networl_2_2_RI_2, P_masterList_1_1_0, P_masterList_1_2_0, P_poll__networl_2_0_AskP_0, P_poll__networl_1_0_AskP_1, P_poll__networl_0_2_AskP_1, P_poll__networl_2_2_RP_1, P_network_2_1_RI_1, P_network_0_0_AI_2, P_network_0_1_AI_2, P_crashed_0, P_poll__networl_2_0_RI_2, P_network_1_0_RP_1, P_network_2_0_AskP_2, P_poll__networl_0_2_RP_2, P_poll__networl_2_0_RI_1, P_network_1_1_AI_2, P_poll__networl_2_0_RI_0, P_poll__networl_2_1_RI_2, P_poll__networl_1_2_AnsP_0, P_poll__networl_2_1_RP_0, P_poll__networl_0_2_RI_1, P_crashed_2, P_electionFailed_0, P_network_2_2_RI_1, P_network_2_2_AskP_2, P_network_0_0_AskP_1, P_masterList_0_1_0, P_masterList_0_2_1, P_poll__networl_2_0_RP_0, P_network_2_2_RI_2, P_poll__networl_1_0_RP_0, P_poll__networl_0_1_RI_0, P_network_1_0_RP_2, P_network_2_2_AskP_1, P_poll__networl_0_2_AnnP_1, P_poll__networl_2_2_AI_0, P_network_1_0_RI_1, P_network_2_2_RP_1, P_poll__networl_0_0_RI_0, P_masterList_2_1_1, P_poll__networl_1_1_AskP_0, P_poll__networl_1_2_RP_0, P_poll__networl_2_1_AnsP_0, P_network_1_1_AskP_2, P_network_2_1_RI_2, P_poll__networl_0_2_AskP_0, P_poll__networl_0_1_AskP_1, P_poll__networl_0_1_RI_1, P_poll__networl_0_2_AskP_2, P_network_1_2_AskP_2, P_network_2_2_AnnP_1, P_poll__networl_0_1_AskP_0, P_network_0_1_AskP_2, P_network_1_0_AI_1, P_network_2_2_AI_1, P_masterList_0_1_1, P_poll__networl_0_0_RP_2, P_masterList_2_2_2, P_electionFailed_1, P_poll__networl_0_0_AI_0, P_network_0_0_AnnP_2, P_poll__networl_1_1_RI_1, P_poll__networl_0_2_AI_1, P_network_0_1_RP_1, P_poll__networl_2_1_RP_2, P_network_2_2_AnnP_2, P_network_2_1_AI_2, P_poll__networl_1_2_AI_1, P_poll__networl_1_0_AI_0, P_poll__networl_2_2_RP_0, P_poll__networl_2_2_AskP_2, P_network_1_1_AskP_1, P_poll__networl_2_0_AnnP_2, P_poll__networl_2_0_AskP_2, P_masterList_1_2_2, P_poll__networl_1_1_AskP_1, P_poll__networl_1_1_AnnP_0, P_poll__networl_2_0_AnsP_0, P_poll__networl_0_1_AI_2, P_network_2_0_RI_1, P_poll__networl_0_2_RI_2, P_crashed_1, P_poll__networl_0_0_AnnP_1, P_poll__networl_2_1_AskP_2, P_poll__networl_0_2_AnnP_2, P_network_0_0_RP_1, P_network_1_1_AI_1, P_poll__networl_1_2_AnnP_1, P_poll__networl_2_1_AskP_1, P_network_2_2_RP_2, P_poll__networl_1_2_RP_2, P_network_1_0_RI_2, P_poll__networl_0_0_AI_2, P_network_1_2_RI_2, P_poll__networl_2_1_AI_0, P_poll__networl_0_1_RP_2, P_poll__networl_0_1_AskP_2, P_masterList_2_1_2, P_poll__networl_2_2_AI_1, P_network_2_0_AnnP_1, P_poll__networl_1_0_AnnP_0, P_masterList_1_2_1, P_network_0_2_AI_1, P_network_1_2_AnnP_1, P_poll__networl_1_1_RP_0, P_network_1_2_RP_2, P_network_0_2_RI_2, P_network_1_2_RP_1, P_network_1_1_AnnP_1, P_masterList_1_1_1, P_network_2_0_AskP_1, P_network_2_0_RP_2, P_network_2_0_RP_1, P_poll__networl_0_1_RP_1, P_poll__networl_1_0_AnnP_1, P_poll__networl_0_2_RP_0, P_network_1_0_AI_2, P_poll__networl_0_0_AskP_1, P_poll__networl_1_2_RP_1, P_masterList_1_1_2, P_poll__networl_1_2_AI_0, P_poll__networl_2_2_RP_2, P_poll__networl_1_2_AnnP_0, P_network_1_1_RI_2, P_network_0_2_AskP_1, P_masterList_2_1_0, P_poll__networl_1_2_AI_2, P_poll__networl_2_0_AI_1, P_network_1_2_RI_1, P_network_0_1_AnnP_1, P_network_0_2_RI_1, P_poll__networl_0_0_AskP_2, P_poll__networl_1_0_AI_2, P_network_1_0_AnnP_1, P_network_0_0_AnnP_1, P_poll__networl_2_2_RI_1, P_network_0_2_AnnP_1, P_poll__networl_0_0_RP_1, P_poll__networl_1_1_AskP_2, P_poll__networl_2_2_AnnP_2, P_network_1_2_AskP_1, P_poll__networl_1_0_AI_1, P_poll__networl_0_0_RI_2, P_poll__networl_1_2_RI_2, P_network_0_1_AskP_1, P_poll__networl_1_2_RI_0, P_poll__networl_1_2_AskP_1, P_network_0_0_RP_2, P_poll__networl_0_0_AnsP_0, P_poll__networl_1_1_AnsP_0, P_poll__networl_2_1_AI_1, P_poll__networl_2_1_RI_0, P_dead_0, P_poll__networl_2_1_RP_1, P_poll__networl_1_1_RI_2, P_network_0_2_RP_2, P_network_0_1_AnnP_2, P_network_2_1_RP_1, P_dead_2, P_poll__networl_2_2_AnsP_0, P_poll__networl_0_0_AskP_0, P_poll__networl_2_0_AI_0, P_poll__networl_2_2_AskP_1, P_poll__networl_1_0_RI_2, P_network_0_1_RI_1, P_network_0_2_AskP_2, P_poll__networl_1_1_AI_2, P_poll__networl_0_2_AnsP_0, P_poll__networl_2_0_AskP_1, P_network_0_1_RI_2, P_poll__networl_1_0_RI_1, P_poll__networl_1_1_RP_2, P_poll__networl_2_2_AnnP_0, P_poll__networl_1_2_AskP_2, P_network_2_0_RI_2, P_poll__networl_2_2_AnnP_1, P_network_0_0_AI_1, P_network_1_1_RI_1, P_network_0_0_RI_2, P_poll__networl_2_0_RP_1, P_electionFailed_2, P_poll__networl_2_1_AnnP_0
Jun 02, 2017 10:32:32 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 432 expressions due to constant valuations.
Jun 02, 2017 10:32:32 PM fr.lip6.move.gal.instantiate.Simplifier simplifyFalseTransitions
INFO: Removed 14 false transitions.
Jun 02, 2017 10:32:32 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 7 fixed domain variables (out of 177 variables) in GAL type NeoElection_PT_2_flat
Jun 02, 2017 10:32:32 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 883 ms
Jun 02, 2017 10:32:32 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 32 ms
Jun 02, 2017 10:32:32 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 02, 2017 10:32:33 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 32 place invariants in 129 ms
Jun 02, 2017 10:32:33 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is NOT exact ! Due to transitions T_poll__end_2, T_poll__end_3, T_startNeg__end_2, T_startNeg__end_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :324/15/4/343
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states

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_NeoElection-PT-2"
export BK_EXAMINATION="LTLCardinality"
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_NeoElection-PT-2.tgz
mv S_NeoElection-PT-2 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_NeoElection-PT-2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r120-blw7-149441652000266"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;