Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r245-tall-171654349900442.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is NeoElection-COL-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349900442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 9.0K Apr 11 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:43 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-COL-2-CTLFireability-2024-00
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-01
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-02
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-03
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-04
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-05
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-06
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-07
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-08
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-09
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-10
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-11
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-12
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-13
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-14
FORMULA_NAME NeoElection-COL-2-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716667217129

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 20:00:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 20:00:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:00:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 20:00:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 20:00:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 572 ms
[2024-05-25 20:00:18] [INFO ] Detected 6 constant HL places corresponding to 192 PT places.
[2024-05-25 20:00:18] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 438 PT places and 672.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2024-05-25 20:00:18] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 4 ms.
[2024-05-25 20:00:19] [INFO ] Skeletonized 1 HLPN properties in 1 ms. Removed 15 properties that had guard overlaps.
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Domain [M(3), POS(2), M(3)] of place P_masterList breaks symmetries in sort M
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
Arc [15:1*[$m, (MOD (ADD $i 1) 2)]] contains successor/predecessor on variables of sort POS
[2024-05-25 20:00:19] [INFO ] Unfolded HLPN to a Petri net with 438 places and 295 transitions 1570 arcs in 45 ms.
[2024-05-25 20:00:19] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Deduced a syphon composed of 403 places in 1 ms
Reduce places removed 407 places and 275 transitions.
Reduce places removed 3 places and 0 transitions.
FORMULA NeoElection-COL-2-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 9 ms. Remains 26 /28 variables (removed 2) and now considering 20/20 (removed 0) transitions.
[2024-05-25 20:00:19] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 26 cols
[2024-05-25 20:00:19] [INFO ] Computed 7 invariants in 8 ms
[2024-05-25 20:00:19] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-25 20:00:19] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-25 20:00:19] [INFO ] Invariant cache hit.
[2024-05-25 20:00:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 20:00:19] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 18 sub problems to find dead transitions.
[2024-05-25 20:00:19] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-25 20:00:19] [INFO ] Invariant cache hit.
[2024-05-25 20:00:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 6 (OVERLAPS) 19/45 variables, 26/33 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 1/34 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-25 20:00:19] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 7 ms to minimize.
[2024-05-25 20:00:19] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-25 20:00:19] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 3/37 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 37 constraints, problems are : Problem set: 1 solved, 17 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/26 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 19/45 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 1/37 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 17/54 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-25 20:00:19] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 1/55 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/45 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/45 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 55 constraints, problems are : Problem set: 1 solved, 17 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 4/4 constraints]
After SMT, in 750ms problems are : Problem set: 1 solved, 17 unsolved
Search for dead transitions found 1 dead transitions in 762ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 26/28 places, 19/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1007 ms. Remains : 26/28 places, 19/20 transitions.
Support contains 24 out of 26 places after structural reductions.
[2024-05-25 20:00:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 14 ms
FORMULA NeoElection-COL-2-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 5 ms
[2024-05-25 20:00:20] [INFO ] Input system was already deterministic with 19 transitions.
Support contains 16 out of 26 places (down from 24) after GAL structural reductions.
FORMULA NeoElection-COL-2-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (1212 resets) in 696 ms. (57 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (449 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
[2024-05-25 20:00:20] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 26 cols
[2024-05-25 20:00:20] [INFO ] Computed 8 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 20:00:20] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 19/44 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 45ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
FORMULA NeoElection-COL-2-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 3 ms
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 3 ms
[2024-05-25 20:00:20] [INFO ] Input system was already deterministic with 19 transitions.
Computed a total of 26 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 19
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 2 formulas.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 26/26 places, 19/19 transitions.
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:00:20] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 19/19 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 24 transition count 17
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 17
Applied a total of 4 rules in 3 ms. Remains 24 /26 variables (removed 2) and now considering 17/19 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 24/26 places, 17/19 transitions.
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:00:20] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 26/26 places, 19/19 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 22 transition count 17
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 22 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 20 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 18 transition count 13
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 18 transition count 13
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 18 transition count 12
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 17 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 32 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 13 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 13 transition count 8
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 19 place count 11 transition count 8
Applied a total of 19 rules in 9 ms. Remains 11 /26 variables (removed 15) and now considering 8/19 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 11/26 places, 8/19 transitions.
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:00:20] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 19/19 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 24 transition count 17
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 17
Applied a total of 4 rules in 1 ms. Remains 24 /26 variables (removed 2) and now considering 17/19 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/26 places, 17/19 transitions.
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:00:20] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 19/19 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 24 transition count 17
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 17
Applied a total of 4 rules in 0 ms. Remains 24 /26 variables (removed 2) and now considering 17/19 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 24/26 places, 17/19 transitions.
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:00:20] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 19/19 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 24 transition count 17
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 17
Applied a total of 4 rules in 0 ms. Remains 24 /26 variables (removed 2) and now considering 17/19 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 24/26 places, 17/19 transitions.
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 1 ms
[2024-05-25 20:00:20] [INFO ] Input system was already deterministic with 17 transitions.
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:00:20] [INFO ] Flatten gal took : 2 ms
[2024-05-25 20:00:20] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-25 20:00:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 26 places, 19 transitions and 68 arcs took 1 ms.
Total runtime 2497 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NeoElection-COL-2

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 26
TRANSITIONS: 19
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 549
MODEL NAME: /home/mcc/execution/411/model
26 places, 19 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA NeoElection-COL-2-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NeoElection-COL-2-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NeoElection-COL-2-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NeoElection-COL-2-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NeoElection-COL-2-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA NeoElection-COL-2-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716667221252

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

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-COL-2"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is NeoElection-COL-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 r245-tall-171654349900442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-2.tgz
mv NeoElection-COL-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 ;