Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.0K Apr 11 20:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 11 20:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 19:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 19:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 22:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 22:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 21:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 120K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716684321210

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-26 00:45:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 00:45:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:45:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 00:45:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 00:45:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 633 ms
[2024-05-26 00:45:23] [INFO ] Detected 6 constant HL places corresponding to 5058 PT places.
[2024-05-26 00:45:23] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 10062 PT places and 34578.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2024-05-26 00:45:23] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 4 ms.
[2024-05-26 00:45:23] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
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 16 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-8-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40002 steps (875 resets) in 835 ms. (47 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (126 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (568 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (122 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (139 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (127 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (137 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (139 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
// Phase 1: matrix 7 rows 6 cols
[2024-05-26 00:45:24] [INFO ] Computed 1 invariants in 8 ms
[2024-05-26 00:45:24] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 5/13 variables, and 1 constraints, problems are : Problem set: 11 solved, 0 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 8 simplifications.
FORMULA NeoElection-COL-8-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 00:45:24] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-26 00:45:24] [INFO ] Flatten gal took : 12 ms
[2024-05-26 00:45:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-COL-8-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 00:45:24] [INFO ] Flatten gal took : 1 ms
Domain [M(9), POS(8), M(9)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 8)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
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.
[2024-05-26 00:45:24] [INFO ] Unfolded HLPN to a Petri net with 10062 places and 19858 transitions 113083 arcs in 241 ms.
[2024-05-26 00:45:24] [INFO ] Unfolded 4 HLPN properties in 0 ms.
Deduced a syphon composed of 9487 places in 49 ms
Reduce places removed 9551 places and 18965 transitions.
Reduce places removed 9 places and 0 transitions.
Support contains 80 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 893/893 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 446 transition count 893
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 146 place count 356 transition count 326
Iterating global reduction 1 with 90 rules applied. Total rules applied 236 place count 356 transition count 326
Applied a total of 236 rules in 44 ms. Remains 356 /502 variables (removed 146) and now considering 326/893 (removed 567) transitions.
[2024-05-26 00:45:24] [INFO ] Flow matrix only has 277 transitions (discarded 49 similar events)
// Phase 1: matrix 277 rows 356 cols
[2024-05-26 00:45:24] [INFO ] Computed 79 invariants in 27 ms
[2024-05-26 00:45:25] [INFO ] Implicit Places using invariants in 321 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 331 ms to find 64 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 292/502 places, 326/893 transitions.
Applied a total of 0 rules in 5 ms. Remains 292 /292 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 389 ms. Remains : 292/502 places, 326/893 transitions.
Support contains 80 out of 292 places after structural reductions.
[2024-05-26 00:45:25] [INFO ] Flatten gal took : 36 ms
[2024-05-26 00:45:25] [INFO ] Flatten gal took : 32 ms
[2024-05-26 00:45:25] [INFO ] Input system was already deterministic with 326 transitions.
RANDOM walk for 40000 steps (52 resets) in 814 ms. (49 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
[2024-05-26 00:45:25] [INFO ] Flow matrix only has 277 transitions (discarded 49 similar events)
// Phase 1: matrix 277 rows 292 cols
[2024-05-26 00:45:25] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 00:45:25] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 96/569 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 8/15 constraints, State Equation: 0/292 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
[2024-05-26 00:45:25] [INFO ] Flatten gal took : 25 ms
[2024-05-26 00:45:25] [INFO ] Flatten gal took : 25 ms
[2024-05-26 00:45:25] [INFO ] Input system was already deterministic with 326 transitions.
Computed a total of 292 stabilizing places and 326 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 292 transition count 326
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 3 formulas.
FORMULA NeoElection-COL-8-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 326/326 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 284 transition count 318
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 284 transition count 318
Applied a total of 16 rules in 11 ms. Remains 284 /292 variables (removed 8) and now considering 318/326 (removed 8) transitions.
[2024-05-26 00:45:25] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
// Phase 1: matrix 269 rows 284 cols
[2024-05-26 00:45:25] [INFO ] Computed 15 invariants in 5 ms
[2024-05-26 00:45:25] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-26 00:45:25] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2024-05-26 00:45:25] [INFO ] Invariant cache hit.
[2024-05-26 00:45:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-26 00:45:26] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2024-05-26 00:45:26] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2024-05-26 00:45:26] [INFO ] Invariant cache hit.
[2024-05-26 00:45:26] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Problem TDEAD20 is UNSAT
At refinement iteration 4 (OVERLAPS) 269/553 variables, 284/299 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 7/306 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 16 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:45:32] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:45:33] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:45:35] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-26 00:45:35] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-26 00:45:35] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 20/326 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:45:37] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-26 00:45:37] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-26 00:45:37] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 4 ms to minimize.
[2024-05-26 00:45:38] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 20/346 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-26 00:45:39] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 3 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:45:40] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/366 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-26 00:45:41] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-26 00:45:43] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-05-26 00:45:44] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 20/386 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:45:46] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-26 00:45:48] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-26 00:45:48] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-26 00:45:48] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 4/390 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:45:49] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 1/391 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 391 constraints, problems are : Problem set: 1 solved, 309 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 1 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 85/100 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 269/553 variables, 284/384 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 7/391 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 309/700 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/700 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/553 variables, 0/700 constraints. Problems are: Problem set: 1 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 700 constraints, problems are : Problem set: 1 solved, 309 unsolved in 24429 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 309/310 constraints, Known Traps: 85/85 constraints]
After SMT, in 54624ms problems are : Problem set: 1 solved, 309 unsolved
Search for dead transitions found 1 dead transitions in 54633ms
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 : 284/292 places, 317/326 transitions.
Applied a total of 0 rules in 6 ms. Remains 284 /284 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55097 ms. Remains : 284/292 places, 317/326 transitions.
[2024-05-26 00:46:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-26 00:46:20] [INFO ] Flatten gal took : 20 ms
FORMULA NeoElection-COL-8-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 00:46:20] [INFO ] Flatten gal took : 19 ms
[2024-05-26 00:46:20] [INFO ] Input system was already deterministic with 317 transitions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 326/326 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 284 transition count 318
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 284 transition count 318
Applied a total of 16 rules in 14 ms. Remains 284 /292 variables (removed 8) and now considering 318/326 (removed 8) transitions.
[2024-05-26 00:46:20] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2024-05-26 00:46:20] [INFO ] Invariant cache hit.
[2024-05-26 00:46:21] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-26 00:46:21] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2024-05-26 00:46:21] [INFO ] Invariant cache hit.
[2024-05-26 00:46:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-26 00:46:21] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2024-05-26 00:46:21] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
[2024-05-26 00:46:21] [INFO ] Invariant cache hit.
[2024-05-26 00:46:21] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Problem TDEAD20 is UNSAT
At refinement iteration 4 (OVERLAPS) 269/553 variables, 284/299 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 7/306 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:46:27] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:46:28] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:46:28] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:46:28] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:46:28] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:46:28] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-26 00:46:30] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-26 00:46:30] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-26 00:46:30] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 20/326 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:46:32] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2024-05-26 00:46:32] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-26 00:46:32] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-26 00:46:32] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-26 00:46:32] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:46:32] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-26 00:46:32] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-26 00:46:32] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-26 00:46:33] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 20/346 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:46:34] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 20/366 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 4 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-26 00:46:35] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-26 00:46:36] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:46:36] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:46:36] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-26 00:46:36] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-26 00:46:36] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-26 00:46:36] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-26 00:46:36] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-26 00:46:36] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-26 00:46:38] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-26 00:46:38] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-26 00:46:38] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-05-26 00:46:38] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 20/386 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:46:40] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-26 00:46:42] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2024-05-26 00:46:42] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-26 00:46:43] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 4/390 constraints. Problems are: Problem set: 1 solved, 309 unsolved
[2024-05-26 00:46:43] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 1/391 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 391 constraints, problems are : Problem set: 1 solved, 309 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 1 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 85/100 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 269/553 variables, 284/384 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 7/391 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 309/700 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/700 constraints. Problems are: Problem set: 1 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/553 variables, 0/700 constraints. Problems are: Problem set: 1 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 700 constraints, problems are : Problem set: 1 solved, 309 unsolved in 24649 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 284/284 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 309/310 constraints, Known Traps: 85/85 constraints]
After SMT, in 54786ms problems are : Problem set: 1 solved, 309 unsolved
Search for dead transitions found 1 dead transitions in 54791ms
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 : 284/292 places, 317/326 transitions.
Applied a total of 0 rules in 13 ms. Remains 284 /284 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55176 ms. Remains : 284/292 places, 317/326 transitions.
[2024-05-26 00:47:16] [INFO ] Flatten gal took : 15 ms
[2024-05-26 00:47:16] [INFO ] Flatten gal took : 16 ms
[2024-05-26 00:47:16] [INFO ] Input system was already deterministic with 317 transitions.
[2024-05-26 00:47:16] [INFO ] Flatten gal took : 14 ms
[2024-05-26 00:47:16] [INFO ] Flatten gal took : 13 ms
[2024-05-26 00:47:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality10138889432129912737.gal : 8 ms
[2024-05-26 00:47:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15969920669742588493.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10138889432129912737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15969920669742588493.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-26 00:47:46] [INFO ] Flatten gal took : 17 ms
[2024-05-26 00:47:46] [INFO ] Applying decomposition
[2024-05-26 00:47:46] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1820389549661334644.txt' '-o' '/tmp/graph1820389549661334644.bin' '-w' '/tmp/graph1820389549661334644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1820389549661334644.bin' '-l' '-1' '-v' '-w' '/tmp/graph1820389549661334644.weights' '-q' '0' '-e' '0.001'
[2024-05-26 00:47:46] [INFO ] Decomposing Gal with order
[2024-05-26 00:47:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 00:47:46] [INFO ] Removed a total of 73 redundant transitions.
[2024-05-26 00:47:46] [INFO ] Flatten gal took : 41 ms
[2024-05-26 00:47:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 14 ms.
[2024-05-26 00:47:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality4550377349435228983.gal : 7 ms
[2024-05-26 00:47:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality11064376112116237087.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4550377349435228983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11064376112116237087.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-26 00:48:16] [INFO ] Flatten gal took : 17 ms
[2024-05-26 00:48:16] [INFO ] Flatten gal took : 13 ms
[2024-05-26 00:48:16] [INFO ] Applying decomposition
[2024-05-26 00:48:16] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph121408352711518767.txt' '-o' '/tmp/graph121408352711518767.bin' '-w' '/tmp/graph121408352711518767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph121408352711518767.bin' '-l' '-1' '-v' '-w' '/tmp/graph121408352711518767.weights' '-q' '0' '-e' '0.001'
[2024-05-26 00:48:16] [INFO ] Decomposing Gal with order
[2024-05-26 00:48:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 00:48:16] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-26 00:48:16] [INFO ] Flatten gal took : 29 ms
[2024-05-26 00:48:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2024-05-26 00:48:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality15613214726870436731.gal : 5 ms
[2024-05-26 00:48:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality11049246770897667967.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15613214726870436731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11049246770897667967.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-26 01:09:15] [INFO ] Applying decomposition
[2024-05-26 01:09:15] [INFO ] Flatten gal took : 27 ms
[2024-05-26 01:09:15] [INFO ] Decomposing Gal with order
[2024-05-26 01:09:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 01:09:15] [INFO ] Removed a total of 468 redundant transitions.
[2024-05-26 01:09:15] [INFO ] Flatten gal took : 29 ms
[2024-05-26 01:09:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-26 01:09:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality3608470234915110268.gal : 5 ms
[2024-05-26 01:09:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality12232529688196381666.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3608470234915110268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12232529688196381666.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-26 01:16:02] [INFO ] Flatten gal took : 15 ms
[2024-05-26 01:16:02] [INFO ] Input system was already deterministic with 326 transitions.
[2024-05-26 01:16:02] [INFO ] Transformed 292 places.
[2024-05-26 01:16:02] [INFO ] Transformed 326 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 01:16:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality17786963092236326777.gal : 2 ms
[2024-05-26 01:16:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality1348115356607969121.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17786963092236326777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1348115356607969121.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2471390 ms.

BK_STOP 1716686793840

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-8"
export BK_EXAMINATION="CTLCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-8, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654351700489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-8.tgz
mv NeoElection-COL-8 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;