Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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 29K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 277K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 209K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K 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 332K 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-2-LTLCardinality-00
FORMULA_NAME NeoElection-PT-2-LTLCardinality-01
FORMULA_NAME NeoElection-PT-2-LTLCardinality-02
FORMULA_NAME NeoElection-PT-2-LTLCardinality-03
FORMULA_NAME NeoElection-PT-2-LTLCardinality-04
FORMULA_NAME NeoElection-PT-2-LTLCardinality-05
FORMULA_NAME NeoElection-PT-2-LTLCardinality-06
FORMULA_NAME NeoElection-PT-2-LTLCardinality-07
FORMULA_NAME NeoElection-PT-2-LTLCardinality-08
FORMULA_NAME NeoElection-PT-2-LTLCardinality-09
FORMULA_NAME NeoElection-PT-2-LTLCardinality-10
FORMULA_NAME NeoElection-PT-2-LTLCardinality-11
FORMULA_NAME NeoElection-PT-2-LTLCardinality-12
FORMULA_NAME NeoElection-PT-2-LTLCardinality-13
FORMULA_NAME NeoElection-PT-2-LTLCardinality-14
FORMULA_NAME NeoElection-PT-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748803538775

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-PT-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 18:45:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 18:45:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 18:45:40] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2025-06-01 18:45:40] [INFO ] Transformed 438 places.
[2025-06-01 18:45:40] [INFO ] Transformed 357 transitions.
[2025-06-01 18:45:40] [INFO ] Found NUPN structural information;
[2025-06-01 18:45:40] [INFO ] Completing missing partition info from NUPN : creating a component with [P_crashed_0, P_crashed_1, P_crashed_2, P_dead_0, P_dead_1, P_dead_2, P_electedPrimary_0, P_electedPrimary_1, P_electedPrimary_2, P_electedSecondary_0, P_electedSecondary_1, P_electedSecondary_2, P_electionFailed_0, P_electionFailed_1, P_electionFailed_2, P_electionInit_0, P_electionInit_1, P_electionInit_2, P_masterList_0_1_0, P_masterList_0_1_1, P_masterList_0_1_2, P_masterList_0_2_0, P_masterList_0_2_1, P_masterList_0_2_2, P_masterList_1_1_0, P_masterList_1_1_1, P_masterList_1_1_2, P_masterList_1_2_0, P_masterList_1_2_1, P_masterList_1_2_2, P_masterList_2_1_0, P_masterList_2_1_1, P_masterList_2_1_2, P_masterList_2_2_0, P_masterList_2_2_1, P_masterList_2_2_2, P_masterState_0_F_0, P_masterState_0_F_1, P_masterState_0_F_2, P_masterState_0_T_0, P_masterState_0_T_1, P_masterState_0_T_2, P_masterState_1_F_0, P_masterState_1_F_1, P_masterState_1_F_2, P_masterState_1_T_0, P_masterState_1_T_1, P_masterState_1_T_2, P_masterState_2_F_0, P_masterState_2_F_1, P_masterState_2_F_2, P_masterState_2_T_0, P_masterState_2_T_1, P_masterState_2_T_2, P_negotiation_0_0_NONE, P_negotiation_0_0_CO, P_negotiation_0_0_DONE, P_negotiation_0_1_NONE, P_negotiation_0_1_CO, P_negotiation_0_1_DONE, P_negotiation_0_2_NONE, P_negotiation_0_2_CO, P_negotiation_0_2_DONE, P_negotiation_1_0_NONE, P_negotiation_1_0_CO, P_negotiation_1_0_DONE, P_negotiation_1_1_NONE, P_negotiation_1_1_CO, P_negotiation_1_1_DONE, P_negotiation_1_2_NONE, P_negotiation_1_2_CO, P_negotiation_1_2_DONE, P_negotiation_2_0_NONE, P_negotiation_2_0_CO, P_negotiation_2_0_DONE, P_negotiation_2_1_NONE, P_negotiation_2_1_CO, P_negotiation_2_1_DONE, P_negotiation_2_2_NONE, P_negotiation_2_2_CO, P_negotiation_2_2_DONE, P_network_0_0_AskP_0, P_network_0_0_AskP_1, P_network_0_0_AskP_2, P_network_0_0_AnsP_0, P_network_0_0_AnsP_1, P_network_0_0_AnsP_2, P_network_0_0_RI_0, P_network_0_0_RI_1, P_network_0_0_RI_2, P_network_0_0_AI_0, P_network_0_0_AI_1, P_network_0_0_AI_2, P_network_0_0_AnnP_0, P_network_0_0_AnnP_1, P_network_0_0_AnnP_2, P_network_0_0_RP_0, P_network_0_0_RP_1, P_network_0_0_RP_2, P_network_0_1_AskP_0, P_network_0_1_AskP_1, P_network_0_1_AskP_2, P_network_0_1_AnsP_0, P_network_0_1_AnsP_1, P_network_0_1_AnsP_2, P_network_0_1_RI_0, P_network_0_1_RI_1, P_network_0_1_RI_2, P_network_0_1_AI_0, P_network_0_1_AI_1, P_network_0_1_AI_2, P_network_0_1_AnnP_0, P_network_0_1_AnnP_1, P_network_0_1_AnnP_2, P_network_0_1_RP_0, P_network_0_1_RP_1, P_network_0_1_RP_2, P_network_0_2_AskP_0, P_network_0_2_AskP_1, P_network_0_2_AskP_2, P_network_0_2_AnsP_0, P_network_0_2_AnsP_1, P_network_0_2_AnsP_2, P_network_0_2_RI_0, P_network_0_2_RI_1, P_network_0_2_RI_2, P_network_0_2_AI_0, P_network_0_2_AI_1, P_network_0_2_AI_2, P_network_0_2_AnnP_0, P_network_0_2_AnnP_1, P_network_0_2_AnnP_2, P_network_0_2_RP_0, P_network_0_2_RP_1, P_network_0_2_RP_2, P_network_1_0_AskP_0, P_network_1_0_AskP_1, P_network_1_0_AskP_2, P_network_1_0_AnsP_0, P_network_1_0_AnsP_1, P_network_1_0_AnsP_2, P_network_1_0_RI_0, P_network_1_0_RI_1, P_network_1_0_RI_2, P_network_1_0_AI_0, P_network_1_0_AI_1, P_network_1_0_AI_2, P_network_1_0_AnnP_0, P_network_1_0_AnnP_1, P_network_1_0_AnnP_2, P_network_1_0_RP_0, P_network_1_0_RP_1, P_network_1_0_RP_2, P_network_1_1_AskP_0, P_network_1_1_AskP_1, P_network_1_1_AskP_2, P_network_1_1_AnsP_0, P_network_1_1_AnsP_1, P_network_1_1_AnsP_2, P_network_1_1_RI_0, P_network_1_1_RI_1, P_network_1_1_RI_2, P_network_1_1_AI_0, P_network_1_1_AI_1, P_network_1_1_AI_2, P_network_1_1_AnnP_0, P_network_1_1_AnnP_1, P_network_1_1_AnnP_2, P_network_1_1_RP_0, P_network_1_1_RP_1, P_network_1_1_RP_2, P_network_1_2_AskP_0, P_network_1_2_AskP_1, P_network_1_2_AskP_2, P_network_1_2_AnsP_0, P_network_1_2_AnsP_1, P_network_1_2_AnsP_2, P_network_1_2_RI_0, P_network_1_2_RI_1, P_network_1_2_RI_2, P_network_1_2_AI_0, P_network_1_2_AI_1, P_network_1_2_AI_2, P_network_1_2_AnnP_0, P_network_1_2_AnnP_1, P_network_1_2_AnnP_2, P_network_1_2_RP_0, P_network_1_2_RP_1, P_network_1_2_RP_2, P_network_2_0_AskP_0, P_network_2_0_AskP_1, P_network_2_0_AskP_2, P_network_2_0_AnsP_0, P_network_2_0_AnsP_1, P_network_2_0_AnsP_2, P_network_2_0_RI_0, P_network_2_0_RI_1, P_network_2_0_RI_2, P_network_2_0_AI_0, P_network_2_0_AI_1, P_network_2_0_AI_2, P_network_2_0_AnnP_0, P_network_2_0_AnnP_1, P_network_2_0_AnnP_2, P_network_2_0_RP_0, P_network_2_0_RP_1, P_network_2_0_RP_2, P_network_2_1_AskP_0, P_network_2_1_AskP_1, P_network_2_1_AskP_2, P_network_2_1_AnsP_0, P_network_2_1_AnsP_1, P_network_2_1_AnsP_2, P_network_2_1_RI_0, P_network_2_1_RI_1, P_network_2_1_RI_2, P_network_2_1_AI_0, P_network_2_1_AI_1, P_network_2_1_AI_2, P_network_2_1_AnnP_0, P_network_2_1_AnnP_1, P_network_2_1_AnnP_2, P_network_2_1_RP_0, P_network_2_1_RP_1, P_network_2_1_RP_2, P_network_2_2_AskP_0, P_network_2_2_AskP_1, P_network_2_2_AskP_2, P_network_2_2_AnsP_0, P_network_2_2_AnsP_1, P_network_2_2_AnsP_2, P_network_2_2_RI_0, P_network_2_2_RI_1, P_network_2_2_RI_2, P_network_2_2_AI_0, P_network_2_2_AI_1, P_network_2_2_AI_2, P_network_2_2_AnnP_0, P_network_2_2_AnnP_1, P_network_2_2_AnnP_2, P_network_2_2_RP_0, P_network_2_2_RP_1, P_network_2_2_RP_2, P_poll__handlingMessage_0, P_poll__handlingMessage_1, P_poll__handlingMessage_2, 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_AnsP_0, P_poll__networl_0_0_AnsP_1, P_poll__networl_0_0_AnsP_2, 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_AI_0, P_poll__networl_0_0_AI_1, P_poll__networl_0_0_AI_2, 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_RP_0, P_poll__networl_0_0_RP_1, P_poll__networl_0_0_RP_2, 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_AnsP_0, P_poll__networl_0_1_AnsP_1, P_poll__networl_0_1_AnsP_2, 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_AI_0, P_poll__networl_0_1_AI_1, P_poll__networl_0_1_AI_2, 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_RP_0, P_poll__networl_0_1_RP_1, P_poll__networl_0_1_RP_2, 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_AnsP_0, P_poll__networl_0_2_AnsP_1, P_poll__networl_0_2_AnsP_2, 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_AI_0, P_poll__networl_0_2_AI_1, P_poll__networl_0_2_AI_2, 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_RP_0, P_poll__networl_0_2_RP_1, P_poll__networl_0_2_RP_2, 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_AnsP_0, P_poll__networl_1_0_AnsP_1, P_poll__networl_1_0_AnsP_2, 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_AI_0, P_poll__networl_1_0_AI_1, P_poll__networl_1_0_AI_2, 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_RP_0, P_poll__networl_1_0_RP_1, P_poll__networl_1_0_RP_2, 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_AnsP_0, P_poll__networl_1_1_AnsP_1, P_poll__networl_1_1_AnsP_2, 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_AI_0, P_poll__networl_1_1_AI_1, P_poll__networl_1_1_AI_2, 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_RP_0, P_poll__networl_1_1_RP_1, P_poll__networl_1_1_RP_2, 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_AnsP_0, P_poll__networl_1_2_AnsP_1, P_poll__networl_1_2_AnsP_2, 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_AI_0, P_poll__networl_1_2_AI_1, P_poll__networl_1_2_AI_2, 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_RP_0, P_poll__networl_1_2_RP_1, P_poll__networl_1_2_RP_2, 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_AnsP_0, P_poll__networl_2_0_AnsP_1, P_poll__networl_2_0_AnsP_2, 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_AI_0, P_poll__networl_2_0_AI_1, P_poll__networl_2_0_AI_2, 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_RP_0, P_poll__networl_2_0_RP_1, P_poll__networl_2_0_RP_2, 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_AnsP_0, P_poll__networl_2_1_AnsP_1, P_poll__networl_2_1_AnsP_2, 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_AI_0, P_poll__networl_2_1_AI_1, P_poll__networl_2_1_AI_2, 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_RP_0, P_poll__networl_2_1_RP_1, P_poll__networl_2_1_RP_2, 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_AnsP_0, P_poll__networl_2_2_AnsP_1, P_poll__networl_2_2_AnsP_2, 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_AI_0, P_poll__networl_2_2_AI_1, P_poll__networl_2_2_AI_2, 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_RP_0, P_poll__networl_2_2_RP_1, P_poll__networl_2_2_RP_2, P_poll__pollEnd_0, P_poll__pollEnd_1, P_poll__pollEnd_2, P_poll__waitingMessage_0, P_poll__waitingMessage_1, P_poll__waitingMessage_2, P_polling_0, P_polling_1, P_polling_2, P_sendAnnPs__broadcasting_0_1, P_sendAnnPs__broadcasting_0_2, P_sendAnnPs__broadcasting_1_1, P_sendAnnPs__broadcasting_1_2, P_sendAnnPs__broadcasting_2_1, P_sendAnnPs__broadcasting_2_2, 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_startNeg__broadcasting_0_1, P_startNeg__broadcasting_0_2, P_startNeg__broadcasting_1_1, P_startNeg__broadcasting_1_2, P_startNeg__broadcasting_2_1, P_startNeg__broadcasting_2_2]
[2025-06-01 18:45:40] [INFO ] Parsed PT model containing 438 places and 357 transitions and 1998 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 403 places in 1 ms
Reduce places removed 405 places and 337 transitions.
Reduce places removed 5 places and 0 transitions.
FORMULA NeoElection-PT-2-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 20
Applied a total of 2 rules in 10 ms. Remains 26 /28 variables (removed 2) and now considering 20/20 (removed 0) transitions.
[2025-06-01 18:45:40] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 26 cols
[2025-06-01 18:45:40] [INFO ] Computed 7 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:45:40] [INFO ] Implicit Places using invariants in 183 ms returned [4, 5, 6, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 217 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/28 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 22/28 places, 20/20 transitions.
Support contains 9 out of 22 places after structural reductions.
[2025-06-01 18:45:40] [INFO ] Flatten gal took : 15 ms
[2025-06-01 18:45:40] [INFO ] Flatten gal took : 5 ms
[2025-06-01 18:45:40] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 40000 steps (1212 resets) in 695 ms. (57 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (478 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
[2025-06-01 18:45:40] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 22 cols
[2025-06-01 18:45:41] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 18:45:41] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 2/41 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Domain max(s): 0/22 constraints, Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 0/22 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
Computed a total of 22 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 2 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 18 transition count 16
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 18 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 16 transition count 14
Applied a total of 6 rules in 11 ms. Remains 16 /22 variables (removed 6) and now considering 14/20 (removed 6) transitions.
[2025-06-01 18:45:41] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 16 cols
[2025-06-01 18:45:41] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:45:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-01 18:45:41] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2025-06-01 18:45:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:45:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 18:45:41] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:45:41] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-01 18:45:41] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2025-06-01 18:45:41] [INFO ] Invariant cache hit.
[2025-06-01 18:45:41] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/29 variables, 16/19 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 20 constraints, problems are : Problem set: 1 solved, 11 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 13/29 variables, 16/19 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 11/31 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/29 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 31 constraints, problems are : Problem set: 1 solved, 11 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 417ms problems are : Problem set: 1 solved, 11 unsolved
Search for dead transitions found 1 dead transitions in 418ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 13/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:45:41] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 540 ms. Remains : 16/22 places, 13/20 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-PT-2-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Computed a total of 16 stabilizing places and 13 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 13
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-2-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-2-LTLCardinality-00 finished in 1070 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(G(p0)))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 5 ms. Remains 20 /22 variables (removed 2) and now considering 18/20 (removed 2) transitions.
[2025-06-01 18:45:42] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 20 cols
[2025-06-01 18:45:42] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:45:42] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-01 18:45:42] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2025-06-01 18:45:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:45:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 18:45:42] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:45:42] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-01 18:45:42] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2025-06-01 18:45:42] [INFO ] Invariant cache hit.
[2025-06-01 18:45:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD8 is UNSAT
At refinement iteration 6 (OVERLAPS) 17/37 variables, 20/43 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 1/44 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:45:42] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 18:45:42] [INFO ] Deduced a trap composed of 6 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:45:42] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 3/47 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/37 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 47 constraints, problems are : Problem set: 1 solved, 15 unsolved in 345 ms.
Refiners :[Domain max(s): 20/20 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 3/26 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 17/37 variables, 20/46 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 1/47 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 15/62 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/37 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 62 constraints, problems are : Problem set: 1 solved, 15 unsolved in 225 ms.
Refiners :[Domain max(s): 20/20 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 578ms problems are : Problem set: 1 solved, 15 unsolved
Search for dead transitions found 1 dead transitions in 578ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 20/22 places, 17/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:45:42] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 674 ms. Remains : 20/22 places, 17/20 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-PT-2-LTLCardinality-02
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA NeoElection-PT-2-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-PT-2-LTLCardinality-02 finished in 719 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(G(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 20 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 16
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 17 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 17 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 17 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 16 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 15 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 13 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 12 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 13 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 10 transition count 9
Applied a total of 17 rules in 9 ms. Remains 10 /22 variables (removed 12) and now considering 9/20 (removed 11) transitions.
[2025-06-01 18:45:42] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 10 cols
[2025-06-01 18:45:42] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:45:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-01 18:45:42] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2025-06-01 18:45:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:45:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 18:45:42] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:45:42] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-01 18:45:42] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2025-06-01 18:45:42] [INFO ] Invariant cache hit.
[2025-06-01 18:45:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/17 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/18 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 13 constraints, problems are : Problem set: 1 solved, 6 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 8/17 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/18 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 19 constraints, problems are : Problem set: 1 solved, 6 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 172ms problems are : Problem set: 1 solved, 6 unsolved
Search for dead transitions found 1 dead transitions in 172ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 8/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:45:43] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 10/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-PT-2-LTLCardinality-11
Product exploration explored 100000 steps with 9090 reset in 162 ms.
Product exploration explored 100000 steps with 9090 reset in 106 ms.
Computed a total of 10 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 8
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, (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 11 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-PT-2-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-PT-2-LTLCardinality-11 finished in 612 ms.
All properties solved by simple procedures.
Total runtime 3527 ms.

BK_STOP 1748803544213

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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-2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876811900099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-2.tgz
mv NeoElection-PT-2 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;