Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.............................................................................................
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 320K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is NeoElection-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732585900083
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527501925851

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)<=(((((((((((((((((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))"))
Formula 0 simplified : !"(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)<=(((((((((((((((((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))"
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
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
40 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.508021,30388,1,0,52,14808,382,23,5068,8702,370
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(("(((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)>=1)")U("(((P_electionInit_0+P_electionInit_1)+P_electionInit_2)>=1)")))))
Formula 1 simplified : !GF("(((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)>=1)" U "(((P_electionInit_0+P_electionInit_1)+P_electionInit_2)>=1)")
Computing Next relation with stutter on 1 deadlock states
35 unique states visited
35 strongly connected components in search stack
36 transitions explored
35 items max in DFS search stack
24 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.758939,34816,1,0,86,27709,395,92,5319,26295,648
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("((((((((((((((((((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)>=0)"))
Formula 2 simplified : !"((((((((((((((((((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)>=0)"
Computing Next relation with stutter on 1 deadlock states
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.760203,34816,1,0,86,27709,398,92,5338,26295,650
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(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)<=(((((((((((((((((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))")))))
Formula 3 simplified : !GFG"((((((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)<=(((((((((((((((((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))"
Computing Next relation with stutter on 1 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 290
// Phase 1: matrix 290 rows 177 cols
invariant :P_negotiation_0_2_NONE = 0
invariant :P_negotiation_2_1_NONE + P_negotiation_2_1_CO + P_negotiation_2_1_DONE = 1
invariant :P_electedPrimary_2 + P_electedSecondary_2 + P_negotiation_2_1_NONE + P_poll__handlingMessage_2 + P_poll__pollEnd_2 + P_polling_2 + P_sendAnnPs__broadcasting_2_1 + P_sendAnnPs__broadcasting_2_2 + -1'P_stage_2_PRIM + -1'P_stage_2_SEC + P_startNeg__broadcasting_2_2 = 1
invariant :P_masterState_0_F_0 + P_masterState_0_F_1 + P_masterState_0_F_2 + P_masterState_0_T_0 + P_masterState_0_T_1 + P_masterState_0_T_2 = 0
invariant :P_electedPrimary_0 + P_sendAnnPs__broadcasting_0_1 + -1'P_stage_0_PRIM = 0
invariant :P_electionInit_0 + P_startNeg__broadcasting_0_1 = 0
invariant :P_negotiation_1_1_CO + P_negotiation_1_1_DONE = 1
invariant :P_electedSecondary_0 + P_poll__handlingMessage_0 + P_poll__pollEnd_0 + P_polling_0 + P_sendAnnPs__broadcasting_0_2 + -1'P_stage_0_SEC + P_startNeg__broadcasting_0_2 = 0
invariant :P_negotiation_0_1_NONE = 0
invariant :P_stage_1_NEG + P_stage_1_PRIM + P_stage_1_SEC = 1
invariant :P_poll__waitingMessage_0 + P_stage_0_PRIM + P_stage_0_SEC = 0
invariant :P_negotiation_0_0_NONE = 0
invariant :P_masterState_2_F_0 + P_masterState_2_F_1 + P_masterState_2_F_2 + P_masterState_2_T_0 + P_masterState_2_T_1 + P_masterState_2_T_2 = 1
invariant :P_poll__waitingMessage_2 + P_stage_2_PRIM + P_stage_2_SEC = 0
invariant :P_negotiation_1_0_NONE = 0
invariant :P_negotiation_1_0_CO + P_negotiation_1_0_DONE = 0
invariant :P_negotiation_2_2_NONE = 0
invariant :P_stage_0_NEG + P_stage_0_PRIM + P_stage_0_SEC = 0
invariant :P_electionInit_2 + -1'P_negotiation_2_1_NONE + P_startNeg__broadcasting_2_1 = 0
invariant :P_negotiation_2_2_CO + P_negotiation_2_2_DONE = 1
invariant :P_poll__waitingMessage_1 + P_stage_1_PRIM + P_stage_1_SEC = 0
invariant :P_electionInit_1 + -1'P_negotiation_1_2_NONE + P_startNeg__broadcasting_1_1 = 0
invariant :P_masterState_1_F_0 + P_masterState_1_F_1 + P_masterState_1_F_2 + P_masterState_1_T_0 + P_masterState_1_T_1 + P_masterState_1_T_2 = 1
invariant :P_stage_2_NEG + P_stage_2_PRIM + P_stage_2_SEC = 1
invariant :P_negotiation_2_0_CO + P_negotiation_2_0_DONE = 0
invariant :P_negotiation_0_0_CO + P_negotiation_0_0_DONE = 0
invariant :P_negotiation_1_2_NONE + P_negotiation_1_2_CO + P_negotiation_1_2_DONE = 1
invariant :P_negotiation_2_0_NONE = 0
invariant :P_electedPrimary_1 + P_electedSecondary_1 + P_negotiation_1_2_NONE + P_poll__handlingMessage_1 + P_poll__pollEnd_1 + P_polling_1 + P_sendAnnPs__broadcasting_1_1 + P_sendAnnPs__broadcasting_1_2 + -1'P_stage_1_PRIM + -1'P_stage_1_SEC + P_startNeg__broadcasting_1_2 = 1
invariant :P_negotiation_0_2_CO + P_negotiation_0_2_DONE = 0
invariant :P_negotiation_0_1_CO + P_negotiation_0_1_DONE = 0
invariant :P_negotiation_1_1_NONE = 0
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
17 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.927059,40028,1,0,216,49513,411,222,5483,61721,1095
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(X("(((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)>=2)")))U(G(G("(((P_electionInit_0+P_electionInit_1)+P_electionInit_2)>=0)")))))
Formula 4 simplified : !(GX"(((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)>=2)" U G"(((P_electionInit_0+P_electionInit_1)+P_electionInit_2)>=0)")
Computing Next relation with stutter on 1 deadlock states
96 unique states visited
0 strongly connected components in search stack
98 transitions explored
35 items max in DFS search stack
9 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.01508,43540,1,0,246,53839,433,315,5510,82749,1700
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)<=((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2))"))
Formula 5 simplified : !"(((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)<=((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2))"
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.01588,43540,1,0,246,53840,436,315,5518,82749,1702
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((((((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)<=0)"))
Formula 6 simplified : !"((((((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)<=0)"
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.0166,43804,1,0,246,53840,439,315,5524,82749,1704
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(("(((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)>=2)")U(true))))
Formula 7 simplified : 0
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.01677,43804,1,0,246,53840,439,315,5524,82749,1704
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(true)))
Formula 8 simplified : 0
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.0169,43804,1,0,246,53840,439,315,5524,82749,1704
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((X("(P_negotiation_0_0_CO<=0)"))U(G("(P_network_1_2_AnsP_0<=0)")))))
Formula 9 simplified : !G(X"(P_negotiation_0_0_CO<=0)" U G"(P_network_1_2_AnsP_0<=0)")
Computing Next relation with stutter on 1 deadlock states
279 unique states visited
0 strongly connected components in search stack
408 transitions explored
27 items max in DFS search stack
56 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.58105,58464,1,0,548,93700,454,730,5532,135611,3585
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(G(F(G(true))))))
Formula 10 simplified : 0
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.58203,58464,1,0,548,93700,454,730,5532,135611,3585
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(X(F(G("(P_stage_2_SEC<=0)"))))))
Formula 11 simplified : !GXFG"(P_stage_2_SEC<=0)"
Computing Next relation with stutter on 1 deadlock states
65 unique states visited
0 strongly connected components in search stack
66 transitions explored
34 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.58586,58712,1,0,548,93700,467,730,5535,135650,3842
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(X(G("(P_poll__waitingMessage_0<=P_network_2_1_RP_0)")))))
Formula 12 simplified : !FXG"(P_poll__waitingMessage_0<=P_network_2_1_RP_0)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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,1.60047,58976,1,0,576,93787,480,790,5540,136702,4155
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((true))
Formula 13 simplified : 0
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.60065,58976,1,0,576,93787,480,790,5540,136702,4155
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(true)))
Formula 14 simplified : 0
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.60078,58976,1,0,576,93787,480,790,5540,136702,4155
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(true)))
Formula 15 simplified : 0
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.60091,58976,1,0,576,93787,480,790,5540,136702,4155
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA NeoElection-PT-2-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527501937304

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 10:05:33 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
May 28, 2018 10:05:33 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 10:05:33 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 140 ms
May 28, 2018 10:05:33 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 438 places.
May 28, 2018 10:05:33 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 357 transitions.
May 28, 2018 10:05:33 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 42 ms
May 28, 2018 10:05:34 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 252 fixed domain variables (out of 438 variables) in GAL type NeoElection_PT_2
May 28, 2018 10:05:34 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 252 constant array cells/variables (out of 438 variables) in type NeoElection_PT_2
May 28, 2018 10:05:34 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: P_poll__networl_0_1_AnsP_0,P_poll__networl_2_0_AnnP_0,P_network_1_0_AnnP_1,P_network_1_2_RI_2,P_network_0_1_AI_1,P_network_0_0_AnnP_2,P_poll__networl_1_1_AskP_0,P_poll__networl_0_0_AskP_2,P_poll__networl_1_1_RP_2,P_crashed_0,P_network_1_0_AskP_2,P_poll__networl_2_1_RP_2,P_poll__networl_0_0_AnnP_0,P_poll__networl_0_2_AI_1,P_network_1_2_AI_2,P_poll__networl_1_0_AI_2,P_network_1_1_RP_2,P_poll__networl_2_2_RI_1,P_electionFailed_0,P_dead_0,P_network_2_0_RP_2,P_network_1_2_RP_2,P_poll__networl_1_1_AnnP_2,P_poll__networl_0_2_RI_1,P_poll__networl_2_1_AskP_0,P_poll__networl_0_2_AnnP_1,P_poll__networl_1_1_AskP_1,P_poll__networl_1_1_RI_1,P_network_2_1_RP_2,P_masterList_2_2_1,P_poll__networl_1_2_AnsP_0,P_poll__networl_1_0_AI_0,P_network_2_0_AnnP_2,P_network_0_2_RP_1,P_poll__networl_1_1_RI_0,P_masterList_2_2_0,P_network_0_1_AskP_2,P_network_2_1_AskP_1,P_poll__networl_0_0_AnsP_0,P_poll__networl_0_1_AnnP_2,P_poll__networl_1_1_AnnP_1,P_poll__networl_0_1_AnnP_1,P_poll__networl_0_0_RI_2,P_electionFailed_2,P_poll__networl_2_2_RI_2,P_network_1_1_RI_2,P_network_2_0_AnnP_1,P_poll__networl_2_0_AI_0,P_poll__networl_1_0_AnnP_1,P_poll__networl_1_2_AI_0,P_network_0_2_RP_2,P_network_1_2_AskP_2,P_poll__networl_2_0_RI_0,P_poll__networl_1_2_AskP_2,P_network_1_1_RP_1,P_poll__networl_1_2_AnnP_1,P_poll__networl_0_2_AnsP_0,P_crashed_1,P_poll__networl_2_2_RP_1,P_network_0_2_AnnP_2,P_poll__networl_2_1_RI_0,P_network_2_0_RI_1,P_network_1_2_AskP_1,P_poll__networl_1_2_AskP_1,P_poll__networl_0_0_RI_1,P_network_2_1_AskP_2,P_poll__networl_1_1_AI_2,P_poll__networl_1_0_AnnP_2,P_network_0_1_AskP_1,P_poll__networl_1_0_AskP_1,P_network_1_0_RP_2,P_poll__networl_2_2_AskP_1,P_poll__networl_2_1_AI_1,P_poll__networl_0_1_RP_2,P_poll__networl_2_2_AnsP_0,P_network_0_1_RP_2,P_network_1_2_AnnP_1,P_network_2_1_AI_1,P_network_0_1_AnnP_1,P_network_0_2_AI_2,P_poll__networl_2_1_AI_0,P_poll__networl_1_2_AskP_0,P_poll__networl_2_1_AnnP_0,P_network_1_0_AnnP_2,P_network_2_0_AskP_2,P_poll__networl_2_1_AnnP_1,P_network_0_0_RP_2,P_poll__networl_2_0_AnnP_2,P_network_2_0_AI_2,P_masterList_1_2_1,P_poll__networl_0_2_RP_2,P_network_1_2_RP_1,P_poll__networl_1_1_AI_0,P_poll__networl_0_1_RP_1,P_poll__networl_1_0_RI_2,P_network_2_2_RI_2,P_network_1_1_RI_1,P_network_2_1_AnnP_1,P_poll__networl_0_1_RI_2,P_network_0_2_AI_1,P_poll__networl_1_0_RP_0,P_poll__networl_1_2_RP_1,P_network_0_1_AnnP_2,P_network_1_0_RP_1,P_poll__networl_1_2_AnnP_2,P_poll__networl_2_2_AI_0,P_poll__networl_2_0_RI_2,P_poll__networl_0_1_RI_0,P_network_2_2_RP_1,P_masterList_1_2_0,P_network_1_2_RI_1,P_poll__networl_2_0_AnnP_1,P_poll__networl_1_0_AskP_2,P_poll__networl_1_1_AI_1,P_network_0_1_RI_1,P_poll__networl_1_1_RP_0,P_network_2_1_RI_1,P_masterList_0_2_1,P_network_1_1_AnnP_2,P_poll__networl_1_1_AnsP_0,P_masterList_2_2_2,P_poll__networl_2_1_AnsP_0,P_poll__networl_2_2_AnnP_1,P_poll__networl_1_1_AnnP_0,P_electionFailed_1,P_poll__networl_0_1_AI_0,P_poll__networl_2_1_AnnP_2,P_crashed_2,P_network_2_2_AnnP_1,P_poll__networl_2_0_AI_1,P_poll__networl_1_2_RI_1,P_network_0_0_RP_1,P_poll__networl_1_0_RI_1,P_poll__networl_0_2_AI_2,P_poll__networl_0_2_AnnP_2,P_poll__networl_1_0_AI_1,P_poll__networl_1_0_RP_1,P_poll__networl_2_2_AI_2,P_poll__networl_2_1_AskP_1,P_poll__networl_2_0_RP_2,P_poll__networl_2_1_AI_2,P_poll__networl_0_1_AskP_1,P_poll__networl_0_1_RP_0,P_poll__networl_2_0_AskP_2,P_poll__networl_1_2_AI_1,P_poll__networl_1_1_AskP_2,P_network_1_1_AskP_1,P_poll__networl_1_0_AskP_0,P_poll__networl_2_2_AskP_0,P_network_0_0_AI_2,P_poll__networl_2_0_RP_1,P_network_1_1_AI_1,P_poll__networl_2_2_AnnP_2,P_poll__networl_1_1_RP_1,P_dead_1,P_network_1_0_RI_1,P_network_2_2_RI_1,P_poll__networl_2_2_AnnP_0,P_poll__networl_2_2_RI_0,P_poll__networl_2_2_AI_1,P_poll__networl_1_2_RI_2,P_poll__networl_0_2_RP_1,P_poll__networl_1_2_RI_0,P_poll__networl_0_2_AskP_2,P_network_1_1_AnnP_1,P_poll__networl_2_0_RP_0,P_network_0_0_AnnP_1,P_poll__networl_1_2_AnnP_0,P_network_2_0_AI_1,P_poll__networl_2_1_RI_1,P_poll__networl_0_2_AskP_1,P_network_0_1_AI_2,P_poll__networl_1_2_RP_2,P_masterList_1_2_2,P_poll__networl_0_2_RI_2,P_network_2_2_AskP_1,P_poll__networl_1_0_RP_2,P_network_1_0_AI_1,P_poll__networl_1_0_AnsP_0,P_poll__networl_0_0_AI_0,P_network_2_1_AI_2,P_poll__networl_0_0_RP_0,P_network_1_0_AskP_1,P_network_0_2_RI_2,P_network_0_0_AskP_1,P_network_2_1_RP_1,P_poll__networl_1_0_RI_0,P_network_0_0_RI_2,P_poll__networl_2_1_AskP_2,P_network_0_0_AskP_2,P_poll__networl_0_1_AnnP_0,P_poll__networl_0_0_RI_0,P_network_2_1_AnnP_2,P_poll__networl_2_0_AnsP_0,P_poll__networl_0_0_RP_2,P_poll__networl_0_0_AI_1,P_network_2_2_AI_2,P_masterList_0_2_0,P_poll__networl_0_2_RI_0,P_poll__networl_2_2_RP_2,P_poll__networl_0_0_RP_1,P_network_0_2_RI_1,P_network_2_0_AskP_1,P_network_0_1_RP_1,P_poll__networl_0_1_RI_1,P_poll__networl_0_1_AI_1,P_poll__networl_0_0_AI_2,P_dead_2,P_network_1_2_AnnP_2,P_network_1_0_RI_2,P_poll__networl_0_2_AI_0,P_poll__networl_0_2_RP_0,P_poll__networl_1_0_AnnP_0,P_poll__networl_1_1_RI_2,P_poll__networl_0_1_AskP_2,P_network_0_2_AskP_2,P_network_1_1_AI_2,P_network_0_2_AskP_1,P_network_2_2_RP_2,P_poll__networl_2_1_RP_0,P_network_0_2_AnnP_1,P_network_0_0_RI_1,P_poll__networl_0_0_AnnP_2,P_network_2_0_RI_2,P_masterList_0_2_2,P_poll__networl_0_2_AnnP_0,P_network_2_2_AI_1,P_poll__networl_2_0_AI_2,P_network_2_1_RI_2,P_poll__networl_2_0_AskP_0,P_network_1_1_AskP_2,P_poll__networl_2_0_AskP_1,P_poll__networl_0_2_AskP_0,P_poll__networl_0_0_AskP_1,P_poll__networl_1_2_RP_0,P_poll__networl_2_1_RI_2,P_poll__networl_0_0_AskP_0,P_network_0_1_RI_2,P_network_1_0_AI_2,P_poll__networl_0_1_AI_2,P_poll__networl_2_0_RI_1,P_network_2_0_RP_1,P_network_1_2_AI_1,P_poll__networl_2_2_AskP_2,P_network_0_0_AI_1,P_poll__networl_2_1_RP_1,P_poll__networl_0_0_AnnP_1,P_poll__networl_1_2_AI_2,P_poll__networl_0_1_AskP_0,P_poll__networl_2_2_RP_0,P_network_2_2_AnnP_2,P_network_2_2_AskP_2,
May 28, 2018 10:05:34 AM 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
May 28, 2018 10:05:34 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 261 constant array cells/variables (out of 438 variables) in type NeoElection_PT_2
May 28, 2018 10:05:34 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: P_poll__networl_0_1_AnsP_0,P_poll__networl_2_0_AnnP_0,P_network_1_0_AnnP_1,P_network_1_2_RI_2,P_network_0_1_AI_1,P_network_0_0_AnnP_2,P_poll__networl_1_1_AskP_0,P_poll__networl_0_0_AskP_2,P_masterList_1_1_0,P_poll__networl_1_1_RP_2,P_crashed_0,P_network_1_0_AskP_2,P_poll__networl_2_1_RP_2,P_poll__networl_0_0_AnnP_0,P_poll__networl_0_2_AI_1,P_network_1_2_AI_2,P_poll__networl_1_0_AI_2,P_network_1_1_RP_2,P_poll__networl_2_2_RI_1,P_electionFailed_0,P_dead_0,P_network_2_0_RP_2,P_network_1_2_RP_2,P_poll__networl_1_1_AnnP_2,P_poll__networl_0_2_RI_1,P_poll__networl_2_1_AskP_0,P_poll__networl_0_2_AnnP_1,P_poll__networl_1_1_AskP_1,P_poll__networl_1_1_RI_1,P_network_2_1_RP_2,P_masterList_2_2_1,P_poll__networl_1_2_AnsP_0,P_poll__networl_1_0_AI_0,P_masterList_2_1_0,P_masterList_2_1_1,P_network_2_0_AnnP_2,P_network_0_2_RP_1,P_poll__networl_1_1_RI_0,P_masterList_2_2_0,P_network_0_1_AskP_2,P_network_2_1_AskP_1,P_poll__networl_0_0_AnsP_0,P_poll__networl_0_1_AnnP_2,P_poll__networl_1_1_AnnP_1,P_poll__networl_0_1_AnnP_1,P_poll__networl_0_0_RI_2,P_electionFailed_2,P_poll__networl_2_2_RI_2,P_network_1_1_RI_2,P_network_2_0_AnnP_1,P_poll__networl_2_0_AI_0,P_poll__networl_1_0_AnnP_1,P_poll__networl_1_2_AI_0,P_network_0_2_RP_2,P_network_1_2_AskP_2,P_poll__networl_2_0_RI_0,P_poll__networl_1_2_AskP_2,P_network_1_1_RP_1,P_poll__networl_1_2_AnnP_1,P_poll__networl_0_2_AnsP_0,P_crashed_1,P_poll__networl_2_2_RP_1,P_network_0_2_AnnP_2,P_poll__networl_2_1_RI_0,P_network_2_0_RI_1,P_network_1_2_AskP_1,P_poll__networl_1_2_AskP_1,P_poll__networl_0_0_RI_1,P_masterList_0_1_0,P_network_2_1_AskP_2,P_poll__networl_1_1_AI_2,P_poll__networl_1_0_AnnP_2,P_network_0_1_AskP_1,P_poll__networl_1_0_AskP_1,P_network_1_0_RP_2,P_poll__networl_2_2_AskP_1,P_poll__networl_2_1_AI_1,P_poll__networl_0_1_RP_2,P_poll__networl_2_2_AnsP_0,P_network_0_1_RP_2,P_network_1_2_AnnP_1,P_network_2_1_AI_1,P_network_0_1_AnnP_1,P_network_0_2_AI_2,P_poll__networl_2_1_AI_0,P_poll__networl_1_2_AskP_0,P_poll__networl_2_1_AnnP_0,P_network_1_0_AnnP_2,P_network_2_0_AskP_2,P_poll__networl_2_1_AnnP_1,P_network_0_0_RP_2,P_poll__networl_2_0_AnnP_2,P_network_2_0_AI_2,P_masterList_1_2_1,P_poll__networl_0_2_RP_2,P_network_1_2_RP_1,P_poll__networl_1_1_AI_0,P_poll__networl_0_1_RP_1,P_poll__networl_1_0_RI_2,P_network_2_2_RI_2,P_network_1_1_RI_1,P_network_2_1_AnnP_1,P_poll__networl_0_1_RI_2,P_network_0_2_AI_1,P_poll__networl_1_0_RP_0,P_poll__networl_1_2_RP_1,P_masterList_1_1_2,P_network_0_1_AnnP_2,P_network_1_0_RP_1,P_poll__networl_1_2_AnnP_2,P_poll__networl_2_2_AI_0,P_poll__networl_2_0_RI_2,P_poll__networl_0_1_RI_0,P_network_2_2_RP_1,P_masterList_1_2_0,P_network_1_2_RI_1,P_poll__networl_2_0_AnnP_1,P_poll__networl_1_0_AskP_2,P_poll__networl_1_1_AI_1,P_network_0_1_RI_1,P_poll__networl_1_1_RP_0,P_network_2_1_RI_1,P_masterList_0_2_1,P_network_1_1_AnnP_2,P_poll__networl_1_1_AnsP_0,P_masterList_2_2_2,P_poll__networl_2_1_AnsP_0,P_poll__networl_2_2_AnnP_1,P_poll__networl_1_1_AnnP_0,P_electionFailed_1,P_poll__networl_0_1_AI_0,P_poll__networl_2_1_AnnP_2,P_crashed_2,P_network_2_2_AnnP_1,P_poll__networl_2_0_AI_1,P_poll__networl_1_2_RI_1,P_network_0_0_RP_1,P_poll__networl_1_0_RI_1,P_poll__networl_0_2_AI_2,P_poll__networl_0_2_AnnP_2,P_poll__networl_1_0_AI_1,P_poll__networl_1_0_RP_1,P_poll__networl_2_2_AI_2,P_masterList_0_1_2,P_poll__networl_2_1_AskP_1,P_poll__networl_2_0_RP_2,P_poll__networl_2_1_AI_2,P_poll__networl_0_1_AskP_1,P_poll__networl_0_1_RP_0,P_poll__networl_2_0_AskP_2,P_poll__networl_1_2_AI_1,P_poll__networl_1_1_AskP_2,P_network_1_1_AskP_1,P_poll__networl_1_0_AskP_0,P_poll__networl_2_2_AskP_0,P_network_0_0_AI_2,P_poll__networl_2_0_RP_1,P_network_1_1_AI_1,P_poll__networl_2_2_AnnP_2,P_masterList_2_1_2,P_poll__networl_1_1_RP_1,P_dead_1,P_network_1_0_RI_1,P_network_2_2_RI_1,P_poll__networl_2_2_AnnP_0,P_poll__networl_2_2_RI_0,P_poll__networl_2_2_AI_1,P_poll__networl_1_2_RI_2,P_poll__networl_0_2_RP_1,P_poll__networl_1_2_RI_0,P_poll__networl_0_2_AskP_2,P_network_1_1_AnnP_1,P_poll__networl_2_0_RP_0,P_network_0_0_AnnP_1,P_poll__networl_1_2_AnnP_0,P_network_2_0_AI_1,P_poll__networl_2_1_RI_1,P_poll__networl_0_2_AskP_1,P_network_0_1_AI_2,P_poll__networl_1_2_RP_2,P_masterList_1_2_2,P_poll__networl_0_2_RI_2,P_network_2_2_AskP_1,P_poll__networl_1_0_RP_2,P_network_1_0_AI_1,P_poll__networl_1_0_AnsP_0,P_poll__networl_0_0_AI_0,P_network_2_1_AI_2,P_poll__networl_0_0_RP_0,P_masterList_0_1_1,P_network_1_0_AskP_1,P_network_0_2_RI_2,P_network_0_0_AskP_1,P_network_2_1_RP_1,P_poll__networl_1_0_RI_0,P_network_0_0_RI_2,P_poll__networl_2_1_AskP_2,P_network_0_0_AskP_2,P_poll__networl_0_1_AnnP_0,P_poll__networl_0_0_RI_0,P_network_2_1_AnnP_2,P_poll__networl_2_0_AnsP_0,P_poll__networl_0_0_RP_2,P_poll__networl_0_0_AI_1,P_network_2_2_AI_2,P_masterList_0_2_0,P_poll__networl_0_2_RI_0,P_poll__networl_2_2_RP_2,P_poll__networl_0_0_RP_1,P_network_0_2_RI_1,P_network_2_0_AskP_1,P_network_0_1_RP_1,P_poll__networl_0_1_RI_1,P_poll__networl_0_1_AI_1,P_poll__networl_0_0_AI_2,P_masterList_1_1_1,P_dead_2,P_network_1_2_AnnP_2,P_network_1_0_RI_2,P_poll__networl_0_2_AI_0,P_poll__networl_0_2_RP_0,P_poll__networl_1_0_AnnP_0,P_poll__networl_1_1_RI_2,P_poll__networl_0_1_AskP_2,P_network_0_2_AskP_2,P_network_1_1_AI_2,P_network_0_2_AskP_1,P_network_2_2_RP_2,P_poll__networl_2_1_RP_0,P_network_0_2_AnnP_1,P_network_0_0_RI_1,P_poll__networl_0_0_AnnP_2,P_network_2_0_RI_2,P_masterList_0_2_2,P_poll__networl_0_2_AnnP_0,P_network_2_2_AI_1,P_poll__networl_2_0_AI_2,P_network_2_1_RI_2,P_poll__networl_2_0_AskP_0,P_network_1_1_AskP_2,P_poll__networl_2_0_AskP_1,P_poll__networl_0_2_AskP_0,P_poll__networl_0_0_AskP_1,P_poll__networl_1_2_RP_0,P_poll__networl_2_1_RI_2,P_poll__networl_0_0_AskP_0,P_network_0_1_RI_2,P_network_1_0_AI_2,P_poll__networl_0_1_AI_2,P_poll__networl_2_0_RI_1,P_network_2_0_RP_1,P_network_1_2_AI_1,P_poll__networl_2_2_AskP_2,P_network_0_0_AI_1,P_poll__networl_2_1_RP_1,P_poll__networl_0_0_AnnP_1,P_poll__networl_1_2_AI_2,P_poll__networl_0_1_AskP_0,P_poll__networl_2_2_RP_0,P_network_2_2_AnnP_2,P_network_2_2_AskP_2,
May 28, 2018 10:05:34 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 261 constant variables :P_poll__networl_0_1_AnsP_0=0, P_poll__networl_2_0_AnnP_0=0, P_network_1_0_AnnP_1=0, P_network_1_2_RI_2=0, P_network_0_1_AI_1=0, P_network_0_0_AnnP_2=0, P_poll__networl_1_1_AskP_0=0, P_poll__networl_0_0_AskP_2=0, P_masterList_1_1_0=0, P_poll__networl_1_1_RP_2=0, P_crashed_0=0, P_network_1_0_AskP_2=0, P_poll__networl_2_1_RP_2=0, P_poll__networl_0_0_AnnP_0=0, P_poll__networl_0_2_AI_1=0, P_network_1_2_AI_2=0, P_poll__networl_1_0_AI_2=0, P_network_1_1_RP_2=0, P_poll__networl_2_2_RI_1=0, P_electionFailed_0=0, P_dead_0=0, P_network_2_0_RP_2=0, P_network_1_2_RP_2=0, P_poll__networl_1_1_AnnP_2=0, P_poll__networl_0_2_RI_1=0, P_poll__networl_2_1_AskP_0=0, P_poll__networl_0_2_AnnP_1=0, P_poll__networl_1_1_AskP_1=0, P_poll__networl_1_1_RI_1=0, P_network_2_1_RP_2=0, P_masterList_2_2_1=0, P_poll__networl_1_2_AnsP_0=0, P_poll__networl_1_0_AI_0=0, P_masterList_2_1_0=0, P_masterList_2_1_1=1, P_network_2_0_AnnP_2=0, P_network_0_2_RP_1=0, P_poll__networl_1_1_RI_0=0, P_masterList_2_2_0=0, P_network_0_1_AskP_2=0, P_network_2_1_AskP_1=0, P_poll__networl_0_0_AnsP_0=0, P_poll__networl_0_1_AnnP_2=0, P_poll__networl_1_1_AnnP_1=0, P_poll__networl_0_1_AnnP_1=0, P_poll__networl_0_0_RI_2=0, P_electionFailed_2=0, P_poll__networl_2_2_RI_2=0, P_network_1_1_RI_2=0, P_network_2_0_AnnP_1=0, P_poll__networl_2_0_AI_0=0, P_poll__networl_1_0_AnnP_1=0, P_poll__networl_1_2_AI_0=0, P_network_0_2_RP_2=0, P_network_1_2_AskP_2=0, P_poll__networl_2_0_RI_0=0, P_poll__networl_1_2_AskP_2=0, P_network_1_1_RP_1=0, P_poll__networl_1_2_AnnP_1=0, P_poll__networl_0_2_AnsP_0=0, P_crashed_1=0, P_poll__networl_2_2_RP_1=0, P_network_0_2_AnnP_2=0, P_poll__networl_2_1_RI_0=0, P_network_2_0_RI_1=0, P_network_1_2_AskP_1=0, P_poll__networl_1_2_AskP_1=0, P_poll__networl_0_0_RI_1=0, P_masterList_0_1_0=0, P_network_2_1_AskP_2=0, P_poll__networl_1_1_AI_2=0, P_poll__networl_1_0_AnnP_2=0, P_network_0_1_AskP_1=0, P_poll__networl_1_0_AskP_1=0, P_network_1_0_RP_2=0, P_poll__networl_2_2_AskP_1=0, P_poll__networl_2_1_AI_1=0, P_poll__networl_0_1_RP_2=0, P_poll__networl_2_2_AnsP_0=0, P_network_0_1_RP_2=0, P_network_1_2_AnnP_1=0, P_network_2_1_AI_1=0, P_network_0_1_AnnP_1=0, P_network_0_2_AI_2=0, P_poll__networl_2_1_AI_0=0, P_poll__networl_1_2_AskP_0=0, P_poll__networl_2_1_AnnP_0=0, P_network_1_0_AnnP_2=0, P_network_2_0_AskP_2=0, P_poll__networl_2_1_AnnP_1=0, P_network_0_0_RP_2=0, P_poll__networl_2_0_AnnP_2=0, P_network_2_0_AI_2=0, P_masterList_1_2_1=0, P_poll__networl_0_2_RP_2=0, P_network_1_2_RP_1=0, P_poll__networl_1_1_AI_0=0, P_poll__networl_0_1_RP_1=0, P_poll__networl_1_0_RI_2=0, P_network_2_2_RI_2=0, P_network_1_1_RI_1=0, P_network_2_1_AnnP_1=0, P_poll__networl_0_1_RI_2=0, P_network_0_2_AI_1=0, P_poll__networl_1_0_RP_0=0, P_poll__networl_1_2_RP_1=0, P_masterList_1_1_2=1, P_network_0_1_AnnP_2=0, P_network_1_0_RP_1=0, P_poll__networl_1_2_AnnP_2=0, P_poll__networl_2_2_AI_0=0, P_poll__networl_2_0_RI_2=0, P_poll__networl_0_1_RI_0=0, P_network_2_2_RP_1=0, P_masterList_1_2_0=0, P_network_1_2_RI_1=0, P_poll__networl_2_0_AnnP_1=0, P_poll__networl_1_0_AskP_2=0, P_poll__networl_1_1_AI_1=0, P_network_0_1_RI_1=0, P_poll__networl_1_1_RP_0=0, P_network_2_1_RI_1=0, P_masterList_0_2_1=0, P_network_1_1_AnnP_2=0, P_poll__networl_1_1_AnsP_0=0, P_masterList_2_2_2=0, P_poll__networl_2_1_AnsP_0=0, P_poll__networl_2_2_AnnP_1=0, P_poll__networl_1_1_AnnP_0=0, P_electionFailed_1=0, P_poll__networl_0_1_AI_0=0, P_poll__networl_2_1_AnnP_2=0, P_crashed_2=0, P_network_2_2_AnnP_1=0, P_poll__networl_2_0_AI_1=0, P_poll__networl_1_2_RI_1=0, P_network_0_0_RP_1=0, P_poll__networl_1_0_RI_1=0, P_poll__networl_0_2_AI_2=0, P_poll__networl_0_2_AnnP_2=0, P_poll__networl_1_0_AI_1=0, P_poll__networl_1_0_RP_1=0, P_poll__networl_2_2_AI_2=0, P_masterList_0_1_2=0, P_poll__networl_2_1_AskP_1=0, P_poll__networl_2_0_RP_2=0, P_poll__networl_2_1_AI_2=0, P_poll__networl_0_1_AskP_1=0, P_poll__networl_0_1_RP_0=0, P_poll__networl_2_0_AskP_2=0, P_poll__networl_1_2_AI_1=0, P_poll__networl_1_1_AskP_2=0, P_network_1_1_AskP_1=0, P_poll__networl_1_0_AskP_0=0, P_poll__networl_2_2_AskP_0=0, P_network_0_0_AI_2=0, P_poll__networl_2_0_RP_1=0, P_network_1_1_AI_1=0, P_poll__networl_2_2_AnnP_2=0, P_masterList_2_1_2=0, P_poll__networl_1_1_RP_1=0, P_dead_1=0, P_network_1_0_RI_1=0, P_network_2_2_RI_1=0, P_poll__networl_2_2_AnnP_0=0, P_poll__networl_2_2_RI_0=0, P_poll__networl_2_2_AI_1=0, P_poll__networl_1_2_RI_2=0, P_poll__networl_0_2_RP_1=0, P_poll__networl_1_2_RI_0=0, P_poll__networl_0_2_AskP_2=0, P_network_1_1_AnnP_1=0, P_poll__networl_2_0_RP_0=0, P_network_0_0_AnnP_1=0, P_poll__networl_1_2_AnnP_0=0, P_network_2_0_AI_1=0, P_poll__networl_2_1_RI_1=0, P_poll__networl_0_2_AskP_1=0, P_network_0_1_AI_2=0, P_poll__networl_1_2_RP_2=0, P_masterList_1_2_2=0, P_poll__networl_0_2_RI_2=0, P_network_2_2_AskP_1=0, P_poll__networl_1_0_RP_2=0, P_network_1_0_AI_1=0, P_poll__networl_1_0_AnsP_0=0, P_poll__networl_0_0_AI_0=0, P_network_2_1_AI_2=0, P_poll__networl_0_0_RP_0=0, P_masterList_0_1_1=0, P_network_1_0_AskP_1=0, P_network_0_2_RI_2=0, P_network_0_0_AskP_1=0, P_network_2_1_RP_1=0, P_poll__networl_1_0_RI_0=0, P_network_0_0_RI_2=0, P_poll__networl_2_1_AskP_2=0, P_network_0_0_AskP_2=0, P_poll__networl_0_1_AnnP_0=0, P_poll__networl_0_0_RI_0=0, P_network_2_1_AnnP_2=0, P_poll__networl_2_0_AnsP_0=0, P_poll__networl_0_0_RP_2=0, P_poll__networl_0_0_AI_1=0, P_network_2_2_AI_2=0, P_masterList_0_2_0=0, P_poll__networl_0_2_RI_0=0, P_poll__networl_2_2_RP_2=0, P_poll__networl_0_0_RP_1=0, P_network_0_2_RI_1=0, P_network_2_0_AskP_1=0, P_network_0_1_RP_1=0, P_poll__networl_0_1_RI_1=0, P_poll__networl_0_1_AI_1=0, P_poll__networl_0_0_AI_2=0, P_masterList_1_1_1=0, P_dead_2=0, P_network_1_2_AnnP_2=0, P_network_1_0_RI_2=0, P_poll__networl_0_2_AI_0=0, P_poll__networl_0_2_RP_0=0, P_poll__networl_1_0_AnnP_0=0, P_poll__networl_1_1_RI_2=0, P_poll__networl_0_1_AskP_2=0, P_network_0_2_AskP_2=0, P_network_1_1_AI_2=0, P_network_0_2_AskP_1=0, P_network_2_2_RP_2=0, P_poll__networl_2_1_RP_0=0, P_network_0_2_AnnP_1=0, P_network_0_0_RI_1=0, P_poll__networl_0_0_AnnP_2=0, P_network_2_0_RI_2=0, P_masterList_0_2_2=0, P_poll__networl_0_2_AnnP_0=0, P_network_2_2_AI_1=0, P_poll__networl_2_0_AI_2=0, P_network_2_1_RI_2=0, P_poll__networl_2_0_AskP_0=0, P_network_1_1_AskP_2=0, P_poll__networl_2_0_AskP_1=0, P_poll__networl_0_2_AskP_0=0, P_poll__networl_0_0_AskP_1=0, P_poll__networl_1_2_RP_0=0, P_poll__networl_2_1_RI_2=0, P_poll__networl_0_0_AskP_0=0, P_network_0_1_RI_2=0, P_network_1_0_AI_2=0, P_poll__networl_0_1_AI_2=0, P_poll__networl_2_0_RI_1=0, P_network_2_0_RP_1=0, P_network_1_2_AI_1=0, P_poll__networl_2_2_AskP_2=0, P_network_0_0_AI_1=0, P_poll__networl_2_1_RP_1=0, P_poll__networl_0_0_AnnP_1=0, P_poll__networl_1_2_AI_2=0, P_poll__networl_0_1_AskP_0=0, P_poll__networl_2_2_RP_0=0, P_network_2_2_AnnP_2=0, P_network_2_2_AskP_2=0
May 28, 2018 10:05:34 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 496 expressions due to constant valuations.
May 28, 2018 10:05:34 AM fr.lip6.move.gal.instantiate.Simplifier simplifyFalseTransitions
INFO: Removed 14 false transitions.
May 28, 2018 10:05:34 AM 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
May 28, 2018 10:05:34 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 272 ms
May 28, 2018 10:05:34 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 7 ms
May 28, 2018 10:05:34 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
May 28, 2018 10:05:35 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 343 transitions.
May 28, 2018 10:05:35 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 32 place invariants in 114 ms
May 28, 2018 10:05:36 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 177 variables to be positive in 847 ms
May 28, 2018 10:05:36 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 343 transitions.
May 28, 2018 10:05:36 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/343 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:05:36 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:05:36 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 343 transitions.
May 28, 2018 10:05:36 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 28, 2018 10:05:36 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1885ms conformant to PINS in folder :/home/mcc/execution

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-PT-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsl"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is 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 r261-csrt-152732585900083"
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 ;