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.r400-tall-171690531900258.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 StigmergyElection-PT-02b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531900258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717006280121

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 18:11:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:11:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:11:21] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-29 18:11:21] [INFO ] Transformed 291 places.
[2024-05-29 18:11:21] [INFO ] Transformed 332 transitions.
[2024-05-29 18:11:21] [INFO ] Found NUPN structural information;
[2024-05-29 18:11:21] [INFO ] Parsed PT model containing 291 places and 332 transitions and 734 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 108 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 270 transition count 311
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 270 transition count 311
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 259 transition count 300
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 259 transition count 300
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 257 transition count 298
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 257 transition count 298
Applied a total of 68 rules in 55 ms. Remains 257 /291 variables (removed 34) and now considering 298/332 (removed 34) transitions.
// Phase 1: matrix 298 rows 257 cols
[2024-05-29 18:11:21] [INFO ] Computed 3 invariants in 12 ms
[2024-05-29 18:11:21] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-29 18:11:21] [INFO ] Invariant cache hit.
[2024-05-29 18:11:22] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-05-29 18:11:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 18:11:25] [INFO ] Deduced a trap composed of 174 places in 169 ms of which 79 ms to minimize.
[2024-05-29 18:11:25] [INFO ] Deduced a trap composed of 174 places in 140 ms of which 3 ms to minimize.
[2024-05-29 18:11:25] [INFO ] Deduced a trap composed of 176 places in 259 ms of which 2 ms to minimize.
[2024-05-29 18:11:25] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:11:25] [INFO ] Deduced a trap composed of 103 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:11:25] [INFO ] Deduced a trap composed of 207 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:11:26] [INFO ] Deduced a trap composed of 197 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 153 places in 712 ms of which 2 ms to minimize.
[2024-05-29 18:11:28] [INFO ] Deduced a trap composed of 174 places in 122 ms of which 3 ms to minimize.
[2024-05-29 18:11:28] [INFO ] Deduced a trap composed of 176 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:11:28] [INFO ] Deduced a trap composed of 176 places in 95 ms of which 1 ms to minimize.
[2024-05-29 18:11:28] [INFO ] Deduced a trap composed of 173 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 18:11:29] [INFO ] Deduced a trap composed of 198 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 298/555 variables, 257/273 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 0/555 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 273 constraints, problems are : Problem set: 0 solved, 297 unsolved in 18446 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 298/555 variables, 257/273 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 297/570 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 18:11:47] [INFO ] Deduced a trap composed of 174 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 571 constraints, problems are : Problem set: 0 solved, 297 unsolved in 17890 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 14/14 constraints]
After SMT, in 36441ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 36468ms
Starting structural reductions in LTL mode, iteration 1 : 257/291 places, 298/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36972 ms. Remains : 257/291 places, 298/332 transitions.
Support contains 108 out of 257 places after structural reductions.
[2024-05-29 18:11:58] [INFO ] Flatten gal took : 57 ms
[2024-05-29 18:11:58] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:11:58] [INFO ] Input system was already deterministic with 298 transitions.
Support contains 107 out of 257 places (down from 108) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 92 to 91
RANDOM walk for 40000 steps (173 resets) in 2216 ms. (18 steps per ms) remains 16/91 properties
BEST_FIRST walk for 4002 steps (26 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (26 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (26 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (26 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (24 resets) in 10 ms. (363 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (25 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (23 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (18 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (25 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
[2024-05-29 18:12:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 1 (OVERLAPS) 224/257 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-05-29 18:12:01] [INFO ] Deduced a trap composed of 174 places in 1268 ms of which 2 ms to minimize.
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 298/555 variables, 257/261 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/261 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/261 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 261 constraints, problems are : Problem set: 4 solved, 10 unsolved in 1947 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 1 (OVERLAPS) 235/257 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 298/555 variables, 257/261 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 9/270 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/270 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/555 variables, 0/270 constraints. Problems are: Problem set: 5 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 270 constraints, problems are : Problem set: 5 solved, 9 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 9/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 2553ms problems are : Problem set: 5 solved, 9 unsolved
Finished Parikh walk after 3418 steps, including 66 resets, run visited all 1 properties in 5 ms. (steps per millisecond=683 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 316 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-29 18:12:02] [INFO ] Flatten gal took : 25 ms
[2024-05-29 18:12:02] [INFO ] Flatten gal took : 28 ms
[2024-05-29 18:12:03] [INFO ] Input system was already deterministic with 298 transitions.
Computed a total of 34 stabilizing places and 36 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 240 transition count 281
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 240 transition count 281
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 235 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 235 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 275
Applied a total of 46 rules in 18 ms. Remains 234 /257 variables (removed 23) and now considering 275/298 (removed 23) transitions.
// Phase 1: matrix 275 rows 234 cols
[2024-05-29 18:12:03] [INFO ] Computed 3 invariants in 5 ms
[2024-05-29 18:12:03] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-29 18:12:03] [INFO ] Invariant cache hit.
[2024-05-29 18:12:03] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-05-29 18:12:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-29 18:12:06] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 1 ms to minimize.
[2024-05-29 18:12:06] [INFO ] Deduced a trap composed of 164 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:12:06] [INFO ] Deduced a trap composed of 165 places in 82 ms of which 1 ms to minimize.
[2024-05-29 18:12:06] [INFO ] Deduced a trap composed of 164 places in 98 ms of which 2 ms to minimize.
[2024-05-29 18:12:06] [INFO ] Deduced a trap composed of 163 places in 139 ms of which 3 ms to minimize.
[2024-05-29 18:12:08] [INFO ] Deduced a trap composed of 165 places in 694 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-29 18:12:09] [INFO ] Deduced a trap composed of 167 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 275/509 variables, 234/244 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/509 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 244 constraints, problems are : Problem set: 0 solved, 274 unsolved in 14433 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/509 variables, 234/244 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 274/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/509 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 518 constraints, problems are : Problem set: 0 solved, 274 unsolved in 9827 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 7/7 constraints]
After SMT, in 24376ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 24379ms
Starting structural reductions in LTL mode, iteration 1 : 234/257 places, 275/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24798 ms. Remains : 234/257 places, 275/298 transitions.
[2024-05-29 18:12:27] [INFO ] Flatten gal took : 28 ms
[2024-05-29 18:12:27] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:12:27] [INFO ] Input system was already deterministic with 275 transitions.
[2024-05-29 18:12:27] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:12:27] [INFO ] Flatten gal took : 24 ms
[2024-05-29 18:12:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4343790960116700732.gal : 5 ms
[2024-05-29 18:12:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17286795751315169364.ctl : 9 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/CTLFireability4343790960116700732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17286795751315169364.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,145658,0.355966,14280,2,2636,5,33954,6,0,1213,53767,0


Converting to forward existential form...Done !
original formula: AG((AG(AF(AX((p12==1)))) + E((p280==1) U ((((p123==1) + EG((p194==1))) * AF((p248==1))) * (EF((p264==1)) + A((p201==1) U (p213==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,TRUE) * !(E((p280==1) U ((((p123==1) + EG((p194==1))) * !(EG(!((p248==1))))) * (E(TRUE U (...281
Reverse transition relation is NOT exact ! Due to transitions t8, t18, t25, t46, t55, t89, t90, t91, t124, t125, t126, t127, t143, t152, t186, t187, t188, ...285
(forward)formula 0,0,20.7802,669300,1,0,1587,4.97337e+06,606,806,7362,2.92805e+06,1973
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Graph (trivial) has 242 edges and 257 vertex of which 32 / 257 are part of one of the 5 SCC in 2 ms
Free SCC test removed 27 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 229 transition count 120
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 1 with 151 rules applied. Total rules applied 299 place count 82 transition count 116
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 11 rules applied. Total rules applied 310 place count 80 transition count 107
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 321 place count 71 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 322 place count 70 transition count 105
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 322 place count 70 transition count 99
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 334 place count 64 transition count 99
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 348 place count 50 transition count 84
Iterating global reduction 5 with 14 rules applied. Total rules applied 362 place count 50 transition count 84
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 5 with 1 rules applied. Total rules applied 363 place count 50 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 364 place count 49 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 364 place count 49 transition count 82
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 366 place count 48 transition count 82
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 368 place count 46 transition count 77
Iterating global reduction 7 with 2 rules applied. Total rules applied 370 place count 46 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 371 place count 46 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 379 place count 42 transition count 72
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 384 place count 37 transition count 61
Iterating global reduction 8 with 5 rules applied. Total rules applied 389 place count 37 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 393 place count 37 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 396 place count 37 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 400 place count 35 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 401 place count 35 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 402 place count 34 transition count 51
Applied a total of 402 rules in 44 ms. Remains 34 /257 variables (removed 223) and now considering 51/298 (removed 247) transitions.
[2024-05-29 18:12:49] [INFO ] Flow matrix only has 49 transitions (discarded 2 similar events)
// Phase 1: matrix 49 rows 34 cols
[2024-05-29 18:12:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:12:49] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 18:12:49] [INFO ] Flow matrix only has 49 transitions (discarded 2 similar events)
[2024-05-29 18:12:49] [INFO ] Invariant cache hit.
[2024-05-29 18:12:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 18:12:49] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-29 18:12:49] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-29 18:12:49] [INFO ] Flow matrix only has 49 transitions (discarded 2 similar events)
[2024-05-29 18:12:49] [INFO ] Invariant cache hit.
[2024-05-29 18:12:49] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 18:12:49] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-05-29 18:12:49] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:12:49] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 16 ms to minimize.
[2024-05-29 18:12:49] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:12:49] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:12:49] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 48/82 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/83 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-29 18:12:50] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/83 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/83 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/83 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 46 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1722 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 48/82 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 46/91 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/83 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/83 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 92 constraints, problems are : Problem set: 0 solved, 46 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 7/7 constraints]
After SMT, in 2407ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2409ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/257 places, 51/298 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2582 ms. Remains : 34/257 places, 51/298 transitions.
[2024-05-29 18:12:51] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:12:51] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:12:51] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-29 18:12:51] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:12:51] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:12:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14990793284098459067.gal : 1 ms
[2024-05-29 18:12:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17351077494179665464.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/CTLFireability14990793284098459067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17351077494179665464.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,410,0.009355,3636,2,231,5,1179,6,0,183,1223,0


Converting to forward existential form...Done !
original formula: AF((EG(((p154==0) + !(E((p120==1) U (p200==1))))) + (p68==1)))
=> equivalent forward existential formula: [FwdG(Init,!((EG(((p154==0) + !(E((p120==1) U (p200==1))))) + (p68==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t10, t11, t12, t31, t33, t35, t36, t37, t44, t45, t46, t47, t48, t50, Intersection w...238
(forward)formula 0,1,0.093534,7384,1,0,160,21017,133,74,1179,19464,179
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Graph (trivial) has 260 edges and 257 vertex of which 40 / 257 are part of one of the 6 SCC in 1 ms
Free SCC test removed 34 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 153 place count 222 transition count 107
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 1 with 156 rules applied. Total rules applied 309 place count 70 transition count 103
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 312 place count 68 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 313 place count 67 transition count 102
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 313 place count 67 transition count 96
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 325 place count 61 transition count 96
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 338 place count 48 transition count 81
Iterating global reduction 4 with 13 rules applied. Total rules applied 351 place count 48 transition count 81
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 4 with 1 rules applied. Total rules applied 352 place count 48 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 353 place count 47 transition count 80
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 353 place count 47 transition count 79
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 355 place count 46 transition count 79
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 356 place count 45 transition count 75
Iterating global reduction 6 with 1 rules applied. Total rules applied 357 place count 45 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 358 place count 45 transition count 74
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 368 place count 40 transition count 69
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 375 place count 33 transition count 54
Iterating global reduction 7 with 7 rules applied. Total rules applied 382 place count 33 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 386 place count 33 transition count 50
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 388 place count 31 transition count 48
Iterating global reduction 8 with 2 rules applied. Total rules applied 390 place count 31 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 392 place count 31 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 396 place count 29 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 397 place count 28 transition count 43
Applied a total of 397 rules in 31 ms. Remains 28 /257 variables (removed 229) and now considering 43/298 (removed 255) transitions.
[2024-05-29 18:12:51] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
// Phase 1: matrix 40 rows 28 cols
[2024-05-29 18:12:51] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:12:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 18:12:51] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2024-05-29 18:12:51] [INFO ] Invariant cache hit.
[2024-05-29 18:12:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 18:12:51] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-29 18:12:51] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-29 18:12:51] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2024-05-29 18:12:51] [INFO ] Invariant cache hit.
[2024-05-29 18:12:51] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 18:12:52] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 1 ms to minimize.
[2024-05-29 18:12:52] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:12:52] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:12:52] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:12:52] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/67 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/68 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 38 constraints, problems are : Problem set: 0 solved, 38 unsolved in 891 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/67 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 18:12:53] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/68 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/68 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 77 constraints, problems are : Problem set: 0 solved, 38 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 6/6 constraints]
After SMT, in 1470ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1470ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/257 places, 43/298 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1634 ms. Remains : 28/257 places, 43/298 transitions.
[2024-05-29 18:12:53] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:12:53] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:12:53] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-29 18:12:53] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:12:53] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:12:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17587179821930994028.gal : 1 ms
[2024-05-29 18:12:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18278963802038223831.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17587179821930994028.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18278963802038223831.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality18278963802038223831.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 67
Reachability property StigmergyElection-PT-02b-CTLFireability-2024-02 is true.
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,101,0.01441,3628,2,102,9,633,6,0,151,359,0
Total reachable state count : 101

Verifying 1 reachability properties.
Reachability property StigmergyElection-PT-02b-CTLFireability-2024-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-02b-CTLFireability-2024-02,1,0.014917,3988,2,29,9,633,7,0,154,359,0
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 18081 steps (2573 resets) in 119 ms. (150 steps per ms) remains 0/1 properties
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 239 transition count 280
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 239 transition count 280
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 234 transition count 275
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 234 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 274
Applied a total of 48 rules in 12 ms. Remains 233 /257 variables (removed 24) and now considering 274/298 (removed 24) transitions.
// Phase 1: matrix 274 rows 233 cols
[2024-05-29 18:12:53] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:12:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 18:12:53] [INFO ] Invariant cache hit.
[2024-05-29 18:12:53] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2024-05-29 18:12:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-05-29 18:12:55] [INFO ] Deduced a trap composed of 189 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:12:56] [INFO ] Deduced a trap composed of 167 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:12:56] [INFO ] Deduced a trap composed of 164 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:12:56] [INFO ] Deduced a trap composed of 164 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:12:57] [INFO ] Deduced a trap composed of 164 places in 72 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 274/507 variables, 233/241 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 0/507 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 241 constraints, problems are : Problem set: 0 solved, 273 unsolved in 11510 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 274/507 variables, 233/241 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 273/514 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-05-29 18:13:10] [INFO ] Deduced a trap composed of 163 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 0/507 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 515 constraints, problems are : Problem set: 0 solved, 273 unsolved in 13676 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 6/6 constraints]
After SMT, in 25216ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 25219ms
Starting structural reductions in LTL mode, iteration 1 : 233/257 places, 274/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25401 ms. Remains : 233/257 places, 274/298 transitions.
[2024-05-29 18:13:18] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:13:18] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:13:18] [INFO ] Input system was already deterministic with 274 transitions.
[2024-05-29 18:13:18] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:13:18] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:13:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17901218963019927890.gal : 2 ms
[2024-05-29 18:13:18] [INFO ] Time to serialize properties into /tmp/CTLFireability14134551486998048659.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/CTLFireability17901218963019927890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14134551486998048659.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,144579,0.259961,14120,2,2394,5,32735,6,0,1208,55839,0


Converting to forward existential form...Done !
original formula: (E(AF((EF((p51!=1)) * AX(AF((p195==1))))) U (p2!=1)) * A((EG(!((AX((p290==1)) + (p117!=1)))) + ((p212==1) * ((EG((p78==1)) + (AF((p16==1)...296
=> equivalent forward existential formula: [(((Init * E(!(EG(!((E(TRUE U (p51!=1)) * !(EX(!(!(EG(!((p195==1))))))))))) U (p2!=1))) * !(EG(!(E(!(!(E(TRUE U ...820
Reverse transition relation is NOT exact ! Due to transitions t18, t31, t45, t54, t90, t91, t92, t125, t126, t127, t128, t144, t145, t154, t188, t189, t190...293
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,24.6707,784920,1,0,1809,5.85453e+06,610,939,7298,3.68449e+06,2247
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 236 transition count 277
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 236 transition count 277
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 229 transition count 270
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 269
Applied a total of 58 rules in 7 ms. Remains 228 /257 variables (removed 29) and now considering 269/298 (removed 29) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-29 18:13:43] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:13:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 18:13:43] [INFO ] Invariant cache hit.
[2024-05-29 18:13:43] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:13:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:13:46] [INFO ] Deduced a trap composed of 164 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:13:46] [INFO ] Deduced a trap composed of 164 places in 64 ms of which 2 ms to minimize.
[2024-05-29 18:13:47] [INFO ] Deduced a trap composed of 163 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:13:47] [INFO ] Deduced a trap composed of 162 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:13:53] [INFO ] Deduced a trap composed of 162 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 14891 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11388 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 26307ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 26311ms
Starting structural reductions in LTL mode, iteration 1 : 228/257 places, 269/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26485 ms. Remains : 228/257 places, 269/298 transitions.
[2024-05-29 18:14:10] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:14:10] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:14:10] [INFO ] Input system was already deterministic with 269 transitions.
[2024-05-29 18:14:10] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:14:10] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:14:10] [INFO ] Time to serialize gal into /tmp/CTLFireability18159668894986330488.gal : 1 ms
[2024-05-29 18:14:10] [INFO ] Time to serialize properties into /tmp/CTLFireability16437961213327642298.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/CTLFireability18159668894986330488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16437961213327642298.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,130047,0.19721,11464,2,1866,5,26218,6,0,1183,36497,0


Converting to forward existential form...Done !
original formula: EG(EX((!(A((p23==1) U (p178==1))) * AX((p31==0)))))
=> equivalent forward existential formula: [FwdG(Init,EX((!(!((E(!((p178==1)) U (!((p23==1)) * !((p178==1)))) + EG(!((p178==1)))))) * !(EX(!((p31==0)))))))...165
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t183, t184, t185, t218, t219, t221, t2...265
(forward)formula 0,1,15.9137,500316,1,0,1078,3.43057e+06,571,630,6391,2.4703e+06,1389
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Graph (trivial) has 260 edges and 257 vertex of which 40 / 257 are part of one of the 6 SCC in 1 ms
Free SCC test removed 34 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 153 place count 222 transition count 107
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 1 with 156 rules applied. Total rules applied 309 place count 70 transition count 103
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 312 place count 68 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 313 place count 67 transition count 102
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 313 place count 67 transition count 96
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 325 place count 61 transition count 96
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 339 place count 47 transition count 80
Iterating global reduction 4 with 14 rules applied. Total rules applied 353 place count 47 transition count 80
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 4 with 1 rules applied. Total rules applied 354 place count 47 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 46 transition count 79
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 355 place count 46 transition count 78
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 357 place count 45 transition count 78
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 359 place count 43 transition count 73
Iterating global reduction 6 with 2 rules applied. Total rules applied 361 place count 43 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 371 place count 38 transition count 68
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 378 place count 31 transition count 53
Iterating global reduction 6 with 7 rules applied. Total rules applied 385 place count 31 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 389 place count 31 transition count 49
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 391 place count 29 transition count 47
Iterating global reduction 7 with 2 rules applied. Total rules applied 393 place count 29 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 395 place count 29 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 399 place count 27 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 400 place count 26 transition count 42
Applied a total of 400 rules in 15 ms. Remains 26 /257 variables (removed 231) and now considering 42/298 (removed 256) transitions.
[2024-05-29 18:14:26] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
// Phase 1: matrix 39 rows 26 cols
[2024-05-29 18:14:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:14:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 18:14:26] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2024-05-29 18:14:26] [INFO ] Invariant cache hit.
[2024-05-29 18:14:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 18:14:26] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-29 18:14:26] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-29 18:14:26] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2024-05-29 18:14:26] [INFO ] Invariant cache hit.
[2024-05-29 18:14:26] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 18:14:26] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:14:26] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:14:26] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:14:26] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 38/64 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 18:14:26] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 1/65 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 0/65 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 36 constraints, problems are : Problem set: 0 solved, 36 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 26/26 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 38/64 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 36/71 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 1/65 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 36 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 26/26 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 5/5 constraints]
After SMT, in 1022ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1022ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/257 places, 42/298 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1121 ms. Remains : 26/257 places, 42/298 transitions.
[2024-05-29 18:14:27] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:14:27] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:14:27] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-29 18:14:27] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:14:27] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:14:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8771048433451332004.gal : 1 ms
[2024-05-29 18:14:27] [INFO ] Time to serialize properties into /tmp/CTLFireability9415149891047959047.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/CTLFireability8771048433451332004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9415149891047959047.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,372,0.006768,3560,2,155,5,783,6,0,142,791,0


Converting to forward existential form...Done !
original formula: EG(AF((p286==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p286==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t8, t9, t21, t22, t28, t29, t30, t37, t38, t39, Intersection with reachable at each ...216
(forward)formula 0,0,0.048402,5460,1,0,159,10497,107,73,882,11556,182
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 237 transition count 278
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 237 transition count 278
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 230 transition count 271
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 229 transition count 270
Applied a total of 56 rules in 12 ms. Remains 229 /257 variables (removed 28) and now considering 270/298 (removed 28) transitions.
// Phase 1: matrix 270 rows 229 cols
[2024-05-29 18:14:27] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:14:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-29 18:14:27] [INFO ] Invariant cache hit.
[2024-05-29 18:14:27] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-05-29 18:14:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:14:30] [INFO ] Deduced a trap composed of 165 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:14:31] [INFO ] Deduced a trap composed of 164 places in 84 ms of which 1 ms to minimize.
[2024-05-29 18:14:31] [INFO ] Deduced a trap composed of 163 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:14:31] [INFO ] Deduced a trap composed of 164 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:14:31] [INFO ] Deduced a trap composed of 164 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:14:31] [INFO ] Deduced a trap composed of 162 places in 74 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 270/499 variables, 229/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 238 constraints, problems are : Problem set: 0 solved, 269 unsolved in 12715 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/499 variables, 229/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 269/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 507 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10376 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 6/6 constraints]
After SMT, in 23136ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 23139ms
Starting structural reductions in LTL mode, iteration 1 : 229/257 places, 270/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23391 ms. Remains : 229/257 places, 270/298 transitions.
[2024-05-29 18:14:51] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:14:51] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:14:51] [INFO ] Input system was already deterministic with 270 transitions.
[2024-05-29 18:14:51] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:14:51] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:14:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5943245316930186204.gal : 1 ms
[2024-05-29 18:14:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3345549232500431218.ctl : 13 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/CTLFireability5943245316930186204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3345549232500431218.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,130971,0.199323,11728,2,1894,5,26766,6,0,1188,37574,0


Converting to forward existential form...Done !
original formula: EG(((p149==1) + EG(EX((p68==0)))))
=> equivalent forward existential formula: [FwdG(Init,((p149==1) + EG(EX((p68==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t184, t185, t186, t219, t220, t222, t2...265
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,10.2279,336136,1,0,741,1.92852e+06,569,509,6800,1.91578e+06,942
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 238 transition count 279
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 238 transition count 279
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 231 transition count 272
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 271
Applied a total of 54 rules in 6 ms. Remains 230 /257 variables (removed 27) and now considering 271/298 (removed 27) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-05-29 18:15:01] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:15:01] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 18:15:01] [INFO ] Invariant cache hit.
[2024-05-29 18:15:01] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-29 18:15:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:15:04] [INFO ] Deduced a trap composed of 166 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:15:04] [INFO ] Deduced a trap composed of 164 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:15:04] [INFO ] Deduced a trap composed of 164 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:15:04] [INFO ] Deduced a trap composed of 165 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:15:04] [INFO ] Deduced a trap composed of 165 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:15:05] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 271/501 variables, 230/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 239 constraints, problems are : Problem set: 0 solved, 270 unsolved in 12497 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/509 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:15:22] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/501 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/501 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 510 constraints, problems are : Problem set: 0 solved, 270 unsolved in 18721 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 7/7 constraints]
After SMT, in 31257ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 31263ms
Starting structural reductions in LTL mode, iteration 1 : 230/257 places, 271/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31474 ms. Remains : 230/257 places, 271/298 transitions.
[2024-05-29 18:15:32] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:15:32] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:15:32] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-29 18:15:32] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:15:32] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:15:32] [INFO ] Time to serialize gal into /tmp/CTLFireability15994225991058652406.gal : 1 ms
[2024-05-29 18:15:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16839110118520413165.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/CTLFireability15994225991058652406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16839110118520413165.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,131965,0.213144,11996,2,1870,5,27307,6,0,1193,39528,0


Converting to forward existential form...Done !
original formula: (AG(AX(AG((p120==1)))) + A(((p187==1) * AG(!(((E((p265==1) U (p252==1)) + (p129==1)) + (p258==1))))) U !(A((p176==1) U E((p28!=1) U (p238...164
=> equivalent forward existential formula: [(FwdU(EY(FwdU((Init * !(!((E(!(!(!((E(!(E((p28!=1) U (p238==1))) U (!((p176==1)) * !(E((p28!=1) U (p238==1)))))...576
Reverse transition relation is NOT exact ! Due to transitions t16, t44, t53, t88, t89, t90, t123, t124, t126, t142, t151, t185, t186, t187, t220, t221, t22...264
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,26.0434,815308,1,0,1166,6.13181e+06,591,740,7633,3.54977e+06,1545
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Graph (trivial) has 231 edges and 257 vertex of which 40 / 257 are part of one of the 6 SCC in 2 ms
Free SCC test removed 34 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 222 transition count 130
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 1 with 133 rules applied. Total rules applied 263 place count 93 transition count 126
Reduce places removed 2 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 17 rules applied. Total rules applied 280 place count 91 transition count 111
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 295 place count 76 transition count 111
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 295 place count 76 transition count 105
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 307 place count 70 transition count 105
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 322 place count 55 transition count 88
Iterating global reduction 4 with 15 rules applied. Total rules applied 337 place count 55 transition count 88
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 4 with 1 rules applied. Total rules applied 338 place count 55 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 339 place count 54 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 339 place count 54 transition count 86
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 341 place count 53 transition count 86
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 344 place count 50 transition count 79
Iterating global reduction 6 with 3 rules applied. Total rules applied 347 place count 50 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 348 place count 50 transition count 78
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 349 place count 49 transition count 77
Iterating global reduction 7 with 1 rules applied. Total rules applied 350 place count 49 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 356 place count 46 transition count 74
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 361 place count 41 transition count 63
Iterating global reduction 7 with 5 rules applied. Total rules applied 366 place count 41 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 369 place count 41 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 371 place count 41 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 375 place count 39 transition count 56
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 376 place count 39 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 377 place count 38 transition count 55
Applied a total of 377 rules in 45 ms. Remains 38 /257 variables (removed 219) and now considering 55/298 (removed 243) transitions.
[2024-05-29 18:15:59] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
// Phase 1: matrix 53 rows 38 cols
[2024-05-29 18:15:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:15:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 18:15:59] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
[2024-05-29 18:15:59] [INFO ] Invariant cache hit.
[2024-05-29 18:15:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 18:15:59] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 18:15:59] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-29 18:15:59] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
[2024-05-29 18:15:59] [INFO ] Invariant cache hit.
[2024-05-29 18:15:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-29 18:15:59] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:15:59] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:15:59] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:15:59] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-29 18:15:59] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 52/90 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 46 constraints, problems are : Problem set: 0 solved, 50 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 2/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 52/90 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 50/95 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 96 constraints, problems are : Problem set: 0 solved, 50 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 5/5 constraints]
After SMT, in 1548ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1549ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/257 places, 55/298 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1675 ms. Remains : 38/257 places, 55/298 transitions.
[2024-05-29 18:16:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:16:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:16:00] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-29 18:16:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:16:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:16:00] [INFO ] Time to serialize gal into /tmp/CTLFireability18379569448212766623.gal : 17 ms
[2024-05-29 18:16:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6143632841524667609.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/CTLFireability18379569448212766623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6143632841524667609.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,616,0.00993,3656,2,227,5,1349,6,0,203,1376,0


Converting to forward existential form...Done !
original formula: AF((((p120==0)||(p255==0)) * ((AF((p34==1)) + (p53==1)) + ((p78==1)||((p164==1)&&(p222==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((((p120==0)||(p255==0)) * ((!(EG(!((p34==1)))) + (p53==1)) + ((p78==1)||((p164==1)&&(p222==1)))))))...164
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t7, t8, t10, t43, t44, t46, t47, t48, t49, t50, t51, Intersection with reachable at ...221
(forward)formula 0,0,0.146851,11100,1,0,262,44802,137,135,1251,45093,296
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-08 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 : 257/257 places, 298/298 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 238 transition count 279
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 238 transition count 279
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 233 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 233 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 273
Applied a total of 50 rules in 13 ms. Remains 232 /257 variables (removed 25) and now considering 273/298 (removed 25) transitions.
// Phase 1: matrix 273 rows 232 cols
[2024-05-29 18:16:01] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:16:01] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 18:16:01] [INFO ] Invariant cache hit.
[2024-05-29 18:16:01] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-29 18:16:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-29 18:16:03] [INFO ] Deduced a trap composed of 165 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:16:03] [INFO ] Deduced a trap composed of 167 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:16:04] [INFO ] Deduced a trap composed of 165 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:16:04] [INFO ] Deduced a trap composed of 164 places in 84 ms of which 1 ms to minimize.
[2024-05-29 18:16:04] [INFO ] Deduced a trap composed of 165 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/505 variables, 232/240 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 240 constraints, problems are : Problem set: 0 solved, 272 unsolved in 11233 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/505 variables, 232/240 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 272/512 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-29 18:16:16] [INFO ] Deduced a trap composed of 183 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:16:17] [INFO ] Deduced a trap composed of 162 places in 63 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-29 18:16:19] [INFO ] Deduced a trap composed of 164 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:16:19] [INFO ] Deduced a trap composed of 160 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/505 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 516 constraints, problems are : Problem set: 0 solved, 272 unsolved in 17283 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 9/9 constraints]
After SMT, in 28547ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 28551ms
Starting structural reductions in LTL mode, iteration 1 : 232/257 places, 273/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28747 ms. Remains : 232/257 places, 273/298 transitions.
[2024-05-29 18:16:29] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:16:29] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:16:29] [INFO ] Input system was already deterministic with 273 transitions.
[2024-05-29 18:16:29] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:16:29] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:16:29] [INFO ] Time to serialize gal into /tmp/CTLFireability17046215685489129082.gal : 1 ms
[2024-05-29 18:16:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5811920649050203909.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/CTLFireability17046215685489129082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5811920649050203909.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,137416,0.239006,13324,2,2560,5,31425,6,0,1203,47644,0


Converting to forward existential form...Done !
original formula: AX(((EG((p201!=1)) * !(E((p281==1) U (p62==1)))) * EG((p36!=1))))
=> equivalent forward existential formula: (([(EY(Init) * !(EG((p201!=1))))] = FALSE * [(FwdU(EY(Init),(p281==1)) * (p62==1))] = FALSE) * [(EY(Init) * !(EG...177
Reverse transition relation is NOT exact ! Due to transitions t17, t23, t44, t53, t87, t88, t89, t122, t123, t124, t125, t141, t150, t185, t186, t187, t200...293
Hit Full ! (commute/partial/dont) 268/0/5
(forward)formula 0,1,27.0657,848384,1,0,1442,6.41572e+06,581,743,6515,3.76176e+06,1802
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 237 transition count 278
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 237 transition count 278
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 230 transition count 271
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 229 transition count 270
Applied a total of 56 rules in 17 ms. Remains 229 /257 variables (removed 28) and now considering 270/298 (removed 28) transitions.
// Phase 1: matrix 270 rows 229 cols
[2024-05-29 18:16:57] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:16:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 18:16:57] [INFO ] Invariant cache hit.
[2024-05-29 18:16:57] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-05-29 18:16:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:16:59] [INFO ] Deduced a trap composed of 164 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:17:00] [INFO ] Deduced a trap composed of 164 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:17:00] [INFO ] Deduced a trap composed of 164 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:17:00] [INFO ] Deduced a trap composed of 163 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:17:00] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 1 ms to minimize.
[2024-05-29 18:17:00] [INFO ] Deduced a trap composed of 164 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/499 variables, 229/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 238 constraints, problems are : Problem set: 0 solved, 269 unsolved in 11366 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:17:10] [INFO ] Deduced a trap composed of 164 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 270/499 variables, 229/239 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 269/508 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:17:17] [INFO ] Deduced a trap composed of 162 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/499 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/499 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 509 constraints, problems are : Problem set: 0 solved, 269 unsolved in 20286 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 8/8 constraints]
After SMT, in 31696ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 31699ms
Starting structural reductions in LTL mode, iteration 1 : 229/257 places, 270/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31903 ms. Remains : 229/257 places, 270/298 transitions.
[2024-05-29 18:17:29] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:17:29] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:17:29] [INFO ] Input system was already deterministic with 270 transitions.
[2024-05-29 18:17:29] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:17:29] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:17:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7321716030373330316.gal : 16 ms
[2024-05-29 18:17:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4056364186151554690.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/CTLFireability7321716030373330316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4056364186151554690.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,130999,0.223651,11724,2,1890,5,26858,6,0,1188,37899,0


Converting to forward existential form...Done !
original formula: A((p20!=1) U ((EF(AX(AX((p52==1)))) * EG(((((p81==1)&&(p199==1))&&(p144!=1)) + AF(((p97==1)&&(p207==1)))))) * ((p25==1)&&(p172==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(((E(TRUE U !(EX(!(!(EX(!((p52==1)))))))) * EG(((((p81==1)&&(p199==1))&&(p144!=1)) + !(EG(!(((p9...538
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t183, t184, t185, t218, t219, t221, t2...265
Using saturation style SCC detection
(forward)formula 0,0,17.3492,524860,1,0,946,3.87621e+06,581,526,7194,2.1968e+06,1462
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-10 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 : 257/257 places, 298/298 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 236 transition count 277
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 236 transition count 277
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 229 transition count 270
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 269
Applied a total of 58 rules in 9 ms. Remains 228 /257 variables (removed 29) and now considering 269/298 (removed 29) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-29 18:17:46] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:17:46] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-29 18:17:46] [INFO ] Invariant cache hit.
[2024-05-29 18:17:46] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:17:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:17:49] [INFO ] Deduced a trap composed of 164 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:17:49] [INFO ] Deduced a trap composed of 164 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:17:49] [INFO ] Deduced a trap composed of 163 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:17:50] [INFO ] Deduced a trap composed of 162 places in 98 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:17:56] [INFO ] Deduced a trap composed of 162 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 14657 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11155 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 25838ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 25841ms
Starting structural reductions in LTL mode, iteration 1 : 228/257 places, 269/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26053 ms. Remains : 228/257 places, 269/298 transitions.
[2024-05-29 18:18:12] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:18:12] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:18:12] [INFO ] Input system was already deterministic with 269 transitions.
[2024-05-29 18:18:12] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:18:12] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:18:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4637565187076349855.gal : 1 ms
[2024-05-29 18:18:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7936773483006966459.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/CTLFireability4637565187076349855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7936773483006966459.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,130047,0.204965,11456,2,1866,5,26218,6,0,1183,36497,0


Converting to forward existential form...Done !
original formula: A(!(AF((AG((p245!=1)) * AX((p40==1))))) U AG(A(EX(EX((p92==1))) U ((!((p174==1)||(p165==1)))||(p213==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((E(!(((!((p174==1)||(p165==1)))||(p213==1))) U (!(EX(EX((p92==1)))) * !(((!((p17...705
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t183, t184, t185, t218, t219, t221, t2...265
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,23.4006,750000,1,0,994,5.69548e+06,580,678,7169,3.33513e+06,1507
FORMULA StigmergyElection-PT-02b-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 241 transition count 282
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 241 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 236 transition count 277
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 236 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 276
Applied a total of 44 rules in 6 ms. Remains 235 /257 variables (removed 22) and now considering 276/298 (removed 22) transitions.
// Phase 1: matrix 276 rows 235 cols
[2024-05-29 18:18:36] [INFO ] Computed 3 invariants in 7 ms
[2024-05-29 18:18:36] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 18:18:36] [INFO ] Invariant cache hit.
[2024-05-29 18:18:36] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-05-29 18:18:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 18:18:39] [INFO ] Deduced a trap composed of 166 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:18:39] [INFO ] Deduced a trap composed of 167 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:18:39] [INFO ] Deduced a trap composed of 165 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:18:39] [INFO ] Deduced a trap composed of 167 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/511 variables, 235/242 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/511 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 242 constraints, problems are : Problem set: 0 solved, 275 unsolved in 11857 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/511 variables, 235/242 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 275/517 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/511 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 517 constraints, problems are : Problem set: 0 solved, 275 unsolved in 11678 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 4/4 constraints]
After SMT, in 23562ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 23575ms
Starting structural reductions in LTL mode, iteration 1 : 235/257 places, 276/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23803 ms. Remains : 235/257 places, 276/298 transitions.
[2024-05-29 18:19:00] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:19:00] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:19:00] [INFO ] Input system was already deterministic with 276 transitions.
[2024-05-29 18:19:00] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:19:00] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:19:00] [INFO ] Time to serialize gal into /tmp/CTLFireability507798136003181482.gal : 14 ms
[2024-05-29 18:19:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4189475249181298256.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/CTLFireability507798136003181482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4189475249181298256.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 -...282
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,136347,0.302287,11756,2,1733,5,27251,6,0,1218,39691,0


Converting to forward existential form...Done !
original formula: EF((((p53==1) * EX(AF(((p24==1)&&(p282==1))))) * (A(!((AX((p83==1)) + E((p103==1) U (p88==1)))) U (AX(((p117==1)||(p139==1))) + AG(A((p9=...342
=> equivalent forward existential formula: ((([(((((FwdU(Init,TRUE) * ((p53==1) * EX(!(EG(!(((p24==1)&&(p282==1)))))))) * !((E(!((!(EX(!(((p117==1)||(p139=...2485
Reverse transition relation is NOT exact ! Due to transitions t43, t88, t89, t122, t123, t127, t142, t151, t168, t187, t188, t190, t223, t224, t226, t239, ...267
Detected timeout of ITS tools.
[2024-05-29 18:19:30] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:19:30] [INFO ] Applying decomposition
[2024-05-29 18:19:30] [INFO ] Flatten gal took : 5 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/graph12281546786693054199.txt' '-o' '/tmp/graph12281546786693054199.bin' '-w' '/tmp/graph12281546786693054199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12281546786693054199.bin' '-l' '-1' '-v' '-w' '/tmp/graph12281546786693054199.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:19:30] [INFO ] Decomposing Gal with order
[2024-05-29 18:19:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:19:30] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-29 18:19:30] [INFO ] Flatten gal took : 43 ms
[2024-05-29 18:19:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 18:19:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10306890613873669000.gal : 4 ms
[2024-05-29 18:19:30] [INFO ] Time to serialize properties into /tmp/CTLFireability5973551463067867792.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/CTLFireability10306890613873669000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5973551463067867792.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,136347,0.046469,5464,271,15,2324,215,477,2826,40,466,0


Converting to forward existential form...Done !
original formula: EF((((i5.u22.p53==1) * EX(AF(((i1.i0.u8.p24==1)&&(i17.i1.u89.p282==1))))) * (A(!((AX((i2.i0.u1.p83==1)) + E((i6.i1.u34.p103==1) U (i4.i1....551
=> equivalent forward existential formula: ((([(((((FwdU(Init,TRUE) * ((i5.u22.p53==1) * EX(!(EG(!(((i1.i0.u8.p24==1)&&(i17.i1.u89.p282==1)))))))) * !((E(!...3502
Reverse transition relation is NOT exact ! Due to transitions t43, t89, t122, t123, t127, t142, t188, t190, t224, t226, t239, t241, i0.i0.u5.t223, i2.i0.u1...310
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,1.42494,69608,1,0,125381,230,3656,216606,213,466,322751
FORMULA StigmergyElection-PT-02b-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 237 transition count 278
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 237 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 231 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 271
Applied a total of 54 rules in 13 ms. Remains 230 /257 variables (removed 27) and now considering 271/298 (removed 27) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-05-29 18:19:31] [INFO ] Computed 3 invariants in 6 ms
[2024-05-29 18:19:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 18:19:31] [INFO ] Invariant cache hit.
[2024-05-29 18:19:32] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-29 18:19:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:19:34] [INFO ] Deduced a trap composed of 164 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:19:35] [INFO ] Deduced a trap composed of 163 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:19:35] [INFO ] Deduced a trap composed of 165 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:19:35] [INFO ] Deduced a trap composed of 165 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:19:35] [INFO ] Deduced a trap composed of 164 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:19:35] [INFO ] Deduced a trap composed of 164 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 239 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11685 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/509 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 509 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10831 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 6/6 constraints]
After SMT, in 22544ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 22547ms
Starting structural reductions in LTL mode, iteration 1 : 230/257 places, 271/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22744 ms. Remains : 230/257 places, 271/298 transitions.
[2024-05-29 18:19:54] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:19:54] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:19:54] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-29 18:19:54] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:19:54] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:19:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1977440981654701501.gal : 1 ms
[2024-05-29 18:19:54] [INFO ] Time to serialize properties into /tmp/CTLFireability14348509119314230471.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/CTLFireability1977440981654701501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14348509119314230471.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,131755,0.230877,11492,2,1790,5,27000,6,0,1193,36329,0


Converting to forward existential form...Done !
original formula: AX((A((p198!=1) U ((p192==1)||(p275==1))) + (p283==1)))
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !((p283==1))),!(((p192==1)||(p275==1)))) * (!((p198!=1)) * !(((p192==1)||(p275==1)))))] = FA...229
Hit Full ! (commute/partial/dont) 267/4/4
(forward)formula 0,0,2.8299,83808,1,0,68,431142,22,6,5442,359212,63
FORMULA StigmergyElection-PT-02b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 236 transition count 277
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 236 transition count 277
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 229 transition count 270
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 269
Applied a total of 58 rules in 7 ms. Remains 228 /257 variables (removed 29) and now considering 269/298 (removed 29) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-29 18:19:57] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 18:19:57] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 18:19:57] [INFO ] Invariant cache hit.
[2024-05-29 18:19:57] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:19:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:20:00] [INFO ] Deduced a trap composed of 164 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:20:00] [INFO ] Deduced a trap composed of 164 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:20:00] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:20:01] [INFO ] Deduced a trap composed of 162 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:20:07] [INFO ] Deduced a trap composed of 162 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 15169 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11587 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 26781ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 26784ms
Starting structural reductions in LTL mode, iteration 1 : 228/257 places, 269/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26968 ms. Remains : 228/257 places, 269/298 transitions.
[2024-05-29 18:20:24] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:20:24] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:20:24] [INFO ] Input system was already deterministic with 269 transitions.
[2024-05-29 18:20:24] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:20:24] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:20:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14539853241668975239.gal : 18 ms
[2024-05-29 18:20:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12204635446642754284.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/CTLFireability14539853241668975239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12204635446642754284.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,130047,0.204919,11484,2,1866,5,26218,6,0,1183,36497,0


Converting to forward existential form...Done !
original formula: EG(((p252==0) + EF(((p66==0) + EX((p110==1))))))
=> equivalent forward existential formula: [FwdG(Init,((p252==0) + E(TRUE U ((p66==0) + EX((p110==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t183, t184, t185, t218, t219, t221, t2...265
(forward)formula 0,1,3.10284,102004,1,0,405,455715,565,259,7173,442861,612
FORMULA StigmergyElection-PT-02b-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 298/298 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 236 transition count 277
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 236 transition count 277
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 231 transition count 272
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 271
Applied a total of 54 rules in 7 ms. Remains 230 /257 variables (removed 27) and now considering 271/298 (removed 27) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-05-29 18:20:27] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:20:27] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 18:20:27] [INFO ] Invariant cache hit.
[2024-05-29 18:20:27] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-29 18:20:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:20:30] [INFO ] Deduced a trap composed of 163 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:20:30] [INFO ] Deduced a trap composed of 165 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:20:30] [INFO ] Deduced a trap composed of 164 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:20:31] [INFO ] Deduced a trap composed of 165 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:20:31] [INFO ] Deduced a trap composed of 164 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:20:31] [INFO ] Deduced a trap composed of 164 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:20:31] [INFO ] Deduced a trap composed of 165 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 240 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11725 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/510 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:20:44] [INFO ] Deduced a trap composed of 162 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:20:47] [INFO ] Deduced a trap composed of 188 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:20:50] [INFO ] Deduced a trap composed of 164 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/501 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 513 constraints, problems are : Problem set: 0 solved, 270 unsolved in 21714 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 10/10 constraints]
After SMT, in 33464ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 33467ms
Starting structural reductions in LTL mode, iteration 1 : 230/257 places, 271/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33677 ms. Remains : 230/257 places, 271/298 transitions.
[2024-05-29 18:21:01] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:21:01] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:21:01] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-29 18:21:01] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:21:01] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:21:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7614562196672814455.gal : 2 ms
[2024-05-29 18:21:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9322265186930806822.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/CTLFireability7614562196672814455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9322265186930806822.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,136777,0.260422,14660,2,2361,5,32980,6,0,1193,54830,0


Converting to forward existential form...Done !
original formula: EX(EG((((AG((p94==0)) + EF((p272==0))) + ((p135==1) + (E(((p50==1)&&(p172==1)) U (p33==1)) * (EX((p134==1)) + (p283==0))))) + ((((p120==1...207
=> equivalent forward existential formula: [FwdG(EY(Init),(((!(E(TRUE U !((p94==0)))) + E(TRUE U (p272==0))) + ((p135==1) + (E(((p50==1)&&(p172==1)) U (p33...268
Reverse transition relation is NOT exact ! Due to transitions t17, t23, t44, t53, t87, t88, t89, t122, t123, t124, t125, t141, t150, t184, t185, t186, t219...287
(forward)formula 0,1,7.45989,246696,1,0,466,1.49778e+06,578,291,7227,991680,687
FORMULA StigmergyElection-PT-02b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 18:21:08] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:21:08] [INFO ] Flatten gal took : 5 ms
Total runtime 587762 ms.

BK_STOP 1717006869062

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="StigmergyElection-PT-02b"
export BK_EXAMINATION="CTLFireability"
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 StigmergyElection-PT-02b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531900258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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