fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r202-smll-171649587400065
Last Updated
July 7, 2024

About the Execution of ITS-Tools for HirschbergSinclair-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4597.604 1345668.00 1416971.00 4130.00 TTTFTFTTTFTFTFFT normal

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.r202-smll-171649587400065.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 HirschbergSinclair-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649587400065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 03:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 03:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 13 03:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 136K May 18 16:42 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 HirschbergSinclair-PT-10-CTLCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2023-12
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2023-13
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2023-14
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716581599452

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-24 20:13: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-24 20:13:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 20:13:21] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-24 20:13:21] [INFO ] Transformed 260 places.
[2024-05-24 20:13:21] [INFO ] Transformed 236 transitions.
[2024-05-24 20:13:21] [INFO ] Parsed PT model containing 260 places and 236 transitions and 721 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 137 ms.
Support contains 122 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 236/236 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 253 transition count 236
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 250 transition count 233
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 250 transition count 233
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 249 transition count 232
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 249 transition count 232
Applied a total of 15 rules in 127 ms. Remains 249 /260 variables (removed 11) and now considering 232/236 (removed 4) transitions.
// Phase 1: matrix 232 rows 249 cols
[2024-05-24 20:13:22] [INFO ] Computed 17 invariants in 34 ms
[2024-05-24 20:13:22] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-05-24 20:13:22] [INFO ] Invariant cache hit.
[2024-05-24 20:13:23] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-24 20:13:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 6/242 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 7/249 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 232/481 variables, 249/266 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 266 constraints, problems are : Problem set: 0 solved, 222 unsolved in 14429 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 6/242 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 7/249 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 232/481 variables, 249/266 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 222/488 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 488 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
After SMT, in 44674ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 44700ms
Starting structural reductions in LTL mode, iteration 1 : 249/260 places, 232/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45897 ms. Remains : 249/260 places, 232/236 transitions.
Support contains 122 out of 249 places after structural reductions.
[2024-05-24 20:14:08] [INFO ] Flatten gal took : 93 ms
[2024-05-24 20:14:08] [INFO ] Flatten gal took : 44 ms
[2024-05-24 20:14:08] [INFO ] Input system was already deterministic with 232 transitions.
RANDOM walk for 40000 steps (168 resets) in 2545 ms. (15 steps per ms) remains 15/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
[2024-05-24 20:14:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 9/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 186/225 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3/228 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 3/231 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 9 (OVERLAPS) 232/463 variables, 231/248 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/248 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 18/481 variables, 18/266 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 0/266 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/481 variables, 0/266 constraints. Problems are: Problem set: 11 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 266 constraints, problems are : Problem set: 11 solved, 4 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/23 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 192/215 variables, 12/14 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/14 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/218 variables, 1/15 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 12/230 variables, 2/17 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/17 constraints. Problems are: Problem set: 11 solved, 4 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 9 (OVERLAPS) 232/462 variables, 230/247 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 2/249 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/249 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 19/481 variables, 19/268 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/481 variables, 1/269 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/481 variables, 0/269 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/481 variables, 0/269 constraints. Problems are: Problem set: 12 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 269 constraints, problems are : Problem set: 12 solved, 3 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 3/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1411ms problems are : Problem set: 12 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 437 ms.
Support contains 11 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 232/232 transitions.
Graph (complete) has 465 edges and 249 vertex of which 237 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 237 transition count 134
Reduce places removed 88 places and 0 transitions.
Graph (complete) has 256 edges and 149 vertex of which 132 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 92 rules applied. Total rules applied 191 place count 132 transition count 131
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 211 place count 129 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 213 place count 127 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 215 place count 127 transition count 112
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 217 place count 127 transition count 110
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 218 edges and 125 vertex of which 110 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 220 place count 110 transition count 110
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 235 place count 110 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 235 place count 110 transition count 94
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 237 place count 109 transition count 94
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 242 place count 109 transition count 89
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 247 place count 104 transition count 89
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 256 place count 95 transition count 80
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 7 with 21 rules applied. Total rules applied 277 place count 89 transition count 65
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 292 place count 74 transition count 65
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 23 Pre rules applied. Total rules applied 292 place count 74 transition count 42
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 47 rules applied. Total rules applied 339 place count 50 transition count 42
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 340 place count 49 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 340 place count 49 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 342 place count 48 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 344 place count 47 transition count 40
Applied a total of 344 rules in 79 ms. Remains 47 /249 variables (removed 202) and now considering 40/232 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 47/249 places, 40/232 transitions.
RANDOM walk for 39621 steps (963 resets) in 266 ms. (148 steps per ms) remains 0/3 properties
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 20:14:11] [INFO ] Flatten gal took : 19 ms
[2024-05-24 20:14:11] [INFO ] Flatten gal took : 21 ms
[2024-05-24 20:14:11] [INFO ] Input system was already deterministic with 232 transitions.
Support contains 91 out of 249 places (down from 102) after GAL structural reductions.
Computed a total of 249 stabilizing places and 232 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 249 transition count 232
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 246 transition count 232
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 237 transition count 223
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 237 transition count 223
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 230 transition count 216
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 230 transition count 216
Applied a total of 35 rules in 23 ms. Remains 230 /249 variables (removed 19) and now considering 216/232 (removed 16) transitions.
// Phase 1: matrix 216 rows 230 cols
[2024-05-24 20:14:11] [INFO ] Computed 14 invariants in 9 ms
[2024-05-24 20:14:11] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-24 20:14:11] [INFO ] Invariant cache hit.
[2024-05-24 20:14:12] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-24 20:14:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 11741 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/446 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 41838ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 41842ms
Starting structural reductions in LTL mode, iteration 1 : 230/249 places, 216/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42474 ms. Remains : 230/249 places, 216/232 transitions.
[2024-05-24 20:14:54] [INFO ] Flatten gal took : 18 ms
[2024-05-24 20:14:54] [INFO ] Flatten gal took : 16 ms
[2024-05-24 20:14:54] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-24 20:14:54] [INFO ] Flatten gal took : 15 ms
[2024-05-24 20:14:54] [INFO ] Flatten gal took : 13 ms
[2024-05-24 20:14:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality10082217254529597837.gal : 8 ms
[2024-05-24 20:14:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality4918906390325445831.ctl : 4 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/CTLCardinality10082217254529597837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4918906390325445831.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.
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,6.26026e+11,0.720206,24892,2,18551,5,81509,6,0,1129,81642,0


Converting to forward existential form...Done !
original formula: AF(((init1<=election_10_3_8_to_left_3) * (EX((((reply_10_3_left10>=1)&&(election_10_4_5_to_right_4>rcv_right_reply_10_1_1))||(rcv_left_el...266
=> equivalent forward existential formula: [FwdG(Init,!(((init1<=election_10_3_8_to_left_3) * (EX((((reply_10_3_left10>=1)&&(election_10_4_5_to_right_4>rcv...454
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31...305
Detected timeout of ITS tools.
[2024-05-24 20:15:24] [INFO ] Flatten gal took : 13 ms
[2024-05-24 20:15:24] [INFO ] Applying decomposition
[2024-05-24 20:15:24] [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/graph16295617651015099945.txt' '-o' '/tmp/graph16295617651015099945.bin' '-w' '/tmp/graph16295617651015099945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16295617651015099945.bin' '-l' '-1' '-v' '-w' '/tmp/graph16295617651015099945.weights' '-q' '0' '-e' '0.001'
[2024-05-24 20:15:24] [INFO ] Decomposing Gal with order
[2024-05-24 20:15:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 20:15:24] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-24 20:15:24] [INFO ] Flatten gal took : 108 ms
[2024-05-24 20:15:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-24 20:15:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality9107238134523632391.gal : 11 ms
[2024-05-24 20:15:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality6542185405319359283.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/CTLCardinality9107238134523632391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6542185405319359283.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 -...283
No direction supplied, using forward translation only.
Parsed 1 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,6.26026e+11,0.749341,23640,2,17575,5,76127,6,0,1129,75108,0


Converting to forward existential form...Done !
original formula: AF(((gu0.init1<=gu0.election_10_3_8_to_left_3) * (EX((((gi1.gi1.gi0.gu9.reply_10_3_left10>=1)&&(gu17.election_10_4_5_to_right_4>gu17.rcv_...343
=> equivalent forward existential formula: [FwdG(Init,!(((gu0.init1<=gu0.election_10_3_8_to_left_3) * (EX((((gi1.gi1.gi0.gu9.reply_10_3_left10>=1)&&(gu17.e...551
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.gi0.gu1.t185, gi1.gi0.gi0.gu2.t13, gi1.gi0.gi0.gu2.t19, gi1.gi0.gi0.t15, gi1.gi0.gi0....677
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 232
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 240 transition count 225
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 240 transition count 225
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 235 transition count 220
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 235 transition count 220
Applied a total of 26 rules in 31 ms. Remains 235 /249 variables (removed 14) and now considering 220/232 (removed 12) transitions.
// Phase 1: matrix 220 rows 235 cols
[2024-05-24 20:15:55] [INFO ] Computed 15 invariants in 4 ms
[2024-05-24 20:15:55] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-24 20:15:55] [INFO ] Invariant cache hit.
[2024-05-24 20:15:55] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-05-24 20:15:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 2/226 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 9/235 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 220/455 variables, 235/250 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/455 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 250 constraints, problems are : Problem set: 0 solved, 210 unsolved in 11080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 2/226 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 9/235 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 220/455 variables, 235/250 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 210/460 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 460 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
After SMT, in 41168ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 41171ms
Starting structural reductions in LTL mode, iteration 1 : 235/249 places, 220/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41858 ms. Remains : 235/249 places, 220/232 transitions.
[2024-05-24 20:16:36] [INFO ] Flatten gal took : 16 ms
[2024-05-24 20:16:36] [INFO ] Flatten gal took : 18 ms
[2024-05-24 20:16:36] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-24 20:16:36] [INFO ] Flatten gal took : 25 ms
[2024-05-24 20:16:36] [INFO ] Flatten gal took : 17 ms
[2024-05-24 20:16:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality11335759807059254273.gal : 3 ms
[2024-05-24 20:16:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality15705412675992785823.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/CTLCardinality11335759807059254273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15705412675992785823.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.
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.11698e+12,0.78475,26420,2,18781,5,86009,6,0,1150,87978,0


Converting to forward existential form...Done !
original formula: E(AF((reply_2_0_left2<=election_2_0_1_to_right_2)) U A(!(EX(AG((reply_10_2_right10<=0)))) U (EG(EF((init2<=0))) * !((((reply_5_0_to_right...267
=> equivalent forward existential formula: [((FwdU(Init,!(EG(!((reply_2_0_left2<=election_2_0_1_to_right_2))))) * !(EG(!((EG(E(TRUE U (init2<=0))) * !((((r...691
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t19, t22, t24, t26, t28, t31, t33, t35, t37...300
Detected timeout of ITS tools.
[2024-05-24 20:17:07] [INFO ] Flatten gal took : 13 ms
[2024-05-24 20:17:07] [INFO ] Applying decomposition
[2024-05-24 20:17:07] [INFO ] Flatten gal took : 11 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/graph1791616102924389227.txt' '-o' '/tmp/graph1791616102924389227.bin' '-w' '/tmp/graph1791616102924389227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1791616102924389227.bin' '-l' '-1' '-v' '-w' '/tmp/graph1791616102924389227.weights' '-q' '0' '-e' '0.001'
[2024-05-24 20:17:07] [INFO ] Decomposing Gal with order
[2024-05-24 20:17:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 20:17:07] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-24 20:17:07] [INFO ] Flatten gal took : 28 ms
[2024-05-24 20:17:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-24 20:17:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality2559855767492278125.gal : 5 ms
[2024-05-24 20:17:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality15238166340703741008.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/CTLCardinality2559855767492278125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15238166340703741008.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.
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.11698e+12,0.85658,27716,2,19724,5,91644,6,0,1150,89448,0


Converting to forward existential form...Done !
original formula: E(AF((gu8.reply_2_0_left2<=gu8.election_2_0_1_to_right_2)) U A(!(EX(AG((gi0.gi3.gu6.reply_10_2_right10<=0)))) U (EG(EF((gi0.gi3.gu7.init2...346
=> equivalent forward existential formula: [((FwdU(Init,!(EG(!((gu8.reply_2_0_left2<=gu8.election_2_0_1_to_right_2))))) * !(EG(!((EG(E(TRUE U (gi0.gi3.gu7....888
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gu1.t19, gi0.gi0.gu1.t22, gi0.gi0.gu9.t24, gi0.gi0.t26, gi0.gi1.gu2.t28, gi0.gi1.gu2....542
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 232
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 239 transition count 224
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 239 transition count 224
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 233 transition count 218
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 233 transition count 218
Applied a total of 30 rules in 14 ms. Remains 233 /249 variables (removed 16) and now considering 218/232 (removed 14) transitions.
// Phase 1: matrix 218 rows 233 cols
[2024-05-24 20:17:37] [INFO ] Computed 15 invariants in 3 ms
[2024-05-24 20:17:37] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-24 20:17:37] [INFO ] Invariant cache hit.
[2024-05-24 20:17:37] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-24 20:17:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 2/224 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 9/233 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 218/451 variables, 233/248 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/451 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 248 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12339 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 2/224 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 9/233 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 218/451 variables, 233/248 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 208/456 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (OVERLAPS) 0/451 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 456 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 42416ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 42418ms
Starting structural reductions in LTL mode, iteration 1 : 233/249 places, 218/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42982 ms. Remains : 233/249 places, 218/232 transitions.
[2024-05-24 20:18:20] [INFO ] Flatten gal took : 15 ms
[2024-05-24 20:18:20] [INFO ] Flatten gal took : 9 ms
[2024-05-24 20:18:20] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-24 20:18:20] [INFO ] Flatten gal took : 9 ms
[2024-05-24 20:18:20] [INFO ] Flatten gal took : 10 ms
[2024-05-24 20:18:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality16397892539346687819.gal : 3 ms
[2024-05-24 20:18:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality5061220962278503430.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/CTLCardinality16397892539346687819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5061220962278503430.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.
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,7.81443e+11,0.937991,25400,2,18438,5,80637,6,0,1140,82302,0


Converting to forward existential form...Done !
original formula: AG(((EF(((((rcv_right_election_8_0_1_7<=rcv_right_election_10_0_1_9)&&(reply_10_3_to_right_2<=1))&&((election_10_4_7_to_right_6>=1)||(new...412
=> equivalent forward existential formula: ([(EY((EY((FwdU(Init,TRUE) * !((E(TRUE U ((((rcv_right_election_8_0_1_7<=rcv_right_election_10_0_1_9)&&(reply_10...821
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t19, t21, t23, t25, t27, t29, t31, t33, t35...300
Detected timeout of ITS tools.
[2024-05-24 20:18:50] [INFO ] Flatten gal took : 10 ms
[2024-05-24 20:18:50] [INFO ] Applying decomposition
[2024-05-24 20:18:50] [INFO ] Flatten gal took : 9 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/graph14778938530074813613.txt' '-o' '/tmp/graph14778938530074813613.bin' '-w' '/tmp/graph14778938530074813613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14778938530074813613.bin' '-l' '-1' '-v' '-w' '/tmp/graph14778938530074813613.weights' '-q' '0' '-e' '0.001'
[2024-05-24 20:18:50] [INFO ] Decomposing Gal with order
[2024-05-24 20:18:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 20:18:50] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-24 20:18:50] [INFO ] Flatten gal took : 22 ms
[2024-05-24 20:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 20:18:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality6692735061840040242.gal : 3 ms
[2024-05-24 20:18:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11500344611265553312.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/CTLCardinality6692735061840040242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11500344611265553312.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.
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,7.81443e+11,0.785845,25488,2,18627,5,81609,6,0,1140,82260,0


Converting to forward existential form...Done !
original formula: AG(((EF(((((gu12.rcv_right_election_8_0_1_7<=gu12.rcv_right_election_10_0_1_9)&&(gi0.gi0.gi1.gu2.reply_10_3_to_right_2<=1))&&((gi0.gi1.gi...561
=> equivalent forward existential formula: ([(EY((EY((FwdU(Init,TRUE) * !((E(TRUE U ((((gu12.rcv_right_election_8_0_1_7<=gu12.rcv_right_election_10_0_1_9)&...1093
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi0.gu1.t13, gi0.gi0.gi1.gu2.t19, gi0.gi0.gi1.gu3.t23, gi0.gi0.gi1.gu3.t29, gi0.gi0.g...637
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 246 transition count 232
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 237 transition count 223
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 237 transition count 223
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 230 transition count 216
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 230 transition count 216
Applied a total of 35 rules in 11 ms. Remains 230 /249 variables (removed 19) and now considering 216/232 (removed 16) transitions.
// Phase 1: matrix 216 rows 230 cols
[2024-05-24 20:19:20] [INFO ] Computed 14 invariants in 3 ms
[2024-05-24 20:19:20] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-24 20:19:20] [INFO ] Invariant cache hit.
[2024-05-24 20:19:21] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-24 20:19:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 13690 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 1)
(s7 0)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 43763ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 43766ms
Starting structural reductions in LTL mode, iteration 1 : 230/249 places, 216/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44419 ms. Remains : 230/249 places, 216/232 transitions.
[2024-05-24 20:20:05] [INFO ] Flatten gal took : 11 ms
[2024-05-24 20:20:05] [INFO ] Flatten gal took : 8 ms
[2024-05-24 20:20:05] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-24 20:20:05] [INFO ] Flatten gal took : 8 ms
[2024-05-24 20:20:05] [INFO ] Flatten gal took : 8 ms
[2024-05-24 20:20:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality10212851854626861673.gal : 3 ms
[2024-05-24 20:20:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality343999644029392690.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/CTLCardinality10212851854626861673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality343999644029392690.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 -...283
No direction supplied, using forward translation only.
Parsed 1 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,6.26026e+11,0.77262,24812,2,18551,5,81509,6,0,1129,81642,0


Converting to forward existential form...Done !
original formula: EG(((reply_10_2_to_left_1>rcv_right_election_8_0_1_7) + EX(((rcv_right_election_8_0_1_7<=0)&&(init10<=0)))))
=> equivalent forward existential formula: [FwdG(Init,((reply_10_2_to_left_1>rcv_right_election_8_0_1_7) + EX(((rcv_right_election_8_0_1_7<=0)&&(init10<=0)...169
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31...305
Detected timeout of ITS tools.
[2024-05-24 20:20:35] [INFO ] Flatten gal took : 8 ms
[2024-05-24 20:20:35] [INFO ] Applying decomposition
[2024-05-24 20:20:35] [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/graph12179236354828451700.txt' '-o' '/tmp/graph12179236354828451700.bin' '-w' '/tmp/graph12179236354828451700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12179236354828451700.bin' '-l' '-1' '-v' '-w' '/tmp/graph12179236354828451700.weights' '-q' '0' '-e' '0.001'
[2024-05-24 20:20:35] [INFO ] Decomposing Gal with order
[2024-05-24 20:20:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 20:20:35] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-24 20:20:35] [INFO ] Flatten gal took : 18 ms
[2024-05-24 20:20:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 20:20:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality10372117708372891401.gal : 3 ms
[2024-05-24 20:20:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality7500849047640685521.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/CTLCardinality10372117708372891401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7500849047640685521.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.
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,6.26026e+11,0.842999,26040,2,18190,5,83434,6,0,1129,82018,0


Converting to forward existential form...Done !
original formula: EG(((gu18.reply_10_2_to_left_1>gu18.rcv_right_election_8_0_1_7) + EX(((gu18.rcv_right_election_8_0_1_7<=0)&&(gi0.gi2.gu13.init10<=0)))))
=> equivalent forward existential formula: [FwdG(Init,((gu18.reply_10_2_to_left_1>gu18.rcv_right_election_8_0_1_7) + EX(((gu18.rcv_right_election_8_0_1_7<=...197
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gu0.t15, gi0.gi0.gu0.t185, gi0.gi0.gu1.t13, gi0.gi0.gu2.t17, gi0.gi0.gu3.t21, gi0.gi0...567
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 246 transition count 232
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 237 transition count 223
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 237 transition count 223
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 230 transition count 216
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 230 transition count 216
Applied a total of 35 rules in 10 ms. Remains 230 /249 variables (removed 19) and now considering 216/232 (removed 16) transitions.
[2024-05-24 20:21:05] [INFO ] Invariant cache hit.
[2024-05-24 20:21:05] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-24 20:21:05] [INFO ] Invariant cache hit.
[2024-05-24 20:21:06] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-24 20:21:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 10636 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/446 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 40703ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 40705ms
Starting structural reductions in LTL mode, iteration 1 : 230/249 places, 216/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41419 ms. Remains : 230/249 places, 216/232 transitions.
[2024-05-24 20:21:46] [INFO ] Flatten gal took : 9 ms
[2024-05-24 20:21:46] [INFO ] Flatten gal took : 7 ms
[2024-05-24 20:21:46] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-24 20:21:46] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:21:46] [INFO ] Flatten gal took : 7 ms
[2024-05-24 20:21:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality13658391822135295578.gal : 2 ms
[2024-05-24 20:21:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1703046283821193065.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/CTLCardinality13658391822135295578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1703046283821193065.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.
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,6.26026e+11,0.760761,24860,2,18551,5,81509,6,0,1129,81642,0


Converting to forward existential form...Done !
original formula: EF(EX(EG(AX((rcv_right_election_4_0_1_3>election_5_0_1_to_left_5)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(EX(!((rcv_right_election_4_0_1_3>election_5_0_1_to_left_5)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31...305
Detected timeout of ITS tools.
[2024-05-24 20:22:16] [INFO ] Flatten gal took : 7 ms
[2024-05-24 20:22:16] [INFO ] Applying decomposition
[2024-05-24 20:22:16] [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/graph12582294795360781097.txt' '-o' '/tmp/graph12582294795360781097.bin' '-w' '/tmp/graph12582294795360781097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12582294795360781097.bin' '-l' '-1' '-v' '-w' '/tmp/graph12582294795360781097.weights' '-q' '0' '-e' '0.001'
[2024-05-24 20:22:16] [INFO ] Decomposing Gal with order
[2024-05-24 20:22:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 20:22:16] [INFO ] Removed a total of 37 redundant transitions.
[2024-05-24 20:22:16] [INFO ] Flatten gal took : 18 ms
[2024-05-24 20:22:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 20:22:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6067525341283558468.gal : 3 ms
[2024-05-24 20:22:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality9506391088638430560.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/CTLCardinality6067525341283558468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9506391088638430560.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 -...283
No direction supplied, using forward translation only.
Parsed 1 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,6.26026e+11,0.754126,24428,2,17912,5,77621,6,0,1129,77175,0


Converting to forward existential form...Done !
original formula: EF(EX(EG(AX((gu9.rcv_right_election_4_0_1_3>gu9.election_5_0_1_to_left_5)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(EX(!((gu9.rcv_right_election_4_0_1_3>gu9.election_5_0_1_to_left_5)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi0.gu0.t15, gi0.gi0.gi0.gu1.t13, gi0.gi0.gi1.gu2.t17, gi0.gi0.gi1.gu3.t3, gi0.gi0.gi...635
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 246 transition count 232
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 239 transition count 225
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 239 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 235 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 235 transition count 221
Applied a total of 25 rules in 10 ms. Remains 235 /249 variables (removed 14) and now considering 221/232 (removed 11) transitions.
// Phase 1: matrix 221 rows 235 cols
[2024-05-24 20:22:47] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 20:22:47] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-24 20:22:47] [INFO ] Invariant cache hit.
[2024-05-24 20:22:47] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-24 20:22:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 10/235 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 221/456 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/456 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 249 constraints, problems are : Problem set: 0 solved, 211 unsolved in 11154 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 10/235 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 221/456 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 211/460 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 460 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
After SMT, in 41223ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 41225ms
Starting structural reductions in LTL mode, iteration 1 : 235/249 places, 221/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41798 ms. Remains : 235/249 places, 221/232 transitions.
[2024-05-24 20:23:28] [INFO ] Flatten gal took : 8 ms
[2024-05-24 20:23:28] [INFO ] Flatten gal took : 7 ms
[2024-05-24 20:23:28] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-24 20:23:28] [INFO ] Flatten gal took : 8 ms
[2024-05-24 20:23:28] [INFO ] Flatten gal took : 7 ms
[2024-05-24 20:23:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality8563613743356620582.gal : 3 ms
[2024-05-24 20:23:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality7523064133356717098.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/CTLCardinality8563613743356620582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7523064133356717098.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 -...283
No direction supplied, using forward translation only.
Parsed 1 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.12701e+12,0.811145,26424,2,19545,5,86725,6,0,1154,86388,0


Converting to forward existential form...Done !
original formula: AX(EX((A(((AF((rcv_right_election_10_4_1_9<=rcv_left_reply_10_2_7)) + (rcv_left_election_6_0_1_7<=reply_2_0_to_right_1)) + (reply_10_3_to...523
=> equivalent forward existential formula: [(EY(Init) * !(EX((!((E(!((((election_8_0_1_to_right_8<=elected_10_to_left_3)&&(reply_10_2_to_right_6<=election_...1106
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t16, t18, t20, t22, t24, t26, t28, t30, t32...305
Detected timeout of ITS tools.
[2024-05-24 20:23:58] [INFO ] Flatten gal took : 8 ms
[2024-05-24 20:23:58] [INFO ] Applying decomposition
[2024-05-24 20:23:58] [INFO ] Flatten gal took : 6 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/graph1470855982978113806.txt' '-o' '/tmp/graph1470855982978113806.bin' '-w' '/tmp/graph1470855982978113806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1470855982978113806.bin' '-l' '-1' '-v' '-w' '/tmp/graph1470855982978113806.weights' '-q' '0' '-e' '0.001'
[2024-05-24 20:23:58] [INFO ] Decomposing Gal with order
[2024-05-24 20:23:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 20:23:59] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-24 20:23:59] [INFO ] Flatten gal took : 18 ms
[2024-05-24 20:23:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2024-05-24 20:23:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3191570693557346158.gal : 6 ms
[2024-05-24 20:23:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality4117828630721397097.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/CTLCardinality3191570693557346158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4117828630721397097.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 -...283
No direction supplied, using forward translation only.
Parsed 1 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.12701e+12,0.889329,23352,2,17250,5,74436,6,0,1156,69100,0


Converting to forward existential form...Done !
original formula: AX(EX((A(((AF((gu28.rcv_right_election_10_4_1_9<=gu28.rcv_left_reply_10_2_7)) + (gu13.rcv_left_election_6_0_1_7<=gu13.reply_2_0_to_right_...634
=> equivalent forward existential formula: [(EY(Init) * !(EX((!((E(!((((gu35.election_8_0_1_to_right_8<=gu35.elected_10_to_left_3)&&(gu27.reply_10_2_to_rig...1327
Reverse transition relation is NOT exact ! Due to transitions gu2.t22, gi2.gi0.gi0.gu8.t11, gi2.gi0.gi0.t9, gi2.gi0.gi2.gu1.t13, gi2.gi0.gi2.gu9.t18, gi2.g...544
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Graph (complete) has 465 edges and 249 vertex of which 248 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 239 transition count 132
Reduce places removed 91 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 93 rules applied. Total rules applied 185 place count 148 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 187 place count 146 transition count 130
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 193 place count 140 transition count 124
Iterating global reduction 3 with 6 rules applied. Total rules applied 199 place count 140 transition count 124
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 201 place count 140 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 203 place count 138 transition count 122
Applied a total of 203 rules in 26 ms. Remains 138 /249 variables (removed 111) and now considering 122/232 (removed 110) transitions.
// Phase 1: matrix 122 rows 138 cols
[2024-05-24 20:24:29] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 20:24:29] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-24 20:24:29] [INFO ] Invariant cache hit.
[2024-05-24 20:24:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 20:24:29] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-24 20:24:29] [INFO ] Redundant transitions in 3 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-24 20:24:29] [INFO ] Invariant cache hit.
[2024-05-24 20:24:29] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 3/122 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 2/124 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 108/232 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/260 variables, and 149 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4979 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 124/138 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 3/122 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 2/124 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 108/232 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 9/149 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 105/254 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/232 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/260 variables, and 254 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4789 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 124/138 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 9787ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 9789ms
Starting structural reductions in SI_CTL mode, iteration 1 : 138/249 places, 122/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10271 ms. Remains : 138/249 places, 122/232 transitions.
[2024-05-24 20:24:39] [INFO ] Flatten gal took : 5 ms
[2024-05-24 20:24:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 20:24:39] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-24 20:24:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 20:24:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 20:24:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality11982271459698559480.gal : 2 ms
[2024-05-24 20:24:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality5625347867255508261.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/CTLCardinality11982271459698559480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5625347867255508261.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.
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,4.06825e+09,0.12561,7260,2,2201,5,17616,6,0,654,12796,0


Converting to forward existential form...Done !
original formula: EG(!(A((rcv_left_reply_10_2_7>=1) U ((!((A((rcv_left_election_10_3_6_6<=reply_2_0_left2) U (rcv_left_election_10_2_1_1<=election_10_4_1_t...330
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(((!((!((E(!((rcv_left_election_10_2_1_1<=election_10_4_1_to_right_10)) U (!((rcv_left_electi...1467
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t6, t8, t14, t16, t18, t20, t99, t109, t120, Intersection with reachable at each ste...215
(forward)formula 0,1,3.89089,104876,1,0,368,551878,284,140,4180,423931,417
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Graph (complete) has 465 edges and 249 vertex of which 246 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 8 places and 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 238 transition count 146
Reduce places removed 78 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 83 rules applied. Total rules applied 162 place count 160 transition count 141
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 167 place count 155 transition count 141
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 174 place count 148 transition count 134
Iterating global reduction 3 with 7 rules applied. Total rules applied 181 place count 148 transition count 134
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 183 place count 148 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 185 place count 146 transition count 132
Applied a total of 185 rules in 24 ms. Remains 146 /249 variables (removed 103) and now considering 132/232 (removed 100) transitions.
// Phase 1: matrix 132 rows 146 cols
[2024-05-24 20:24:43] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 20:24:43] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-24 20:24:43] [INFO ] Invariant cache hit.
[2024-05-24 20:24:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 20:24:43] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-05-24 20:24:43] [INFO ] Redundant transitions in 4 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-24 20:24:43] [INFO ] Invariant cache hit.
[2024-05-24 20:24:43] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 4/137 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 123/260 variables, 137/151 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/278 variables, and 159 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3708 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 137/146 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 4/137 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 123/260 variables, 137/151 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 119/278 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/260 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/278 variables, and 278 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6095 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 137/146 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 9822ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 9824ms
Starting structural reductions in SI_CTL mode, iteration 1 : 146/249 places, 132/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10327 ms. Remains : 146/249 places, 132/232 transitions.
[2024-05-24 20:24:53] [INFO ] Flatten gal took : 4 ms
[2024-05-24 20:24:53] [INFO ] Flatten gal took : 4 ms
[2024-05-24 20:24:53] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-24 20:24:53] [INFO ] Flatten gal took : 4 ms
[2024-05-24 20:24:53] [INFO ] Flatten gal took : 4 ms
[2024-05-24 20:24:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality12592044370062418040.gal : 1 ms
[2024-05-24 20:24:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality3426247624652120271.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/CTLCardinality12592044370062418040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3426247624652120271.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.
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,3.81801e+09,0.126013,7596,2,2669,5,16572,6,0,704,13193,0


Converting to forward existential form...Done !
original formula: !(A((AF(((election_3_0_1_to_left_3>rcv_left_reply_7_0_7)||(newmsg7>rcv_right_election_10_1_2_8))) + EF(!(((rcv_left_election_10_4_5_5<=rc...322
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(EG(((reply_10_2_to_left_2<=reply_10_3_right10)&&(election_10_3_1_to_right_10<=1))))))...603
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t9, t11, t14, t17, t18, t20, t21, t104, t116, t126, t127, t128, Intersec...246
dead was empty
dead was empty
(forward)formula 0,0,6.67863,184884,1,0,833,1.07412e+06,304,402,4374,896792,947
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 246 transition count 232
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 238 transition count 224
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 238 transition count 224
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 233 transition count 219
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 233 transition count 219
Applied a total of 29 rules in 19 ms. Remains 233 /249 variables (removed 16) and now considering 219/232 (removed 13) transitions.
// Phase 1: matrix 219 rows 233 cols
[2024-05-24 20:25:00] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 20:25:00] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-24 20:25:00] [INFO ] Invariant cache hit.
[2024-05-24 20:25:01] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-24 20:25:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 10/233 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 219/452 variables, 233/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 247 constraints, problems are : Problem set: 0 solved, 209 unsolved in 12371 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 10/233 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 219/452 variables, 233/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 209/456 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/452 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 456 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
After SMT, in 42438ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 42441ms
Starting structural reductions in LTL mode, iteration 1 : 233/249 places, 219/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43099 ms. Remains : 233/249 places, 219/232 transitions.
[2024-05-24 20:25:43] [INFO ] Flatten gal took : 7 ms
[2024-05-24 20:25:43] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:25:43] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-24 20:25:43] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:25:43] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:25:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality7036967849150754818.gal : 4 ms
[2024-05-24 20:25:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality15641043878050316265.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/CTLCardinality7036967849150754818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15641043878050316265.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.
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.16647e+12,0.78702,25664,2,18923,5,85464,6,0,1144,86085,0


Converting to forward existential form...Done !
original formula: AX((!(E(AF(((rcv_left_election_10_4_4_4>=1)||(rcv_right_election_1_0_1_10>=1))) U (reply_2_0_to_right_1>=1))) + AF((AG((elected_10_to_lef...213
=> equivalent forward existential formula: [FwdG((EY(Init) * !(!(E(!(EG(!(((rcv_left_election_10_4_4_4>=1)||(rcv_right_election_1_0_1_10>=1))))) U (reply_2...279
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t16, t18, t20, t22, t24, t26, t28, t30, t32...310
Detected timeout of ITS tools.
[2024-05-24 20:26:13] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:26:13] [INFO ] Applying decomposition
[2024-05-24 20:26:13] [INFO ] Flatten gal took : 6 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/graph113777683372603710.txt' '-o' '/tmp/graph113777683372603710.bin' '-w' '/tmp/graph113777683372603710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph113777683372603710.bin' '-l' '-1' '-v' '-w' '/tmp/graph113777683372603710.weights' '-q' '0' '-e' '0.001'
[2024-05-24 20:26:13] [INFO ] Decomposing Gal with order
[2024-05-24 20:26:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 20:26:13] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-24 20:26:13] [INFO ] Flatten gal took : 16 ms
[2024-05-24 20:26:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 20:26:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17924306172918319203.gal : 3 ms
[2024-05-24 20:26:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality12559196930861457055.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/CTLCardinality17924306172918319203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12559196930861457055.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.
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.16647e+12,0.894997,27404,2,18773,5,91151,6,0,1144,88297,0


Converting to forward existential form...Done !
original formula: AX((!(E(AF(((gi0.gi0.gu3.rcv_left_election_10_4_4_4>=1)||(gi0.gi2.gu8.rcv_right_election_1_0_1_10>=1))) U (gi0.gi0.gu0.reply_2_0_to_right...271
=> equivalent forward existential formula: [FwdG((EY(Init) * !(!(E(!(EG(!(((gi0.gi0.gu3.rcv_left_election_10_4_4_4>=1)||(gi0.gi2.gu8.rcv_right_election_1_0...337
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gu1.t13, gi0.gi0.gu2.t18, gi0.gi0.gu2.t24, gi0.gi0.gu3.t22, gi0.gi0.gu3.t28, gi0.gi0....586
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Graph (complete) has 465 edges and 249 vertex of which 246 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 237 transition count 127
Reduce places removed 96 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 141 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 197 place count 139 transition count 125
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 204 place count 132 transition count 118
Iterating global reduction 3 with 7 rules applied. Total rules applied 211 place count 132 transition count 118
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 212 place count 132 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 213 place count 131 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 130 transition count 116
Applied a total of 215 rules in 26 ms. Remains 130 /249 variables (removed 119) and now considering 116/232 (removed 116) transitions.
// Phase 1: matrix 116 rows 130 cols
[2024-05-24 20:26:43] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 20:26:43] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-24 20:26:43] [INFO ] Invariant cache hit.
[2024-05-24 20:26:44] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-24 20:26:44] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-24 20:26:44] [INFO ] Redundant transitions in 5 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-24 20:26:44] [INFO ] Invariant cache hit.
[2024-05-24 20:26:44] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 102/216 variables, 114/128 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 11/139 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 2/218 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/246 variables, and 141 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4757 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 116/130 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 102/216 variables, 114/128 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 11/139 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 99/238 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 2/218 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/218 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/246 variables, and 240 constraints, problems are : Problem set: 0 solved, 99 unsolved in 5401 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 116/130 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 10178ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 10180ms
Starting structural reductions in SI_CTL mode, iteration 1 : 130/249 places, 116/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10733 ms. Remains : 130/249 places, 116/232 transitions.
[2024-05-24 20:26:54] [INFO ] Flatten gal took : 5 ms
[2024-05-24 20:26:54] [INFO ] Flatten gal took : 5 ms
[2024-05-24 20:26:54] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-24 20:26:54] [INFO ] Flatten gal took : 5 ms
[2024-05-24 20:26:54] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:26:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality526251830129685115.gal : 1 ms
[2024-05-24 20:26:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11331978443038729010.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/CTLCardinality526251830129685115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11331978443038729010.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 -...283
No direction supplied, using forward translation only.
Parsed 1 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.53633e+09,0.094618,6416,2,1807,5,12697,6,0,622,10168,0


Converting to forward existential form...Done !
original formula: !(A((reply_10_3_to_left_6>0) U EF(!(((election_10_4_10_to_right_9<=rcv_left_election_3_0_1_4)&&(election_10_0_1_to_right_10<=1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(((election_10_4_10_to_right_9<=rcv_left_election_3_0_1_4)&&(election_10_0_1_to_right_...453
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t7, t9, t10, t12, t14, t16, t18, t111, t114, t115, Intersection with reachable a...225
(forward)formula 0,0,2.52343,77840,1,0,343,369403,265,129,3747,300343,380
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Graph (complete) has 465 edges and 249 vertex of which 246 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 10 places and 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 236 transition count 126
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 140 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 139 transition count 125
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 204 place count 130 transition count 116
Iterating global reduction 3 with 9 rules applied. Total rules applied 213 place count 130 transition count 116
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 215 place count 130 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 217 place count 128 transition count 114
Applied a total of 217 rules in 19 ms. Remains 128 /249 variables (removed 121) and now considering 114/232 (removed 118) transitions.
// Phase 1: matrix 114 rows 128 cols
[2024-05-24 20:26:57] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 20:26:57] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-24 20:26:57] [INFO ] Invariant cache hit.
[2024-05-24 20:26:57] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-24 20:26:57] [INFO ] Redundant transitions in 3 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-24 20:26:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 2/111 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 98/209 variables, 111/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 3/212 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/242 variables, and 127 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3142 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 113/128 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 2/111 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 98/209 variables, 111/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 85/210 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 3/212 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/242 variables, and 222 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4148 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 113/128 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
After SMT, in 7305ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7307ms
Starting structural reductions in SI_CTL mode, iteration 1 : 128/249 places, 114/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7704 ms. Remains : 128/249 places, 114/232 transitions.
[2024-05-24 20:27:04] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:27:04] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:27:04] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-24 20:27:04] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:27:04] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:27:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality12334638215795643854.gal : 1 ms
[2024-05-24 20:27:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality15339431830282435888.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/CTLCardinality12334638215795643854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15339431830282435888.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.
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.21336e+09,0.104232,6932,2,2011,5,13257,6,0,612,10568,0


Converting to forward existential form...Done !
original formula: (EG((rcv_right_election_4_0_1_3>=1)) + EG(AG((EG(((rcv_left_election_10_4_1_1<=0)&&(rcv_right_reply_10_0_10<=reply_10_0_right10))) + EF((...188
=> equivalent forward existential formula: ([FwdG(Init,(rcv_right_election_4_0_1_3>=1))] != FALSE + [FwdG(Init,!(E(TRUE U !((EG(((rcv_left_election_10_4_1_...267
dead was empty
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t8, t10, t12, t14, t16, t91, t102, t112, Intersection with reachable at each...219
(forward)formula 0,1,4.25177,122816,1,0,830,667074,257,376,3980,602108,879
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Graph (complete) has 465 edges and 249 vertex of which 246 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 10 places and 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 236 transition count 123
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 199 place count 137 transition count 123
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 207 place count 129 transition count 115
Iterating global reduction 2 with 8 rules applied. Total rules applied 215 place count 129 transition count 115
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 217 place count 129 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 219 place count 127 transition count 113
Applied a total of 219 rules in 21 ms. Remains 127 /249 variables (removed 122) and now considering 113/232 (removed 119) transitions.
// Phase 1: matrix 113 rows 127 cols
[2024-05-24 20:27:09] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 20:27:09] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-24 20:27:09] [INFO ] Invariant cache hit.
[2024-05-24 20:27:09] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2024-05-24 20:27:09] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-24 20:27:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 98/208 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 2/210 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/240 variables, and 126 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3240 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 112/127 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 98/208 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 94/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 2/210 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/240 variables, and 220 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3340 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 112/127 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 6593ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 6594ms
Starting structural reductions in SI_CTL mode, iteration 1 : 127/249 places, 113/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7013 ms. Remains : 127/249 places, 113/232 transitions.
[2024-05-24 20:27:16] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:27:16] [INFO ] Flatten gal took : 4 ms
[2024-05-24 20:27:16] [INFO ] Input system was already deterministic with 113 transitions.
[2024-05-24 20:27:16] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:27:16] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:27:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality7189220447009331949.gal : 1 ms
[2024-05-24 20:27:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality4429619190771525191.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/CTLCardinality7189220447009331949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4429619190771525191.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 -...283
No direction supplied, using forward translation only.
Parsed 1 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.46391e+09,0.099229,6656,2,1978,5,13059,6,0,603,10619,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((rcv_right_election_10_4_5_5>rcv_left_election_4_0_1_5))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (rcv_right_election_10_4_5_5>rcv_left_election_4_0_1_5))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t8, t10, t11, t13, t15, t17, t92, t102, Intersection with reachable at each step...214
dead was empty
(forward)formula 0,0,2.77741,83168,1,0,325,396191,249,124,3641,328083,373
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 232/232 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 246 transition count 232
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 237 transition count 223
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 237 transition count 223
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 230 transition count 216
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 230 transition count 216
Applied a total of 35 rules in 10 ms. Remains 230 /249 variables (removed 19) and now considering 216/232 (removed 16) transitions.
// Phase 1: matrix 216 rows 230 cols
[2024-05-24 20:27:19] [INFO ] Computed 14 invariants in 3 ms
[2024-05-24 20:27:19] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-24 20:27:19] [INFO ] Invariant cache hit.
[2024-05-24 20:27:19] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-24 20:27:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 12325 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/446 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 42416ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 42421ms
Starting structural reductions in LTL mode, iteration 1 : 230/249 places, 216/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43151 ms. Remains : 230/249 places, 216/232 transitions.
[2024-05-24 20:28:02] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:28:02] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:28:02] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-24 20:28:02] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:28:02] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:28:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality6421142806893216288.gal : 2 ms
[2024-05-24 20:28:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality6999857371617669666.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/CTLCardinality6421142806893216288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6999857371617669666.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 -...283
No direction supplied, using forward translation only.
Parsed 1 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,6.26026e+11,0.746863,24912,2,18551,5,81509,6,0,1129,81642,0


Converting to forward existential form...Done !
original formula: AX(AG(EF((rcv_right_election_8_0_1_7>=1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U (rcv_right_election_8_0_1_7>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31...305
(forward)formula 0,0,19.0036,491580,1,0,405,2.61427e+06,454,225,7289,1.43243e+06,453
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2024-05-24 20:28:21] [INFO ] Flatten gal took : 7 ms
[2024-05-24 20:28:21] [INFO ] Flatten gal took : 7 ms
[2024-05-24 20:28:21] [INFO ] Applying decomposition
[2024-05-24 20:28:21] [INFO ] Flatten gal took : 6 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/graph17103393941035009635.txt' '-o' '/tmp/graph17103393941035009635.bin' '-w' '/tmp/graph17103393941035009635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17103393941035009635.bin' '-l' '-1' '-v' '-w' '/tmp/graph17103393941035009635.weights' '-q' '0' '-e' '0.001'
[2024-05-24 20:28:21] [INFO ] Decomposing Gal with order
[2024-05-24 20:28:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 20:28:21] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-24 20:28:21] [INFO ] Flatten gal took : 18 ms
[2024-05-24 20:28:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 20:28:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality4675207713308020215.gal : 4 ms
[2024-05-24 20:28:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality5781460696870351336.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/CTLCardinality4675207713308020215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5781460696870351336.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 -...283
No direction supplied, using forward translation only.
Parsed 7 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,5.0801e+12,0.917896,27452,2,21396,5,92599,6,0,1212,85518,0


Converting to forward existential form...Done !
original formula: AF(((gu20.init1<=gu20.election_10_3_8_to_left_3) * (EX((((gi4.gu23.reply_10_3_left10>=1)&&(gu28.election_10_4_5_to_right_4>gu28.rcv_right...333
=> equivalent forward existential formula: [FwdG(Init,!(((gu20.init1<=gu20.election_10_3_8_to_left_3) * (EX((((gi4.gu23.reply_10_3_left10>=1)&&(gu28.electi...541
Reverse transition relation is NOT exact ! Due to transitions gi0.gu27.t24, gi0.gu27.t28, gi2.gi0.gi0.gu2.t30, gi2.gi0.gi0.gu2.t38, gi2.gi0.gi0.gu4.t36, gi...503
dead was empty
(forward)formula 0,1,53.9227,1328964,1,0,660,6.22785e+06,494,244,7566,5.12113e+06,721
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: E(AF((gu11.reply_2_0_left2<=gu11.election_2_0_1_to_right_2)) U A(!(EX(AG((gi2.gi1.gu8.reply_10_2_right10<=0)))) U (EG(EF((gi2.gi1.gu9.ini...350
=> equivalent forward existential formula: [((FwdU(Init,!(EG(!((gu11.reply_2_0_left2<=gu11.election_2_0_1_to_right_2))))) * !(EG(!((EG(E(TRUE U (gi2.gi1.gu...896
(forward)formula 1,1,200.362,3478016,1,0,1728,2.18598e+07,12,794,3572,1.884e+07,703
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(((EF(((((gu19.rcv_right_election_8_0_1_7<=gu19.rcv_right_election_10_0_1_9)&&(gi2.gi1.gu12.reply_10_3_to_right_2<=1))&&((gi2.gi0.gi0.g...520
=> equivalent forward existential formula: ([(EY((EY((FwdU(Init,TRUE) * !((E(TRUE U ((((gu19.rcv_right_election_8_0_1_7<=gu19.rcv_right_election_10_0_1_9)&...1011
(forward)formula 2,1,364.872,3858712,1,0,2109,2.51247e+07,24,1293,4255,2.48301e+07,1389
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(((gu19.reply_10_2_to_left_1>gu19.rcv_right_election_8_0_1_7) + EX(((gu19.rcv_right_election_8_0_1_7<=0)&&(gi2.gi1.gu0.init10<=0)))))
=> equivalent forward existential formula: [FwdG(Init,((gu19.reply_10_2_to_left_1>gu19.rcv_right_election_8_0_1_7) + EX(((gu19.rcv_right_election_8_0_1_7<=...196
dead was empty
(forward)formula 3,0,365.707,3858712,1,0,2109,2.51247e+07,26,1293,4263,2.48301e+07,1395
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF(EX(EG(AX((gu13.rcv_right_election_4_0_1_3>gu13.election_5_0_1_to_left_5)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(EX(!((gu13.rcv_right_election_4_0_1_3>gu13.election_5_0_1_to_left_5)))))] != FALSE
(forward)formula 4,1,368.331,3858712,1,0,2109,2.51247e+07,31,1293,4681,2.48301e+07,1404
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AX(EX((A(((AF((gu15.rcv_right_election_10_4_1_9<=gu15.rcv_left_reply_10_2_7)) + (gu10.rcv_left_election_6_0_1_7<=gu10.reply_2_0_to_right_...651
=> equivalent forward existential formula: [(EY(Init) * !(EX((!((E(!((((gu32.election_8_0_1_to_right_8<=gu32.elected_10_to_left_3)&&(gi4.gu26.reply_10_2_to...1378
(forward)formula 5,1,407.867,3858712,1,0,2256,2.51247e+07,50,1293,4723,2.48301e+07,2455
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AX((!(E(AF(((gi0.gu27.rcv_left_election_10_4_4_4>=1)||(gi2.gi1.gu8.rcv_right_election_1_0_1_10>=1))) U (gu10.reply_2_0_to_right_1>=1))) +...265
=> equivalent forward existential formula: [FwdG((EY(Init) * !(!(E(!(EG(!(((gi0.gu27.rcv_left_election_10_4_4_4>=1)||(gi2.gi1.gu8.rcv_right_election_1_0_1_...331
(forward)formula 6,1,442.528,4077476,1,0,3257,2.83701e+07,65,1753,4735,2.67412e+07,3473
FORMULA HirschbergSinclair-PT-10-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1343647 ms.

BK_STOP 1716582945120

--------------------
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="HirschbergSinclair-PT-10"
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 HirschbergSinclair-PT-10, 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 r202-smll-171649587400065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-10.tgz
mv HirschbergSinclair-PT-10 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 ;