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-171654351700473.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-6, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351700473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.4K Apr 11 19:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 19:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.1K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 11 20:27 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 98K 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-6-CTLCardinality-2024-00
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-01
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-02
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-03
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-04
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-05
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-06
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-07
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-08
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-09
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-10
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-11
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-12
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-13
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-14
FORMULA_NAME NeoElection-COL-6-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716680840143

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-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-25 23:47:21] [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-25 23:47:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:47:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 23:47:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 23:47:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 633 ms
[2024-05-25 23:47:22] [INFO ] Detected 6 constant HL places corresponding to 2380 PT places.
[2024-05-25 23:47:22] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 4830 PT places and 13580.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
[2024-05-25 23:47:22] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 4 ms.
[2024-05-25 23:47:22] [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 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-6-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40007 steps (1115 resets) in 910 ms. (43 steps per ms) remains 11/18 properties
BEST_FIRST walk for 40002 steps (162 resets) in 237 ms. (168 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (168 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (195 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (193 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (416 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (768 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (194 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (169 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (196 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
// Phase 1: matrix 7 rows 6 cols
[2024-05-25 23:47:22] [INFO ] Computed 1 invariants in 2 ms
[2024-05-25 23:47:22] [INFO ] State equation strengthened by 2 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 5/13 variables, and 1 constraints, problems are : Problem set: 10 solved, 0 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 9 simplifications.
[2024-05-25 23:47:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-25 23:47:23] [INFO ] Flatten gal took : 14 ms
[2024-05-25 23:47:23] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
FORMULA NeoElection-COL-6-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 23:47:23] [INFO ] Flatten gal took : 1 ms
Domain [M(7), POS(6), M(7)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 6)]] 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-25 23:47:23] [INFO ] Unfolded HLPN to a Petri net with 4830 places and 7361 transitions 41792 arcs in 165 ms.
[2024-05-25 23:47:23] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Deduced a syphon composed of 4507 places in 21 ms
Reduce places removed 4543 places and 6967 transitions.
Reduce places removed 7 places and 0 transitions.
Support contains 60 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 394/394 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 250 transition count 394
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 74 place count 206 transition count 184
Iterating global reduction 1 with 44 rules applied. Total rules applied 118 place count 206 transition count 184
Applied a total of 118 rules in 25 ms. Remains 206 /280 variables (removed 74) and now considering 184/394 (removed 210) transitions.
[2024-05-25 23:47:23] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 206 cols
[2024-05-25 23:47:23] [INFO ] Computed 47 invariants in 17 ms
[2024-05-25 23:47:23] [INFO ] Implicit Places using invariants in 211 ms returned [16, 17, 18, 19, 20, 21, 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]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 221 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/280 places, 184/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 259 ms. Remains : 170/280 places, 184/394 transitions.
Support contains 60 out of 170 places after structural reductions.
[2024-05-25 23:47:23] [INFO ] Flatten gal took : 22 ms
[2024-05-25 23:47:23] [INFO ] Flatten gal took : 19 ms
[2024-05-25 23:47:23] [INFO ] Input system was already deterministic with 184 transitions.
FORMULA NeoElection-COL-6-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (96 resets) in 778 ms. (51 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40002 steps (12 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (16 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
[2024-05-25 23:47:24] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 170 cols
[2024-05-25 23:47:24] [INFO ] Computed 11 invariants in 2 ms
[2024-05-25 23:47:24] [INFO ] State equation strengthened by 5 read => feed constraints.
Problem AtomicPropp5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 60/329 variables, and 6 constraints, problems are : Problem set: 5 solved, 0 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 6/11 constraints, State Equation: 0/170 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 3 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-6-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 23:47:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-25 23:47:24] [INFO ] Flatten gal took : 14 ms
FORMULA NeoElection-COL-6-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 23:47:24] [INFO ] Flatten gal took : 13 ms
[2024-05-25 23:47:24] [INFO ] Input system was already deterministic with 184 transitions.
Computed a total of 170 stabilizing places and 184 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 170 transition count 184
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA NeoElection-COL-6-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 184/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2024-05-25 23:47:24] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
[2024-05-25 23:47:24] [INFO ] Invariant cache hit.
[2024-05-25 23:47:24] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-25 23:47:24] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
[2024-05-25 23:47:24] [INFO ] Invariant cache hit.
[2024-05-25 23:47:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 23:47:24] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-25 23:47:24] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
[2024-05-25 23:47:24] [INFO ] Invariant cache hit.
[2024-05-25 23:47:24] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 6/170 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Problem TDEAD15 is UNSAT
At refinement iteration 4 (OVERLAPS) 159/329 variables, 170/181 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 5/186 constraints. Problems are: Problem set: 1 solved, 177 unsolved
[2024-05-25 23:47:27] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 17 ms to minimize.
[2024-05-25 23:47:27] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-05-25 23:47:27] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-25 23:47:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-25 23:47:27] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-25 23:47:27] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-25 23:47:27] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-25 23:47:27] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-25 23:47:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-25 23:47:28] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-25 23:47:28] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-25 23:47:28] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:47:28] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
[2024-05-25 23:47:28] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-25 23:47:28] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
[2024-05-25 23:47:28] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 10 ms to minimize.
[2024-05-25 23:47:28] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-25 23:47:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-25 23:47:28] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 23:47:28] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 20/206 constraints. Problems are: Problem set: 1 solved, 177 unsolved
[2024-05-25 23:47:29] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:47:29] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:47:29] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:47:29] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:47:29] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-25 23:47:29] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-25 23:47:29] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-25 23:47:29] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 4 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-25 23:47:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 20/226 constraints. Problems are: Problem set: 1 solved, 177 unsolved
[2024-05-25 23:47:31] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:47:31] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-25 23:47:31] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:47:31] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 4/230 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/329 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 230 constraints, problems are : Problem set: 1 solved, 177 unsolved in 10021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 170/170 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 1 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 6/170 variables, 6/13 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 42/55 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 159/329 variables, 170/225 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 5/230 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 177/407 constraints. Problems are: Problem set: 1 solved, 177 unsolved
[2024-05-25 23:47:37] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-25 23:47:38] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-25 23:47:38] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:47:38] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-25 23:47:38] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-25 23:47:38] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-25 23:47:38] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-25 23:47:38] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 8/415 constraints. Problems are: Problem set: 1 solved, 177 unsolved
[2024-05-25 23:47:40] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:47:41] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 2/417 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/417 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 12 (OVERLAPS) 0/329 variables, 0/417 constraints. Problems are: Problem set: 1 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 417 constraints, problems are : Problem set: 1 solved, 177 unsolved in 13530 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 170/170 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 177/178 constraints, Known Traps: 54/54 constraints]
After SMT, in 23641ms problems are : Problem set: 1 solved, 177 unsolved
Search for dead transitions found 1 dead transitions in 23645ms
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 : 170/170 places, 183/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23923 ms. Remains : 170/170 places, 183/184 transitions.
[2024-05-25 23:47:48] [INFO ] Flatten gal took : 12 ms
[2024-05-25 23:47:48] [INFO ] Flatten gal took : 12 ms
[2024-05-25 23:47:48] [INFO ] Input system was already deterministic with 183 transitions.
[2024-05-25 23:47:48] [INFO ] Flatten gal took : 12 ms
[2024-05-25 23:47:48] [INFO ] Flatten gal took : 11 ms
[2024-05-25 23:47:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality9150699293223246078.gal : 4 ms
[2024-05-25 23:47:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality14099897630206823635.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/CTLCardinality9150699293223246078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14099897630206823635.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 -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-25 23:48:18] [INFO ] Flatten gal took : 11 ms
[2024-05-25 23:48:18] [INFO ] Applying decomposition
[2024-05-25 23:48:18] [INFO ] Flatten gal took : 10 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/graph9348314754922532354.txt' '-o' '/tmp/graph9348314754922532354.bin' '-w' '/tmp/graph9348314754922532354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9348314754922532354.bin' '-l' '-1' '-v' '-w' '/tmp/graph9348314754922532354.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:48:18] [INFO ] Decomposing Gal with order
[2024-05-25 23:48:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:48:18] [INFO ] Removed a total of 251 redundant transitions.
[2024-05-25 23:48:18] [INFO ] Flatten gal took : 76 ms
[2024-05-25 23:48:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 235 labels/synchronizations in 42 ms.
[2024-05-25 23:48:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality14918852982550271934.gal : 6 ms
[2024-05-25 23:48:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality14954368020830927478.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/CTLCardinality14918852982550271934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14954368020830927478.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.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 184/184 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 164 transition count 178
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 164 transition count 178
Applied a total of 12 rules in 5 ms. Remains 164 /170 variables (removed 6) and now considering 178/184 (removed 6) transitions.
[2024-05-25 23:48:49] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 164 cols
[2024-05-25 23:48:49] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 23:48:49] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-25 23:48:49] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-05-25 23:48:49] [INFO ] Invariant cache hit.
[2024-05-25 23:48:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 23:48:49] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-25 23:48:49] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-05-25 23:48:49] [INFO ] Invariant cache hit.
[2024-05-25 23:48:49] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Problem TDEAD15 is UNSAT
At refinement iteration 4 (OVERLAPS) 153/317 variables, 164/175 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 5/180 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:48:51] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 8 ms to minimize.
[2024-05-25 23:48:51] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-25 23:48:51] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 3 ms to minimize.
[2024-05-25 23:48:51] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-25 23:48:51] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-25 23:48:51] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-25 23:48:52] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-25 23:48:52] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-25 23:48:52] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-25 23:48:52] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-25 23:48:52] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-25 23:48:52] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-25 23:48:52] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-25 23:48:52] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 23:48:52] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:48:52] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-25 23:48:53] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:48:53] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:48:53] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-25 23:48:53] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/200 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-25 23:48:54] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-25 23:48:55] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-25 23:48:55] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 18/218 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:48:55] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-25 23:48:55] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 2/220 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:48:58] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/317 variables, 1/221 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:48:59] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/317 variables, 1/222 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:49:01] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:49:01] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:49:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 3/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 15 (OVERLAPS) 0/317 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 225 constraints, problems are : Problem set: 1 solved, 171 unsolved in 14660 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 1 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 45/56 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 153/317 variables, 164/220 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 5/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 171/396 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 396 constraints, problems are : Problem set: 1 solved, 171 unsolved in 7364 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 171/172 constraints, Known Traps: 45/45 constraints]
After SMT, in 22099ms problems are : Problem set: 1 solved, 171 unsolved
Search for dead transitions found 1 dead transitions in 22101ms
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 : 164/170 places, 177/184 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22456 ms. Remains : 164/170 places, 177/184 transitions.
[2024-05-25 23:49:11] [INFO ] Flatten gal took : 26 ms
[2024-05-25 23:49:11] [INFO ] Flatten gal took : 12 ms
[2024-05-25 23:49:11] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-25 23:49:11] [INFO ] Flatten gal took : 11 ms
[2024-05-25 23:49:11] [INFO ] Flatten gal took : 11 ms
[2024-05-25 23:49:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality12417158791902361752.gal : 2 ms
[2024-05-25 23:49:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality10718918367427212205.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/CTLCardinality12417158791902361752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10718918367427212205.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-25 23:49:41] [INFO ] Flatten gal took : 14 ms
[2024-05-25 23:49:41] [INFO ] Applying decomposition
[2024-05-25 23:49:41] [INFO ] Flatten gal took : 7 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/graph3960222559713913769.txt' '-o' '/tmp/graph3960222559713913769.bin' '-w' '/tmp/graph3960222559713913769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3960222559713913769.bin' '-l' '-1' '-v' '-w' '/tmp/graph3960222559713913769.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:49:41] [INFO ] Decomposing Gal with order
[2024-05-25 23:49:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:49:41] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-25 23:49:41] [INFO ] Flatten gal took : 28 ms
[2024-05-25 23:49:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-25 23:49:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality15320863147066162833.gal : 3 ms
[2024-05-25 23:49:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality14454585176817613512.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/CTLCardinality15320863147066162833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14454585176817613512.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.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 184/184 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 164 transition count 178
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 164 transition count 178
Applied a total of 12 rules in 9 ms. Remains 164 /170 variables (removed 6) and now considering 178/184 (removed 6) transitions.
[2024-05-25 23:50:11] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-05-25 23:50:11] [INFO ] Invariant cache hit.
[2024-05-25 23:50:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-25 23:50:12] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-05-25 23:50:12] [INFO ] Invariant cache hit.
[2024-05-25 23:50:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 23:50:12] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-25 23:50:12] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-05-25 23:50:12] [INFO ] Invariant cache hit.
[2024-05-25 23:50:12] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Problem TDEAD15 is UNSAT
At refinement iteration 4 (OVERLAPS) 153/317 variables, 164/175 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 5/180 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:50:14] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-25 23:50:14] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-25 23:50:14] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-25 23:50:14] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:50:14] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:50:14] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-25 23:50:14] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-25 23:50:15] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/200 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:50:16] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-25 23:50:16] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-25 23:50:16] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-25 23:50:16] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-25 23:50:16] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-25 23:50:16] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2024-05-25 23:50:16] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-25 23:50:16] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-05-25 23:50:16] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-25 23:50:16] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:50:17] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2024-05-25 23:50:17] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-25 23:50:17] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:50:17] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-25 23:50:17] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-25 23:50:17] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-25 23:50:17] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:50:18] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 18/218 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:50:18] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-25 23:50:18] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 2/220 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:50:20] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/317 variables, 1/221 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:50:22] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/317 variables, 1/222 constraints. Problems are: Problem set: 1 solved, 171 unsolved
[2024-05-25 23:50:23] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 4 ms to minimize.
[2024-05-25 23:50:23] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-25 23:50:23] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 3/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 15 (OVERLAPS) 0/317 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 225 constraints, problems are : Problem set: 1 solved, 171 unsolved in 14476 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 1 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 6/164 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 45/56 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 153/317 variables, 164/220 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 5/225 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 171/396 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 396 constraints, problems are : Problem set: 1 solved, 171 unsolved in 7304 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 171/172 constraints, Known Traps: 45/45 constraints]
After SMT, in 21844ms problems are : Problem set: 1 solved, 171 unsolved
Search for dead transitions found 1 dead transitions in 21846ms
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 : 164/170 places, 177/184 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22094 ms. Remains : 164/170 places, 177/184 transitions.
[2024-05-25 23:50:34] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:50:34] [INFO ] Flatten gal took : 8 ms
[2024-05-25 23:50:34] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-25 23:50:34] [INFO ] Flatten gal took : 8 ms
[2024-05-25 23:50:34] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:50:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality10297738330629638778.gal : 4 ms
[2024-05-25 23:50:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality10484266539194312716.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/CTLCardinality10297738330629638778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10484266539194312716.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-25 23:51:04] [INFO ] Flatten gal took : 8 ms
[2024-05-25 23:51:04] [INFO ] Applying decomposition
[2024-05-25 23:51:04] [INFO ] Flatten gal took : 7 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/graph8598286937081119482.txt' '-o' '/tmp/graph8598286937081119482.bin' '-w' '/tmp/graph8598286937081119482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8598286937081119482.bin' '-l' '-1' '-v' '-w' '/tmp/graph8598286937081119482.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:51:04] [INFO ] Decomposing Gal with order
[2024-05-25 23:51:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:51:04] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-25 23:51:04] [INFO ] Flatten gal took : 29 ms
[2024-05-25 23:51:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2024-05-25 23:51:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality8755348855836032058.gal : 33 ms
[2024-05-25 23:51:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality3882980188430281574.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/CTLCardinality8755348855836032058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3882980188430281574.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-25 23:51:34] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:51:34] [INFO ] Flatten gal took : 7 ms
[2024-05-25 23:51:34] [INFO ] Applying decomposition
[2024-05-25 23:51:34] [INFO ] Flatten gal took : 7 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/graph7543525477796406076.txt' '-o' '/tmp/graph7543525477796406076.bin' '-w' '/tmp/graph7543525477796406076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7543525477796406076.bin' '-l' '-1' '-v' '-w' '/tmp/graph7543525477796406076.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:51:34] [INFO ] Decomposing Gal with order
[2024-05-25 23:51:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:51:34] [INFO ] Removed a total of 256 redundant transitions.
[2024-05-25 23:51:34] [INFO ] Flatten gal took : 15 ms
[2024-05-25 23:51:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 231 labels/synchronizations in 15 ms.
[2024-05-25 23:51:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality14448916240618607952.gal : 19 ms
[2024-05-25 23:51:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality8047505893614150929.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/CTLCardinality14448916240618607952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8047505893614150929.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 -...284
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83247e+23,899.373,12404060,2,1.80993e+06,5,6.02296e+07,6,0,877,6.90709e+07,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-26 00:12:59] [INFO ] Applying decomposition
[2024-05-26 00:12:59] [INFO ] Flatten gal took : 10 ms
[2024-05-26 00:12:59] [INFO ] Decomposing Gal with order
[2024-05-26 00:12:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 00:12:59] [INFO ] Removed a total of 244 redundant transitions.
[2024-05-26 00:12:59] [INFO ] Flatten gal took : 46 ms
[2024-05-26 00:12:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 00:12:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality13517462811172643621.gal : 3 ms
[2024-05-26 00:12:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3229320105093820489.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/CTLCardinality13517462811172643621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3229320105093820489.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 -...284
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83247e+23,1078.19,15443960,2,2.27632e+06,5,7.35745e+07,6,0,846,7.70865e+07,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-26 00:34:23] [INFO ] Flatten gal took : 12 ms
[2024-05-26 00:34:23] [INFO ] Input system was already deterministic with 184 transitions.
[2024-05-26 00:34:24] [INFO ] Transformed 170 places.
[2024-05-26 00:34:24] [INFO ] Transformed 184 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 00:34:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality14270485160965599141.gal : 3 ms
[2024-05-26 00:34:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality1511098931254655899.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/CTLCardinality14270485160965599141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1511098931254655899.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 3 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3441937 ms.

BK_STOP 1716684283290

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-6"
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-6, 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-171654351700473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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