Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876811900106.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-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876811900106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 101K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 371K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 158K 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 70K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 170K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 224K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 746K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 162K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 601K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K 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 939K 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-3-CTLFireability-2025-00
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-01
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-02
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-03
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-04
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-05
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-06
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-07
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-08
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-09
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-10
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-11
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-12
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-13
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-14
FORMULA_NAME NeoElection-PT-3-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748803657357

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-01 18:47:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 18:47:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 18:47:38] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2025-06-01 18:47:38] [INFO ] Transformed 972 places.
[2025-06-01 18:47:38] [INFO ] Transformed 1016 transitions.
[2025-06-01 18:47:38] [INFO ] Found NUPN structural information;
[2025-06-01 18:47:38] [INFO ] Completing missing partition info from NUPN : creating a component with [P_crashed_0, P_crashed_1, P_crashed_2, P_crashed_3, P_dead_0, P_dead_1, P_dead_2, P_dead_3, P_electedPrimary_0, P_electedPrimary_1, P_electedPrimary_2, P_electedPrimary_3, P_electedSecondary_0, P_electedSecondary_1, P_electedSecondary_2, P_electedSecondary_3, P_electionFailed_0, P_electionFailed_1, P_electionFailed_2, P_electionFailed_3, P_electionInit_0, P_electionInit_1, P_electionInit_2, P_electionInit_3, P_masterList_0_1_0, P_masterList_0_1_1, P_masterList_0_1_2, P_masterList_0_1_3, P_masterList_0_2_0, P_masterList_0_2_1, P_masterList_0_2_2, P_masterList_0_2_3, P_masterList_0_3_0, P_masterList_0_3_1, P_masterList_0_3_2, P_masterList_0_3_3, P_masterList_1_1_0, P_masterList_1_1_1, P_masterList_1_1_2, P_masterList_1_1_3, P_masterList_1_2_0, P_masterList_1_2_1, P_masterList_1_2_2, P_masterList_1_2_3, P_masterList_1_3_0, P_masterList_1_3_1, P_masterList_1_3_2, P_masterList_1_3_3, P_masterList_2_1_0, P_masterList_2_1_1, P_masterList_2_1_2, P_masterList_2_1_3, P_masterList_2_2_0, P_masterList_2_2_1, P_masterList_2_2_2, P_masterList_2_2_3, P_masterList_2_3_0, P_masterList_2_3_1, P_masterList_2_3_2, P_masterList_2_3_3, P_masterList_3_1_0, P_masterList_3_1_1, P_masterList_3_1_2, P_masterList_3_1_3, P_masterList_3_2_0, P_masterList_3_2_1, P_masterList_3_2_2, P_masterList_3_2_3, P_masterList_3_3_0, P_masterList_3_3_1, P_masterList_3_3_2, P_masterList_3_3_3, P_masterState_0_F_0, P_masterState_0_F_1, P_masterState_0_F_2, P_masterState_0_F_3, P_masterState_0_T_0, P_masterState_0_T_1, P_masterState_0_T_2, P_masterState_0_T_3, P_masterState_1_F_0, P_masterState_1_F_1, P_masterState_1_F_2, P_masterState_1_F_3, P_masterState_1_T_0, P_masterState_1_T_1, P_masterState_1_T_2, P_masterState_1_T_3, P_masterState_2_F_0, P_masterState_2_F_1, P_masterState_2_F_2, P_masterState_2_F_3, P_masterState_2_T_0, P_masterState_2_T_1, P_masterState_2_T_2, P_masterState_2_T_3, P_masterState_3_F_0, P_masterState_3_F_1, P_masterState_3_F_2, P_masterState_3_F_3, P_masterState_3_T_0, P_masterState_3_T_1, P_masterState_3_T_2, P_masterState_3_T_3, 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_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_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_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_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_AnsP_0, P_network_0_0_AnsP_1, P_network_0_0_AnsP_2, P_network_0_0_AnsP_3, 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_AI_0, P_network_0_0_AI_1, P_network_0_0_AI_2, P_network_0_0_AI_3, 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_RP_0, P_network_0_0_RP_1, P_network_0_0_RP_2, P_network_0_0_RP_3, 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_AnsP_0, P_network_0_1_AnsP_1, P_network_0_1_AnsP_2, P_network_0_1_AnsP_3, 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_AI_0, P_network_0_1_AI_1, P_network_0_1_AI_2, P_network_0_1_AI_3, 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_RP_0, P_network_0_1_RP_1, P_network_0_1_RP_2, P_network_0_1_RP_3, 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_AnsP_0, P_network_0_2_AnsP_1, P_network_0_2_AnsP_2, P_network_0_2_AnsP_3, 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_AI_0, P_network_0_2_AI_1, P_network_0_2_AI_2, P_network_0_2_AI_3, 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_RP_0, P_network_0_2_RP_1, P_network_0_2_RP_2, P_network_0_2_RP_3, 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_AnsP_0, P_network_0_3_AnsP_1, P_network_0_3_AnsP_2, P_network_0_3_AnsP_3, 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_AI_0, P_network_0_3_AI_1, P_network_0_3_AI_2, P_network_0_3_AI_3, 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_RP_0, P_network_0_3_RP_1, P_network_0_3_RP_2, P_network_0_3_RP_3, 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_AnsP_0, P_network_1_0_AnsP_1, P_network_1_0_AnsP_2, P_network_1_0_AnsP_3, 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_AI_0, P_network_1_0_AI_1, P_network_1_0_AI_2, P_network_1_0_AI_3, 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_RP_0, P_network_1_0_RP_1, P_network_1_0_RP_2, P_network_1_0_RP_3, 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_AnsP_0, P_network_1_1_AnsP_1, P_network_1_1_AnsP_2, P_network_1_1_AnsP_3, 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_AI_0, P_network_1_1_AI_1, P_network_1_1_AI_2, P_network_1_1_AI_3, 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_RP_0, P_network_1_1_RP_1, P_network_1_1_RP_2, P_network_1_1_RP_3, 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_AnsP_0, P_network_1_2_AnsP_1, P_network_1_2_AnsP_2, P_network_1_2_AnsP_3, 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_AI_0, P_network_1_2_AI_1, P_network_1_2_AI_2, P_network_1_2_AI_3, 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_RP_0, P_network_1_2_RP_1, P_network_1_2_RP_2, P_network_1_2_RP_3, 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_AnsP_0, P_network_1_3_AnsP_1, P_network_1_3_AnsP_2, P_network_1_3_AnsP_3, 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_AI_0, P_network_1_3_AI_1, P_network_1_3_AI_2, P_network_1_3_AI_3, 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_RP_0, P_network_1_3_RP_1, P_network_1_3_RP_2, P_network_1_3_RP_3, 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_AnsP_0, P_network_2_0_AnsP_1, P_network_2_0_AnsP_2, P_network_2_0_AnsP_3, 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_AI_0, P_network_2_0_AI_1, P_network_2_0_AI_2, P_network_2_0_AI_3, 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_RP_0, P_network_2_0_RP_1, P_network_2_0_RP_2, P_network_2_0_RP_3, 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_AnsP_0, P_network_2_1_AnsP_1, P_network_2_1_AnsP_2, P_network_2_1_AnsP_3, 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_AI_0, P_network_2_1_AI_1, P_network_2_1_AI_2, P_network_2_1_AI_3, 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_RP_0, P_network_2_1_RP_1, P_network_2_1_RP_2, P_network_2_1_RP_3, 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_AnsP_0, P_network_2_2_AnsP_1, P_network_2_2_AnsP_2, P_network_2_2_AnsP_3, 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_AI_0, P_network_2_2_AI_1, P_network_2_2_AI_2, P_network_2_2_AI_3, 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_RP_0, P_network_2_2_RP_1, P_network_2_2_RP_2, P_network_2_2_RP_3, 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_AnsP_0, P_network_2_3_AnsP_1, P_network_2_3_AnsP_2, P_network_2_3_AnsP_3, 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_AI_0, P_network_2_3_AI_1, P_network_2_3_AI_2, P_network_2_3_AI_3, 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_RP_0, P_network_2_3_RP_1, P_network_2_3_RP_2, P_network_2_3_RP_3, 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_AnsP_0, P_network_3_0_AnsP_1, P_network_3_0_AnsP_2, P_network_3_0_AnsP_3, 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_AI_0, P_network_3_0_AI_1, P_network_3_0_AI_2, P_network_3_0_AI_3, 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_RP_0, P_network_3_0_RP_1, P_network_3_0_RP_2, P_network_3_0_RP_3, 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_AnsP_0, P_network_3_1_AnsP_1, P_network_3_1_AnsP_2, P_network_3_1_AnsP_3, 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_AI_0, P_network_3_1_AI_1, P_network_3_1_AI_2, P_network_3_1_AI_3, 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_RP_0, P_network_3_1_RP_1, P_network_3_1_RP_2, P_network_3_1_RP_3, 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_AnsP_0, P_network_3_2_AnsP_1, P_network_3_2_AnsP_2, P_network_3_2_AnsP_3, 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_AI_0, P_network_3_2_AI_1, P_network_3_2_AI_2, P_network_3_2_AI_3, 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_RP_0, P_network_3_2_RP_1, P_network_3_2_RP_2, P_network_3_2_RP_3, 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_AnsP_0, P_network_3_3_AnsP_1, P_network_3_3_AnsP_2, P_network_3_3_AnsP_3, 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_AI_0, P_network_3_3_AI_1, P_network_3_3_AI_2, P_network_3_3_AI_3, 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_RP_0, P_network_3_3_RP_1, P_network_3_3_RP_2, P_network_3_3_RP_3, P_poll__handlingMessage_0, P_poll__handlingMessage_1, P_poll__handlingMessage_2, P_poll__handlingMessage_3, 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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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__pollEnd_0, P_poll__pollEnd_1, P_poll__pollEnd_2, P_poll__pollEnd_3, P_poll__waitingMessage_0, P_poll__waitingMessage_1, P_poll__waitingMessage_2, P_poll__waitingMessage_3, P_polling_0, P_polling_1, P_polling_2, P_polling_3, P_sendAnnPs__broadcasting_0_1, P_sendAnnPs__broadcasting_0_2, P_sendAnnPs__broadcasting_0_3, P_sendAnnPs__broadcasting_1_1, P_sendAnnPs__broadcasting_1_2, P_sendAnnPs__broadcasting_1_3, P_sendAnnPs__broadcasting_2_1, P_sendAnnPs__broadcasting_2_2, P_sendAnnPs__broadcasting_2_3, P_sendAnnPs__broadcasting_3_1, P_sendAnnPs__broadcasting_3_2, P_sendAnnPs__broadcasting_3_3, 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_startNeg__broadcasting_0_1, P_startNeg__broadcasting_0_2, P_startNeg__broadcasting_0_3, P_startNeg__broadcasting_1_1, P_startNeg__broadcasting_1_2, P_startNeg__broadcasting_1_3, P_startNeg__broadcasting_2_1, P_startNeg__broadcasting_2_2, P_startNeg__broadcasting_2_3, P_startNeg__broadcasting_3_1, P_startNeg__broadcasting_3_2, P_startNeg__broadcasting_3_3]
[2025-06-01 18:47:38] [INFO ] Parsed PT model containing 972 places and 1016 transitions and 5840 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Deduced a syphon composed of 892 places in 3 ms
Reduce places removed 898 places and 958 transitions.
Reduce places removed 7 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-PT-3-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-CTLFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 58/58 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 58
Applied a total of 6 rules in 11 ms. Remains 61 /67 variables (removed 6) and now considering 58/58 (removed 0) transitions.
[2025-06-01 18:47:38] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
// Phase 1: matrix 54 rows 61 cols
[2025-06-01 18:47:38] [INFO ] Computed 14 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:39] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-01 18:47:39] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
[2025-06-01 18:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 18:47:39] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2025-06-01 18:47:39] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
[2025-06-01 18:47:39] [INFO ] Invariant cache hit.
[2025-06-01 18:47:39] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 3/61 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:39] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:39] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:40] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:40] [INFO ] Deduced a trap composed of 6 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:47:40] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:40] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:40] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:40] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:40] [INFO ] Deduced a trap composed of 6 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:47:40] [INFO ] Deduced a trap composed of 6 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:47:40] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:40] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:40] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:40] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
At refinement iteration 9 (OVERLAPS) 54/115 variables, 61/150 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 6/156 constraints. Problems are: Problem set: 2 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:41] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:41] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 2/158 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/115 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 53 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:41] [INFO ] Deduced a trap composed of 6 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:47:41] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/115 variables, 2/160 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/115 variables, 0/160 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 0/115 variables, 0/160 constraints. Problems are: Problem set: 2 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 160 constraints, problems are : Problem set: 2 solved, 53 unsolved in 3690 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 53 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 2/60 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/63 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 15/78 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 3/61 variables, 3/81 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 3/84 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 6/90 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 3/93 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 54/115 variables, 61/154 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 6/160 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/115 variables, 53/213 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 14 (OVERLAPS) 0/115 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 213 constraints, problems are : Problem set: 2 solved, 53 unsolved in 4020 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 53/55 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7764ms problems are : Problem set: 2 solved, 53 unsolved
Search for dead transitions found 2 dead transitions in 7776ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 56/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8105 ms. Remains : 61/67 places, 56/58 transitions.
Support contains 55 out of 61 places after structural reductions.
[2025-06-01 18:47:47] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-01 18:47:47] [INFO ] Flatten gal took : 23 ms
[2025-06-01 18:47:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-PT-3-CTLFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-CTLFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 18:47:47] [INFO ] Flatten gal took : 9 ms
[2025-06-01 18:47:47] [INFO ] Input system was already deterministic with 56 transitions.
Reduction of identical properties reduced properties to check from 12 to 9
RANDOM walk for 222 steps (0 resets) in 34 ms. (6 steps per ms) remains 0/9 properties
[2025-06-01 18:47:47] [INFO ] Flatten gal took : 7 ms
[2025-06-01 18:47:47] [INFO ] Flatten gal took : 17 ms
[2025-06-01 18:47:47] [INFO ] Input system was already deterministic with 56 transitions.
Computed a total of 61 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 53 transition count 42
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 53 transition count 42
Applied a total of 16 rules in 4 ms. Remains 53 /61 variables (removed 8) and now considering 42/56 (removed 14) transitions.
[2025-06-01 18:47:47] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
// Phase 1: matrix 38 rows 53 cols
[2025-06-01 18:47:47] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:47] [INFO ] Implicit Places using invariants in 50 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 52 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/61 places, 42/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 44/61 places, 42/56 transitions.
[2025-06-01 18:47:47] [INFO ] Flatten gal took : 4 ms
[2025-06-01 18:47:47] [INFO ] Flatten gal took : 4 ms
[2025-06-01 18:47:47] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-01 18:47:47] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:47] [INFO ] Flatten gal took : 4 ms
[2025-06-01 18:47:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9178638191955815593.gal : 1 ms
[2025-06-01 18:47:47] [INFO ] Time to serialize properties into /tmp/CTLFireability2580631000253006515.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9178638191955815593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2580631000253006515.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,391638,0.044877,5188,2,746,5,6945,6,0,212,6735,0


Converting to forward existential form...Done !
original formula: AF(EX(EX(EG((((((P_network_1_2_AnsP_0==0)||(P_poll__handlingMessage_1==0))&&((P_network_2_3_AnsP_0==0)||(P_poll__handlingMessage_2==0)))&...408
=> equivalent forward existential formula: [FwdG(Init,!(EX(EX(EG((((((P_network_1_2_AnsP_0==0)||(P_poll__handlingMessage_1==0))&&((P_network_2_3_AnsP_0==0)...453
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t25, t26, t27, t28, t34, t36, t38, Intersection with reachable at each step ...211
(forward)formula 0,1,1.72305,64368,1,0,607,325794,108,330,1385,452407,594
FORMULA NeoElection-PT-3-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 47
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 47
Applied a total of 10 rules in 2 ms. Remains 56 /61 variables (removed 5) and now considering 47/56 (removed 9) transitions.
[2025-06-01 18:47:53] [INFO ] Flow matrix only has 43 transitions (discarded 4 similar events)
// Phase 1: matrix 43 rows 56 cols
[2025-06-01 18:47:53] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:53] [INFO ] Implicit Places using invariants in 41 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/61 places, 47/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 55/61 places, 47/56 transitions.
[2025-06-01 18:47:53] [INFO ] Flatten gal took : 4 ms
[2025-06-01 18:47:53] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:53] [INFO ] Input system was already deterministic with 47 transitions.
[2025-06-01 18:47:53] [INFO ] Flatten gal took : 4 ms
[2025-06-01 18:47:53] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7745405758393840030.gal : 1 ms
[2025-06-01 18:47:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8570104277714248738.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7745405758393840030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8570104277714248738.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,709266,0.037858,5644,2,1130,5,9188,6,0,255,7780,0


Converting to forward existential form...Done !
original formula: EF((AX(AG((((((P_negotiation_3_1_NONE==0)||(P_startNeg__broadcasting_3_1==0))&&((P_negotiation_2_1_NONE==0)||(P_startNeg__broadcasting_2_...1524
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((((((P_negotiation_3_1_NONE==0)||(P_startNeg__broadcasting_3_1==0))&&((...1612
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t31, t33, t39, t41, t43, Intersection with reachable at eac...218
(forward)formula 0,0,0.809402,37752,1,0,243,206944,119,78,1795,166919,257
FORMULA NeoElection-PT-3-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 53 transition count 42
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 53 transition count 42
Applied a total of 16 rules in 7 ms. Remains 53 /61 variables (removed 8) and now considering 42/56 (removed 14) transitions.
[2025-06-01 18:47:53] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
// Phase 1: matrix 38 rows 53 cols
[2025-06-01 18:47:53] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:54] [INFO ] Implicit Places using invariants in 53 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 54 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/61 places, 42/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 44/61 places, 42/56 transitions.
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:54] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:54] [INFO ] Time to serialize gal into /tmp/CTLFireability18133181068836858222.gal : 1 ms
[2025-06-01 18:47:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5967168648610182985.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18133181068836858222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5967168648610182985.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,391638,0.031966,5176,2,746,5,6945,6,0,212,6735,0


Converting to forward existential form...Done !
original formula: EF(EX(TRUE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * TRUE)] != FALSE
(forward)formula 0,1,0.037964,5176,1,0,6,6945,7,1,385,6735,1
FORMULA NeoElection-PT-3-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Reduce places removed 3 places and 3 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 55 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 55 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 52 transition count 50
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 47 transition count 39
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 47 transition count 39
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 44 transition count 36
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 41 transition count 33
Ensure Unique test removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 38 transition count 33
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 35 transition count 30
Applied a total of 34 rules in 17 ms. Remains 35 /61 variables (removed 26) and now considering 30/56 (removed 26) transitions.
[2025-06-01 18:47:54] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 35 cols
[2025-06-01 18:47:54] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:54] [INFO ] Implicit Places using invariants in 45 ms returned [4, 5, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/61 places, 30/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 65 ms. Remains : 32/61 places, 30/56 transitions.
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:54] [INFO ] Input system was already deterministic with 30 transitions.
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:54] [INFO ] Time to serialize gal into /tmp/CTLFireability18020878646602925579.gal : 1 ms
[2025-06-01 18:47:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15418466513550986978.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18020878646602925579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15418466513550986978.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,114023,0.01562,4368,2,407,5,3036,6,0,149,3201,0


Converting to forward existential form...Done !
original formula: EG(AF((((P_poll__pollEnd_2==1)||(P_poll__pollEnd_3==1))||(P_poll__pollEnd_1==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((P_poll__pollEnd_2==1)||(P_poll__pollEnd_3==1))||(P_poll__pollEnd_1==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t6, t13, t21, t22, t23, t28, Intersection with reachable at each step en...209
dead was empty
(forward)formula 0,0,0.159287,12048,1,0,129,49828,82,36,1042,51186,120
FORMULA NeoElection-PT-3-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 53 transition count 42
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 53 transition count 42
Applied a total of 16 rules in 2 ms. Remains 53 /61 variables (removed 8) and now considering 42/56 (removed 14) transitions.
[2025-06-01 18:47:54] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
// Phase 1: matrix 38 rows 53 cols
[2025-06-01 18:47:54] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:54] [INFO ] Implicit Places using invariants in 37 ms returned [8, 11, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/61 places, 42/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 50/61 places, 42/56 transitions.
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:54] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:54] [INFO ] Time to serialize gal into /tmp/CTLFireability17899513134172973419.gal : 1 ms
[2025-06-01 18:47:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12307628054551066305.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17899513134172973419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12307628054551066305.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,391638,0.036242,5508,2,961,5,8836,6,0,230,8535,0


Converting to forward existential form...Done !
original formula: !(A(EF(!(AX(FALSE))) U (((((P_negotiation_3_1_NONE==1)&&(P_startNeg__broadcasting_3_1==1))||((P_negotiation_2_1_NONE==1)&&(P_startNeg__br...447
=> equivalent forward existential formula: ([((FwdU(Init,!((((((P_negotiation_3_1_NONE==1)&&(P_startNeg__broadcasting_3_1==1))||((P_negotiation_2_1_NONE==1...1354
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t25, t26, t27, t28, t34, t36, t38, Intersection with reachable at each step ...211
Hit Full ! (commute/partial/dont) 33/27/9
Hit Full ! (commute/partial/dont) 33/27/9
(forward)formula 0,0,0.491721,24384,1,0,191,119601,120,53,1661,107231,191
FORMULA NeoElection-PT-3-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Reduce places removed 3 places and 3 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 55 transition count 53
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 50 transition count 42
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 50 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 47 transition count 39
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 44 transition count 36
Ensure Unique test removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 41 transition count 36
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 38 transition count 33
Applied a total of 28 rules in 10 ms. Remains 38 /61 variables (removed 23) and now considering 33/56 (removed 23) transitions.
[2025-06-01 18:47:54] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
// Phase 1: matrix 29 rows 38 cols
[2025-06-01 18:47:54] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:54] [INFO ] Implicit Places using invariants in 35 ms returned [4, 5, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 35/61 places, 33/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 48 ms. Remains : 35/61 places, 33/56 transitions.
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:54] [INFO ] Input system was already deterministic with 33 transitions.
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:54] [INFO ] Time to serialize gal into /tmp/CTLFireability16203853129908635975.gal : 1 ms
[2025-06-01 18:47:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3373535722164729354.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16203853129908635975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3373535722164729354.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,386135,0.025441,4952,2,408,5,5412,6,0,164,5995,0


Converting to forward existential form...Done !
original formula: EF(EG((((AF((((P_poll__pollEnd_2==0)&&(P_poll__pollEnd_3==0))&&(P_poll__pollEnd_1==0))) * ((P_network_3_2_RI_0==0)||(P_poll__handlingMess...473
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((!(EG(!((((P_poll__pollEnd_2==0)&&(P_poll__pollEnd_3==0))&&(P_poll__pollEnd_1==0))))) * ...529
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t25, t26, t27, t28, Intersection with reachable at each step ena...208
(forward)formula 0,1,0.255056,15848,1,0,167,72776,94,43,1124,75248,152
FORMULA NeoElection-PT-3-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 61 transition count 53
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 53
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 14 place count 50 transition count 39
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 50 transition count 39
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 22 place count 50 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 47 transition count 36
Applied a total of 28 rules in 14 ms. Remains 47 /61 variables (removed 14) and now considering 36/56 (removed 20) transitions.
[2025-06-01 18:47:55] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
// Phase 1: matrix 32 rows 47 cols
[2025-06-01 18:47:55] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:55] [INFO ] Implicit Places using invariants in 42 ms returned [8, 11, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 44/61 places, 36/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 58 ms. Remains : 44/61 places, 36/56 transitions.
[2025-06-01 18:47:55] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:55] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:55] [INFO ] Input system was already deterministic with 36 transitions.
[2025-06-01 18:47:55] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:55] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6789591999920048808.gal : 1 ms
[2025-06-01 18:47:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1617296442289277457.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6789591999920048808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1617296442289277457.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,14764,0.021811,4800,2,890,5,5014,6,0,194,4182,0


Converting to forward existential form...Done !
original formula: AG(EF((((((P_negotiation_3_1_NONE==1)&&(P_startNeg__broadcasting_3_1==1))||((P_negotiation_2_1_NONE==1)&&(P_startNeg__broadcasting_2_1==1...430
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((P_negotiation_3_1_NONE==1)&&(P_startNeg__broadcasting_3_1==1))||((P_negotiat...490
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t16, t17, t18, t22, t23, t24, t30, t35, Intersection with reachable at each step...212
(forward)formula 0,0,0.093305,8896,1,0,88,22474,93,41,1172,16995,82
FORMULA NeoElection-PT-3-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 53
Applied a total of 6 rules in 2 ms. Remains 58 /61 variables (removed 3) and now considering 53/56 (removed 3) transitions.
[2025-06-01 18:47:55] [INFO ] Flow matrix only has 49 transitions (discarded 4 similar events)
// Phase 1: matrix 49 rows 58 cols
[2025-06-01 18:47:55] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-01 18:47:55] [INFO ] Flow matrix only has 49 transitions (discarded 4 similar events)
[2025-06-01 18:47:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 18:47:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2025-06-01 18:47:55] [INFO ] Flow matrix only has 49 transitions (discarded 4 similar events)
[2025-06-01 18:47:55] [INFO ] Invariant cache hit.
[2025-06-01 18:47:55] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 3/58 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:55] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 49/107 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:56] [INFO ] Deduced a trap composed of 5 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:47:56] [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:47:56] [INFO ] Deduced a trap composed of 5 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:47:56] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:56] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:56] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:56] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:47:56] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 86 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1774 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 3/58 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 49/107 variables, 58/82 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 50/136 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (OVERLAPS) 0/107 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 136 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3503ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 3504ms
Starting structural reductions in LTL mode, iteration 1 : 58/61 places, 53/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3608 ms. Remains : 58/61 places, 53/56 transitions.
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 8 ms
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 4 ms
[2025-06-01 18:47:59] [INFO ] Input system was already deterministic with 53 transitions.
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16689263299328144840.gal : 1 ms
[2025-06-01 18:47:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11861713628031641044.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16689263299328144840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11861713628031641044.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,974325,0.037436,5444,2,743,5,8359,6,0,273,7627,0


Converting to forward existential form...Done !
original formula: A((((((P_negotiation_3_1_NONE==1)&&(P_startNeg__broadcasting_3_1==1))||((P_negotiation_2_1_NONE==1)&&(P_startNeg__broadcasting_2_1==1)))|...3800
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((EG((((((((P_negotiation_2_3_CO==1)&&(P_network_2_1_AI_0==1))&&(P_poll__handlingMessage_...14482
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t45, t47, t49, Intersection w...238
(forward)formula 0,1,0.555091,26892,1,0,215,135664,141,66,2020,127288,208
FORMULA NeoElection-PT-3-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 53 transition count 42
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 53 transition count 42
Applied a total of 16 rules in 5 ms. Remains 53 /61 variables (removed 8) and now considering 42/56 (removed 14) transitions.
[2025-06-01 18:47:59] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
// Phase 1: matrix 38 rows 53 cols
[2025-06-01 18:47:59] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:59] [INFO ] Implicit Places using invariants in 48 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 49 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/61 places, 42/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 44/61 places, 42/56 transitions.
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:59] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9154832385330341547.gal : 1 ms
[2025-06-01 18:47:59] [INFO ] Time to serialize properties into /tmp/CTLFireability18211555816839336972.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9154832385330341547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18211555816839336972.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,391638,0.037332,5228,2,746,5,6945,6,0,212,6735,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.037931,5228,1,0,6,6945,7,1,286,6735,1
FORMULA NeoElection-PT-3-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 53 transition count 42
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 53 transition count 42
Applied a total of 16 rules in 5 ms. Remains 53 /61 variables (removed 8) and now considering 42/56 (removed 14) transitions.
[2025-06-01 18:47:59] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
[2025-06-01 18:47:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:59] [INFO ] Implicit Places using invariants in 44 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 46 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/61 places, 42/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 44/61 places, 42/56 transitions.
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:59] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 1 ms
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2960892453668686089.gal : 1 ms
[2025-06-01 18:47:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16583544641127211776.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2960892453668686089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16583544641127211776.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,391638,0.030849,5224,2,746,5,6945,6,0,212,6735,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.03134,5224,1,0,6,6945,7,1,286,6735,1
FORMULA NeoElection-PT-3-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 53 transition count 42
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 53 transition count 42
Applied a total of 16 rules in 5 ms. Remains 53 /61 variables (removed 8) and now considering 42/56 (removed 14) transitions.
[2025-06-01 18:47:59] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
[2025-06-01 18:47:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:47:59] [INFO ] Implicit Places using invariants in 50 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 53 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/61 places, 42/56 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 44/61 places, 42/56 transitions.
[2025-06-01 18:47:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 3 ms
FORMULA NeoElection-PT-3-CTLFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 2 ms
[2025-06-01 18:47:59] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 3 ms
[2025-06-01 18:47:59] [INFO ] Flatten gal took : 3 ms
Total runtime 21388 ms.

BK_STOP 1748803679953

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -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-3"
export BK_EXAMINATION="CTLFireability"
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-3, examination is CTLFireability"
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-174876811900106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-3.tgz
mv NeoElection-PT-3 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;