Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 89K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NeoElection-COL-5-LTLCardinality-00
FORMULA_NAME NeoElection-COL-5-LTLCardinality-01
FORMULA_NAME NeoElection-COL-5-LTLCardinality-02
FORMULA_NAME NeoElection-COL-5-LTLCardinality-03
FORMULA_NAME NeoElection-COL-5-LTLCardinality-04
FORMULA_NAME NeoElection-COL-5-LTLCardinality-05
FORMULA_NAME NeoElection-COL-5-LTLCardinality-06
FORMULA_NAME NeoElection-COL-5-LTLCardinality-07
FORMULA_NAME NeoElection-COL-5-LTLCardinality-08
FORMULA_NAME NeoElection-COL-5-LTLCardinality-09
FORMULA_NAME NeoElection-COL-5-LTLCardinality-10
FORMULA_NAME NeoElection-COL-5-LTLCardinality-11
FORMULA_NAME NeoElection-COL-5-LTLCardinality-12
FORMULA_NAME NeoElection-COL-5-LTLCardinality-13
FORMULA_NAME NeoElection-COL-5-LTLCardinality-14
FORMULA_NAME NeoElection-COL-5-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748796126994

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-01 16:42:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 16:42:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 16:42:08] [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.
[2025-06-01 16:42:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 16:42:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 606 ms
[2025-06-01 16:42:08] [INFO ] Detected 6 constant HL places corresponding to 1500 PT places.
[2025-06-01 16:42:08] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 3090 PT places and 7716.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 16:42:09] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 6 ms.
[2025-06-01 16:42:09] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-5-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.4 ms
Remains 14 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-5-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40007 steps (1219 resets) in 313 ms. (127 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (211 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
// Phase 1: matrix 7 rows 6 cols
[2025-06-01 16:42:09] [INFO ] Computed 1 invariants in 5 ms
[2025-06-01 16:42:09] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 5/13 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA NeoElection-COL-5-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 16:42:09] [INFO ] Flatten gal took : 13 ms
[2025-06-01 16:42:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA NeoElection-COL-5-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 16:42:09] [INFO ] Flatten gal took : 2 ms
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.
Domain [M(6), POS(5), M(6)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 5)]] contains successor/predecessor on variables of sort POS
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.
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.
[2025-06-01 16:42:09] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4024 transitions 22762 arcs in 103 ms.
[2025-06-01 16:42:09] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Deduced a syphon composed of 2866 places in 13 ms
Reduce places removed 2891 places and 3788 transitions.
Reduce places removed 6 places and 0 transitions.
Support contains 15 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 236/236 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 173 transition count 236
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 52 place count 141 transition count 123
Iterating global reduction 1 with 32 rules applied. Total rules applied 84 place count 141 transition count 123
Applied a total of 84 rules in 22 ms. Remains 141 /193 variables (removed 52) and now considering 123/236 (removed 113) transitions.
[2025-06-01 16:42:09] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 141 cols
[2025-06-01 16:42:09] [INFO ] Computed 34 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:42:09] [INFO ] Implicit Places using invariants in 174 ms returned [13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 182 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/193 places, 123/236 transitions.
Applied a total of 0 rules in 14 ms. Remains 116 /116 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 224 ms. Remains : 116/193 places, 123/236 transitions.
Support contains 15 out of 116 places after structural reductions.
[2025-06-01 16:42:09] [INFO ] Flatten gal took : 19 ms
[2025-06-01 16:42:10] [INFO ] Flatten gal took : 15 ms
[2025-06-01 16:42:10] [INFO ] Input system was already deterministic with 123 transitions.
RANDOM walk for 40000 steps (144 resets) in 757 ms. (52 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (21 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
[2025-06-01 16:42:10] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 116 cols
[2025-06-01 16:42:10] [INFO ] Computed 9 invariants in 2 ms
[2025-06-01 16:42:10] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 10/223 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/116 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA NeoElection-COL-5-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
Computed a total of 116 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116 transition count 123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 123/123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 116 transition count 118
Reduce places removed 5 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 111 transition count 113
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 20 place count 106 transition count 113
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 20 place count 106 transition count 108
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 101 transition count 108
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 86 transition count 93
Applied a total of 60 rules in 25 ms. Remains 86 /116 variables (removed 30) and now considering 93/123 (removed 30) transitions.
[2025-06-01 16:42:10] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2025-06-01 16:42:10] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:42:10] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-01 16:42:10] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2025-06-01 16:42:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:42:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-01 16:42:10] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:42:10] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-01 16:42:10] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2025-06-01 16:42:10] [INFO ] Invariant cache hit.
[2025-06-01 16:42:10] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD58 is UNSAT
At refinement iteration 4 (OVERLAPS) 77/163 variables, 86/95 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 72/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 167 constraints, problems are : Problem set: 1 solved, 87 unsolved in 1899 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 77/163 variables, 86/95 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 72/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 87/254 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 254 constraints, problems are : Problem set: 1 solved, 87 unsolved in 2608 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 87/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4539ms problems are : Problem set: 1 solved, 87 unsolved
Search for dead transitions found 1 dead transitions in 4540ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 86/116 places, 92/123 transitions.
Applied a total of 0 rules in 11 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:42:15] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 4817 ms. Remains : 86/116 places, 92/123 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLCardinality-08
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 5 ms.
FORMULA NeoElection-COL-5-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLCardinality-08 finished in 5028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 123/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 116 /116 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-06-01 16:42:15] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 116 cols
[2025-06-01 16:42:15] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:42:15] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-01 16:42:15] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:42:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:42:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:42:15] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2025-06-01 16:42:15] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:42:15] [INFO ] Invariant cache hit.
[2025-06-01 16:42:15] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 107/223 variables, 116/125 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:18] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 19/148 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:19] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:19] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 2/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:20] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:20] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:20] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/223 variables, 3/153 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:21] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:21] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:21] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:21] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:21] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:21] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 159 constraints, problems are : Problem set: 1 solved, 117 unsolved in 8748 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 30/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 107/223 variables, 116/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 117/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 276 constraints, problems are : Problem set: 1 solved, 117 unsolved in 7413 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 117/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16192ms problems are : Problem set: 1 solved, 117 unsolved
Search for dead transitions found 1 dead transitions in 16192ms
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 : 116/116 places, 122/123 transitions.
Applied a total of 0 rules in 7 ms. Remains 116 /116 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16383 ms. Remains : 116/116 places, 122/123 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLCardinality-10
Product exploration explored 100000 steps with 5454 reset in 192 ms.
Product exploration explored 100000 steps with 5437 reset in 166 ms.
Computed a total of 116 stabilizing places and 122 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116 transition count 122
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 67 steps (0 resets) in 7 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 16:42:33] [INFO ] Flow matrix only has 106 transitions (discarded 16 similar events)
// Phase 1: matrix 106 rows 116 cols
[2025-06-01 16:42:33] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:42:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 16:42:33] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-06-01 16:42:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:42:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 16:42:33] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-06-01 16:42:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 16:42:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-06-01 16:42:33] [INFO ] Computed and/alt/rep : 112/236/96 causal constraints (skipped 5 transitions) in 6 ms.
[2025-06-01 16:42:33] [INFO ] Added : 54 causal constraints over 11 iterations in 163 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2025-06-01 16:42:33] [INFO ] Flow matrix only has 106 transitions (discarded 16 similar events)
[2025-06-01 16:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:42:33] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-01 16:42:33] [INFO ] Flow matrix only has 106 transitions (discarded 16 similar events)
[2025-06-01 16:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:42:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 16:42:33] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-06-01 16:42:33] [INFO ] Flow matrix only has 106 transitions (discarded 16 similar events)
[2025-06-01 16:42:33] [INFO ] Invariant cache hit.
[2025-06-01 16:42:33] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:34] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 106/222 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:35] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:35] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:35] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:36] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:37] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:37] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:37] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:37] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:37] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:37] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:37] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:39] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/222 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:39] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:41] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/222 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 17 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 117 unsolved in 10575 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 106/222 variables, 116/155 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 117/275 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 275 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6923 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17525ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 17526ms
Finished structural reductions in LTL mode , in 1 iterations and 17714 ms. Remains : 116/116 places, 122/122 transitions.
Computed a total of 116 stabilizing places and 122 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116 transition count 122
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 59 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 16:42:51] [INFO ] Flow matrix only has 106 transitions (discarded 16 similar events)
[2025-06-01 16:42:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:42:51] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 16:42:51] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-06-01 16:42:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:42:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 16:42:51] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-01 16:42:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-01 16:42:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-06-01 16:42:51] [INFO ] Computed and/alt/rep : 112/236/96 causal constraints (skipped 5 transitions) in 7 ms.
[2025-06-01 16:42:52] [INFO ] Added : 54 causal constraints over 11 iterations in 127 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5454 reset in 117 ms.
Product exploration explored 100000 steps with 5446 reset in 162 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 122/122 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 116 transition count 122
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 20 place count 116 transition count 122
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 20 rules in 19 ms. Remains 116 /116 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:42:52] [INFO ] Redundant transitions in 2 ms returned []
Running 117 sub problems to find dead transitions.
[2025-06-01 16:42:52] [INFO ] Flow matrix only has 106 transitions (discarded 16 similar events)
// Phase 1: matrix 106 rows 116 cols
[2025-06-01 16:42:52] [INFO ] Computed 10 invariants in 1 ms
[2025-06-01 16:42:52] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:53] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:53] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:53] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:53] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:53] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 5/15 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 106/222 variables, 116/131 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 3/134 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/134 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/134 constraints. Problems are: Problem set: 20 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 134 constraints, problems are : Problem set: 20 solved, 97 unsolved in 3455 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 25/116 variables, 6/10 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 5/15 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 106/222 variables, 116/131 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 3/134 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 97/231 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/231 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/231 constraints. Problems are: Problem set: 20 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 231 constraints, problems are : Problem set: 20 solved, 97 unsolved in 4827 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 97/117 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8304ms problems are : Problem set: 20 solved, 97 unsolved
Search for dead transitions found 20 dead transitions in 8305ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 116/116 places, 102/122 transitions.
Graph (complete) has 324 edges and 116 vertex of which 96 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 96 /116 variables (removed 20) and now considering 102/102 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/116 places, 102/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8344 ms. Remains : 96/116 places, 102/122 transitions.
Built C files in :
/tmp/ltsmin11121482325148385046
[2025-06-01 16:43:01] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11121482325148385046
Running compilation step : cd /tmp/ltsmin11121482325148385046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 377 ms.
Running link step : cd /tmp/ltsmin11121482325148385046;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11121482325148385046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10988691078420933875.hoa' '--buchi-type=spotba'
LTSmin run took 4196 ms.
FORMULA NeoElection-COL-5-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-5-LTLCardinality-10 finished in 50242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 123/123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 116 transition count 118
Reduce places removed 5 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 111 transition count 113
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 20 place count 106 transition count 113
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 20 place count 106 transition count 108
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 101 transition count 108
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 86 transition count 93
Applied a total of 60 rules in 16 ms. Remains 86 /116 variables (removed 30) and now considering 93/123 (removed 30) transitions.
[2025-06-01 16:43:05] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
// Phase 1: matrix 77 rows 86 cols
[2025-06-01 16:43:05] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:43:05] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-01 16:43:05] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2025-06-01 16:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:43:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-01 16:43:06] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:43:06] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-01 16:43:06] [INFO ] Flow matrix only has 77 transitions (discarded 16 similar events)
[2025-06-01 16:43:06] [INFO ] Invariant cache hit.
[2025-06-01 16:43:06] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD58 is UNSAT
At refinement iteration 4 (OVERLAPS) 77/163 variables, 86/95 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 72/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 167 constraints, problems are : Problem set: 1 solved, 87 unsolved in 1711 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 5/86 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 77/163 variables, 86/95 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 72/167 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 87/254 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 254 constraints, problems are : Problem set: 1 solved, 87 unsolved in 2507 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 87/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4227ms problems are : Problem set: 1 solved, 87 unsolved
Search for dead transitions found 1 dead transitions in 4228ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 86/116 places, 92/123 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:43:10] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 4455 ms. Remains : 86/116 places, 92/123 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLCardinality-13
Product exploration explored 100000 steps with 4883 reset in 309 ms.
Product exploration explored 100000 steps with 4845 reset in 292 ms.
Computed a total of 86 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-5-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-5-LTLCardinality-13 finished in 5198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-06-01 16:43:11] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 116 cols
[2025-06-01 16:43:11] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:43:11] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-01 16:43:11] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:43:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:43:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:43:11] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2025-06-01 16:43:11] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:43:11] [INFO ] Invariant cache hit.
[2025-06-01 16:43:11] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 107/223 variables, 116/125 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:12] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:12] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:12] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:12] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:12] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:13] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 19/148 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:14] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:14] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 2/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:15] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:15] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:15] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/223 variables, 3/153 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:16] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:16] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:16] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:16] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:16] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:17] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 159 constraints, problems are : Problem set: 1 solved, 117 unsolved in 8226 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 30/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 107/223 variables, 116/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 117/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 276 constraints, problems are : Problem set: 1 solved, 117 unsolved in 7317 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 117/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15560ms problems are : Problem set: 1 solved, 117 unsolved
Search for dead transitions found 1 dead transitions in 15561ms
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 : 116/116 places, 122/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15739 ms. Remains : 116/116 places, 122/123 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Computed a total of 116 stabilizing places and 122 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116 transition count 122
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-5-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-5-LTLCardinality-15 finished in 16081 ms.
All properties solved by simple procedures.
Total runtime 78851 ms.

BK_STOP 1748796207469

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-5"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-5, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876811900067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-5.tgz
mv NeoElection-COL-5 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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