Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812000116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is NeoElection-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812000116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.0M
-rw-r--r-- 1 mcc users 107K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 378K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 199K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 695K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 82K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 221K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 77K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 214K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 646K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.2M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 258K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 874K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.1M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NeoElection-PT-4-LTLFireability-00
FORMULA_NAME NeoElection-PT-4-LTLFireability-01
FORMULA_NAME NeoElection-PT-4-LTLFireability-02
FORMULA_NAME NeoElection-PT-4-LTLFireability-03
FORMULA_NAME NeoElection-PT-4-LTLFireability-04
FORMULA_NAME NeoElection-PT-4-LTLFireability-05
FORMULA_NAME NeoElection-PT-4-LTLFireability-06
FORMULA_NAME NeoElection-PT-4-LTLFireability-07
FORMULA_NAME NeoElection-PT-4-LTLFireability-08
FORMULA_NAME NeoElection-PT-4-LTLFireability-09
FORMULA_NAME NeoElection-PT-4-LTLFireability-10
FORMULA_NAME NeoElection-PT-4-LTLFireability-11
FORMULA_NAME NeoElection-PT-4-LTLFireability-12
FORMULA_NAME NeoElection-PT-4-LTLFireability-13
FORMULA_NAME NeoElection-PT-4-LTLFireability-14
FORMULA_NAME NeoElection-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748804121765

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 18:55:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 18:55:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 18:55:23] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2025-06-01 18:55:23] [INFO ] Transformed 1830 places.
[2025-06-01 18:55:23] [INFO ] Transformed 2340 transitions.
[2025-06-01 18:55:23] [INFO ] Found NUPN structural information;
[2025-06-01 18:55:23] [INFO ] Completing missing partition info from NUPN : creating a component with [P_crashed_0, P_crashed_1, P_crashed_2, P_crashed_3, P_crashed_4, P_dead_0, P_dead_1, P_dead_2, P_dead_3, P_dead_4, P_electedPrimary_0, P_electedPrimary_1, P_electedPrimary_2, P_electedPrimary_3, P_electedPrimary_4, P_electedSecondary_0, P_electedSecondary_1, P_electedSecondary_2, P_electedSecondary_3, P_electedSecondary_4, P_electionFailed_0, P_electionFailed_1, P_electionFailed_2, P_electionFailed_3, P_electionFailed_4, P_electionInit_0, P_electionInit_1, P_electionInit_2, P_electionInit_3, P_electionInit_4, P_masterList_0_1_0, P_masterList_0_1_1, P_masterList_0_1_2, P_masterList_0_1_3, P_masterList_0_1_4, P_masterList_0_2_0, P_masterList_0_2_1, P_masterList_0_2_2, P_masterList_0_2_3, P_masterList_0_2_4, P_masterList_0_3_0, P_masterList_0_3_1, P_masterList_0_3_2, P_masterList_0_3_3, P_masterList_0_3_4, P_masterList_0_4_0, P_masterList_0_4_1, P_masterList_0_4_2, P_masterList_0_4_3, P_masterList_0_4_4, P_masterList_1_1_0, P_masterList_1_1_1, P_masterList_1_1_2, P_masterList_1_1_3, P_masterList_1_1_4, P_masterList_1_2_0, P_masterList_1_2_1, P_masterList_1_2_2, P_masterList_1_2_3, P_masterList_1_2_4, P_masterList_1_3_0, P_masterList_1_3_1, P_masterList_1_3_2, P_masterList_1_3_3, P_masterList_1_3_4, P_masterList_1_4_0, P_masterList_1_4_1, P_masterList_1_4_2, P_masterList_1_4_3, P_masterList_1_4_4, P_masterList_2_1_0, P_masterList_2_1_1, P_masterList_2_1_2, P_masterList_2_1_3, P_masterList_2_1_4, P_masterList_2_2_0, P_masterList_2_2_1, P_masterList_2_2_2, P_masterList_2_2_3, P_masterList_2_2_4, P_masterList_2_3_0, P_masterList_2_3_1, P_masterList_2_3_2, P_masterList_2_3_3, P_masterList_2_3_4, P_masterList_2_4_0, P_masterList_2_4_1, P_masterList_2_4_2, P_masterList_2_4_3, P_masterList_2_4_4, P_masterList_3_1_0, P_masterList_3_1_1, P_masterList_3_1_2, P_masterList_3_1_3, P_masterList_3_1_4, P_masterList_3_2_0, P_masterList_3_2_1, P_masterList_3_2_2, P_masterList_3_2_3, P_masterList_3_2_4, P_masterList_3_3_0, P_masterList_3_3_1, P_masterList_3_3_2, P_masterList_3_3_3, P_masterList_3_3_4, P_masterList_3_4_0, P_masterList_3_4_1, P_masterList_3_4_2, P_masterList_3_4_3, P_masterList_3_4_4, P_masterList_4_1_0, P_masterList_4_1_1, P_masterList_4_1_2, P_masterList_4_1_3, P_masterList_4_1_4, P_masterList_4_2_0, P_masterList_4_2_1, P_masterList_4_2_2, P_masterList_4_2_3, P_masterList_4_2_4, P_masterList_4_3_0, P_masterList_4_3_1, P_masterList_4_3_2, P_masterList_4_3_3, P_masterList_4_3_4, P_masterList_4_4_0, P_masterList_4_4_1, P_masterList_4_4_2, P_masterList_4_4_3, P_masterList_4_4_4, P_masterState_0_F_0, P_masterState_0_F_1, P_masterState_0_F_2, P_masterState_0_F_3, P_masterState_0_F_4, P_masterState_0_T_0, P_masterState_0_T_1, P_masterState_0_T_2, P_masterState_0_T_3, P_masterState_0_T_4, P_masterState_1_F_0, P_masterState_1_F_1, P_masterState_1_F_2, P_masterState_1_F_3, P_masterState_1_F_4, P_masterState_1_T_0, P_masterState_1_T_1, P_masterState_1_T_2, P_masterState_1_T_3, P_masterState_1_T_4, P_masterState_2_F_0, P_masterState_2_F_1, P_masterState_2_F_2, P_masterState_2_F_3, P_masterState_2_F_4, P_masterState_2_T_0, P_masterState_2_T_1, P_masterState_2_T_2, P_masterState_2_T_3, P_masterState_2_T_4, P_masterState_3_F_0, P_masterState_3_F_1, P_masterState_3_F_2, P_masterState_3_F_3, P_masterState_3_F_4, P_masterState_3_T_0, P_masterState_3_T_1, P_masterState_3_T_2, P_masterState_3_T_3, P_masterState_3_T_4, P_masterState_4_F_0, P_masterState_4_F_1, P_masterState_4_F_2, P_masterState_4_F_3, P_masterState_4_F_4, P_masterState_4_T_0, P_masterState_4_T_1, P_masterState_4_T_2, P_masterState_4_T_3, P_masterState_4_T_4, 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_0_3_NONE, P_negotiation_0_3_CO, P_negotiation_0_3_DONE, P_negotiation_0_4_NONE, P_negotiation_0_4_CO, P_negotiation_0_4_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_1_3_NONE, P_negotiation_1_3_CO, P_negotiation_1_3_DONE, P_negotiation_1_4_NONE, P_negotiation_1_4_CO, P_negotiation_1_4_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_negotiation_2_3_NONE, P_negotiation_2_3_CO, P_negotiation_2_3_DONE, P_negotiation_2_4_NONE, P_negotiation_2_4_CO, P_negotiation_2_4_DONE, P_negotiation_3_0_NONE, P_negotiation_3_0_CO, P_negotiation_3_0_DONE, P_negotiation_3_1_NONE, P_negotiation_3_1_CO, P_negotiation_3_1_DONE, P_negotiation_3_2_NONE, P_negotiation_3_2_CO, P_negotiation_3_2_DONE, P_negotiation_3_3_NONE, P_negotiation_3_3_CO, P_negotiation_3_3_DONE, P_negotiation_3_4_NONE, P_negotiation_3_4_CO, P_negotiation_3_4_DONE, P_negotiation_4_0_NONE, P_negotiation_4_0_CO, P_negotiation_4_0_DONE, P_negotiation_4_1_NONE, P_negotiation_4_1_CO, P_negotiation_4_1_DONE, P_negotiation_4_2_NONE, P_negotiation_4_2_CO, P_negotiation_4_2_DONE, P_negotiation_4_3_NONE, P_negotiation_4_3_CO, P_negotiation_4_3_DONE, P_negotiation_4_4_NONE, P_negotiation_4_4_CO, P_negotiation_4_4_DONE, P_network_0_0_AskP_0, P_network_0_0_AskP_1, P_network_0_0_AskP_2, P_network_0_0_AskP_3, P_network_0_0_AskP_4, P_network_0_0_AnsP_0, P_network_0_0_AnsP_1, P_network_0_0_AnsP_2, P_network_0_0_AnsP_3, P_network_0_0_AnsP_4, P_network_0_0_RI_0, P_network_0_0_RI_1, P_network_0_0_RI_2, P_network_0_0_RI_3, P_network_0_0_RI_4, P_network_0_0_AI_0, P_network_0_0_AI_1, P_network_0_0_AI_2, P_network_0_0_AI_3, P_network_0_0_AI_4, P_network_0_0_AnnP_0, P_network_0_0_AnnP_1, P_network_0_0_AnnP_2, P_network_0_0_AnnP_3, P_network_0_0_AnnP_4, P_network_0_0_RP_0, P_network_0_0_RP_1, P_network_0_0_RP_2, P_network_0_0_RP_3, P_network_0_0_RP_4, P_network_0_1_AskP_0, P_network_0_1_AskP_1, P_network_0_1_AskP_2, P_network_0_1_AskP_3, P_network_0_1_AskP_4, P_network_0_1_AnsP_0, P_network_0_1_AnsP_1, P_network_0_1_AnsP_2, P_network_0_1_AnsP_3, P_network_0_1_AnsP_4, P_network_0_1_RI_0, P_network_0_1_RI_1, P_network_0_1_RI_2, P_network_0_1_RI_3, P_network_0_1_RI_4, P_network_0_1_AI_0, P_network_0_1_AI_1, P_network_0_1_AI_2, P_network_0_1_AI_3, P_network_0_1_AI_4, P_network_0_1_AnnP_0, P_network_0_1_AnnP_1, P_network_0_1_AnnP_2, P_network_0_1_AnnP_3, P_network_0_1_AnnP_4, P_network_0_1_RP_0, P_network_0_1_RP_1, P_network_0_1_RP_2, P_network_0_1_RP_3, P_network_0_1_RP_4, P_network_0_2_AskP_0, P_network_0_2_AskP_1, P_network_0_2_AskP_2, P_network_0_2_AskP_3, P_network_0_2_AskP_4, P_network_0_2_AnsP_0, P_network_0_2_AnsP_1, P_network_0_2_AnsP_2, P_network_0_2_AnsP_3, P_network_0_2_AnsP_4, P_network_0_2_RI_0, P_network_0_2_RI_1, P_network_0_2_RI_2, P_network_0_2_RI_3, P_network_0_2_RI_4, P_network_0_2_AI_0, P_network_0_2_AI_1, P_network_0_2_AI_2, P_network_0_2_AI_3, P_network_0_2_AI_4, P_network_0_2_AnnP_0, P_network_0_2_AnnP_1, P_network_0_2_AnnP_2, P_network_0_2_AnnP_3, P_network_0_2_AnnP_4, P_network_0_2_RP_0, P_network_0_2_RP_1, P_network_0_2_RP_2, P_network_0_2_RP_3, P_network_0_2_RP_4, P_network_0_3_AskP_0, P_network_0_3_AskP_1, P_network_0_3_AskP_2, P_network_0_3_AskP_3, P_network_0_3_AskP_4, P_network_0_3_AnsP_0, P_network_0_3_AnsP_1, P_network_0_3_AnsP_2, P_network_0_3_AnsP_3, P_network_0_3_AnsP_4, P_network_0_3_RI_0, P_network_0_3_RI_1, P_network_0_3_RI_2, P_network_0_3_RI_3, P_network_0_3_RI_4, P_network_0_3_AI_0, P_network_0_3_AI_1, P_network_0_3_AI_2, P_network_0_3_AI_3, P_network_0_3_AI_4, P_network_0_3_AnnP_0, P_network_0_3_AnnP_1, P_network_0_3_AnnP_2, P_network_0_3_AnnP_3, P_network_0_3_AnnP_4, P_network_0_3_RP_0, P_network_0_3_RP_1, P_network_0_3_RP_2, P_network_0_3_RP_3, P_network_0_3_RP_4, P_network_0_4_AskP_0, P_network_0_4_AskP_1, P_network_0_4_AskP_2, P_network_0_4_AskP_3, P_network_0_4_AskP_4, P_network_0_4_AnsP_0, P_network_0_4_AnsP_1, P_network_0_4_AnsP_2, P_network_0_4_AnsP_3, P_network_0_4_AnsP_4, P_network_0_4_RI_0, P_network_0_4_RI_1, P_network_0_4_RI_2, P_network_0_4_RI_3, P_network_0_4_RI_4, P_network_0_4_AI_0, P_network_0_4_AI_1, P_network_0_4_AI_2, P_network_0_4_AI_3, P_network_0_4_AI_4, P_network_0_4_AnnP_0, P_network_0_4_AnnP_1, P_network_0_4_AnnP_2, P_network_0_4_AnnP_3, P_network_0_4_AnnP_4, P_network_0_4_RP_0, P_network_0_4_RP_1, P_network_0_4_RP_2, P_network_0_4_RP_3, P_network_0_4_RP_4, P_network_1_0_AskP_0, P_network_1_0_AskP_1, P_network_1_0_AskP_2, P_network_1_0_AskP_3, P_network_1_0_AskP_4, P_network_1_0_AnsP_0, P_network_1_0_AnsP_1, P_network_1_0_AnsP_2, P_network_1_0_AnsP_3, P_network_1_0_AnsP_4, P_network_1_0_RI_0, P_network_1_0_RI_1, P_network_1_0_RI_2, P_network_1_0_RI_3, P_network_1_0_RI_4, P_network_1_0_AI_0, P_network_1_0_AI_1, P_network_1_0_AI_2, P_network_1_0_AI_3, P_network_1_0_AI_4, P_network_1_0_AnnP_0, P_network_1_0_AnnP_1, P_network_1_0_AnnP_2, P_network_1_0_AnnP_3, P_network_1_0_AnnP_4, P_network_1_0_RP_0, P_network_1_0_RP_1, P_network_1_0_RP_2, P_network_1_0_RP_3, P_network_1_0_RP_4, P_network_1_1_AskP_0, P_network_1_1_AskP_1, P_network_1_1_AskP_2, P_network_1_1_AskP_3, P_network_1_1_AskP_4, P_network_1_1_AnsP_0, P_network_1_1_AnsP_1, P_network_1_1_AnsP_2, P_network_1_1_AnsP_3, P_network_1_1_AnsP_4, P_network_1_1_RI_0, P_network_1_1_RI_1, P_network_1_1_RI_2, P_network_1_1_RI_3, P_network_1_1_RI_4, P_network_1_1_AI_0, P_network_1_1_AI_1, P_network_1_1_AI_2, P_network_1_1_AI_3, P_network_1_1_AI_4, P_network_1_1_AnnP_0, P_network_1_1_AnnP_1, P_network_1_1_AnnP_2, P_network_1_1_AnnP_3, P_network_1_1_AnnP_4, P_network_1_1_RP_0, P_network_1_1_RP_1, P_network_1_1_RP_2, P_network_1_1_RP_3, P_network_1_1_RP_4, P_network_1_2_AskP_0, P_network_1_2_AskP_1, P_network_1_2_AskP_2, P_network_1_2_AskP_3, P_network_1_2_AskP_4, P_network_1_2_AnsP_0, P_network_1_2_AnsP_1, P_network_1_2_AnsP_2, P_network_1_2_AnsP_3, P_network_1_2_AnsP_4, P_network_1_2_RI_0, P_network_1_2_RI_1, P_network_1_2_RI_2, P_network_1_2_RI_3, P_network_1_2_RI_4, P_network_1_2_AI_0, P_network_1_2_AI_1, P_network_1_2_AI_2, P_network_1_2_AI_3, P_network_1_2_AI_4, P_network_1_2_AnnP_0, P_network_1_2_AnnP_1, P_network_1_2_AnnP_2, P_network_1_2_AnnP_3, P_network_1_2_AnnP_4, P_network_1_2_RP_0, P_network_1_2_RP_1, P_network_1_2_RP_2, P_network_1_2_RP_3, P_network_1_2_RP_4, P_network_1_3_AskP_0, P_network_1_3_AskP_1, P_network_1_3_AskP_2, P_network_1_3_AskP_3, P_network_1_3_AskP_4, P_network_1_3_AnsP_0, P_network_1_3_AnsP_1, P_network_1_3_AnsP_2, P_network_1_3_AnsP_3, P_network_1_3_AnsP_4, P_network_1_3_RI_0, P_network_1_3_RI_1, P_network_1_3_RI_2, P_network_1_3_RI_3, P_network_1_3_RI_4, P_network_1_3_AI_0, P_network_1_3_AI_1, P_network_1_3_AI_2, P_network_1_3_AI_3, P_network_1_3_AI_4, P_network_1_3_AnnP_0, P_network_1_3_AnnP_1, P_network_1_3_AnnP_2, P_network_1_3_AnnP_3, P_network_1_3_AnnP_4, P_network_1_3_RP_0, P_network_1_3_RP_1, P_network_1_3_RP_2, P_network_1_3_RP_3, P_network_1_3_RP_4, P_network_1_4_AskP_0, P_network_1_4_AskP_1, P_network_1_4_AskP_2, P_network_1_4_AskP_3, P_network_1_4_AskP_4, P_network_1_4_AnsP_0, P_network_1_4_AnsP_1, P_network_1_4_AnsP_2, P_network_1_4_AnsP_3, P_network_1_4_AnsP_4, P_network_1_4_RI_0, P_network_1_4_RI_1, P_network_1_4_RI_2, P_network_1_4_RI_3, P_network_1_4_RI_4, P_network_1_4_AI_0, P_network_1_4_AI_1, P_network_1_4_AI_2, P_network_1_4_AI_3, P_network_1_4_AI_4, P_network_1_4_AnnP_0, P_network_1_4_AnnP_1, P_network_1_4_AnnP_2, P_network_1_4_AnnP_3, P_network_1_4_AnnP_4, P_network_1_4_RP_0, P_network_1_4_RP_1, P_network_1_4_RP_2, P_network_1_4_RP_3, P_network_1_4_RP_4, P_network_2_0_AskP_0, P_network_2_0_AskP_1, P_network_2_0_AskP_2, P_network_2_0_AskP_3, P_network_2_0_AskP_4, P_network_2_0_AnsP_0, P_network_2_0_AnsP_1, P_network_2_0_AnsP_2, P_network_2_0_AnsP_3, P_network_2_0_AnsP_4, P_network_2_0_RI_0, P_network_2_0_RI_1, P_network_2_0_RI_2, P_network_2_0_RI_3, P_network_2_0_RI_4, P_network_2_0_AI_0, P_network_2_0_AI_1, P_network_2_0_AI_2, P_network_2_0_AI_3, P_network_2_0_AI_4, P_network_2_0_AnnP_0, P_network_2_0_AnnP_1, P_network_2_0_AnnP_2, P_network_2_0_AnnP_3, P_network_2_0_AnnP_4, P_network_2_0_RP_0, P_network_2_0_RP_1, P_network_2_0_RP_2, P_network_2_0_RP_3, P_network_2_0_RP_4, P_network_2_1_AskP_0, P_network_2_1_AskP_1, P_network_2_1_AskP_2, P_network_2_1_AskP_3, P_network_2_1_AskP_4, P_network_2_1_AnsP_0, P_network_2_1_AnsP_1, P_network_2_1_AnsP_2, P_network_2_1_AnsP_3, P_network_2_1_AnsP_4, P_network_2_1_RI_0, P_network_2_1_RI_1, P_network_2_1_RI_2, P_network_2_1_RI_3, P_network_2_1_RI_4, P_network_2_1_AI_0, P_network_2_1_AI_1, P_network_2_1_AI_2, P_network_2_1_AI_3, P_network_2_1_AI_4, P_network_2_1_AnnP_0, P_network_2_1_AnnP_1, P_network_2_1_AnnP_2, P_network_2_1_AnnP_3, P_network_2_1_AnnP_4, P_network_2_1_RP_0, P_network_2_1_RP_1, P_network_2_1_RP_2, P_network_2_1_RP_3, P_network_2_1_RP_4, P_network_2_2_AskP_0, P_network_2_2_AskP_1, P_network_2_2_AskP_2, P_network_2_2_AskP_3, P_network_2_2_AskP_4, P_network_2_2_AnsP_0, P_network_2_2_AnsP_1, P_network_2_2_AnsP_2, P_network_2_2_AnsP_3, P_network_2_2_AnsP_4, P_network_2_2_RI_0, P_network_2_2_RI_1, P_network_2_2_RI_2, P_network_2_2_RI_3, P_network_2_2_RI_4, P_network_2_2_AI_0, P_network_2_2_AI_1, P_network_2_2_AI_2, P_network_2_2_AI_3, P_network_2_2_AI_4, P_network_2_2_AnnP_0, P_network_2_2_AnnP_1, P_network_2_2_AnnP_2, P_network_2_2_AnnP_3, P_network_2_2_AnnP_4, P_network_2_2_RP_0, P_network_2_2_RP_1, P_network_2_2_RP_2, P_network_2_2_RP_3, P_network_2_2_RP_4, P_network_2_3_AskP_0, P_network_2_3_AskP_1, P_network_2_3_AskP_2, P_network_2_3_AskP_3, P_network_2_3_AskP_4, P_network_2_3_AnsP_0, P_network_2_3_AnsP_1, P_network_2_3_AnsP_2, P_network_2_3_AnsP_3, P_network_2_3_AnsP_4, P_network_2_3_RI_0, P_network_2_3_RI_1, P_network_2_3_RI_2, P_network_2_3_RI_3, P_network_2_3_RI_4, P_network_2_3_AI_0, P_network_2_3_AI_1, P_network_2_3_AI_2, P_network_2_3_AI_3, P_network_2_3_AI_4, P_network_2_3_AnnP_0, P_network_2_3_AnnP_1, P_network_2_3_AnnP_2, P_network_2_3_AnnP_3, P_network_2_3_AnnP_4, P_network_2_3_RP_0, P_network_2_3_RP_1, P_network_2_3_RP_2, P_network_2_3_RP_3, P_network_2_3_RP_4, P_network_2_4_AskP_0, P_network_2_4_AskP_1, P_network_2_4_AskP_2, P_network_2_4_AskP_3, P_network_2_4_AskP_4, P_network_2_4_AnsP_0, P_network_2_4_AnsP_1, P_network_2_4_AnsP_2, P_network_2_4_AnsP_3, P_network_2_4_AnsP_4, P_network_2_4_RI_0, P_network_2_4_RI_1, P_network_2_4_RI_2, P_network_2_4_RI_3, P_network_2_4_RI_4, P_network_2_4_AI_0, P_network_2_4_AI_1, P_network_2_4_AI_2, P_network_2_4_AI_3, P_network_2_4_AI_4, P_network_2_4_AnnP_0, P_network_2_4_AnnP_1, P_network_2_4_AnnP_2, P_network_2_4_AnnP_3, P_network_2_4_AnnP_4, P_network_2_4_RP_0, P_network_2_4_RP_1, P_network_2_4_RP_2, P_network_2_4_RP_3, P_network_2_4_RP_4, P_network_3_0_AskP_0, P_network_3_0_AskP_1, P_network_3_0_AskP_2, P_network_3_0_AskP_3, P_network_3_0_AskP_4, P_network_3_0_AnsP_0, P_network_3_0_AnsP_1, P_network_3_0_AnsP_2, P_network_3_0_AnsP_3, P_network_3_0_AnsP_4, P_network_3_0_RI_0, P_network_3_0_RI_1, P_network_3_0_RI_2, P_network_3_0_RI_3, P_network_3_0_RI_4, P_network_3_0_AI_0, P_network_3_0_AI_1, P_network_3_0_AI_2, P_network_3_0_AI_3, P_network_3_0_AI_4, P_network_3_0_AnnP_0, P_network_3_0_AnnP_1, P_network_3_0_AnnP_2, P_network_3_0_AnnP_3, P_network_3_0_AnnP_4, P_network_3_0_RP_0, P_network_3_0_RP_1, P_network_3_0_RP_2, P_network_3_0_RP_3, P_network_3_0_RP_4, P_network_3_1_AskP_0, P_network_3_1_AskP_1, P_network_3_1_AskP_2, P_network_3_1_AskP_3, P_network_3_1_AskP_4, P_network_3_1_AnsP_0, P_network_3_1_AnsP_1, P_network_3_1_AnsP_2, P_network_3_1_AnsP_3, P_network_3_1_AnsP_4, P_network_3_1_RI_0, P_network_3_1_RI_1, P_network_3_1_RI_2, P_network_3_1_RI_3, P_network_3_1_RI_4, P_network_3_1_AI_0, P_network_3_1_AI_1, P_network_3_1_AI_2, P_network_3_1_AI_3, P_network_3_1_AI_4, P_network_3_1_AnnP_0, P_network_3_1_AnnP_1, P_network_3_1_AnnP_2, P_network_3_1_AnnP_3, P_network_3_1_AnnP_4, P_network_3_1_RP_0, P_network_3_1_RP_1, P_network_3_1_RP_2, P_network_3_1_RP_3, P_network_3_1_RP_4, P_network_3_2_AskP_0, P_network_3_2_AskP_1, P_network_3_2_AskP_2, P_network_3_2_AskP_3, P_network_3_2_AskP_4, P_network_3_2_AnsP_0, P_network_3_2_AnsP_1, P_network_3_2_AnsP_2, P_network_3_2_AnsP_3, P_network_3_2_AnsP_4, P_network_3_2_RI_0, P_network_3_2_RI_1, P_network_3_2_RI_2, P_network_3_2_RI_3, P_network_3_2_RI_4, P_network_3_2_AI_0, P_network_3_2_AI_1, P_network_3_2_AI_2, P_network_3_2_AI_3, P_network_3_2_AI_4, P_network_3_2_AnnP_0, P_network_3_2_AnnP_1, P_network_3_2_AnnP_2, P_network_3_2_AnnP_3, P_network_3_2_AnnP_4, P_network_3_2_RP_0, P_network_3_2_RP_1, P_network_3_2_RP_2, P_network_3_2_RP_3, P_network_3_2_RP_4, P_network_3_3_AskP_0, P_network_3_3_AskP_1, P_network_3_3_AskP_2, P_network_3_3_AskP_3, P_network_3_3_AskP_4, P_network_3_3_AnsP_0, P_network_3_3_AnsP_1, P_network_3_3_AnsP_2, P_network_3_3_AnsP_3, P_network_3_3_AnsP_4, P_network_3_3_RI_0, P_network_3_3_RI_1, P_network_3_3_RI_2, P_network_3_3_RI_3, P_network_3_3_RI_4, P_network_3_3_AI_0, P_network_3_3_AI_1, P_network_3_3_AI_2, P_network_3_3_AI_3, P_network_3_3_AI_4, P_network_3_3_AnnP_0, P_network_3_3_AnnP_1, P_network_3_3_AnnP_2, P_network_3_3_AnnP_3, P_network_3_3_AnnP_4, P_network_3_3_RP_0, P_network_3_3_RP_1, P_network_3_3_RP_2, P_network_3_3_RP_3, P_network_3_3_RP_4, P_network_3_4_AskP_0, P_network_3_4_AskP_1, P_network_3_4_AskP_2, P_network_3_4_AskP_3, P_network_3_4_AskP_4, P_network_3_4_AnsP_0, P_network_3_4_AnsP_1, P_network_3_4_AnsP_2, P_network_3_4_AnsP_3, P_network_3_4_AnsP_4, P_network_3_4_RI_0, P_network_3_4_RI_1, P_network_3_4_RI_2, P_network_3_4_RI_3, P_network_3_4_RI_4, P_network_3_4_AI_0, P_network_3_4_AI_1, P_network_3_4_AI_2, P_network_3_4_AI_3, P_network_3_4_AI_4, P_network_3_4_AnnP_0, P_network_3_4_AnnP_1, P_network_3_4_AnnP_2, P_network_3_4_AnnP_3, P_network_3_4_AnnP_4, P_network_3_4_RP_0, P_network_3_4_RP_1, P_network_3_4_RP_2, P_network_3_4_RP_3, P_network_3_4_RP_4, P_network_4_0_AskP_0, P_network_4_0_AskP_1, P_network_4_0_AskP_2, P_network_4_0_AskP_3, P_network_4_0_AskP_4, P_network_4_0_AnsP_0, P_network_4_0_AnsP_1, P_network_4_0_AnsP_2, P_network_4_0_AnsP_3, P_network_4_0_AnsP_4, P_network_4_0_RI_0, P_network_4_0_RI_1, P_network_4_0_RI_2, P_network_4_0_RI_3, P_network_4_0_RI_4, P_network_4_0_AI_0, P_network_4_0_AI_1, P_network_4_0_AI_2, P_network_4_0_AI_3, P_network_4_0_AI_4, P_network_4_0_AnnP_0, P_network_4_0_AnnP_1, P_network_4_0_AnnP_2, P_network_4_0_AnnP_3, P_network_4_0_AnnP_4, P_network_4_0_RP_0, P_network_4_0_RP_1, P_network_4_0_RP_2, P_network_4_0_RP_3, P_network_4_0_RP_4, P_network_4_1_AskP_0, P_network_4_1_AskP_1, P_network_4_1_AskP_2, P_network_4_1_AskP_3, P_network_4_1_AskP_4, P_network_4_1_AnsP_0, P_network_4_1_AnsP_1, P_network_4_1_AnsP_2, P_network_4_1_AnsP_3, P_network_4_1_AnsP_4, P_network_4_1_RI_0, P_network_4_1_RI_1, P_network_4_1_RI_2, P_network_4_1_RI_3, P_network_4_1_RI_4, P_network_4_1_AI_0, P_network_4_1_AI_1, P_network_4_1_AI_2, P_network_4_1_AI_3, P_network_4_1_AI_4, P_network_4_1_AnnP_0, P_network_4_1_AnnP_1, P_network_4_1_AnnP_2, P_network_4_1_AnnP_3, P_network_4_1_AnnP_4, P_network_4_1_RP_0, P_network_4_1_RP_1, P_network_4_1_RP_2, P_network_4_1_RP_3, P_network_4_1_RP_4, P_network_4_2_AskP_0, P_network_4_2_AskP_1, P_network_4_2_AskP_2, P_network_4_2_AskP_3, P_network_4_2_AskP_4, P_network_4_2_AnsP_0, P_network_4_2_AnsP_1, P_network_4_2_AnsP_2, P_network_4_2_AnsP_3, P_network_4_2_AnsP_4, P_network_4_2_RI_0, P_network_4_2_RI_1, P_network_4_2_RI_2, P_network_4_2_RI_3, P_network_4_2_RI_4, P_network_4_2_AI_0, P_network_4_2_AI_1, P_network_4_2_AI_2, P_network_4_2_AI_3, P_network_4_2_AI_4, P_network_4_2_AnnP_0, P_network_4_2_AnnP_1, P_network_4_2_AnnP_2, P_network_4_2_AnnP_3, P_network_4_2_AnnP_4, P_network_4_2_RP_0, P_network_4_2_RP_1, P_network_4_2_RP_2, P_network_4_2_RP_3, P_network_4_2_RP_4, P_network_4_3_AskP_0, P_network_4_3_AskP_1, P_network_4_3_AskP_2, P_network_4_3_AskP_3, P_network_4_3_AskP_4, P_network_4_3_AnsP_0, P_network_4_3_AnsP_1, P_network_4_3_AnsP_2, P_network_4_3_AnsP_3, P_network_4_3_AnsP_4, P_network_4_3_RI_0, P_network_4_3_RI_1, P_network_4_3_RI_2, P_network_4_3_RI_3, P_network_4_3_RI_4, P_network_4_3_AI_0, P_network_4_3_AI_1, P_network_4_3_AI_2, P_network_4_3_AI_3, P_network_4_3_AI_4, P_network_4_3_AnnP_0, P_network_4_3_AnnP_1, P_network_4_3_AnnP_2, P_network_4_3_AnnP_3, P_network_4_3_AnnP_4, P_network_4_3_RP_0, P_network_4_3_RP_1, P_network_4_3_RP_2, P_network_4_3_RP_3, P_network_4_3_RP_4, P_network_4_4_AskP_0, P_network_4_4_AskP_1, P_network_4_4_AskP_2, P_network_4_4_AskP_3, P_network_4_4_AskP_4, P_network_4_4_AnsP_0, P_network_4_4_AnsP_1, P_network_4_4_AnsP_2, P_network_4_4_AnsP_3, P_network_4_4_AnsP_4, P_network_4_4_RI_0, P_network_4_4_RI_1, P_network_4_4_RI_2, P_network_4_4_RI_3, P_network_4_4_RI_4, P_network_4_4_AI_0, P_network_4_4_AI_1, P_network_4_4_AI_2, P_network_4_4_AI_3, P_network_4_4_AI_4, P_network_4_4_AnnP_0, P_network_4_4_AnnP_1, P_network_4_4_AnnP_2, P_network_4_4_AnnP_3, P_network_4_4_AnnP_4, P_network_4_4_RP_0, P_network_4_4_RP_1, P_network_4_4_RP_2, P_network_4_4_RP_3, P_network_4_4_RP_4, P_poll__handlingMessage_0, P_poll__handlingMessage_1, P_poll__handlingMessage_2, P_poll__handlingMessage_3, P_poll__handlingMessage_4, P_poll__networl_0_0_AskP_0, P_poll__networl_0_0_AskP_1, P_poll__networl_0_0_AskP_2, P_poll__networl_0_0_AskP_3, P_poll__networl_0_0_AskP_4, P_poll__networl_0_0_AnsP_0, P_poll__networl_0_0_AnsP_1, P_poll__networl_0_0_AnsP_2, P_poll__networl_0_0_AnsP_3, P_poll__networl_0_0_AnsP_4, P_poll__networl_0_0_RI_0, P_poll__networl_0_0_RI_1, P_poll__networl_0_0_RI_2, P_poll__networl_0_0_RI_3, P_poll__networl_0_0_RI_4, P_poll__networl_0_0_AI_0, P_poll__networl_0_0_AI_1, P_poll__networl_0_0_AI_2, P_poll__networl_0_0_AI_3, P_poll__networl_0_0_AI_4, P_poll__networl_0_0_AnnP_0, P_poll__networl_0_0_AnnP_1, P_poll__networl_0_0_AnnP_2, P_poll__networl_0_0_AnnP_3, P_poll__networl_0_0_AnnP_4, P_poll__networl_0_0_RP_0, P_poll__networl_0_0_RP_1, P_poll__networl_0_0_RP_2, P_poll__networl_0_0_RP_3, P_poll__networl_0_0_RP_4, P_poll__networl_0_1_AskP_0, P_poll__networl_0_1_AskP_1, P_poll__networl_0_1_AskP_2, P_poll__networl_0_1_AskP_3, P_poll__networl_0_1_AskP_4, P_poll__networl_0_1_AnsP_0, P_poll__networl_0_1_AnsP_1, P_poll__networl_0_1_AnsP_2, P_poll__networl_0_1_AnsP_3, P_poll__networl_0_1_AnsP_4, P_poll__networl_0_1_RI_0, P_poll__networl_0_1_RI_1, P_poll__networl_0_1_RI_2, P_poll__networl_0_1_RI_3, P_poll__networl_0_1_RI_4, P_poll__networl_0_1_AI_0, P_poll__networl_0_1_AI_1, P_poll__networl_0_1_AI_2, P_poll__networl_0_1_AI_3, P_poll__networl_0_1_AI_4, P_poll__networl_0_1_AnnP_0, P_poll__networl_0_1_AnnP_1, P_poll__networl_0_1_AnnP_2, P_poll__networl_0_1_AnnP_3, P_poll__networl_0_1_AnnP_4, P_poll__networl_0_1_RP_0, P_poll__networl_0_1_RP_1, P_poll__networl_0_1_RP_2, P_poll__networl_0_1_RP_3, P_poll__networl_0_1_RP_4, P_poll__networl_0_2_AskP_0, P_poll__networl_0_2_AskP_1, P_poll__networl_0_2_AskP_2, P_poll__networl_0_2_AskP_3, P_poll__networl_0_2_AskP_4, P_poll__networl_0_2_AnsP_0, P_poll__networl_0_2_AnsP_1, P_poll__networl_0_2_AnsP_2, P_poll__networl_0_2_AnsP_3, P_poll__networl_0_2_AnsP_4, P_poll__networl_0_2_RI_0, P_poll__networl_0_2_RI_1, P_poll__networl_0_2_RI_2, P_poll__networl_0_2_RI_3, P_poll__networl_0_2_RI_4, P_poll__networl_0_2_AI_0, P_poll__networl_0_2_AI_1, P_poll__networl_0_2_AI_2, P_poll__networl_0_2_AI_3, P_poll__networl_0_2_AI_4, P_poll__networl_0_2_AnnP_0, P_poll__networl_0_2_AnnP_1, P_poll__networl_0_2_AnnP_2, P_poll__networl_0_2_AnnP_3, P_poll__networl_0_2_AnnP_4, P_poll__networl_0_2_RP_0, P_poll__networl_0_2_RP_1, P_poll__networl_0_2_RP_2, P_poll__networl_0_2_RP_3, P_poll__networl_0_2_RP_4, P_poll__networl_0_3_AskP_0, P_poll__networl_0_3_AskP_1, P_poll__networl_0_3_AskP_2, P_poll__networl_0_3_AskP_3, P_poll__networl_0_3_AskP_4, P_poll__networl_0_3_AnsP_0, P_poll__networl_0_3_AnsP_1, P_poll__networl_0_3_AnsP_2, P_poll__networl_0_3_AnsP_3, P_poll__networl_0_3_AnsP_4, P_poll__networl_0_3_RI_0, P_poll__networl_0_3_RI_1, P_poll__networl_0_3_RI_2, P_poll__networl_0_3_RI_3, P_poll__networl_0_3_RI_4, P_poll__networl_0_3_AI_0, P_poll__networl_0_3_AI_1, P_poll__networl_0_3_AI_2, P_poll__networl_0_3_AI_3, P_poll__networl_0_3_AI_4, P_poll__networl_0_3_AnnP_0, P_poll__networl_0_3_AnnP_1, P_poll__networl_0_3_AnnP_2, P_poll__networl_0_3_AnnP_3, P_poll__networl_0_3_AnnP_4, P_poll__networl_0_3_RP_0, P_poll__networl_0_3_RP_1, P_poll__networl_0_3_RP_2, P_poll__networl_0_3_RP_3, P_poll__networl_0_3_RP_4, P_poll__networl_0_4_AskP_0, P_poll__networl_0_4_AskP_1, P_poll__networl_0_4_AskP_2, P_poll__networl_0_4_AskP_3, P_poll__networl_0_4_AskP_4, P_poll__networl_0_4_AnsP_0, P_poll__networl_0_4_AnsP_1, P_poll__networl_0_4_AnsP_2, P_poll__networl_0_4_AnsP_3, P_poll__networl_0_4_AnsP_4, P_poll__networl_0_4_RI_0, P_poll__networl_0_4_RI_1, P_poll__networl_0_4_RI_2, P_poll__networl_0_4_RI_3, P_poll__networl_0_4_RI_4, P_poll__networl_0_4_AI_0, P_poll__networl_0_4_AI_1, P_poll__networl_0_4_AI_2, P_poll__networl_0_4_AI_3, P_poll__networl_0_4_AI_4, P_poll__networl_0_4_AnnP_0, P_poll__networl_0_4_AnnP_1, P_poll__networl_0_4_AnnP_2, P_poll__networl_0_4_AnnP_3, P_poll__networl_0_4_AnnP_4, P_poll__networl_0_4_RP_0, P_poll__networl_0_4_RP_1, P_poll__networl_0_4_RP_2, P_poll__networl_0_4_RP_3, P_poll__networl_0_4_RP_4, P_poll__networl_1_0_AskP_0, P_poll__networl_1_0_AskP_1, P_poll__networl_1_0_AskP_2, P_poll__networl_1_0_AskP_3, P_poll__networl_1_0_AskP_4, P_poll__networl_1_0_AnsP_0, P_poll__networl_1_0_AnsP_1, P_poll__networl_1_0_AnsP_2, P_poll__networl_1_0_AnsP_3, P_poll__networl_1_0_AnsP_4, P_poll__networl_1_0_RI_0, P_poll__networl_1_0_RI_1, P_poll__networl_1_0_RI_2, P_poll__networl_1_0_RI_3, P_poll__networl_1_0_RI_4, P_poll__networl_1_0_AI_0, P_poll__networl_1_0_AI_1, P_poll__networl_1_0_AI_2, P_poll__networl_1_0_AI_3, P_poll__networl_1_0_AI_4, P_poll__networl_1_0_AnnP_0, P_poll__networl_1_0_AnnP_1, P_poll__networl_1_0_AnnP_2, P_poll__networl_1_0_AnnP_3, P_poll__networl_1_0_AnnP_4, P_poll__networl_1_0_RP_0, P_poll__networl_1_0_RP_1, P_poll__networl_1_0_RP_2, P_poll__networl_1_0_RP_3, P_poll__networl_1_0_RP_4, P_poll__networl_1_1_AskP_0, P_poll__networl_1_1_AskP_1, P_poll__networl_1_1_AskP_2, P_poll__networl_1_1_AskP_3, P_poll__networl_1_1_AskP_4, P_poll__networl_1_1_AnsP_0, P_poll__networl_1_1_AnsP_1, P_poll__networl_1_1_AnsP_2, P_poll__networl_1_1_AnsP_3, P_poll__networl_1_1_AnsP_4, P_poll__networl_1_1_RI_0, P_poll__networl_1_1_RI_1, P_poll__networl_1_1_RI_2, P_poll__networl_1_1_RI_3, P_poll__networl_1_1_RI_4, P_poll__networl_1_1_AI_0, P_poll__networl_1_1_AI_1, P_poll__networl_1_1_AI_2, P_poll__networl_1_1_AI_3, P_poll__networl_1_1_AI_4, P_poll__networl_1_1_AnnP_0, P_poll__networl_1_1_AnnP_1, P_poll__networl_1_1_AnnP_2, P_poll__networl_1_1_AnnP_3, P_poll__networl_1_1_AnnP_4, P_poll__networl_1_1_RP_0, P_poll__networl_1_1_RP_1, P_poll__networl_1_1_RP_2, P_poll__networl_1_1_RP_3, P_poll__networl_1_1_RP_4, P_poll__networl_1_2_AskP_0, P_poll__networl_1_2_AskP_1, P_poll__networl_1_2_AskP_2, P_poll__networl_1_2_AskP_3, P_poll__networl_1_2_AskP_4, P_poll__networl_1_2_AnsP_0, P_poll__networl_1_2_AnsP_1, P_poll__networl_1_2_AnsP_2, P_poll__networl_1_2_AnsP_3, P_poll__networl_1_2_AnsP_4, P_poll__networl_1_2_RI_0, P_poll__networl_1_2_RI_1, P_poll__networl_1_2_RI_2, P_poll__networl_1_2_RI_3, P_poll__networl_1_2_RI_4, P_poll__networl_1_2_AI_0, P_poll__networl_1_2_AI_1, P_poll__networl_1_2_AI_2, P_poll__networl_1_2_AI_3, P_poll__networl_1_2_AI_4, P_poll__networl_1_2_AnnP_0, P_poll__networl_1_2_AnnP_1, P_poll__networl_1_2_AnnP_2, P_poll__networl_1_2_AnnP_3, P_poll__networl_1_2_AnnP_4, P_poll__networl_1_2_RP_0, P_poll__networl_1_2_RP_1, P_poll__networl_1_2_RP_2, P_poll__networl_1_2_RP_3, P_poll__networl_1_2_RP_4, P_poll__networl_1_3_AskP_0, P_poll__networl_1_3_AskP_1, P_poll__networl_1_3_AskP_2, P_poll__networl_1_3_AskP_3, P_poll__networl_1_3_AskP_4, P_poll__networl_1_3_AnsP_0, P_poll__networl_1_3_AnsP_1, P_poll__networl_1_3_AnsP_2, P_poll__networl_1_3_AnsP_3, P_poll__networl_1_3_AnsP_4, P_poll__networl_1_3_RI_0, P_poll__networl_1_3_RI_1, P_poll__networl_1_3_RI_2, P_poll__networl_1_3_RI_3, P_poll__networl_1_3_RI_4, P_poll__networl_1_3_AI_0, P_poll__networl_1_3_AI_1, P_poll__networl_1_3_AI_2, P_poll__networl_1_3_AI_3, P_poll__networl_1_3_AI_4, P_poll__networl_1_3_AnnP_0, P_poll__networl_1_3_AnnP_1, P_poll__networl_1_3_AnnP_2, P_poll__networl_1_3_AnnP_3, P_poll__networl_1_3_AnnP_4, P_poll__networl_1_3_RP_0, P_poll__networl_1_3_RP_1, P_poll__networl_1_3_RP_2, P_poll__networl_1_3_RP_3, P_poll__networl_1_3_RP_4, P_poll__networl_1_4_AskP_0, P_poll__networl_1_4_AskP_1, P_poll__networl_1_4_AskP_2, P_poll__networl_1_4_AskP_3, P_poll__networl_1_4_AskP_4, P_poll__networl_1_4_AnsP_0, P_poll__networl_1_4_AnsP_1, P_poll__networl_1_4_AnsP_2, P_poll__networl_1_4_AnsP_3, P_poll__networl_1_4_AnsP_4, P_poll__networl_1_4_RI_0, P_poll__networl_1_4_RI_1, P_poll__networl_1_4_RI_2, P_poll__networl_1_4_RI_3, P_poll__networl_1_4_RI_4, P_poll__networl_1_4_AI_0, P_poll__networl_1_4_AI_1, P_poll__networl_1_4_AI_2, P_poll__networl_1_4_AI_3, P_poll__networl_1_4_AI_4, P_poll__networl_1_4_AnnP_0, P_poll__networl_1_4_AnnP_1, P_poll__networl_1_4_AnnP_2, P_poll__networl_1_4_AnnP_3, P_poll__networl_1_4_AnnP_4, P_poll__networl_1_4_RP_0, P_poll__networl_1_4_RP_1, P_poll__networl_1_4_RP_2, P_poll__networl_1_4_RP_3, P_poll__networl_1_4_RP_4, P_poll__networl_2_0_AskP_0, P_poll__networl_2_0_AskP_1, P_poll__networl_2_0_AskP_2, P_poll__networl_2_0_AskP_3, P_poll__networl_2_0_AskP_4, P_poll__networl_2_0_AnsP_0, P_poll__networl_2_0_AnsP_1, P_poll__networl_2_0_AnsP_2, P_poll__networl_2_0_AnsP_3, P_poll__networl_2_0_AnsP_4, P_poll__networl_2_0_RI_0, P_poll__networl_2_0_RI_1, P_poll__networl_2_0_RI_2, P_poll__networl_2_0_RI_3, P_poll__networl_2_0_RI_4, P_poll__networl_2_0_AI_0, P_poll__networl_2_0_AI_1, P_poll__networl_2_0_AI_2, P_poll__networl_2_0_AI_3, P_poll__networl_2_0_AI_4, P_poll__networl_2_0_AnnP_0, P_poll__networl_2_0_AnnP_1, P_poll__networl_2_0_AnnP_2, P_poll__networl_2_0_AnnP_3, P_poll__networl_2_0_AnnP_4, P_poll__networl_2_0_RP_0, P_poll__networl_2_0_RP_1, P_poll__networl_2_0_RP_2, P_poll__networl_2_0_RP_3, P_poll__networl_2_0_RP_4, P_poll__networl_2_1_AskP_0, P_poll__networl_2_1_AskP_1, P_poll__networl_2_1_AskP_2, P_poll__networl_2_1_AskP_3, P_poll__networl_2_1_AskP_4, P_poll__networl_2_1_AnsP_0, P_poll__networl_2_1_AnsP_1, P_poll__networl_2_1_AnsP_2, P_poll__networl_2_1_AnsP_3, P_poll__networl_2_1_AnsP_4, P_poll__networl_2_1_RI_0, P_poll__networl_2_1_RI_1, P_poll__networl_2_1_RI_2, P_poll__networl_2_1_RI_3, P_poll__networl_2_1_RI_4, P_poll__networl_2_1_AI_0, P_poll__networl_2_1_AI_1, P_poll__networl_2_1_AI_2, P_poll__networl_2_1_AI_3, P_poll__networl_2_1_AI_4, P_poll__networl_2_1_AnnP_0, P_poll__networl_2_1_AnnP_1, P_poll__networl_2_1_AnnP_2, P_poll__networl_2_1_AnnP_3, P_poll__networl_2_1_AnnP_4, P_poll__networl_2_1_RP_0, P_poll__networl_2_1_RP_1, P_poll__networl_2_1_RP_2, P_poll__networl_2_1_RP_3, P_poll__networl_2_1_RP_4, P_poll__networl_2_2_AskP_0, P_poll__networl_2_2_AskP_1, P_poll__networl_2_2_AskP_2, P_poll__networl_2_2_AskP_3, P_poll__networl_2_2_AskP_4, P_poll__networl_2_2_AnsP_0, P_poll__networl_2_2_AnsP_1, P_poll__networl_2_2_AnsP_2, P_poll__networl_2_2_AnsP_3, P_poll__networl_2_2_AnsP_4, P_poll__networl_2_2_RI_0, P_poll__networl_2_2_RI_1, P_poll__networl_2_2_RI_2, P_poll__networl_2_2_RI_3, P_poll__networl_2_2_RI_4, P_poll__networl_2_2_AI_0, P_poll__networl_2_2_AI_1, P_poll__networl_2_2_AI_2, P_poll__networl_2_2_AI_3, P_poll__networl_2_2_AI_4, P_poll__networl_2_2_AnnP_0, P_poll__networl_2_2_AnnP_1, P_poll__networl_2_2_AnnP_2, P_poll__networl_2_2_AnnP_3, P_poll__networl_2_2_AnnP_4, P_poll__networl_2_2_RP_0, P_poll__networl_2_2_RP_1, P_poll__networl_2_2_RP_2, P_poll__networl_2_2_RP_3, P_poll__networl_2_2_RP_4, P_poll__networl_2_3_AskP_0, P_poll__networl_2_3_AskP_1, P_poll__networl_2_3_AskP_2, P_poll__networl_2_3_AskP_3, P_poll__networl_2_3_AskP_4, P_poll__networl_2_3_AnsP_0, P_poll__networl_2_3_AnsP_1, P_poll__networl_2_3_AnsP_2, P_poll__networl_2_3_AnsP_3, P_poll__networl_2_3_AnsP_4, P_poll__networl_2_3_RI_0, P_poll__networl_2_3_RI_1, P_poll__networl_2_3_RI_2, P_poll__networl_2_3_RI_3, P_poll__networl_2_3_RI_4, P_poll__networl_2_3_AI_0, P_poll__networl_2_3_AI_1, P_poll__networl_2_3_AI_2, P_poll__networl_2_3_AI_3, P_poll__networl_2_3_AI_4, P_poll__networl_2_3_AnnP_0, P_poll__networl_2_3_AnnP_1, P_poll__networl_2_3_AnnP_2, P_poll__networl_2_3_AnnP_3, P_poll__networl_2_3_AnnP_4, P_poll__networl_2_3_RP_0, P_poll__networl_2_3_RP_1, P_poll__networl_2_3_RP_2, P_poll__networl_2_3_RP_3, P_poll__networl_2_3_RP_4, P_poll__networl_2_4_AskP_0, P_poll__networl_2_4_AskP_1, P_poll__networl_2_4_AskP_2, P_poll__networl_2_4_AskP_3, P_poll__networl_2_4_AskP_4, P_poll__networl_2_4_AnsP_0, P_poll__networl_2_4_AnsP_1, P_poll__networl_2_4_AnsP_2, P_poll__networl_2_4_AnsP_3, P_poll__networl_2_4_AnsP_4, P_poll__networl_2_4_RI_0, P_poll__networl_2_4_RI_1, P_poll__networl_2_4_RI_2, P_poll__networl_2_4_RI_3, P_poll__networl_2_4_RI_4, P_poll__networl_2_4_AI_0, P_poll__networl_2_4_AI_1, P_poll__networl_2_4_AI_2, P_poll__networl_2_4_AI_3, P_poll__networl_2_4_AI_4, P_poll__networl_2_4_AnnP_0, P_poll__networl_2_4_AnnP_1, P_poll__networl_2_4_AnnP_2, P_poll__networl_2_4_AnnP_3, P_poll__networl_2_4_AnnP_4, P_poll__networl_2_4_RP_0, P_poll__networl_2_4_RP_1, P_poll__networl_2_4_RP_2, P_poll__networl_2_4_RP_3, P_poll__networl_2_4_RP_4, P_poll__networl_3_0_AskP_0, P_poll__networl_3_0_AskP_1, P_poll__networl_3_0_AskP_2, P_poll__networl_3_0_AskP_3, P_poll__networl_3_0_AskP_4, P_poll__networl_3_0_AnsP_0, P_poll__networl_3_0_AnsP_1, P_poll__networl_3_0_AnsP_2, P_poll__networl_3_0_AnsP_3, P_poll__networl_3_0_AnsP_4, P_poll__networl_3_0_RI_0, P_poll__networl_3_0_RI_1, P_poll__networl_3_0_RI_2, P_poll__networl_3_0_RI_3, P_poll__networl_3_0_RI_4, P_poll__networl_3_0_AI_0, P_poll__networl_3_0_AI_1, P_poll__networl_3_0_AI_2, P_poll__networl_3_0_AI_3, P_poll__networl_3_0_AI_4, P_poll__networl_3_0_AnnP_0, P_poll__networl_3_0_AnnP_1, P_poll__networl_3_0_AnnP_2, P_poll__networl_3_0_AnnP_3, P_poll__networl_3_0_AnnP_4, P_poll__networl_3_0_RP_0, P_poll__networl_3_0_RP_1, P_poll__networl_3_0_RP_2, P_poll__networl_3_0_RP_3, P_poll__networl_3_0_RP_4, P_poll__networl_3_1_AskP_0, P_poll__networl_3_1_AskP_1, P_poll__networl_3_1_AskP_2, P_poll__networl_3_1_AskP_3, P_poll__networl_3_1_AskP_4, P_poll__networl_3_1_AnsP_0, P_poll__networl_3_1_AnsP_1, P_poll__networl_3_1_AnsP_2, P_poll__networl_3_1_AnsP_3, P_poll__networl_3_1_AnsP_4, P_poll__networl_3_1_RI_0, P_poll__networl_3_1_RI_1, P_poll__networl_3_1_RI_2, P_poll__networl_3_1_RI_3, P_poll__networl_3_1_RI_4, P_poll__networl_3_1_AI_0, P_poll__networl_3_1_AI_1, P_poll__networl_3_1_AI_2, P_poll__networl_3_1_AI_3, P_poll__networl_3_1_AI_4, P_poll__networl_3_1_AnnP_0, P_poll__networl_3_1_AnnP_1, P_poll__networl_3_1_AnnP_2, P_poll__networl_3_1_AnnP_3, P_poll__networl_3_1_AnnP_4, P_poll__networl_3_1_RP_0, P_poll__networl_3_1_RP_1, P_poll__networl_3_1_RP_2, P_poll__networl_3_1_RP_3, P_poll__networl_3_1_RP_4, P_poll__networl_3_2_AskP_0, P_poll__networl_3_2_AskP_1, P_poll__networl_3_2_AskP_2, P_poll__networl_3_2_AskP_3, P_poll__networl_3_2_AskP_4, P_poll__networl_3_2_AnsP_0, P_poll__networl_3_2_AnsP_1, P_poll__networl_3_2_AnsP_2, P_poll__networl_3_2_AnsP_3, P_poll__networl_3_2_AnsP_4, P_poll__networl_3_2_RI_0, P_poll__networl_3_2_RI_1, P_poll__networl_3_2_RI_2, P_poll__networl_3_2_RI_3, P_poll__networl_3_2_RI_4, P_poll__networl_3_2_AI_0, P_poll__networl_3_2_AI_1, P_poll__networl_3_2_AI_2, P_poll__networl_3_2_AI_3, P_poll__networl_3_2_AI_4, P_poll__networl_3_2_AnnP_0, P_poll__networl_3_2_AnnP_1, P_poll__networl_3_2_AnnP_2, P_poll__networl_3_2_AnnP_3, P_poll__networl_3_2_AnnP_4, P_poll__networl_3_2_RP_0, P_poll__networl_3_2_RP_1, P_poll__networl_3_2_RP_2, P_poll__networl_3_2_RP_3, P_poll__networl_3_2_RP_4, P_poll__networl_3_3_AskP_0, P_poll__networl_3_3_AskP_1, P_poll__networl_3_3_AskP_2, P_poll__networl_3_3_AskP_3, P_poll__networl_3_3_AskP_4, P_poll__networl_3_3_AnsP_0, P_poll__networl_3_3_AnsP_1, P_poll__networl_3_3_AnsP_2, P_poll__networl_3_3_AnsP_3, P_poll__networl_3_3_AnsP_4, P_poll__networl_3_3_RI_0, P_poll__networl_3_3_RI_1, P_poll__networl_3_3_RI_2, P_poll__networl_3_3_RI_3, P_poll__networl_3_3_RI_4, P_poll__networl_3_3_AI_0, P_poll__networl_3_3_AI_1, P_poll__networl_3_3_AI_2, P_poll__networl_3_3_AI_3, P_poll__networl_3_3_AI_4, P_poll__networl_3_3_AnnP_0, P_poll__networl_3_3_AnnP_1, P_poll__networl_3_3_AnnP_2, P_poll__networl_3_3_AnnP_3, P_poll__networl_3_3_AnnP_4, P_poll__networl_3_3_RP_0, P_poll__networl_3_3_RP_1, P_poll__networl_3_3_RP_2, P_poll__networl_3_3_RP_3, P_poll__networl_3_3_RP_4, P_poll__networl_3_4_AskP_0, P_poll__networl_3_4_AskP_1, P_poll__networl_3_4_AskP_2, P_poll__networl_3_4_AskP_3, P_poll__networl_3_4_AskP_4, P_poll__networl_3_4_AnsP_0, P_poll__networl_3_4_AnsP_1, P_poll__networl_3_4_AnsP_2, P_poll__networl_3_4_AnsP_3, P_poll__networl_3_4_AnsP_4, P_poll__networl_3_4_RI_0, P_poll__networl_3_4_RI_1, P_poll__networl_3_4_RI_2, P_poll__networl_3_4_RI_3, P_poll__networl_3_4_RI_4, P_poll__networl_3_4_AI_0, P_poll__networl_3_4_AI_1, P_poll__networl_3_4_AI_2, P_poll__networl_3_4_AI_3, P_poll__networl_3_4_AI_4, P_poll__networl_3_4_AnnP_0, P_poll__networl_3_4_AnnP_1, P_poll__networl_3_4_AnnP_2, P_poll__networl_3_4_AnnP_3, P_poll__networl_3_4_AnnP_4, P_poll__networl_3_4_RP_0, P_poll__networl_3_4_RP_1, P_poll__networl_3_4_RP_2, P_poll__networl_3_4_RP_3, P_poll__networl_3_4_RP_4, P_poll__networl_4_0_AskP_0, P_poll__networl_4_0_AskP_1, P_poll__networl_4_0_AskP_2, P_poll__networl_4_0_AskP_3, P_poll__networl_4_0_AskP_4, P_poll__networl_4_0_AnsP_0, P_poll__networl_4_0_AnsP_1, P_poll__networl_4_0_AnsP_2, P_poll__networl_4_0_AnsP_3, P_poll__networl_4_0_AnsP_4, P_poll__networl_4_0_RI_0, P_poll__networl_4_0_RI_1, P_poll__networl_4_0_RI_2, P_poll__networl_4_0_RI_3, P_poll__networl_4_0_RI_4, P_poll__networl_4_0_AI_0, P_poll__networl_4_0_AI_1, P_poll__networl_4_0_AI_2, P_poll__networl_4_0_AI_3, P_poll__networl_4_0_AI_4, P_poll__networl_4_0_AnnP_0, P_poll__networl_4_0_AnnP_1, P_poll__networl_4_0_AnnP_2, P_poll__networl_4_0_AnnP_3, P_poll__networl_4_0_AnnP_4, P_poll__networl_4_0_RP_0, P_poll__networl_4_0_RP_1, P_poll__networl_4_0_RP_2, P_poll__networl_4_0_RP_3, P_poll__networl_4_0_RP_4, P_poll__networl_4_1_AskP_0, P_poll__networl_4_1_AskP_1, P_poll__networl_4_1_AskP_2, P_poll__networl_4_1_AskP_3, P_poll__networl_4_1_AskP_4, P_poll__networl_4_1_AnsP_0, P_poll__networl_4_1_AnsP_1, P_poll__networl_4_1_AnsP_2, P_poll__networl_4_1_AnsP_3, P_poll__networl_4_1_AnsP_4, P_poll__networl_4_1_RI_0, P_poll__networl_4_1_RI_1, P_poll__networl_4_1_RI_2, P_poll__networl_4_1_RI_3, P_poll__networl_4_1_RI_4, P_poll__networl_4_1_AI_0, P_poll__networl_4_1_AI_1, P_poll__networl_4_1_AI_2, P_poll__networl_4_1_AI_3, P_poll__networl_4_1_AI_4, P_poll__networl_4_1_AnnP_0, P_poll__networl_4_1_AnnP_1, P_poll__networl_4_1_AnnP_2, P_poll__networl_4_1_AnnP_3, P_poll__networl_4_1_AnnP_4, P_poll__networl_4_1_RP_0, P_poll__networl_4_1_RP_1, P_poll__networl_4_1_RP_2, P_poll__networl_4_1_RP_3, P_poll__networl_4_1_RP_4, P_poll__networl_4_2_AskP_0, P_poll__networl_4_2_AskP_1, P_poll__networl_4_2_AskP_2, P_poll__networl_4_2_AskP_3, P_poll__networl_4_2_AskP_4, P_poll__networl_4_2_AnsP_0, P_poll__networl_4_2_AnsP_1, P_poll__networl_4_2_AnsP_2, P_poll__networl_4_2_AnsP_3, P_poll__networl_4_2_AnsP_4, P_poll__networl_4_2_RI_0, P_poll__networl_4_2_RI_1, P_poll__networl_4_2_RI_2, P_poll__networl_4_2_RI_3, P_poll__networl_4_2_RI_4, P_poll__networl_4_2_AI_0, P_poll__networl_4_2_AI_1, P_poll__networl_4_2_AI_2, P_poll__networl_4_2_AI_3, P_poll__networl_4_2_AI_4, P_poll__networl_4_2_AnnP_0, P_poll__networl_4_2_AnnP_1, P_poll__networl_4_2_AnnP_2, P_poll__networl_4_2_AnnP_3, P_poll__networl_4_2_AnnP_4, P_poll__networl_4_2_RP_0, P_poll__networl_4_2_RP_1, P_poll__networl_4_2_RP_2, P_poll__networl_4_2_RP_3, P_poll__networl_4_2_RP_4, P_poll__networl_4_3_AskP_0, P_poll__networl_4_3_AskP_1, P_poll__networl_4_3_AskP_2, P_poll__networl_4_3_AskP_3, P_poll__networl_4_3_AskP_4, P_poll__networl_4_3_AnsP_0, P_poll__networl_4_3_AnsP_1, P_poll__networl_4_3_AnsP_2, P_poll__networl_4_3_AnsP_3, P_poll__networl_4_3_AnsP_4, P_poll__networl_4_3_RI_0, P_poll__networl_4_3_RI_1, P_poll__networl_4_3_RI_2, P_poll__networl_4_3_RI_3, P_poll__networl_4_3_RI_4, P_poll__networl_4_3_AI_0, P_poll__networl_4_3_AI_1, P_poll__networl_4_3_AI_2, P_poll__networl_4_3_AI_3, P_poll__networl_4_3_AI_4, P_poll__networl_4_3_AnnP_0, P_poll__networl_4_3_AnnP_1, P_poll__networl_4_3_AnnP_2, P_poll__networl_4_3_AnnP_3, P_poll__networl_4_3_AnnP_4, P_poll__networl_4_3_RP_0, P_poll__networl_4_3_RP_1, P_poll__networl_4_3_RP_2, P_poll__networl_4_3_RP_3, P_poll__networl_4_3_RP_4, P_poll__networl_4_4_AskP_0, P_poll__networl_4_4_AskP_1, P_poll__networl_4_4_AskP_2, P_poll__networl_4_4_AskP_3, P_poll__networl_4_4_AskP_4, P_poll__networl_4_4_AnsP_0, P_poll__networl_4_4_AnsP_1, P_poll__networl_4_4_AnsP_2, P_poll__networl_4_4_AnsP_3, P_poll__networl_4_4_AnsP_4, P_poll__networl_4_4_RI_0, P_poll__networl_4_4_RI_1, P_poll__networl_4_4_RI_2, P_poll__networl_4_4_RI_3, P_poll__networl_4_4_RI_4, P_poll__networl_4_4_AI_0, P_poll__networl_4_4_AI_1, P_poll__networl_4_4_AI_2, P_poll__networl_4_4_AI_3, P_poll__networl_4_4_AI_4, P_poll__networl_4_4_AnnP_0, P_poll__networl_4_4_AnnP_1, P_poll__networl_4_4_AnnP_2, P_poll__networl_4_4_AnnP_3, P_poll__networl_4_4_AnnP_4, P_poll__networl_4_4_RP_0, P_poll__networl_4_4_RP_1, P_poll__networl_4_4_RP_2, P_poll__networl_4_4_RP_3, P_poll__networl_4_4_RP_4, P_poll__pollEnd_0, P_poll__pollEnd_1, P_poll__pollEnd_2, P_poll__pollEnd_3, P_poll__pollEnd_4, P_poll__waitingMessage_0, P_poll__waitingMessage_1, P_poll__waitingMessage_2, P_poll__waitingMessage_3, P_poll__waitingMessage_4, P_polling_0, P_polling_1, P_polling_2, P_polling_3, P_polling_4, P_sendAnnPs__broadcasting_0_1, P_sendAnnPs__broadcasting_0_2, P_sendAnnPs__broadcasting_0_3, P_sendAnnPs__broadcasting_0_4, P_sendAnnPs__broadcasting_1_1, P_sendAnnPs__broadcasting_1_2, P_sendAnnPs__broadcasting_1_3, P_sendAnnPs__broadcasting_1_4, P_sendAnnPs__broadcasting_2_1, P_sendAnnPs__broadcasting_2_2, P_sendAnnPs__broadcasting_2_3, P_sendAnnPs__broadcasting_2_4, P_sendAnnPs__broadcasting_3_1, P_sendAnnPs__broadcasting_3_2, P_sendAnnPs__broadcasting_3_3, P_sendAnnPs__broadcasting_3_4, P_sendAnnPs__broadcasting_4_1, P_sendAnnPs__broadcasting_4_2, P_sendAnnPs__broadcasting_4_3, P_sendAnnPs__broadcasting_4_4, P_stage_0_NEG, P_stage_0_PRIM, P_stage_0_SEC, P_stage_1_NEG, P_stage_1_PRIM, P_stage_1_SEC, P_stage_2_NEG, P_stage_2_PRIM, P_stage_2_SEC, P_stage_3_NEG, P_stage_3_PRIM, P_stage_3_SEC, P_stage_4_NEG, P_stage_4_PRIM, P_stage_4_SEC, P_startNeg__broadcasting_0_1, P_startNeg__broadcasting_0_2, P_startNeg__broadcasting_0_3, P_startNeg__broadcasting_0_4, P_startNeg__broadcasting_1_1, P_startNeg__broadcasting_1_2, P_startNeg__broadcasting_1_3, P_startNeg__broadcasting_1_4, P_startNeg__broadcasting_2_1, P_startNeg__broadcasting_2_2, P_startNeg__broadcasting_2_3, P_startNeg__broadcasting_2_4, P_startNeg__broadcasting_3_1, P_startNeg__broadcasting_3_2, P_startNeg__broadcasting_3_3, P_startNeg__broadcasting_3_4, P_startNeg__broadcasting_4_1, P_startNeg__broadcasting_4_2, P_startNeg__broadcasting_4_3, P_startNeg__broadcasting_4_4]
[2025-06-01 18:55:23] [INFO ] Parsed PT model containing 1830 places and 2340 transitions and 13565 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1687 places in 17 ms
Reduce places removed 1699 places and 2213 transitions.
Reduce places removed 9 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-PT-4-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-4-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 127/127 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 110 transition count 127
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 30 place count 92 transition count 78
Iterating global reduction 1 with 18 rules applied. Total rules applied 48 place count 92 transition count 78
Applied a total of 48 rules in 23 ms. Remains 92 /122 variables (removed 30) and now considering 78/127 (removed 49) transitions.
[2025-06-01 18:55:23] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 92 cols
[2025-06-01 18:55:23] [INFO ] Computed 23 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:55:23] [INFO ] Implicit Places using invariants in 239 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 268 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/122 places, 78/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 305 ms. Remains : 76/122 places, 78/127 transitions.
Support contains 7 out of 76 places after structural reductions.
[2025-06-01 18:55:23] [INFO ] Flatten gal took : 30 ms
[2025-06-01 18:55:23] [INFO ] Flatten gal took : 10 ms
[2025-06-01 18:55:24] [INFO ] Input system was already deterministic with 78 transitions.
RANDOM walk for 217 steps (0 resets) in 16 ms. (12 steps per ms) remains 0/3 properties
Computed a total of 76 stabilizing places and 78 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 78
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 78/78 transitions.
Reduce places removed 4 places and 4 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 64 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 60 transition count 62
Applied a total of 20 rules in 17 ms. Remains 60 /76 variables (removed 16) and now considering 62/78 (removed 16) transitions.
[2025-06-01 18:55:24] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 60 cols
[2025-06-01 18:55:24] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:55:24] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-01 18:55:24] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2025-06-01 18:55:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:55:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 18:55:24] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:55:24] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2025-06-01 18:55:24] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2025-06-01 18:55:24] [INFO ] Invariant cache hit.
[2025-06-01 18:55:24] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 53/113 variables, 60/67 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/70 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 70 constraints, problems are : Problem set: 1 solved, 57 unsolved in 1345 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 60/60 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 53/113 variables, 60/67 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 3/70 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 57/127 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 127 constraints, problems are : Problem set: 1 solved, 57 unsolved in 1271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 60/60 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 57/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2659ms problems are : Problem set: 1 solved, 57 unsolved
Search for dead transitions found 1 dead transitions in 2666ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 60/76 places, 61/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:55:27] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 2868 ms. Remains : 60/76 places, 61/78 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-PT-4-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Computed a total of 60 stabilizing places and 61 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 61
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-4-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-4-LTLFireability-00 finished in 3469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2025-06-01 18:55:27] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2025-06-01 18:55:27] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:55:27] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-01 18:55:27] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2025-06-01 18:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:55:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 18:55:27] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-01 18:55:27] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2025-06-01 18:55:27] [INFO ] Invariant cache hit.
[2025-06-01 18:55:27] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/145 variables, 76/83 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 3/86 constraints. Problems are: Problem set: 1 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:28] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:28] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:28] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:28] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:28] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:28] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:28] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:28] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 16/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:29] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 4/106 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 106 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2994 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 20/27 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 69/145 variables, 76/103 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/106 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 73/179 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 179 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2503 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/74 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5529ms problems are : Problem set: 1 solved, 73 unsolved
Search for dead transitions found 1 dead transitions in 5530ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 76/76 places, 77/78 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5673 ms. Remains : 76/76 places, 77/78 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : NeoElection-PT-4-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-PT-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-4-LTLFireability-14 finished in 5782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2025-06-01 18:55:33] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2025-06-01 18:55:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:55:33] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-01 18:55:33] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2025-06-01 18:55:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:55:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 18:55:33] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-01 18:55:33] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2025-06-01 18:55:33] [INFO ] Invariant cache hit.
[2025-06-01 18:55:33] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/145 variables, 76/83 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 3/86 constraints. Problems are: Problem set: 1 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:34] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 16/102 constraints. Problems are: Problem set: 1 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:35] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:35] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:35] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:55:35] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 4/106 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 106 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2829 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 20/27 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 69/145 variables, 76/103 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/106 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 73/179 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 179 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2550 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/74 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5391ms problems are : Problem set: 1 solved, 73 unsolved
Search for dead transitions found 1 dead transitions in 5393ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 76/76 places, 77/78 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5519 ms. Remains : 76/76 places, 77/78 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-4-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-PT-4-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-4-LTLFireability-15 finished in 5628 ms.
All properties solved by simple procedures.
Total runtime 16019 ms.

BK_STOP 1748804139378

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is NeoElection-PT-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812000116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-4.tgz
mv NeoElection-PT-4 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;