Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 246K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 841K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 384K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 26K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Mar 27 06:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 27 06:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 25 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 25 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.3K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 332K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620940839099

Running Version 0
[2021-05-13 21:20:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 21:20:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 21:20:49] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2021-05-13 21:20:49] [INFO ] Transformed 438 places.
[2021-05-13 21:20:49] [INFO ] Transformed 357 transitions.
[2021-05-13 21:20:49] [INFO ] Found NUPN structural information;
[2021-05-13 21:20:49] [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]
[2021-05-13 21:20:49] [INFO ] Parsed PT model containing 438 places and 357 transitions in 124 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
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-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 28 places. Attempting structural reductions.
Starting structural reductions, 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 9 ms. Remains 26 /28 variables (removed 2) and now considering 20/20 (removed 0) transitions.
[2021-05-13 21:20:49] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 26 cols
[2021-05-13 21:20:49] [INFO ] Computed 7 place invariants in 7 ms
[2021-05-13 21:20:49] [INFO ] Implicit Places using invariants in 78 ms returned []
[2021-05-13 21:20:49] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 26 cols
[2021-05-13 21:20:49] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 21:20:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-13 21:20:49] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2021-05-13 21:20:49] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 26 cols
[2021-05-13 21:20:49] [INFO ] Computed 7 place invariants in 10 ms
[2021-05-13 21:20:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/28 places, 20/20 transitions.
[2021-05-13 21:20:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 21:20:49] [INFO ] Flatten gal took : 31 ms
[2021-05-13 21:20:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-PT-2-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 21:20:49] [INFO ] Flatten gal took : 6 ms
[2021-05-13 21:20:49] [INFO ] Input system was already deterministic with 20 transitions.
FORMULA NeoElection-PT-2-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 29 steps, including 0 resets, run visited all 25 properties in 2 ms. (steps per millisecond=14 )
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 1 place count 24 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 8 place count 20 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 18 transition count 14
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 12 place count 18 transition count 13
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 14 place count 17 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 16 ms. Remains 13 /26 variables (removed 13) and now considering 10/20 (removed 10) transitions.
[2021-05-13 21:20:49] [INFO ] Flatten gal took : 2 ms
[2021-05-13 21:20:49] [INFO ] Flatten gal took : 2 ms
[2021-05-13 21:20:49] [INFO ] Input system was already deterministic with 10 transitions.
[2021-05-13 21:20:49] [INFO ] Flatten gal took : 2 ms
[2021-05-13 21:20:49] [INFO ] Flatten gal took : 2 ms
[2021-05-13 21:20:49] [INFO ] Time to serialize gal into /tmp/CTLFireability5532019360795828935.gal : 1 ms
[2021-05-13 21:20:49] [INFO ] Time to serialize properties into /tmp/CTLFireability4625901214552843569.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5532019360795828935.gal, -t, CGAL, -ctl, /tmp/CTLFireability4625901214552843569.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5532019360795828935.gal -t CGAL -ctl /tmp/CTLFireability4625901214552843569.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,33,0.007608,4308,2,61,5,200,6,0,59,165,0


Converting to forward existential form...Done !
original formula: AF(!(AF((((((P_masterState_1_F_0==1)&&(P_negotiation_1_2_CO==1))&&(P_network_1_2_AI_0==1))&&(P_poll__handlingMessage_1==1))||((((P_masterState_1_T_0==1)&&(P_negotiation_1_2_CO==1))&&(P_network_1_2_AI_0==1))&&(P_poll__handlingMessage_1==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!(EG(!((((((P_masterState_1_F_0==1)&&(P_negotiation_1_2_CO==1))&&(P_network_1_2_AI_0==1))&&(P_poll__handlingMessage_1==1))||((((P_masterState_1_T_0==1)&&(P_negotiation_1_2_CO==1))&&(P_network_1_2_AI_0==1))&&(P_poll__handlingMessage_1==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/8/1/10
dead was empty
(forward)formula 0,1,0.014927,4760,1,0,57,922,39,21,385,986,79
FORMULA NeoElection-PT-2-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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 24 transition count 18
Applied a total of 4 rules in 2 ms. Remains 24 /26 variables (removed 2) and now considering 18/20 (removed 2) transitions.
[2021-05-13 21:20:49] [INFO ] Flatten gal took : 2 ms
[2021-05-13 21:20:49] [INFO ] Flatten gal took : 2 ms
[2021-05-13 21:20:49] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-13 21:20:49] [INFO ] Flatten gal took : 1 ms
[2021-05-13 21:20:49] [INFO ] Flatten gal took : 2 ms
[2021-05-13 21:20:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17887099158503938693.gal : 1 ms
[2021-05-13 21:20:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6062943860356226554.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17887099158503938693.gal, -t, CGAL, -ctl, /tmp/CTLFireability6062943860356226554.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17887099158503938693.gal -t CGAL -ctl /tmp/CTLFireability6062943860356226554.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,125,0.00547,4484,2,124,5,518,6,0,110,400,0


Converting to forward existential form...Done !
original formula: AG(EF(((((E(((P_startNeg__broadcasting_2_2==1)||(P_startNeg__broadcasting_1_2==1)) U (((((((P_negotiation_2_1_NONE==1)&&(P_startNeg__broadcasting_2_1==1))||(P_electionInit_2==1))||((P_network_2_1_RI_0==1)&&(P_poll__handlingMessage_2==1)))||((P_negotiation_1_2_NONE==1)&&(P_startNeg__broadcasting_1_1==1)))||(P_electionInit_1==1))||((P_network_1_2_RI_0==1)&&(P_poll__handlingMessage_1==1)))) + (P_negotiation_2_1_CO==0)) + (P_network_2_1_AI_0==0)) + (P_poll__handlingMessage_2==0)) + (((((((P_negotiation_2_1_CO==0)||(P_network_2_1_AI_0==0))||(P_poll__handlingMessage_2==0))&&((P_network_1_2_RI_0==0)||(P_poll__handlingMessage_1==0)))&&((P_negotiation_2_1_NONE==0)||(P_startNeg__broadcasting_2_1==0)))&&((P_network_2_1_RI_0==0)||(P_poll__handlingMessage_2==0)))&&((P_negotiation_1_2_NONE==0)||(P_startNeg__broadcasting_1_1==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((E(((P_startNeg__broadcasting_2_2==1)||(P_startNeg__broadcasting_1_2==1)) U (((((((P_negotiation_2_1_NONE==1)&&(P_startNeg__broadcasting_2_1==1))||(P_electionInit_2==1))||((P_network_2_1_RI_0==1)&&(P_poll__handlingMessage_2==1)))||((P_negotiation_1_2_NONE==1)&&(P_startNeg__broadcasting_1_1==1)))||(P_electionInit_1==1))||((P_network_1_2_RI_0==1)&&(P_poll__handlingMessage_1==1)))) + (P_negotiation_2_1_CO==0)) + (P_network_2_1_AI_0==0)) + (P_poll__handlingMessage_2==0)) + (((((((P_negotiation_2_1_CO==0)||(P_network_2_1_AI_0==0))||(P_poll__handlingMessage_2==0))&&((P_network_1_2_RI_0==0)||(P_poll__handlingMessage_1==0)))&&((P_negotiation_2_1_NONE==0)||(P_startNeg__broadcasting_2_1==0)))&&((P_network_2_1_RI_0==0)||(P_poll__handlingMessage_2==0)))&&((P_negotiation_1_2_NONE==0)||(P_startNeg__broadcasting_1_1==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/15/2/18
(forward)formula 0,1,0.02351,5452,1,0,56,2637,64,27,731,2254,57
FORMULA NeoElection-PT-2-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2021-05-13 21:20:50] [INFO ] Flatten gal took : 4 ms
[2021-05-13 21:20:50] [INFO ] Flatten gal took : 3 ms
[2021-05-13 21:20:50] [INFO ] Applying decomposition
[2021-05-13 21:20:50] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15550361844594527006.txt, -o, /tmp/graph15550361844594527006.bin, -w, /tmp/graph15550361844594527006.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15550361844594527006.bin, -l, -1, -v, -w, /tmp/graph15550361844594527006.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 21:20:50] [INFO ] Decomposing Gal with order
[2021-05-13 21:20:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 21:20:50] [INFO ] Removed a total of 5 redundant transitions.
[2021-05-13 21:20:50] [INFO ] Flatten gal took : 25 ms
[2021-05-13 21:20:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2021-05-13 21:20:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14839952101858221786.gal : 1 ms
[2021-05-13 21:20:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16076842419441352447.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14839952101858221786.gal, -t, CGAL, -ctl, /tmp/CTLFireability16076842419441352447.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14839952101858221786.gal -t CGAL -ctl /tmp/CTLFireability16076842419441352447.ctl
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,241,0.006388,4440,59,55,235,133,70,253,59,243,0


Converting to forward existential form...Done !
original formula: AF(((((((((((((((((AX(AG(((((((((i0.u0.P_network_2_1_AnsP_0==1)&&(u4.P_poll__handlingMessage_2==1))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||((u4.P_negotiation_2_1_NONE==1)&&(u6.P_startNeg__broadcasting_2_1==1)))||((((u3.P_masterState_1_F_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u3.P_negotiation_1_2_NONE==1)&&(u5.P_startNeg__broadcasting_1_1==1)))||((((u3.P_masterState_1_T_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u1.P_network_1_2_AnsP_0==1)&&(u3.P_poll__handlingMessage_1==1))))) * (u6.P_electionInit_2==0)) * (u3.P_startNeg__broadcasting_1_2==0)) * (u5.P_electionInit_1==0)) * (u4.P_poll__pollEnd_2==0)) * (u3.P_poll__pollEnd_1==0)) * (u4.P_startNeg__broadcasting_2_2==0)) * (((((u3.P_poll__pollEnd_1==1)||(u4.P_poll__pollEnd_2==1))||((u4.P_negotiation_2_1_NONE==1)&&(u6.P_startNeg__broadcasting_2_1==1)))||((u3.P_negotiation_1_2_NONE==1)&&(u5.P_startNeg__broadcasting_1_1==1)))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))) * ((i0.u0.P_network_2_1_AnsP_0==0)||(u4.P_poll__handlingMessage_2==0))) * (((u3.P_masterState_1_T_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0))) * (((u3.P_masterState_1_F_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0))) * (((u4.P_negotiation_2_1_CO==0)||(i0.u2.P_network_2_1_AI_0==0))||(u4.P_poll__handlingMessage_2==0))) * ((u1.P_network_2_1_AskP_0==0)||(u4.P_poll__handlingMessage_2==0))) * ((i0.u2.P_network_1_2_RI_0==0)||(u3.P_poll__handlingMessage_1==0))) * ((u1.P_network_2_1_RI_0==0)||(u4.P_poll__handlingMessage_2==0))) * ((u1.P_network_1_2_AnsP_0==0)||(u3.P_poll__handlingMessage_1==0))) * (E((((((((((u3.P_polling_1==1)||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||(u4.P_poll__pollEnd_2==1))||((i0.u2.P_network_1_2_RI_0==1)&&(u3.P_poll__handlingMessage_1==1)))||((((u3.P_masterState_1_F_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u1.P_network_2_1_RI_0==1)&&(u4.P_poll__handlingMessage_2==1)))||(u3.P_poll__pollEnd_1==1))||((((u3.P_masterState_1_T_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(u4.P_polling_2==1)) U ((((((((((((u6.P_electionInit_2==1)||(u3.P_polling_1==1))||((i0.u0.P_network_2_1_AnsP_0==1)&&(u4.P_poll__handlingMessage_2==1)))||(((u3.P_masterState_1_T_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u3.P_masterState_1_F_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||(u5.P_electionInit_1==1))||((u1.P_network_2_1_AskP_0==1)&&(u4.P_poll__handlingMessage_2==1)))||((((u3.P_masterState_1_F_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((((u3.P_masterState_1_T_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u1.P_network_1_2_AnsP_0==1)&&(u3.P_poll__handlingMessage_1==1)))||(u4.P_polling_2==1))) + ((((u3.P_polling_1==0)&&(u4.P_polling_2==0))&&((i0.u0.P_network_2_1_AnsP_0==0)||(u4.P_poll__handlingMessage_2==0)))&&((u1.P_network_1_2_AnsP_0==0)||(u3.P_poll__handlingMessage_1==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(((((((((((((((((!(EX(!(!(E(TRUE U !(((((((((i0.u0.P_network_2_1_AnsP_0==1)&&(u4.P_poll__handlingMessage_2==1))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||((u4.P_negotiation_2_1_NONE==1)&&(u6.P_startNeg__broadcasting_2_1==1)))||((((u3.P_masterState_1_F_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u3.P_negotiation_1_2_NONE==1)&&(u5.P_startNeg__broadcasting_1_1==1)))||((((u3.P_masterState_1_T_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u1.P_network_1_2_AnsP_0==1)&&(u3.P_poll__handlingMessage_1==1))))))))) * (u6.P_electionInit_2==0)) * (u3.P_startNeg__broadcasting_1_2==0)) * (u5.P_electionInit_1==0)) * (u4.P_poll__pollEnd_2==0)) * (u3.P_poll__pollEnd_1==0)) * (u4.P_startNeg__broadcasting_2_2==0)) * (((((u3.P_poll__pollEnd_1==1)||(u4.P_poll__pollEnd_2==1))||((u4.P_negotiation_2_1_NONE==1)&&(u6.P_startNeg__broadcasting_2_1==1)))||((u3.P_negotiation_1_2_NONE==1)&&(u5.P_startNeg__broadcasting_1_1==1)))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))) * ((i0.u0.P_network_2_1_AnsP_0==0)||(u4.P_poll__handlingMessage_2==0))) * (((u3.P_masterState_1_T_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0))) * (((u3.P_masterState_1_F_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0))) * (((u4.P_negotiation_2_1_CO==0)||(i0.u2.P_network_2_1_AI_0==0))||(u4.P_poll__handlingMessage_2==0))) * ((u1.P_network_2_1_AskP_0==0)||(u4.P_poll__handlingMessage_2==0))) * ((i0.u2.P_network_1_2_RI_0==0)||(u3.P_poll__handlingMessage_1==0))) * ((u1.P_network_2_1_RI_0==0)||(u4.P_poll__handlingMessage_2==0))) * ((u1.P_network_1_2_AnsP_0==0)||(u3.P_poll__handlingMessage_1==0))) * (E((((((((((u3.P_polling_1==1)||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||(u4.P_poll__pollEnd_2==1))||((i0.u2.P_network_1_2_RI_0==1)&&(u3.P_poll__handlingMessage_1==1)))||((((u3.P_masterState_1_F_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u1.P_network_2_1_RI_0==1)&&(u4.P_poll__handlingMessage_2==1)))||(u3.P_poll__pollEnd_1==1))||((((u3.P_masterState_1_T_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(u4.P_polling_2==1)) U ((((((((((((u6.P_electionInit_2==1)||(u3.P_polling_1==1))||((i0.u0.P_network_2_1_AnsP_0==1)&&(u4.P_poll__handlingMessage_2==1)))||(((u3.P_masterState_1_T_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u3.P_masterState_1_F_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||(u5.P_electionInit_1==1))||((u1.P_network_2_1_AskP_0==1)&&(u4.P_poll__handlingMessage_2==1)))||((((u3.P_masterState_1_F_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((((u3.P_masterState_1_T_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u1.P_network_1_2_AnsP_0==1)&&(u3.P_poll__handlingMessage_1==1)))||(u4.P_polling_2==1))) + ((((u3.P_polling_1==0)&&(u4.P_polling_2==0))&&((i0.u0.P_network_2_1_AnsP_0==0)||(u4.P_poll__handlingMessage_2==0)))&&((u1.P_network_1_2_AnsP_0==0)||(u3.P_poll__handlingMessage_1==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, u3.t0, u3.t14, u4.t1, u4.t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/12/5/17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,0.049307,5732,1,0,1887,525,577,2307,305,1323,5612
FORMULA NeoElection-PT-2-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EG((((EX(((((((((u4.P_negotiation_2_1_NONE==1)&&(u6.P_startNeg__broadcasting_2_1==1))||((u1.P_network_2_1_RI_0==1)&&(u4.P_poll__handlingMessage_2==1)))||((u3.P_negotiation_1_2_NONE==1)&&(u5.P_startNeg__broadcasting_1_1==1)))||(u3.P_poll__pollEnd_1==1))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||(u4.P_poll__pollEnd_2==1))||((i0.u2.P_network_1_2_RI_0==1)&&(u3.P_poll__handlingMessage_1==1)))) + !(AG((((u4.P_negotiation_2_1_NONE==1)&&(u6.P_startNeg__broadcasting_2_1==1))||((u3.P_negotiation_1_2_NONE==1)&&(u5.P_startNeg__broadcasting_1_1==1)))))) + ((((((((((u3.P_polling_1==0)&&(u3.P_startNeg__broadcasting_1_2==0))&&(u4.P_poll__pollEnd_2==0))&&((u4.P_negotiation_2_1_NONE==0)||(u6.P_startNeg__broadcasting_2_1==0)))&&((((u3.P_masterState_1_F_0==0)||(u3.P_negotiation_1_2_CO==0))||(u1.P_network_1_2_AI_0==0))||(u3.P_poll__handlingMessage_1==0)))&&((u3.P_negotiation_1_2_NONE==0)||(u5.P_startNeg__broadcasting_1_1==0)))&&(u3.P_poll__pollEnd_1==0))&&(u4.P_startNeg__broadcasting_2_2==0))&&((((u3.P_masterState_1_T_0==0)||(u3.P_negotiation_1_2_CO==0))||(u1.P_network_1_2_AI_0==0))||(u3.P_poll__handlingMessage_1==0)))&&(u4.P_polling_2==0))) * (!(EX((((((((((u3.P_polling_1==1)||(u3.P_startNeg__broadcasting_1_2==1))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||((i0.u2.P_network_1_2_RI_0==1)&&(u3.P_poll__handlingMessage_1==1)))||((((u3.P_masterState_1_F_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u1.P_network_2_1_RI_0==1)&&(u4.P_poll__handlingMessage_2==1)))||(u4.P_startNeg__broadcasting_2_2==1))||((((u3.P_masterState_1_T_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(u4.P_polling_2==1)))) + !(AG((((((((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1))||(u5.P_electionInit_1==1))||(u6.P_electionInit_2==1))||(u3.P_polling_1==1))||(u4.P_polling_2==1))))))))
=> equivalent forward existential formula: [FwdG(Init,(((EX(((((((((u4.P_negotiation_2_1_NONE==1)&&(u6.P_startNeg__broadcasting_2_1==1))||((u1.P_network_2_1_RI_0==1)&&(u4.P_poll__handlingMessage_2==1)))||((u3.P_negotiation_1_2_NONE==1)&&(u5.P_startNeg__broadcasting_1_1==1)))||(u3.P_poll__pollEnd_1==1))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||(u4.P_poll__pollEnd_2==1))||((i0.u2.P_network_1_2_RI_0==1)&&(u3.P_poll__handlingMessage_1==1)))) + !(!(E(TRUE U !((((u4.P_negotiation_2_1_NONE==1)&&(u6.P_startNeg__broadcasting_2_1==1))||((u3.P_negotiation_1_2_NONE==1)&&(u5.P_startNeg__broadcasting_1_1==1)))))))) + ((((((((((u3.P_polling_1==0)&&(u3.P_startNeg__broadcasting_1_2==0))&&(u4.P_poll__pollEnd_2==0))&&((u4.P_negotiation_2_1_NONE==0)||(u6.P_startNeg__broadcasting_2_1==0)))&&((((u3.P_masterState_1_F_0==0)||(u3.P_negotiation_1_2_CO==0))||(u1.P_network_1_2_AI_0==0))||(u3.P_poll__handlingMessage_1==0)))&&((u3.P_negotiation_1_2_NONE==0)||(u5.P_startNeg__broadcasting_1_1==0)))&&(u3.P_poll__pollEnd_1==0))&&(u4.P_startNeg__broadcasting_2_2==0))&&((((u3.P_masterState_1_T_0==0)||(u3.P_negotiation_1_2_CO==0))||(u1.P_network_1_2_AI_0==0))||(u3.P_poll__handlingMessage_1==0)))&&(u4.P_polling_2==0))) * (!(EX((((((((((u3.P_polling_1==1)||(u3.P_startNeg__broadcasting_1_2==1))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||((i0.u2.P_network_1_2_RI_0==1)&&(u3.P_poll__handlingMessage_1==1)))||((((u3.P_masterState_1_F_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u1.P_network_2_1_RI_0==1)&&(u4.P_poll__handlingMessage_2==1)))||(u4.P_startNeg__broadcasting_2_2==1))||((((u3.P_masterState_1_T_0==1)&&(u3.P_negotiation_1_2_CO==1))&&(u1.P_network_1_2_AI_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(u4.P_polling_2==1)))) + !(!(E(TRUE U !((((((((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1))||(u5.P_electionInit_1==1))||(u6.P_electionInit_2==1))||(u3.P_polling_1==1))||(u4.P_polling_2==1)))))))))] = FALSE
(forward)formula 1,0,0.060416,6260,1,0,2166,559,664,2716,323,1438,6452
FORMULA NeoElection-PT-2-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AX(((AX((((((i0.u0.P_network_2_1_AnsP_0==0)||(u4.P_poll__handlingMessage_2==0))&&((i0.u2.P_network_1_2_RI_0==0)||(u3.P_poll__handlingMessage_1==0)))&&((u1.P_network_2_1_RI_0==0)||(u4.P_poll__handlingMessage_2==0)))&&((u1.P_network_1_2_AnsP_0==0)||(u3.P_poll__handlingMessage_1==0)))) * !(EG(((((u4.P_startNeg__broadcasting_2_2==1)||(u3.P_startNeg__broadcasting_1_2==1))||(u4.P_polling_2==1))||(u3.P_polling_1==1))))) * (((u1.P_network_2_1_RI_0==1)&&(u4.P_poll__handlingMessage_2==1))||((i0.u2.P_network_1_2_RI_0==1)&&(u3.P_poll__handlingMessage_1==1))))))
=> equivalent forward existential formula: (([(EY(EY(Init)) * !((((((i0.u0.P_network_2_1_AnsP_0==0)||(u4.P_poll__handlingMessage_2==0))&&((i0.u2.P_network_1_2_RI_0==0)||(u3.P_poll__handlingMessage_1==0)))&&((u1.P_network_2_1_RI_0==0)||(u4.P_poll__handlingMessage_2==0)))&&((u1.P_network_1_2_AnsP_0==0)||(u3.P_poll__handlingMessage_1==0)))))] != FALSE + [FwdG(EY(Init),((((u4.P_startNeg__broadcasting_2_2==1)||(u3.P_startNeg__broadcasting_1_2==1))||(u4.P_polling_2==1))||(u3.P_polling_1==1)))] != FALSE) + [(EY(Init) * !((((u1.P_network_2_1_RI_0==1)&&(u4.P_poll__handlingMessage_2==1))||((i0.u2.P_network_1_2_RI_0==1)&&(u3.P_poll__handlingMessage_1==1)))))] != FALSE)
dead was empty
(forward)formula 2,1,0.063386,6260,1,0,2230,560,677,2787,323,1446,6570
FORMULA NeoElection-PT-2-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AG((!(AX(((((((((((u6.P_electionInit_2==0)&&(((u3.P_masterState_1_T_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0)))&&(u3.P_startNeg__broadcasting_1_2==0))&&(((u3.P_masterState_1_F_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0)))&&(u5.P_electionInit_1==0))&&((u1.P_network_2_1_AskP_0==0)||(u4.P_poll__handlingMessage_2==0)))&&((((u3.P_masterState_1_F_0==0)||(u3.P_negotiation_1_2_CO==0))||(u1.P_network_1_2_AI_0==0))||(u3.P_poll__handlingMessage_1==0)))&&(u4.P_startNeg__broadcasting_2_2==0))&&((((u3.P_masterState_1_T_0==0)||(u3.P_negotiation_1_2_CO==0))||(u1.P_network_1_2_AI_0==0))||(u3.P_poll__handlingMessage_1==0)))||(((((((((((u3.P_masterState_1_T_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0))&&(u3.P_startNeg__broadcasting_1_2==0))&&(((u3.P_masterState_1_F_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0)))&&(u4.P_poll__pollEnd_2==0))&&((u1.P_network_2_1_AskP_0==0)||(u4.P_poll__handlingMessage_2==0)))&&((u4.P_negotiation_2_1_NONE==0)||(u6.P_startNeg__broadcasting_2_1==0)))&&((u3.P_negotiation_1_2_NONE==0)||(u5.P_startNeg__broadcasting_1_1==0)))&&(u3.P_poll__pollEnd_1==0))&&(u4.P_startNeg__broadcasting_2_2==0))))) + AX(AX(((((((u4.P_negotiation_2_1_NONE==0)||(u6.P_startNeg__broadcasting_2_1==0))&&(u6.P_electionInit_2==0))&&((u3.P_negotiation_1_2_NONE==0)||(u5.P_startNeg__broadcasting_1_1==0)))&&(((u4.P_negotiation_2_1_CO==0)||(i0.u2.P_network_2_1_AI_0==0))||(u4.P_poll__handlingMessage_2==0)))&&(u5.P_electionInit_1==0)))))) + EG(E(AG((((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1))) U A(AX((((((((((u6.P_electionInit_2==1)||(u3.P_polling_1==1))||(((u3.P_masterState_1_T_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u3.P_masterState_1_F_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(u5.P_electionInit_1==1))||(u4.P_poll__pollEnd_2==1))||((u1.P_network_2_1_AskP_0==1)&&(u4.P_poll__handlingMessage_2==1)))||(u3.P_poll__pollEnd_1==1))||(u4.P_polling_2==1))) U ((((((((((u6.P_electionInit_2==1)||(u3.P_poll__pollEnd_1==1))||(u4.P_startNeg__broadcasting_2_2==1))||(u3.P_startNeg__broadcasting_1_2==1))||(u5.P_electionInit_1==1))||(u4.P_poll__pollEnd_2==1))||(((u3.P_masterState_1_T_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u3.P_masterState_1_F_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||((u1.P_network_2_1_AskP_0==1)&&(u4.P_poll__handlingMessage_2==1)))))))
=> equivalent forward existential formula: [(EY(EY((FwdU((Init * !(EG(E(!(E(TRUE U !((((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1))))) U !((E(!(((((((((((u6.P_electionInit_2==1)||(u3.P_poll__pollEnd_1==1))||(u4.P_startNeg__broadcasting_2_2==1))||(u3.P_startNeg__broadcasting_1_2==1))||(u5.P_electionInit_1==1))||(u4.P_poll__pollEnd_2==1))||(((u3.P_masterState_1_T_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u3.P_masterState_1_F_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||((u1.P_network_2_1_AskP_0==1)&&(u4.P_poll__handlingMessage_2==1)))) U (!(!(EX(!((((((((((u6.P_electionInit_2==1)||(u3.P_polling_1==1))||(((u3.P_masterState_1_T_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u3.P_masterState_1_F_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(u5.P_electionInit_1==1))||(u4.P_poll__pollEnd_2==1))||((u1.P_network_2_1_AskP_0==1)&&(u4.P_poll__handlingMessage_2==1)))||(u3.P_poll__pollEnd_1==1))||(u4.P_polling_2==1)))))) * !(((((((((((u6.P_electionInit_2==1)||(u3.P_poll__pollEnd_1==1))||(u4.P_startNeg__broadcasting_2_2==1))||(u3.P_startNeg__broadcasting_1_2==1))||(u5.P_electionInit_1==1))||(u4.P_poll__pollEnd_2==1))||(((u3.P_masterState_1_T_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u3.P_masterState_1_F_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||((u1.P_network_2_1_AskP_0==1)&&(u4.P_poll__handlingMessage_2==1)))))) + EG(!(((((((((((u6.P_electionInit_2==1)||(u3.P_poll__pollEnd_1==1))||(u4.P_startNeg__broadcasting_2_2==1))||(u3.P_startNeg__broadcasting_1_2==1))||(u5.P_electionInit_1==1))||(u4.P_poll__pollEnd_2==1))||(((u3.P_masterState_1_T_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u3.P_masterState_1_F_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||(((u4.P_negotiation_2_1_CO==1)&&(i0.u2.P_network_2_1_AI_0==1))&&(u4.P_poll__handlingMessage_2==1)))||((u1.P_network_2_1_AskP_0==1)&&(u4.P_poll__handlingMessage_2==1))))))))))),TRUE) * !(!(!(EX(!(((((((((((u6.P_electionInit_2==0)&&(((u3.P_masterState_1_T_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0)))&&(u3.P_startNeg__broadcasting_1_2==0))&&(((u3.P_masterState_1_F_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0)))&&(u5.P_electionInit_1==0))&&((u1.P_network_2_1_AskP_0==0)||(u4.P_poll__handlingMessage_2==0)))&&((((u3.P_masterState_1_F_0==0)||(u3.P_negotiation_1_2_CO==0))||(u1.P_network_1_2_AI_0==0))||(u3.P_poll__handlingMessage_1==0)))&&(u4.P_startNeg__broadcasting_2_2==0))&&((((u3.P_masterState_1_T_0==0)||(u3.P_negotiation_1_2_CO==0))||(u1.P_network_1_2_AI_0==0))||(u3.P_poll__handlingMessage_1==0)))||(((((((((((u3.P_masterState_1_T_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0))&&(u3.P_startNeg__broadcasting_1_2==0))&&(((u3.P_masterState_1_F_0==0)||(i0.u0.P_network_1_2_AskP_0==0))||(u3.P_poll__handlingMessage_1==0)))&&(u4.P_poll__pollEnd_2==0))&&((u1.P_network_2_1_AskP_0==0)||(u4.P_poll__handlingMessage_2==0)))&&((u4.P_negotiation_2_1_NONE==0)||(u6.P_startNeg__broadcasting_2_1==0)))&&((u3.P_negotiation_1_2_NONE==0)||(u5.P_startNeg__broadcasting_1_1==0)))&&(u3.P_poll__pollEnd_1==0))&&(u4.P_startNeg__broadcasting_2_2==0))))))))))) * !(((((((u4.P_negotiation_2_1_NONE==0)||(u6.P_startNeg__broadcasting_2_1==0))&&(u6.P_electionInit_2==0))&&((u3.P_negotiation_1_2_NONE==0)||(u5.P_startNeg__broadcasting_1_1==0)))&&(((u4.P_negotiation_2_1_CO==0)||(i0.u2.P_network_2_1_AI_0==0))||(u4.P_poll__handlingMessage_2==0)))&&(u5.P_electionInit_1==0))))] = FALSE
(forward)formula 3,0,0.082306,6524,1,0,2783,590,770,3424,326,1509,8255
FORMULA NeoElection-PT-2-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((((((u3.P_masterState_1_T_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1))||(((u3.P_masterState_1_F_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u1.P_network_2_1_AskP_0==1)&&(u4.P_poll__handlingMessage_2==1))))
=> equivalent forward existential formula: [(EY(Init) * (((((u3.P_masterState_1_T_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1))||(((u3.P_masterState_1_F_0==1)&&(i0.u0.P_network_1_2_AskP_0==1))&&(u3.P_poll__handlingMessage_1==1)))||((u1.P_network_2_1_AskP_0==1)&&(u4.P_poll__handlingMessage_2==1))))] != FALSE
(forward)formula 4,0,0.083388,6524,1,0,2791,590,772,3427,326,1509,8283
FORMULA NeoElection-PT-2-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (A(((u3.P_startNeg__broadcasting_1_2==1) + EG(((u3.P_negotiation_1_2_NONE==1)&&(u5.P_startNeg__broadcasting_1_1==1)))) U AX(FALSE)) * AX(AX(FALSE)))
=> equivalent forward existential formula: (([(EY((FwdU(Init,!(!(EX(!(FALSE))))) * !(((u3.P_startNeg__broadcasting_1_2==1) + EG(((u3.P_negotiation_1_2_NONE==1)&&(u5.P_startNeg__broadcasting_1_1==1))))))) * !(FALSE))] = FALSE * [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE) * [(EY(EY(Init)) * !(FALSE))] = FALSE)
(forward)formula 5,0,0.083453,6524,1,0,2791,590,772,3435,326,1509,8283
FORMULA NeoElection-PT-2-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 6,0,0.083483,6524,1,0,2791,590,772,3436,326,1509,8283
FORMULA NeoElection-PT-2-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1620940856494

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NeoElection-PT-2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127400170"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;