Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r266-smll-167863540600170.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
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 r266-smll-167863540600170
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 75K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 283K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 38K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 158K Feb 26 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 96K Feb 26 15:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 343K Feb 26 15:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 55K Feb 26 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 223K Feb 26 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 332K Mar 5 18:23 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 1678852239695

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-PT-2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 03:50:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 03:50:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 03:50:42] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-03-15 03:50:42] [INFO ] Transformed 438 places.
[2023-03-15 03:50:42] [INFO ] Transformed 357 transitions.
[2023-03-15 03:50:42] [INFO ] Found NUPN structural information;
[2023-03-15 03:50:42] [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]
[2023-03-15 03:50:42] [INFO ] Parsed PT model containing 438 places and 357 transitions and 1998 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 43 ms.
Deduced a syphon composed of 403 places in 3 ms
Reduce places removed 405 places and 337 transitions.
Reduce places removed 5 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-PT-2-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 22 ms. Remains 26 /28 variables (removed 2) and now considering 20/20 (removed 0) transitions.
[2023-03-15 03:50:43] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 26 cols
[2023-03-15 03:50:43] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-15 03:50:43] [INFO ] Implicit Places using invariants in 331 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 388 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 412 ms. Remains : 25/28 places, 20/20 transitions.
Support contains 22 out of 25 places after structural reductions.
[2023-03-15 03:50:43] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 35 ms
[2023-03-15 03:50:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-PT-2-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-PT-2-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 8 ms
[2023-03-15 03:50:43] [INFO ] Input system was already deterministic with 20 transitions.
Support contains 20 out of 25 places (down from 22) after GAL structural reductions.
Finished random walk after 27 steps, including 0 resets, run visited all 8 properties in 24 ms. (steps per millisecond=1 )
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 6 ms
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 7 ms
[2023-03-15 03:50:43] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 25 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 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).
AF dead knowledge conclusive for 1 formulas.
FORMULA NeoElection-PT-2-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 20/20 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 23 transition count 18
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 23 transition count 18
Applied a total of 4 rules in 3 ms. Remains 23 /25 variables (removed 2) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 23/25 places, 18/20 transitions.
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 4 ms
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 4 ms
[2023-03-15 03:50:43] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 25/25 places, 20/20 transitions.
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 4 ms
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 4 ms
[2023-03-15 03:50:43] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 20/20 transitions.
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 21 transition count 16
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 19 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 17 transition count 14
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 17 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 10 place count 17 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 12 place count 16 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 15 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 14 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 14 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 13 transition count 11
Applied a total of 16 rules in 14 ms. Remains 13 /25 variables (removed 12) and now considering 11/20 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 13/25 places, 11/20 transitions.
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 2 ms
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 1 ms
[2023-03-15 03:50:43] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 20/20 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 23 transition count 18
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 23 transition count 18
Applied a total of 4 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/25 places, 18/20 transitions.
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 3 ms
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 13 ms
[2023-03-15 03:50:43] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 4 ms
[2023-03-15 03:50:43] [INFO ] Flatten gal took : 3 ms
[2023-03-15 03:50:43] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-15 03:50:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 20 transitions and 71 arcs took 1 ms.
Total runtime 1470 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 25 NrTr: 20 NrArc: 71)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 3.668sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 208 (2.1e+02) #states 241



starting MCC model checker
--------------------------

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA NeoElection-PT-2-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: AF [EG [[[p6<=0 & 0<=p6] | [[p14<=0 & 0<=p14] | [p16<=0 & 0<=p16]]]]]
normalized: ~ [EG [~ [EG [[[[p14<=0 & 0<=p14] | [p16<=0 & 0<=p16]] | [p6<=0 & 0<=p6]]]]]]

abstracting: (0<=p6)
states: 241
abstracting: (p6<=0)
states: 55
abstracting: (0<=p16)
states: 241
abstracting: (p16<=0)
states: 164
abstracting: (0<=p14)
states: 241
abstracting: (p14<=0)
states: 196
..............................
EG iterations: 30
...............................
EG iterations: 31
-> the formula is TRUE

FORMULA NeoElection-PT-2-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: A [~ [[AF [~ [[[p6<=1 & 1<=p6] & [[p14<=1 & 1<=p14] & [p16<=1 & 1<=p16]]]]] & E [~ [AG [[[p24<=1 & 1<=p24] | [p22<=1 & 1<=p22]]]] U [[p18<=1 & 1<=p18] | [p17<=1 & 1<=p17]]]]] U EG [AX [AF [[[[p5<=1 & 1<=p5] & [p23<=1 & 1<=p23]] | [[p4<=1 & 1<=p4] & [p21<=1 & 1<=p21]]]]]]]
normalized: [~ [EG [~ [EG [~ [EX [EG [~ [[[[p21<=1 & 1<=p21] & [p4<=1 & 1<=p4]] | [[p23<=1 & 1<=p23] & [p5<=1 & 1<=p5]]]]]]]]]]] & ~ [E [~ [EG [~ [EX [EG [~ [[[[p21<=1 & 1<=p21] & [p4<=1 & 1<=p4]] | [[p23<=1 & 1<=p23] & [p5<=1 & 1<=p5]]]]]]]]] U [[E [E [true U ~ [[[p22<=1 & 1<=p22] | [p24<=1 & 1<=p24]]]] U [[p17<=1 & 1<=p17] | [p18<=1 & 1<=p18]]] & ~ [EG [[[[p16<=1 & 1<=p16] & [p14<=1 & 1<=p14]] & [p6<=1 & 1<=p6]]]]] & ~ [EG [~ [EX [EG [~ [[[[p21<=1 & 1<=p21] & [p4<=1 & 1<=p4]] | [[p23<=1 & 1<=p23] & [p5<=1 & 1<=p5]]]]]]]]]]]]]

abstracting: (1<=p5)
states: 10
abstracting: (p5<=1)
states: 241
abstracting: (1<=p23)
states: 5
abstracting: (p23<=1)
states: 241
abstracting: (1<=p4)
states: 10
abstracting: (p4<=1)
states: 241
abstracting: (1<=p21)
states: 5
abstracting: (p21<=1)
states: 241
....
EG iterations: 4
.......
EG iterations: 6
abstracting: (1<=p6)
states: 186
abstracting: (p6<=1)
states: 241
abstracting: (1<=p14)
states: 45
abstracting: (p14<=1)
states: 241
abstracting: (1<=p16)
states: 77
abstracting: (p16<=1)
states: 241
.......
EG iterations: 7
abstracting: (1<=p18)
states: 69
abstracting: (p18<=1)
states: 241
abstracting: (1<=p17)
states: 69
abstracting: (p17<=1)
states: 241
abstracting: (1<=p24)
states: 8
abstracting: (p24<=1)
states: 241
abstracting: (1<=p22)
states: 8
abstracting: (p22<=1)
states: 241
abstracting: (1<=p5)
states: 10
abstracting: (p5<=1)
states: 241
abstracting: (1<=p23)
states: 5
abstracting: (p23<=1)
states: 241
abstracting: (1<=p4)
states: 10
abstracting: (p4<=1)
states: 241
abstracting: (1<=p21)
states: 5
abstracting: (p21<=1)
states: 241
....
EG iterations: 4
.......
EG iterations: 6
abstracting: (1<=p5)
states: 10
abstracting: (p5<=1)
states: 241
abstracting: (1<=p23)
states: 5
abstracting: (p23<=1)
states: 241
abstracting: (1<=p4)
states: 10
abstracting: (p4<=1)
states: 241
abstracting: (1<=p21)
states: 5
abstracting: (p21<=1)
states: 241
....
EG iterations: 4
.......
EG iterations: 6
.................................
EG iterations: 33
-> the formula is FALSE

FORMULA NeoElection-PT-2-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AX [[[[AF [[[[0<=p3 & p3<=0] | [[p7<=0 & 0<=p7] | [p15<=0 & 0<=p15]]] & [[[p2<=0 & 0<=p2] | [[p7<=0 & 0<=p7] | [p15<=0 & 0<=p15]]] & [[p11<=0 & 0<=p11] | [p16<=0 & 0<=p16]]]]] | [p0<=1 & 1<=p0]] | [[p1<=1 & 1<=p1] | [[p20<=1 & 1<=p20] | [p19<=1 & 1<=p19]]]] | [[EX [0<=0] | EF [[[[p5<=0 & 0<=p5] | [p23<=0 & 0<=p23]] & [[p4<=0 & 0<=p4] | [p21<=0 & 0<=p21]]]]] | [[[p3<=1 & 1<=p3] & [[p7<=1 & 1<=p7] & [p15<=1 & 1<=p15]]] | [[[p2<=1 & 1<=p2] & [[p7<=1 & 1<=p7] & [p15<=1 & 1<=p15]]] | [[p11<=1 & 1<=p11] & [p16<=1 & 1<=p16]]]]]]]
normalized: ~ [EX [~ [[[[[[[p16<=1 & 1<=p16] & [p11<=1 & 1<=p11]] | [[[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]] & [p2<=1 & 1<=p2]]] | [[[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]] & [p3<=1 & 1<=p3]]] | [E [true U [[[p21<=0 & 0<=p21] | [p4<=0 & 0<=p4]] & [[p23<=0 & 0<=p23] | [p5<=0 & 0<=p5]]]] | EX [0<=0]]] | [[[[p19<=1 & 1<=p19] | [p20<=1 & 1<=p20]] | [p1<=1 & 1<=p1]] | [[p0<=1 & 1<=p0] | ~ [EG [~ [[[[[p16<=0 & 0<=p16] | [p11<=0 & 0<=p11]] & [[[p15<=0 & 0<=p15] | [p7<=0 & 0<=p7]] | [p2<=0 & 0<=p2]]] & [[[p15<=0 & 0<=p15] | [p7<=0 & 0<=p7]] | [0<=p3 & p3<=0]]]]]]]]]]]]

abstracting: (p3<=0)
states: 45
abstracting: (0<=p3)
states: 241
abstracting: (0<=p7)
states: 241
abstracting: (p7<=0)
states: 190
abstracting: (0<=p15)
states: 241
abstracting: (p15<=0)
states: 164
abstracting: (0<=p2)
states: 241
abstracting: (p2<=0)
states: 196
abstracting: (0<=p7)
states: 241
abstracting: (p7<=0)
states: 190
abstracting: (0<=p15)
states: 241
abstracting: (p15<=0)
states: 164
abstracting: (0<=p11)
states: 241
abstracting: (p11<=0)
states: 190
abstracting: (0<=p16)
states: 241
abstracting: (p16<=0)
states: 164
.......
EG iterations: 7
abstracting: (1<=p0)
states: 5
abstracting: (p0<=1)
states: 241
abstracting: (1<=p1)
states: 5
abstracting: (p1<=1)
states: 241
abstracting: (1<=p20)
states: 77
abstracting: (p20<=1)
states: 241
abstracting: (1<=p19)
states: 77
abstracting: (p19<=1)
states: 241
abstracting: (0<=0)
states: 241
.abstracting: (0<=p5)
states: 241
abstracting: (p5<=0)
states: 231
abstracting: (0<=p23)
states: 241
abstracting: (p23<=0)
states: 236
abstracting: (0<=p4)
states: 241
abstracting: (p4<=0)
states: 231
abstracting: (0<=p21)
states: 241
abstracting: (p21<=0)
states: 236
abstracting: (1<=p3)
states: 196
abstracting: (p3<=1)
states: 241
abstracting: (1<=p7)
states: 51
abstracting: (p7<=1)
states: 241
abstracting: (1<=p15)
states: 77
abstracting: (p15<=1)
states: 241
abstracting: (1<=p2)
states: 45
abstracting: (p2<=1)
states: 241
abstracting: (1<=p7)
states: 51
abstracting: (p7<=1)
states: 241
abstracting: (1<=p15)
states: 77
abstracting: (p15<=1)
states: 241
abstracting: (1<=p11)
states: 51
abstracting: (p11<=1)
states: 241
abstracting: (1<=p16)
states: 77
abstracting: (p16<=1)
states: 241
.-> the formula is TRUE

FORMULA NeoElection-PT-2-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

totally nodes used: 17678 (1.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 18563 41498 60061
used/not used/entry size/cache size: 56709 67052155 16 1024MB
basic ops cache: hits/miss/sum: 6064 15155 21219
used/not used/entry size/cache size: 27097 16750119 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 559 1232 1791
used/not used/entry size/cache size: 1232 8387376 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67091294
1 17462
2 108
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.340sec


BK_STOP 1678852250439

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:205 (10), effective:32 (1)

initing FirstDep: 0m 0.000sec


iterations count:24 (1), effective:2 (0)

iterations count:171 (8), effective:24 (1)

iterations count:20 (1), effective:0 (0)

iterations count:27 (1), effective:2 (0)

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="marciexred"
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-5348"
echo " Executing tool marciexred"
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 r266-smll-167863540600170"
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 ;