Execution Chart

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

Trace from the execution

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

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

=== Now, execution of the tool begins

BK_START 1748803717801

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-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 18:48:38] [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:48:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 18:48:39] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2025-06-01 18:48:39] [INFO ] Transformed 972 places.
[2025-06-01 18:48:39] [INFO ] Transformed 1016 transitions.
[2025-06-01 18:48:39] [INFO ] Found NUPN structural information;
[2025-06-01 18:48:39] [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:48:39] [INFO ] Parsed PT model containing 972 places and 1016 transitions and 5840 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
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-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-3-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 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
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 59 transition count 55
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 59 transition count 55
Applied a total of 10 rules in 29 ms. Remains 59 /67 variables (removed 8) and now considering 55/58 (removed 3) transitions.
[2025-06-01 18:48:39] [INFO ] Flow matrix only has 51 transitions (discarded 4 similar events)
// Phase 1: matrix 51 rows 59 cols
[2025-06-01 18:48:39] [INFO ] Computed 14 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:39] [INFO ] Implicit Places using invariants in 150 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/67 places, 55/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 58/67 places, 55/58 transitions.
Support contains 40 out of 58 places after structural reductions.
[2025-06-01 18:48:39] [INFO ] Flatten gal took : 26 ms
[2025-06-01 18:48:39] [INFO ] Flatten gal took : 9 ms
[2025-06-01 18:48:39] [INFO ] Input system was already deterministic with 55 transitions.
RANDOM walk for 142 steps (0 resets) in 16 ms. (8 steps per ms) remains 0/7 properties
Computed a total of 58 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 55
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' '!(X(X(X(G(p0)))))'
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 52 transition count 43
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 52 transition count 43
Applied a total of 12 rules in 3 ms. Remains 52 /58 variables (removed 6) and now considering 43/55 (removed 12) transitions.
[2025-06-01 18:48:40] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 52 cols
[2025-06-01 18:48:40] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:40] [INFO ] Implicit Places using invariants in 96 ms returned [7, 8, 9, 10, 11, 12, 13, 14]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 97 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/58 places, 43/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 44/58 places, 43/55 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-3-LTLFireability-01
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA NeoElection-PT-3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-3-LTLFireability-01 finished in 416 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' '!((G(p0)||G(p1)))'
Support contains 16 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 55/55 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 52 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 52 transition count 51
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 51 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 48 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 47 transition count 47
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 46 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 45 transition count 46
Applied a total of 14 rules in 17 ms. Remains 45 /58 variables (removed 13) and now considering 46/55 (removed 9) transitions.
[2025-06-01 18:48:40] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 45 cols
[2025-06-01 18:48:40] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:40] [INFO ] Implicit Places using invariants in 56 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/58 places, 46/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 92 ms. Remains : 43/58 places, 46/55 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NeoElection-PT-3-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA NeoElection-PT-3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-3-LTLFireability-03 finished in 222 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' '!(F(p0))'
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 55/55 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 52 transition count 52
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 52 transition count 49
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 49 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 46 transition count 46
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 46 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 15 place count 46 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 45 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 44 transition count 44
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 43 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 42 transition count 43
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 109 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 40 transition count 42
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 40 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 36 transition count 38
Applied a total of 30 rules in 19 ms. Remains 36 /58 variables (removed 22) and now considering 38/55 (removed 17) transitions.
[2025-06-01 18:48:40] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
// Phase 1: matrix 34 rows 36 cols
[2025-06-01 18:48:40] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:40] [INFO ] Implicit Places using invariants in 30 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/58 places, 38/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 34/58 places, 38/55 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-PT-3-LTLFireability-04
Product exploration explored 100000 steps with 6716 reset in 346 ms.
Product exploration explored 100000 steps with 6741 reset in 257 ms.
Computed a total of 34 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34 transition count 38
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 (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 56 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2025-06-01 18:48:41] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
// Phase 1: matrix 34 rows 34 cols
[2025-06-01 18:48:41] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:48:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 18:48:41] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-01 18:48:41] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 18:48:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 18:48:41] [INFO ] [Real]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-01 18:48:41] [INFO ] Computed and/alt/rep : 34/106/30 causal constraints (skipped 2 transitions) in 4 ms.
[2025-06-01 18:48:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:48:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 18:48:41] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-01 18:48:41] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 18:48:41] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-01 18:48:41] [INFO ] Computed and/alt/rep : 34/106/30 causal constraints (skipped 2 transitions) in 5 ms.
[2025-06-01 18:48:42] [INFO ] Added : 18 causal constraints over 4 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 13 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 38/38 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2025-06-01 18:48:42] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2025-06-01 18:48:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:42] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-01 18:48:42] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2025-06-01 18:48:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 18:48:42] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:48:42] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2025-06-01 18:48:42] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2025-06-01 18:48:42] [INFO ] Invariant cache hit.
[2025-06-01 18:48:42] [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/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 2/34 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 5 (OVERLAPS) 34/68 variables, 34/40 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 6/46 constraints. Problems are: Problem set: 2 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:42] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:42] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:42] [INFO ] Deduced a trap composed of 4 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:48:42] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 4/50 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/68 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 50 constraints, problems are : Problem set: 2 solved, 34 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 2/34 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 4/10 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 34/68 variables, 34/44 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 6/50 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 34/84 constraints. Problems are: Problem set: 2 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:43] [INFO ] Deduced a trap composed of 3 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:48:43] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 2/86 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/86 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/68 variables, 0/86 constraints. Problems are: Problem set: 2 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 86 constraints, problems are : Problem set: 2 solved, 34 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 34/36 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1905ms problems are : Problem set: 2 solved, 34 unsolved
Search for dead transitions found 2 dead transitions in 1912ms
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 SI_LTL mode, iteration 1 : 34/34 places, 36/38 transitions.
Applied a total of 0 rules in 6 ms. Remains 34 /34 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:48:44] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 2026 ms. Remains : 34/34 places, 36/38 transitions.
Computed a total of 34 stabilizing places and 36 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34 transition count 36
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 (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 65 steps (0 resets) in 8 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2025-06-01 18:48:44] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
// Phase 1: matrix 32 rows 34 cols
[2025-06-01 18:48:44] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:48:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 18:48:44] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-01 18:48:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 18:48:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:48:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 18:48:44] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-01 18:48:44] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-01 18:48:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 18:48:44] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 18:48:44] [INFO ] Computed and/alt/rep : 32/96/28 causal constraints (skipped 2 transitions) in 2 ms.
[2025-06-01 18:48:44] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6685 reset in 276 ms.
Product exploration explored 100000 steps with 6709 reset in 229 ms.
Built C files in :
/tmp/ltsmin14371955717976274356
[2025-06-01 18:48:45] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2025-06-01 18:48:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:48:45] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2025-06-01 18:48:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:48:45] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2025-06-01 18:48:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 18:48:45] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14371955717976274356
Running compilation step : cd /tmp/ltsmin14371955717976274356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 256 ms.
Running link step : cd /tmp/ltsmin14371955717976274356;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14371955717976274356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7654157089818078409.hoa' '--buchi-type=spotba'
LTSmin run took 159 ms.
FORMULA NeoElection-PT-3-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-PT-3-LTLFireability-04 finished in 5027 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(F(p0)))'
Support contains 12 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 52 transition count 43
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 52 transition count 43
Applied a total of 12 rules in 4 ms. Remains 52 /58 variables (removed 6) and now considering 43/55 (removed 12) transitions.
[2025-06-01 18:48:45] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 52 cols
[2025-06-01 18:48:45] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:45] [INFO ] Implicit Places using invariants in 49 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/58 places, 43/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 50/58 places, 43/55 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-3-LTLFireability-05
Product exploration explored 100000 steps with 8307 reset in 158 ms.
Product exploration explored 100000 steps with 8343 reset in 124 ms.
Computed a total of 50 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 43
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 : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-3-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-3-LTLFireability-05 finished in 470 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' '!(G((F(p0)&&F(p1))))'
Support contains 20 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 55/55 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 52 transition count 52
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 52 transition count 49
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 49 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 46 transition count 46
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 46 transition count 46
Applied a total of 15 rules in 10 ms. Remains 46 /58 variables (removed 12) and now considering 46/55 (removed 9) transitions.
[2025-06-01 18:48:46] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 46 cols
[2025-06-01 18:48:46] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:46] [INFO ] Implicit Places using invariants in 36 ms returned [5, 8, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/58 places, 46/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49 ms. Remains : 43/58 places, 46/55 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NeoElection-PT-3-LTLFireability-07
Product exploration explored 100000 steps with 3546 reset in 239 ms.
Product exploration explored 100000 steps with 3539 reset in 273 ms.
Computed a total of 43 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 46
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 : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 110 steps (0 resets) in 7 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-3-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-3-LTLFireability-07 finished in 1059 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(X(F(p0))))'
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 52 transition count 43
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 52 transition count 43
Applied a total of 12 rules in 4 ms. Remains 52 /58 variables (removed 6) and now considering 43/55 (removed 12) transitions.
[2025-06-01 18:48:47] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 52 cols
[2025-06-01 18:48:47] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:47] [INFO ] Implicit Places using invariants in 44 ms returned [7, 8, 9, 10, 11, 12, 13, 14]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 45 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/58 places, 43/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 44/58 places, 43/55 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-PT-3-LTLFireability-11
Product exploration explored 100000 steps with 7624 reset in 78 ms.
Product exploration explored 100000 steps with 7622 reset in 84 ms.
Computed a total of 44 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 43
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 58 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 18:48:48] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 44 cols
[2025-06-01 18:48:48] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:48:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 18:48:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 18:48:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:48:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2025-06-01 18:48:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 18:48:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 18:48:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-01 18:48:48] [INFO ] Computed and/alt/rep : 39/91/35 causal constraints (skipped 1 transitions) in 2 ms.
[2025-06-01 18:48:48] [INFO ] Added : 32 causal constraints over 7 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2025-06-01 18:48:48] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
[2025-06-01 18:48:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:48] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-01 18:48:48] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
[2025-06-01 18:48:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 18:48:48] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-01 18:48:48] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
[2025-06-01 18:48:48] [INFO ] Invariant cache hit.
[2025-06-01 18:48:48] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 3/44 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem TDEAD7 is UNSAT
At refinement iteration 4 (OVERLAPS) 39/83 variables, 44/49 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 2/51 constraints. Problems are: Problem set: 1 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:48] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:48] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:48] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:48] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:48] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 5/56 constraints. Problems are: Problem set: 1 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:49] [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:48:49] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/83 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 58 constraints, problems are : Problem set: 1 solved, 39 unsolved in 1049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 3/44 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 39/83 variables, 44/56 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 39/97 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:50] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/83 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:50] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/83 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/83 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/83 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 99 constraints, problems are : Problem set: 1 solved, 39 unsolved in 1745 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 39/40 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2801ms problems are : Problem set: 1 solved, 39 unsolved
Search for dead transitions found 1 dead transitions in 2802ms
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 : 44/44 places, 42/43 transitions.
Applied a total of 0 rules in 3 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 2903 ms. Remains : 44/44 places, 42/43 transitions.
Computed a total of 44 stabilizing places and 42 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 42
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 54 steps (0 resets) in 8 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 18:48:51] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
// Phase 1: matrix 38 rows 44 cols
[2025-06-01 18:48:51] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:48:51] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-01 18:48:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 18:48:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:48:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 18:48:51] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 18:48:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 18:48:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 18:48:51] [INFO ] Computed and/alt/rep : 39/97/35 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 18:48:52] [INFO ] Added : 33 causal constraints over 7 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7650 reset in 88 ms.
Product exploration explored 100000 steps with 7625 reset in 102 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 42/42 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 44 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 44 transition count 42
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 42 transition count 40
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 42 transition count 40
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 14 rules in 10 ms. Remains 42 /44 variables (removed 2) and now considering 40/42 (removed 2) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:48:52] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2025-06-01 18:48:52] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
// Phase 1: matrix 36 rows 42 cols
[2025-06-01 18:48:52] [INFO ] Computed 6 invariants in 0 ms
[2025-06-01 18:48:52] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 3/42 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:52] [INFO ] Deduced a trap composed of 2 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:48:52] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:48:52] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/9 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 36/78 variables, 42/51 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 15/66 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/66 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/66 constraints. Problems are: Problem set: 8 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 66 constraints, problems are : Problem set: 8 solved, 29 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 11/42 variables, 4/6 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/9 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 36/78 variables, 42/51 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 15/66 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 29/95 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/95 constraints. Problems are: Problem set: 8 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/95 constraints. Problems are: Problem set: 8 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 95 constraints, problems are : Problem set: 8 solved, 29 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 29/37 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1090ms problems are : Problem set: 8 solved, 29 unsolved
Search for dead transitions found 8 dead transitions in 1090ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 42/44 places, 32/42 transitions.
Graph (complete) has 104 edges and 42 vertex of which 34 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 34 /42 variables (removed 8) and now considering 32/32 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/44 places, 32/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1113 ms. Remains : 34/44 places, 32/42 transitions.
Built C files in :
/tmp/ltsmin7849919878799359866
[2025-06-01 18:48:53] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7849919878799359866
Running compilation step : cd /tmp/ltsmin7849919878799359866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin7849919878799359866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7849919878799359866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16909075695772318927.hoa' '--buchi-type=spotba'
LTSmin run took 1452 ms.
FORMULA NeoElection-PT-3-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-PT-3-LTLFireability-11 finished in 8136 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 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 55/55 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 53 transition count 44
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 53 transition count 44
Applied a total of 10 rules in 4 ms. Remains 53 /58 variables (removed 5) and now considering 44/55 (removed 11) transitions.
[2025-06-01 18:48:55] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
// Phase 1: matrix 40 rows 53 cols
[2025-06-01 18:48:55] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:55] [INFO ] Implicit Places using invariants in 49 ms returned [7, 8, 9, 10, 11, 12, 13, 14]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 50 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/58 places, 44/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 45/58 places, 44/55 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : NeoElection-PT-3-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NeoElection-PT-3-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-3-LTLFireability-15 finished in 151 ms.
All properties solved by simple procedures.
Total runtime 16608 ms.

BK_STOP 1748803735907

--------------------
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-3"
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-3, 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-174876812000108"
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 [ "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 ;