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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 18:44 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 117K 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-03b-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717006769206

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-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 18:19:30] [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:19:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:19:30] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-29 18:19:30] [INFO ] Transformed 427 places.
[2024-05-29 18:19:30] [INFO ] Transformed 518 transitions.
[2024-05-29 18:19:30] [INFO ] Found NUPN structural information;
[2024-05-29 18:19:30] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 91 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 387 transition count 478
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 387 transition count 478
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 94 place count 373 transition count 464
Iterating global reduction 0 with 14 rules applied. Total rules applied 108 place count 373 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 371 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 371 transition count 462
Applied a total of 112 rules in 86 ms. Remains 371 /427 variables (removed 56) and now considering 462/518 (removed 56) transitions.
// Phase 1: matrix 462 rows 371 cols
[2024-05-29 18:19:30] [INFO ] Computed 4 invariants in 21 ms
[2024-05-29 18:19:31] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-29 18:19:31] [INFO ] Invariant cache hit.
[2024-05-29 18:19:31] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-05-29 18:19:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-29 18:19:36] [INFO ] Deduced a trap composed of 175 places in 133 ms of which 23 ms to minimize.
[2024-05-29 18:19:36] [INFO ] Deduced a trap composed of 173 places in 107 ms of which 2 ms to minimize.
[2024-05-29 18:19:37] [INFO ] Deduced a trap composed of 176 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:19:37] [INFO ] Deduced a trap composed of 173 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:19:37] [INFO ] Deduced a trap composed of 172 places in 102 ms of which 2 ms to minimize.
[2024-05-29 18:19:37] [INFO ] Deduced a trap composed of 172 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:19:37] [INFO ] Deduced a trap composed of 173 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:19:38] [INFO ] Deduced a trap composed of 177 places in 93 ms of which 3 ms to minimize.
[2024-05-29 18:19:39] [INFO ] Deduced a trap composed of 175 places in 93 ms of which 3 ms to minimize.
[2024-05-29 18:19:39] [INFO ] Deduced a trap composed of 228 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:19:40] [INFO ] Deduced a trap composed of 180 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:19:41] [INFO ] Deduced a trap composed of 171 places in 111 ms of which 3 ms to minimize.
[2024-05-29 18:19:41] [INFO ] Deduced a trap composed of 177 places in 100 ms of which 2 ms to minimize.
[2024-05-29 18:19:41] [INFO ] Deduced a trap composed of 173 places in 98 ms of which 2 ms to minimize.
[2024-05-29 18:19:41] [INFO ] Deduced a trap composed of 173 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:19:41] [INFO ] Deduced a trap composed of 173 places in 101 ms of which 2 ms to minimize.
[2024-05-29 18:19:41] [INFO ] Deduced a trap composed of 171 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:19:41] [INFO ] Deduced a trap composed of 173 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-29 18:19:44] [INFO ] Deduced a trap composed of 175 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (OVERLAPS) 462/833 variables, 371/394 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-29 18:19:58] [INFO ] Deduced a trap composed of 170 places in 104 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 833/833 variables, and 395 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 462/833 variables, 371/395 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 461/856 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-29 18:20:09] [INFO ] Deduced a trap composed of 213 places in 126 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/833 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/833 variables, and 857 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 21/21 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 371/427 places, 462/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 371/427 places, 462/518 transitions.
Support contains 91 out of 371 places after structural reductions.
[2024-05-29 18:20:31] [INFO ] Flatten gal took : 53 ms
[2024-05-29 18:20:31] [INFO ] Flatten gal took : 24 ms
[2024-05-29 18:20:31] [INFO ] Input system was already deterministic with 462 transitions.
RANDOM walk for 40000 steps (685 resets) in 1844 ms. (21 steps per ms) remains 29/73 properties
BEST_FIRST walk for 4003 steps (14 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (14 resets) in 62 ms. (63 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (17 resets) in 68 ms. (58 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (14 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (15 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (13 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 43 ms. (90 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
[2024-05-29 18:20:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 322/371 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-05-29 18:20:32] [INFO ] Deduced a trap composed of 173 places in 85 ms of which 2 ms to minimize.
Problem AtomicPropp49 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 1/5 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 462/833 variables, 371/376 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 0/376 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/833 variables, 0/376 constraints. Problems are: Problem set: 4 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 833/833 variables, and 376 constraints, problems are : Problem set: 4 solved, 25 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 332/371 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 1/5 constraints. Problems are: Problem set: 4 solved, 25 unsolved
[2024-05-29 18:20:34] [INFO ] Deduced a trap composed of 172 places in 116 ms of which 3 ms to minimize.
[2024-05-29 18:20:34] [INFO ] Deduced a trap composed of 180 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:20:34] [INFO ] Deduced a trap composed of 173 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:20:34] [INFO ] Deduced a trap composed of 173 places in 111 ms of which 2 ms to minimize.
[2024-05-29 18:20:34] [INFO ] Deduced a trap composed of 170 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:20:34] [INFO ] Deduced a trap composed of 213 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 6/11 constraints. Problems are: Problem set: 4 solved, 25 unsolved
[2024-05-29 18:20:35] [INFO ] Deduced a trap composed of 228 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:20:35] [INFO ] Deduced a trap composed of 213 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 2/13 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 462/833 variables, 371/384 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/833 variables, 25/409 constraints. Problems are: Problem set: 4 solved, 25 unsolved
[2024-05-29 18:20:35] [INFO ] Deduced a trap composed of 171 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:20:36] [INFO ] Deduced a trap composed of 175 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:20:36] [INFO ] Deduced a trap composed of 173 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/833 variables, 3/412 constraints. Problems are: Problem set: 4 solved, 25 unsolved
[2024-05-29 18:20:36] [INFO ] Deduced a trap composed of 170 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:20:37] [INFO ] Deduced a trap composed of 171 places in 102 ms of which 4 ms to minimize.
[2024-05-29 18:20:37] [INFO ] Deduced a trap composed of 173 places in 89 ms of which 3 ms to minimize.
[2024-05-29 18:20:37] [INFO ] Deduced a trap composed of 172 places in 80 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/833 variables, 4/416 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/833 variables, 0/416 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/833 variables, 0/416 constraints. Problems are: Problem set: 4 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 833/833 variables, and 416 constraints, problems are : Problem set: 4 solved, 25 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 25/29 constraints, Known Traps: 16/16 constraints]
After SMT, in 6345ms problems are : Problem set: 4 solved, 25 unsolved
Fused 25 Parikh solutions to 17 different solutions.
Parikh walk visited 1 properties in 1707 ms.
Support contains 37 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 462/462 transitions.
Graph (trivial) has 322 edges and 371 vertex of which 33 / 371 are part of one of the 5 SCC in 3 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 557 edges and 343 vertex of which 342 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 191 rules applied. Total rules applied 193 place count 342 transition count 236
Reduce places removed 190 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 196 rules applied. Total rules applied 389 place count 152 transition count 230
Reduce places removed 3 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 12 rules applied. Total rules applied 401 place count 149 transition count 221
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 412 place count 140 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 413 place count 139 transition count 219
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 413 place count 139 transition count 202
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 447 place count 122 transition count 202
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 452 place count 117 transition count 197
Iterating global reduction 5 with 5 rules applied. Total rules applied 457 place count 117 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 457 place count 117 transition count 196
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 459 place count 116 transition count 196
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 481 place count 105 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 483 place count 105 transition count 183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 484 place count 104 transition count 177
Iterating global reduction 6 with 1 rules applied. Total rules applied 485 place count 104 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 486 place count 104 transition count 176
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 498 place count 98 transition count 170
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 7 with 8 rules applied. Total rules applied 506 place count 94 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 510 place count 94 transition count 170
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 532 place count 94 transition count 148
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 554 place count 72 transition count 148
Applied a total of 554 rules in 81 ms. Remains 72 /371 variables (removed 299) and now considering 148/462 (removed 314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 72/371 places, 148/462 transitions.
RANDOM walk for 40000 steps (11 resets) in 537 ms. (74 steps per ms) remains 12/24 properties
BEST_FIRST walk for 40000 steps (49 resets) in 155 ms. (256 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40001 steps (70 resets) in 104 ms. (380 steps per ms) remains 2/3 properties
BEST_FIRST walk for 21048 steps (34 resets) in 68 ms. (305 steps per ms) remains 0/2 properties
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-29 18:20:41] [INFO ] Flatten gal took : 21 ms
[2024-05-29 18:20:41] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:20:41] [INFO ] Input system was already deterministic with 462 transitions.
Computed a total of 48 stabilizing places and 51 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 351 transition count 442
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 351 transition count 442
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 342 transition count 433
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 342 transition count 433
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 338 transition count 429
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 336 transition count 427
Applied a total of 70 rules in 25 ms. Remains 336 /371 variables (removed 35) and now considering 427/462 (removed 35) transitions.
// Phase 1: matrix 427 rows 336 cols
[2024-05-29 18:20:41] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 18:20:41] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 18:20:41] [INFO ] Invariant cache hit.
[2024-05-29 18:20:41] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-05-29 18:20:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:20:46] [INFO ] Deduced a trap composed of 218 places in 108 ms of which 2 ms to minimize.
[2024-05-29 18:20:47] [INFO ] Deduced a trap composed of 164 places in 85 ms of which 1 ms to minimize.
[2024-05-29 18:20:47] [INFO ] Deduced a trap composed of 164 places in 94 ms of which 3 ms to minimize.
[2024-05-29 18:20:47] [INFO ] Deduced a trap composed of 165 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:20:47] [INFO ] Deduced a trap composed of 163 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:20:47] [INFO ] Deduced a trap composed of 164 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:20:48] [INFO ] Deduced a trap composed of 164 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:20:48] [INFO ] Deduced a trap composed of 164 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:20:48] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:20:48] [INFO ] Deduced a trap composed of 162 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 165 places in 98 ms of which 2 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 164 places in 103 ms of which 3 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 167 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 165 places in 102 ms of which 3 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 164 places in 90 ms of which 3 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 163 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 163 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:20:50] [INFO ] Deduced a trap composed of 166 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 427/763 variables, 336/358 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (OVERLAPS) 0/763 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 763/763 variables, and 358 constraints, problems are : Problem set: 0 solved, 426 unsolved in 27472 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:21:13] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/763 variables, 336/359 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 426/785 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:21:31] [INFO ] Deduced a trap composed of 165 places in 134 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/763 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 786 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 20/20 constraints]
After SMT, in 57567ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 57572ms
Starting structural reductions in LTL mode, iteration 1 : 336/371 places, 427/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57871 ms. Remains : 336/371 places, 427/462 transitions.
[2024-05-29 18:21:39] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:21:39] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:21:39] [INFO ] Input system was already deterministic with 427 transitions.
[2024-05-29 18:21:39] [INFO ] Flatten gal took : 30 ms
[2024-05-29 18:21:39] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:21:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3077176108050557641.gal : 24 ms
[2024-05-29 18:21:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7050474216994107167.ctl : 16 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/CTLFireability3077176108050557641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7050474216994107167.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05015e+07,1.72905,52340,2,6201,5,159577,6,0,1773,241073,0


Converting to forward existential form...Done !
original formula: AG((EX(TRUE) * (p157==0)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE * [(FwdU(Init,TRUE) * !((p157==0)))] = FALSE)
(forward)formula 0,0,1.73677,52340,1,0,8,159577,9,2,1778,241073,1
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-00 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 : 371/371 places, 462/462 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 351 transition count 442
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 351 transition count 442
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 343 transition count 434
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 343 transition count 434
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 337 transition count 428
Applied a total of 68 rules in 88 ms. Remains 337 /371 variables (removed 34) and now considering 428/462 (removed 34) transitions.
// Phase 1: matrix 428 rows 337 cols
[2024-05-29 18:21:41] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 18:21:41] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-29 18:21:41] [INFO ] Invariant cache hit.
[2024-05-29 18:21:41] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-05-29 18:21:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:21:46] [INFO ] Deduced a trap composed of 163 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:21:47] [INFO ] Deduced a trap composed of 163 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:21:47] [INFO ] Deduced a trap composed of 166 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:21:48] [INFO ] Deduced a trap composed of 164 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:21:48] [INFO ] Deduced a trap composed of 164 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:21:48] [INFO ] Deduced a trap composed of 165 places in 105 ms of which 2 ms to minimize.
[2024-05-29 18:21:48] [INFO ] Deduced a trap composed of 164 places in 103 ms of which 3 ms to minimize.
[2024-05-29 18:21:49] [INFO ] Deduced a trap composed of 165 places in 102 ms of which 2 ms to minimize.
[2024-05-29 18:21:49] [INFO ] Deduced a trap composed of 167 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:21:49] [INFO ] Deduced a trap composed of 163 places in 100 ms of which 3 ms to minimize.
[2024-05-29 18:21:49] [INFO ] Deduced a trap composed of 166 places in 99 ms of which 2 ms to minimize.
[2024-05-29 18:21:49] [INFO ] Deduced a trap composed of 165 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:21:49] [INFO ] Deduced a trap composed of 165 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:21:49] [INFO ] Deduced a trap composed of 163 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:21:51] [INFO ] Deduced a trap composed of 167 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:21:51] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:21:53] [INFO ] Deduced a trap composed of 164 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/765 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/765 variables, and 358 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 428/765 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/765 variables, 427/785 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:22:23] [INFO ] Deduced a trap composed of 164 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:22:24] [INFO ] Deduced a trap composed of 163 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 2/787 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 164 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/765 variables, and 788 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 20/20 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 337/371 places, 428/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60654 ms. Remains : 337/371 places, 428/462 transitions.
[2024-05-29 18:22:41] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:22:41] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:22:41] [INFO ] Input system was already deterministic with 428 transitions.
[2024-05-29 18:22:41] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:22:41] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:22:41] [INFO ] Time to serialize gal into /tmp/CTLFireability6311174207657617963.gal : 4 ms
[2024-05-29 18:22:41] [INFO ] Time to serialize properties into /tmp/CTLFireability18098392271823811837.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/CTLFireability6311174207657617963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18098392271823811837.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05587e+07,1.77772,54428,2,6195,5,165398,6,0,1778,249932,0


Converting to forward existential form...Done !
original formula: AX((AG((p20==0)) + EG(((p266==1)||(p198==1)))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(EG(((p266==1)||(p198==1))))),TRUE) * !((p20==0)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t193, t194, t195, t228, t229, t231, t2...319
(forward)formula 0,0,25.1857,687412,1,0,901,3.78293e+06,881,512,11192,2.84613e+06,1357
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-01 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 : 371/371 places, 462/462 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 350 transition count 441
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 350 transition count 441
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 341 transition count 432
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 341 transition count 432
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 337 transition count 428
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 335 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 335 transition count 426
Applied a total of 72 rules in 21 ms. Remains 335 /371 variables (removed 36) and now considering 426/462 (removed 36) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-29 18:23:07] [INFO ] Computed 4 invariants in 7 ms
[2024-05-29 18:23:07] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 18:23:07] [INFO ] Invariant cache hit.
[2024-05-29 18:23:07] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-29 18:23:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:13] [INFO ] Deduced a trap composed of 164 places in 105 ms of which 5 ms to minimize.
[2024-05-29 18:23:13] [INFO ] Deduced a trap composed of 163 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:23:13] [INFO ] Deduced a trap composed of 164 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:23:14] [INFO ] Deduced a trap composed of 164 places in 95 ms of which 1 ms to minimize.
[2024-05-29 18:23:14] [INFO ] Deduced a trap composed of 164 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:23:14] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:23:15] [INFO ] Deduced a trap composed of 165 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:23:15] [INFO ] Deduced a trap composed of 200 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:23:15] [INFO ] Deduced a trap composed of 165 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:23:15] [INFO ] Deduced a trap composed of 163 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:16] [INFO ] Deduced a trap composed of 163 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:23:17] [INFO ] Deduced a trap composed of 163 places in 98 ms of which 2 ms to minimize.
[2024-05-29 18:23:17] [INFO ] Deduced a trap composed of 165 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:23] [INFO ] Deduced a trap composed of 163 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:23:23] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:25] [INFO ] Deduced a trap composed of 163 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 426/761 variables, 335/355 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:37] [INFO ] Deduced a trap composed of 165 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:23:37] [INFO ] Deduced a trap composed of 163 places in 90 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 timeout
0.0)
(s70 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 761/761 variables, and 357 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:42] [INFO ] Deduced a trap composed of 164 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/358 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 425/783 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-29 18:23:48] [INFO ] Deduced a trap composed of 162 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 784 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 20/20 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 335/371 places, 426/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60401 ms. Remains : 335/371 places, 426/462 transitions.
[2024-05-29 18:24:07] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:24:07] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:24:07] [INFO ] Input system was already deterministic with 426 transitions.
[2024-05-29 18:24:07] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:24:07] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:24:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11660162123736711405.gal : 4 ms
[2024-05-29 18:24:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10409663331956618249.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/CTLFireability11660162123736711405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10409663331956618249.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04368e+07,1.70713,52764,2,6563,5,163098,6,0,1768,240578,0


Converting to forward existential form...Done !
original formula: (EF(AX(AX(((p244==1) * EX((p310==1)))))) * EG(AG(AX(AF((p350==1))))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U !(EX(!(!(EX(!(((p244==1) * EX((p310==1))))))))))),!(E(TRUE U !(!(EX(!(!(EG(!((p350==1))))...172
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
Detected timeout of ITS tools.
[2024-05-29 18:24:37] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:24:37] [INFO ] Applying decomposition
[2024-05-29 18:24:37] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10193154818164456177.txt' '-o' '/tmp/graph10193154818164456177.bin' '-w' '/tmp/graph10193154818164456177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10193154818164456177.bin' '-l' '-1' '-v' '-w' '/tmp/graph10193154818164456177.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:24:37] [INFO ] Decomposing Gal with order
[2024-05-29 18:24:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:24:38] [INFO ] Removed a total of 330 redundant transitions.
[2024-05-29 18:24:38] [INFO ] Flatten gal took : 55 ms
[2024-05-29 18:24:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2024-05-29 18:24:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11769851977361888761.gal : 17 ms
[2024-05-29 18:24:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2364372975873420840.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/CTLFireability11769851977361888761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2364372975873420840.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,1.04368e+07,0.112978,7732,669,20,6639,453,647,7831,71,970,0


Converting to forward existential form...Done !
original formula: (EF(AX(AX(((i10.u71.p244==1) * EX((i17.i0.u89.p310==1)))))) * EG(AG(AX(AF((i19.i1.u100.p350==1))))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U !(EX(!(!(EX(!(((i10.u71.p244==1) * EX((i17.i0.u89.p310==1))))))))))),!(E(TRUE U !(!(EX(!(...203
Reverse transition relation is NOT exact ! Due to transitions t96, t129, t130, t132, t149, t194, t227, t228, t230, t291, t324, t325, t327, t344, t345, t347...398
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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,0,2.69945,108580,1,0,213538,552,4715,324005,317,1427,535133
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 353 transition count 444
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 353 transition count 444
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 345 transition count 436
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 345 transition count 436
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 342 transition count 433
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 342 transition count 433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 340 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 340 transition count 431
Applied a total of 62 rules in 35 ms. Remains 340 /371 variables (removed 31) and now considering 431/462 (removed 31) transitions.
// Phase 1: matrix 431 rows 340 cols
[2024-05-29 18:24:40] [INFO ] Computed 4 invariants in 5 ms
[2024-05-29 18:24:40] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-29 18:24:40] [INFO ] Invariant cache hit.
[2024-05-29 18:24:41] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-05-29 18:24:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 18:24:45] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 14 ms to minimize.
[2024-05-29 18:24:46] [INFO ] Deduced a trap composed of 164 places in 102 ms of which 3 ms to minimize.
[2024-05-29 18:24:46] [INFO ] Deduced a trap composed of 166 places in 100 ms of which 3 ms to minimize.
[2024-05-29 18:24:46] [INFO ] Deduced a trap composed of 162 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:24:47] [INFO ] Deduced a trap composed of 163 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:24:47] [INFO ] Deduced a trap composed of 166 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:24:47] [INFO ] Deduced a trap composed of 164 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:24:47] [INFO ] Deduced a trap composed of 166 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:24:48] [INFO ] Deduced a trap composed of 168 places in 97 ms of which 3 ms to minimize.
[2024-05-29 18:24:48] [INFO ] Deduced a trap composed of 165 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:24:48] [INFO ] Deduced a trap composed of 164 places in 100 ms of which 3 ms to minimize.
[2024-05-29 18:24:49] [INFO ] Deduced a trap composed of 166 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:24:49] [INFO ] Deduced a trap composed of 164 places in 87 ms of which 1 ms to minimize.
[2024-05-29 18:24:49] [INFO ] Deduced a trap composed of 164 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:24:49] [INFO ] Deduced a trap composed of 166 places in 104 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 18:24:50] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:24:51] [INFO ] Deduced a trap composed of 166 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:24:51] [INFO ] Deduced a trap composed of 164 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 18:24:57] [INFO ] Deduced a trap composed of 165 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (OVERLAPS) 431/771 variables, 340/363 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 18:25:09] [INFO ] Deduced a trap composed of 163 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:25:10] [INFO ] Deduced a trap composed of 168 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 771/771 variables, and 365 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 431/771 variables, 340/365 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 430/795 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-29 18:25:18] [INFO ] Deduced a trap composed of 271 places in 111 ms of which 2 ms to minimize.
[2024-05-29 18:25:22] [INFO ] Deduced a trap composed of 166 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:25:22] [INFO ] Deduced a trap composed of 165 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:25:23] [INFO ] Deduced a trap composed of 166 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 4/799 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/771 variables, and 799 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 25/25 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 340/371 places, 431/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60458 ms. Remains : 340/371 places, 431/462 transitions.
[2024-05-29 18:25:41] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:25:41] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:25:41] [INFO ] Input system was already deterministic with 431 transitions.
[2024-05-29 18:25:41] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:25:41] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:25:41] [INFO ] Time to serialize gal into /tmp/CTLFireability10305584268699465531.gal : 2 ms
[2024-05-29 18:25:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13016904401857754147.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/CTLFireability10305584268699465531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13016904401857754147.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10639e+07,2.12308,61452,2,7431,5,175356,6,0,1793,292631,0


Converting to forward existential form...Done !
original formula: E((AF(EX(AF((p238==1)))) + EF(!(((((((p26==1)&&(p173==1))&&(p321==1))||(p145==1)) * E((p126==1) U (p361==1))) + E((p408==1) U (p162==1)))...199
=> equivalent forward existential formula: [(FwdU((FwdU(Init,(!(EG(!(EX(!(EG(!((p238==1)))))))) + E(TRUE U !(((((((p26==1)&&(p173==1))&&(p321==1))||(p145==...270
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t32, t53, t98, t99, t132, t133, t134, t135, t152, t161, t195, t196, t197, t230, t23...342
Detected timeout of ITS tools.
[2024-05-29 18:26:11] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:26:11] [INFO ] Applying decomposition
[2024-05-29 18:26:11] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8855666397525562574.txt' '-o' '/tmp/graph8855666397525562574.bin' '-w' '/tmp/graph8855666397525562574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8855666397525562574.bin' '-l' '-1' '-v' '-w' '/tmp/graph8855666397525562574.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:26:11] [INFO ] Decomposing Gal with order
[2024-05-29 18:26:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:26:11] [INFO ] Removed a total of 340 redundant transitions.
[2024-05-29 18:26:11] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:26:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-29 18:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability11285873426918859254.gal : 5 ms
[2024-05-29 18:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8451874329413339435.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/CTLFireability11285873426918859254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8451874329413339435.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,1.10639e+07,0.093673,7352,771,23,6048,404,652,6874,57,813,0


Converting to forward existential form...Done !
original formula: E((AF(EX(AF((i14.u73.p238==1)))) + EF(!(((((((i1.i0.u5.p26==1)&&(i11.i1.u52.p173==1))&&(i20.i0.u98.p321==1))||(i8.u42.p145==1)) * E((i2.i...309
=> equivalent forward existential formula: [(FwdU((FwdU(Init,(!(EG(!(EX(!(EG(!((i14.u73.p238==1)))))))) + E(TRUE U !(((((((i1.i0.u5.p26==1)&&(i11.i1.u52.p1...380
Reverse transition relation is NOT exact ! Due to transitions t53, t99, t133, t152, t197, t230, t231, t233, t294, t327, t328, t330, t347, t348, t350, i2.i2...439
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,7.13903,260528,1,0,502664,616,6069,780260,325,1991,994761
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Graph (trivial) has 343 edges and 371 vertex of which 40 / 371 are part of one of the 7 SCC in 3 ms
Free SCC test removed 33 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 212 place count 337 transition count 214
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 219 rules applied. Total rules applied 431 place count 126 transition count 206
Reduce places removed 4 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 21 rules applied. Total rules applied 452 place count 122 transition count 189
Reduce places removed 17 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 19 rules applied. Total rules applied 471 place count 105 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 472 place count 104 transition count 187
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 472 place count 104 transition count 173
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 500 place count 90 transition count 173
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 512 place count 78 transition count 160
Iterating global reduction 5 with 12 rules applied. Total rules applied 524 place count 78 transition count 160
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 525 place count 78 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 526 place count 77 transition count 159
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 527 place count 76 transition count 157
Iterating global reduction 7 with 1 rules applied. Total rules applied 528 place count 76 transition count 157
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 529 place count 75 transition count 155
Iterating global reduction 7 with 1 rules applied. Total rules applied 530 place count 75 transition count 155
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 542 place count 69 transition count 149
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 549 place count 62 transition count 116
Iterating global reduction 7 with 7 rules applied. Total rules applied 556 place count 62 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 559 place count 62 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 561 place count 61 transition count 112
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 562 place count 60 transition count 107
Iterating global reduction 8 with 1 rules applied. Total rules applied 563 place count 60 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 564 place count 60 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 568 place count 60 transition count 102
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 9 with 8 rules applied. Total rules applied 576 place count 56 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 577 place count 55 transition count 97
Applied a total of 577 rules in 56 ms. Remains 55 /371 variables (removed 316) and now considering 97/462 (removed 365) transitions.
[2024-05-29 18:26:18] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
// Phase 1: matrix 94 rows 55 cols
[2024-05-29 18:26:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:26:18] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 18:26:18] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
[2024-05-29 18:26:18] [INFO ] Invariant cache hit.
[2024-05-29 18:26:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:26:18] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-29 18:26:18] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-29 18:26:18] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
[2024-05-29 18:26:18] [INFO ] Invariant cache hit.
[2024-05-29 18:26:18] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 3/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:26:20] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 93/148 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 18:26:20] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:26:20] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 18:26:20] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 1/149 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (OVERLAPS) 0/149 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 79 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3196 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 3/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 93/148 variables, 55/74 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 90/168 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 1/149 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/149 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 169 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 17/17 constraints]
After SMT, in 5326ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5327ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/371 places, 97/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5475 ms. Remains : 55/371 places, 97/462 transitions.
[2024-05-29 18:26:24] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:26:24] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:26:24] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-29 18:26:24] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:26:24] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:26:24] [INFO ] Time to serialize gal into /tmp/CTLFireability11463120244938226233.gal : 1 ms
[2024-05-29 18:26:24] [INFO ] Time to serialize properties into /tmp/CTLFireability4828858685616282949.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/CTLFireability11463120244938226233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4828858685616282949.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,7540,0.063805,5932,2,1209,5,9271,6,0,311,10223,0


Converting to forward existential form...Done !
original formula: EF((AG((((p151==0)||(p391==1))||(p344==1))) * (AG((p60==0)) + ((E((p319==1) U (p121==1)) * (p17==0)) * A((p219==1) U (p175==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E(TRUE U !((((p151==0)||(p391==1))||(p344==1)))))) * !(E(TRUE U !((p60==0)))))] != FALSE...362
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t7, t10, t11, t14, t20, t21, t23, t63, t64, t66, t67, t68, t70, t71, t86, t87, t88, t...272
(forward)formula 0,1,0.866717,35228,1,0,239,179996,214,112,2378,110181,264
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Graph (trivial) has 375 edges and 371 vertex of which 57 / 371 are part of one of the 9 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 223 place count 322 transition count 185
Reduce places removed 222 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 228 rules applied. Total rules applied 451 place count 100 transition count 179
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 456 place count 97 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 458 place count 95 transition count 177
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 458 place count 95 transition count 167
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 478 place count 85 transition count 167
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 492 place count 71 transition count 151
Iterating global reduction 4 with 14 rules applied. Total rules applied 506 place count 71 transition count 151
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 4 with 2 rules applied. Total rules applied 508 place count 71 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 510 place count 69 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 510 place count 69 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 514 place count 67 transition count 147
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 517 place count 64 transition count 134
Iterating global reduction 6 with 3 rules applied. Total rules applied 520 place count 64 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 521 place count 64 transition count 133
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 523 place count 62 transition count 129
Iterating global reduction 7 with 2 rules applied. Total rules applied 525 place count 62 transition count 129
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 535 place count 57 transition count 124
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 544 place count 48 transition count 90
Iterating global reduction 7 with 9 rules applied. Total rules applied 553 place count 48 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 557 place count 48 transition count 86
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 558 place count 47 transition count 84
Iterating global reduction 8 with 1 rules applied. Total rules applied 559 place count 47 transition count 84
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 560 place count 46 transition count 82
Iterating global reduction 8 with 1 rules applied. Total rules applied 561 place count 46 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 563 place count 45 transition count 81
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 564 place count 44 transition count 78
Iterating global reduction 8 with 1 rules applied. Total rules applied 565 place count 44 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 566 place count 44 transition count 77
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 569 place count 44 transition count 74
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 9 with 6 rules applied. Total rules applied 575 place count 41 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 576 place count 40 transition count 70
Applied a total of 576 rules in 34 ms. Remains 40 /371 variables (removed 331) and now considering 70/462 (removed 392) transitions.
[2024-05-29 18:26:25] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
// Phase 1: matrix 66 rows 40 cols
[2024-05-29 18:26:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:26:25] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 18:26:25] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-05-29 18:26:25] [INFO ] Invariant cache hit.
[2024-05-29 18:26:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:26:25] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-29 18:26:25] [INFO ] Redundant transitions in 0 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-29 18:26:25] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-05-29 18:26:25] [INFO ] Invariant cache hit.
[2024-05-29 18:26:25] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 18:26:25] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:26:25] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:26:25] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:26:25] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:26:25] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:26:25] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:26:25] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:26:25] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 65/105 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 18:26:26] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 18:26:26] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:26:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 1/106 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 60 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1774 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-29 18:26:27] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:26:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/105 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 64/125 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 1/106 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 126 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 13/13 constraints]
After SMT, in 3044ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3044ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/371 places, 70/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3163 ms. Remains : 40/371 places, 70/462 transitions.
[2024-05-29 18:26:28] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:26:28] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:26:28] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-29 18:26:28] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:26:28] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:26:28] [INFO ] Time to serialize gal into /tmp/CTLFireability192207858139084334.gal : 1 ms
[2024-05-29 18:26:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15392139858693654614.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/CTLFireability192207858139084334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15392139858693654614.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,3204,0.025043,4472,2,692,5,3813,6,0,224,4023,0


Converting to forward existential form...Done !
original formula: !(A((p177!=1) U (p134==1)))
=> equivalent forward existential formula: ([(FwdU(Init,!((p134==1))) * (!((p177!=1)) * !((p134==1))))] != FALSE + [FwdG(Init,!((p134==1)))] != FALSE)
Hit Full ! (commute/partial/dont) 68/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
(forward)formula 0,1,0.029265,4736,1,0,12,3813,19,3,415,4023,5
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 351 transition count 442
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 351 transition count 442
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 342 transition count 433
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 342 transition count 433
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 338 transition count 429
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 336 transition count 427
Applied a total of 70 rules in 28 ms. Remains 336 /371 variables (removed 35) and now considering 427/462 (removed 35) transitions.
// Phase 1: matrix 427 rows 336 cols
[2024-05-29 18:26:28] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 18:26:28] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-29 18:26:28] [INFO ] Invariant cache hit.
[2024-05-29 18:26:28] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-05-29 18:26:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:26:34] [INFO ] Deduced a trap composed of 162 places in 98 ms of which 2 ms to minimize.
[2024-05-29 18:26:34] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 1 ms to minimize.
[2024-05-29 18:26:34] [INFO ] Deduced a trap composed of 165 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:26:34] [INFO ] Deduced a trap composed of 164 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:26:34] [INFO ] Deduced a trap composed of 162 places in 94 ms of which 3 ms to minimize.
[2024-05-29 18:26:35] [INFO ] Deduced a trap composed of 164 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:26:35] [INFO ] Deduced a trap composed of 164 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:26:35] [INFO ] Deduced a trap composed of 165 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:26:36] [INFO ] Deduced a trap composed of 164 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:26:36] [INFO ] Deduced a trap composed of 164 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:26:36] [INFO ] Deduced a trap composed of 166 places in 99 ms of which 3 ms to minimize.
[2024-05-29 18:26:36] [INFO ] Deduced a trap composed of 165 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:26:36] [INFO ] Deduced a trap composed of 165 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-29 18:26:37] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:26:37] [INFO ] Deduced a trap composed of 165 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:26:37] [INFO ] Deduced a trap composed of 164 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:26:37] [INFO ] Deduced a trap composed of 164 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:26:38] [INFO ] Deduced a trap composed of 165 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:26:38] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:26:39] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/763 variables, 336/360 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/763 variables, and 360 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 427/763 variables, 336/360 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 426/786 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (OVERLAPS) 0/763 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Int declared 763/763 variables, and 786 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 20/20 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 336/371 places, 427/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60414 ms. Remains : 336/371 places, 427/462 transitions.
[2024-05-29 18:27:28] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:27:28] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:27:28] [INFO ] Input system was already deterministic with 427 transitions.
[2024-05-29 18:27:28] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:27:28] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:27:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4079249999259287695.gal : 3 ms
[2024-05-29 18:27:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4864557400302394640.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/CTLFireability4079249999259287695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4864557400302394640.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05015e+07,1.55579,53712,2,6552,5,165320,6,0,1773,246865,0


Converting to forward existential form...Done !
original formula: AX(AG(!(E(EX((p135==1)) U EG((p284==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(EY(Init),TRUE),EX((p135==1))),(p284==1))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t129, t130, t132, t149, t158, t192, t193, t194, t227, t228, t230, t2...319
Hit Full ! (commute/partial/dont) 425/0/2
(forward)formula 0,0,18.3252,494712,1,0,648,2.08934e+06,885,404,11307,2.27514e+06,957
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Graph (trivial) has 368 edges and 371 vertex of which 53 / 371 are part of one of the 9 SCC in 2 ms
Free SCC test removed 44 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 221 place count 326 transition count 193
Reduce places removed 220 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 226 rules applied. Total rules applied 447 place count 106 transition count 187
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 453 place count 103 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 456 place count 100 transition count 184
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 456 place count 100 transition count 174
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 476 place count 90 transition count 174
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 489 place count 77 transition count 160
Iterating global reduction 4 with 13 rules applied. Total rules applied 502 place count 77 transition count 160
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 503 place count 77 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 504 place count 76 transition count 159
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 504 place count 76 transition count 157
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 508 place count 74 transition count 157
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 510 place count 72 transition count 146
Iterating global reduction 6 with 2 rules applied. Total rules applied 512 place count 72 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 513 place count 72 transition count 145
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 514 place count 71 transition count 143
Iterating global reduction 7 with 1 rules applied. Total rules applied 515 place count 71 transition count 143
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 527 place count 65 transition count 137
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 534 place count 58 transition count 109
Iterating global reduction 7 with 7 rules applied. Total rules applied 541 place count 58 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 544 place count 58 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 546 place count 57 transition count 105
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 547 place count 56 transition count 100
Iterating global reduction 8 with 1 rules applied. Total rules applied 548 place count 56 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 549 place count 56 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 554 place count 56 transition count 94
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 9 with 10 rules applied. Total rules applied 564 place count 51 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 565 place count 50 transition count 88
Applied a total of 565 rules in 52 ms. Remains 50 /371 variables (removed 321) and now considering 88/462 (removed 374) transitions.
[2024-05-29 18:27:47] [INFO ] Flow matrix only has 82 transitions (discarded 6 similar events)
// Phase 1: matrix 82 rows 50 cols
[2024-05-29 18:27:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:27:47] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 18:27:47] [INFO ] Flow matrix only has 82 transitions (discarded 6 similar events)
[2024-05-29 18:27:47] [INFO ] Invariant cache hit.
[2024-05-29 18:27:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:27:47] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-29 18:27:47] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-29 18:27:47] [INFO ] Flow matrix only has 82 transitions (discarded 6 similar events)
[2024-05-29 18:27:47] [INFO ] Invariant cache hit.
[2024-05-29 18:27:47] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 3/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-29 18:27:47] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:27:47] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:27:47] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:27:47] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:27:48] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:27:48] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:27:48] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:27:48] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:27:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:27:48] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:27:48] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:27:48] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:27:48] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:27:48] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 81/131 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-29 18:27:48] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-29 18:27:49] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:27:49] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 1/132 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 76 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2788 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 3/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 81/131 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 81/156 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 157 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1752 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 17/17 constraints]
After SMT, in 4566ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 4568ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/371 places, 88/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4726 ms. Remains : 50/371 places, 88/462 transitions.
[2024-05-29 18:27:52] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:27:52] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:27:52] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-29 18:27:52] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:27:52] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:27:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7894083147567334812.gal : 1 ms
[2024-05-29 18:27:52] [INFO ] Time to serialize properties into /tmp/CTLFireability6168708396691925337.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/CTLFireability7894083147567334812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6168708396691925337.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,5896,0.040328,5052,2,916,5,5997,6,0,280,6483,0


Converting to forward existential form...Done !
original formula: EG(EF((!(E(EG((p306==1)) U ((p195==1)||(((p73==1)&&(p233==1))&&(p343==1))))) + (EG((p14==0)) * EF((p181==0))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(E(EG((p306==1)) U ((p195==1)||(((p73==1)&&(p233==1))&&(p343==1))))) + (EG((p14==0)) * E(T...185
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t9, t10, t14, t38, t39, t40, t41, t70, t71, t74, t77, t78, t79, t80, t81, t82...255
(forward)formula 0,1,1.14424,40104,1,0,376,216835,208,182,2200,177294,455
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Graph (trivial) has 373 edges and 371 vertex of which 57 / 371 are part of one of the 9 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 223 place count 322 transition count 185
Reduce places removed 222 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 228 rules applied. Total rules applied 451 place count 100 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 454 place count 97 transition count 179
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 454 place count 97 transition count 169
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 474 place count 87 transition count 169
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 488 place count 73 transition count 153
Iterating global reduction 3 with 14 rules applied. Total rules applied 502 place count 73 transition count 153
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 504 place count 73 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 506 place count 71 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 506 place count 71 transition count 149
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 510 place count 69 transition count 149
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 513 place count 66 transition count 136
Iterating global reduction 5 with 3 rules applied. Total rules applied 516 place count 66 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 517 place count 66 transition count 135
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 519 place count 64 transition count 131
Iterating global reduction 6 with 2 rules applied. Total rules applied 521 place count 64 transition count 131
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 531 place count 59 transition count 126
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 537 place count 53 transition count 106
Iterating global reduction 6 with 6 rules applied. Total rules applied 543 place count 53 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 545 place count 53 transition count 104
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 546 place count 52 transition count 102
Iterating global reduction 7 with 1 rules applied. Total rules applied 547 place count 52 transition count 102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 548 place count 51 transition count 100
Iterating global reduction 7 with 1 rules applied. Total rules applied 549 place count 51 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 551 place count 50 transition count 99
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 552 place count 49 transition count 96
Iterating global reduction 7 with 1 rules applied. Total rules applied 553 place count 49 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 554 place count 49 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 557 place count 49 transition count 92
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 8 with 6 rules applied. Total rules applied 563 place count 46 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 564 place count 45 transition count 88
Applied a total of 564 rules in 25 ms. Remains 45 /371 variables (removed 326) and now considering 88/462 (removed 374) transitions.
[2024-05-29 18:27:53] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 45 cols
[2024-05-29 18:27:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:27:53] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 18:27:53] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
[2024-05-29 18:27:53] [INFO ] Invariant cache hit.
[2024-05-29 18:27:53] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:27:53] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-29 18:27:53] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-29 18:27:53] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
[2024-05-29 18:27:53] [INFO ] Invariant cache hit.
[2024-05-29 18:27:53] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 3/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:27:54] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-29 18:27:54] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:27:54] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 83/128 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/129 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 64 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1797 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 3/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 83/128 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 81/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-29 18:27:56] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 146 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 11/11 constraints]
After SMT, in 3976ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3977ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/371 places, 88/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4094 ms. Remains : 45/371 places, 88/462 transitions.
[2024-05-29 18:27:57] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:27:57] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:27:57] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-29 18:27:57] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:27:57] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:27:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5951594448742187160.gal : 1 ms
[2024-05-29 18:27:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15285850110765318880.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/CTLFireability5951594448742187160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15285850110765318880.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,5322,0.046381,4864,2,802,5,5247,6,0,262,5593,0


Converting to forward existential form...Done !
original formula: AG(AF(!(E((((p26==1)&&(p173==1))&&(p296==1)) U (((p85==1)&&(p208==1))&&(p368==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(E((((p26==1)&&(p173==1))&&(p296==1)) U (((p85==1)&&(p208==1))&&(p368==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t5, t9, t10, t31, t32, t33, t34, t63, t68, t69, t72, t75, t82, t83, t84, Interse...245
(forward)formula 0,1,0.195504,11728,1,0,166,32985,197,79,2071,30617,198
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-08 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 : 371/371 places, 462/462 transitions.
Graph (trivial) has 377 edges and 371 vertex of which 57 / 371 are part of one of the 9 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 227 place count 322 transition count 181
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 232 rules applied. Total rules applied 459 place count 96 transition count 175
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 462 place count 93 transition count 175
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 462 place count 93 transition count 165
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 482 place count 83 transition count 165
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 496 place count 69 transition count 149
Iterating global reduction 3 with 14 rules applied. Total rules applied 510 place count 69 transition count 149
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 512 place count 69 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 514 place count 67 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 514 place count 67 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 518 place count 65 transition count 145
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 521 place count 62 transition count 132
Iterating global reduction 5 with 3 rules applied. Total rules applied 524 place count 62 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 525 place count 62 transition count 131
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 527 place count 60 transition count 127
Iterating global reduction 6 with 2 rules applied. Total rules applied 529 place count 60 transition count 127
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 539 place count 55 transition count 122
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 548 place count 46 transition count 88
Iterating global reduction 6 with 9 rules applied. Total rules applied 557 place count 46 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 561 place count 46 transition count 84
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 562 place count 45 transition count 82
Iterating global reduction 7 with 1 rules applied. Total rules applied 563 place count 45 transition count 82
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 564 place count 44 transition count 80
Iterating global reduction 7 with 1 rules applied. Total rules applied 565 place count 44 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 567 place count 43 transition count 79
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 568 place count 42 transition count 76
Iterating global reduction 7 with 1 rules applied. Total rules applied 569 place count 42 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 570 place count 42 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 573 place count 42 transition count 72
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 8 with 6 rules applied. Total rules applied 579 place count 39 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 580 place count 38 transition count 68
Applied a total of 580 rules in 23 ms. Remains 38 /371 variables (removed 333) and now considering 68/462 (removed 394) transitions.
[2024-05-29 18:27:57] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
// Phase 1: matrix 64 rows 38 cols
[2024-05-29 18:27:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:27:57] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 18:27:57] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-05-29 18:27:57] [INFO ] Invariant cache hit.
[2024-05-29 18:27:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:27:57] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-29 18:27:57] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-29 18:27:57] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2024-05-29 18:27:57] [INFO ] Invariant cache hit.
[2024-05-29 18:27:57] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 18:27:57] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:27:57] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:27:58] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:27:58] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:27:58] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:27:58] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:27:58] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:27:58] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:27:58] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 18:27:58] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 63/101 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 18:27:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 18:27:58] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 1/102 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/102 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 59 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 63/101 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 61/119 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 1/102 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 120 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1063 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 12/12 constraints]
After SMT, in 2820ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2821ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/371 places, 68/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2921 ms. Remains : 38/371 places, 68/462 transitions.
[2024-05-29 18:28:00] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:28:00] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:28:00] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-29 18:28:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:28:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:28:00] [INFO ] Time to serialize gal into /tmp/CTLFireability13173772593573861623.gal : 1 ms
[2024-05-29 18:28:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10084430859376020470.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/CTLFireability13173772593573861623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10084430859376020470.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,2884,0.029224,4464,2,602,5,3396,6,0,214,3574,0


Converting to forward existential form...Done !
original formula: EG(EF((p174==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p174==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t8, t26, t27, t28, t29, t57, t58, t59, t60, t61, t62, t63, t64, Intersec...244
(forward)formula 0,1,0.380515,18848,1,0,208,74288,158,101,1611,73989,213
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 350 transition count 441
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 350 transition count 441
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 342 transition count 433
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 342 transition count 433
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 339 transition count 430
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 339 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 338 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 338 transition count 429
Applied a total of 66 rules in 45 ms. Remains 338 /371 variables (removed 33) and now considering 429/462 (removed 33) transitions.
// Phase 1: matrix 429 rows 338 cols
[2024-05-29 18:28:01] [INFO ] Computed 4 invariants in 8 ms
[2024-05-29 18:28:01] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 18:28:01] [INFO ] Invariant cache hit.
[2024-05-29 18:28:01] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-05-29 18:28:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-29 18:28:05] [INFO ] Deduced a trap composed of 164 places in 100 ms of which 2 ms to minimize.
[2024-05-29 18:28:06] [INFO ] Deduced a trap composed of 164 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:28:06] [INFO ] Deduced a trap composed of 165 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:28:06] [INFO ] Deduced a trap composed of 164 places in 84 ms of which 1 ms to minimize.
[2024-05-29 18:28:06] [INFO ] Deduced a trap composed of 164 places in 108 ms of which 2 ms to minimize.
[2024-05-29 18:28:06] [INFO ] Deduced a trap composed of 164 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:28:07] [INFO ] Deduced a trap composed of 166 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:28:07] [INFO ] Deduced a trap composed of 166 places in 104 ms of which 3 ms to minimize.
[2024-05-29 18:28:07] [INFO ] Deduced a trap composed of 164 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:28:07] [INFO ] Deduced a trap composed of 163 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:28:07] [INFO ] Deduced a trap composed of 165 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:28:08] [INFO ] Deduced a trap composed of 165 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:28:08] [INFO ] Deduced a trap composed of 167 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:28:09] [INFO ] Deduced a trap composed of 163 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-29 18:28:11] [INFO ] Deduced a trap composed of 163 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:28:12] [INFO ] Deduced a trap composed of 166 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-29 18:28:16] [INFO ] Deduced a trap composed of 167 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:28:16] [INFO ] Deduced a trap composed of 166 places in 79 ms of which 3 ms to minimize.
[2024-05-29 18:28:16] [INFO ] Deduced a trap composed of 164 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:28:17] [INFO ] Deduced a trap composed of 165 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-05-29 18:28:20] [INFO ] Deduced a trap composed of 162 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (OVERLAPS) 429/767 variables, 338/363 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/767 variables, and 363 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (OVERLAPS) 429/767 variables, 338/363 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 428/791 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (OVERLAPS) 0/767 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 767/767 variables, and 791 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 21/21 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 338/371 places, 429/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60437 ms. Remains : 338/371 places, 429/462 transitions.
[2024-05-29 18:29:01] [INFO ] Flatten gal took : 24 ms
[2024-05-29 18:29:01] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:29:01] [INFO ] Input system was already deterministic with 429 transitions.
[2024-05-29 18:29:01] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:29:01] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:29:01] [INFO ] Time to serialize gal into /tmp/CTLFireability17715940442359301566.gal : 18 ms
[2024-05-29 18:29:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5596061947671803862.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/CTLFireability17715940442359301566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5596061947671803862.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05685e+07,1.68395,56260,2,5774,5,170397,6,0,1783,258747,0


Converting to forward existential form...Done !
original formula: AX(AG((AF((p32==1)) * AG((p106==0)))))
=> equivalent forward existential formula: ([FwdG(FwdU(EY(Init),TRUE),!((p32==1)))] = FALSE * [(FwdU(FwdU(EY(Init),TRUE),TRUE) * !((p106==0)))] = FALSE)
(forward)formula 0,0,2.78759,57844,1,0,10,174687,10,2,3579,266387,6
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Graph (trivial) has 365 edges and 371 vertex of which 56 / 371 are part of one of the 9 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 217 place count 323 transition count 193
Reduce places removed 216 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 220 rules applied. Total rules applied 437 place count 107 transition count 189
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 443 place count 105 transition count 185
Reduce places removed 4 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 6 rules applied. Total rules applied 449 place count 101 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 450 place count 100 transition count 183
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 450 place count 100 transition count 174
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 468 place count 91 transition count 174
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 481 place count 78 transition count 159
Iterating global reduction 5 with 13 rules applied. Total rules applied 494 place count 78 transition count 159
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 5 with 2 rules applied. Total rules applied 496 place count 78 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 498 place count 76 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 498 place count 76 transition count 155
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 502 place count 74 transition count 155
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 505 place count 71 transition count 142
Iterating global reduction 7 with 3 rules applied. Total rules applied 508 place count 71 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 509 place count 71 transition count 141
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 511 place count 69 transition count 137
Iterating global reduction 8 with 2 rules applied. Total rules applied 513 place count 69 transition count 137
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 8 with 10 rules applied. Total rules applied 523 place count 64 transition count 132
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 528 place count 59 transition count 111
Iterating global reduction 8 with 5 rules applied. Total rules applied 533 place count 59 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 535 place count 59 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 537 place count 58 transition count 108
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 538 place count 57 transition count 104
Iterating global reduction 9 with 1 rules applied. Total rules applied 539 place count 57 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 540 place count 57 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 543 place count 57 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 544 place count 57 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 545 place count 56 transition count 99
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 12 with 4 rules applied. Total rules applied 549 place count 54 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 550 place count 53 transition count 96
Applied a total of 550 rules in 49 ms. Remains 53 /371 variables (removed 318) and now considering 96/462 (removed 366) transitions.
[2024-05-29 18:29:04] [INFO ] Flow matrix only has 91 transitions (discarded 5 similar events)
// Phase 1: matrix 91 rows 53 cols
[2024-05-29 18:29:04] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:29:04] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-29 18:29:04] [INFO ] Flow matrix only has 91 transitions (discarded 5 similar events)
[2024-05-29 18:29:04] [INFO ] Invariant cache hit.
[2024-05-29 18:29:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:29:04] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-29 18:29:04] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-29 18:29:04] [INFO ] Flow matrix only has 91 transitions (discarded 5 similar events)
[2024-05-29 18:29:04] [INFO ] Invariant cache hit.
[2024-05-29 18:29:04] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/143 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 75 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/143 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 89/163 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-29 18:29:08] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/144 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (OVERLAPS) 0/144 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 165 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2870 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 14/14 constraints]
After SMT, in 5167ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 5170ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/371 places, 96/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5528 ms. Remains : 53/371 places, 96/462 transitions.
[2024-05-29 18:29:09] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:29:09] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:29:09] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-29 18:29:09] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:29:09] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:29:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11806122938172174164.gal : 1 ms
[2024-05-29 18:29:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17500142381954616529.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/CTLFireability11806122938172174164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17500142381954616529.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,6896,0.045867,5136,2,913,5,6131,6,0,301,6338,0


Converting to forward existential form...Done !
original formula: E(E(EF((p60==1)) U (A((((p92==1)||(p111==1)) * AF((p24==1))) U AF((p57==1))) + (((p73==1)&&(p233==1))&&(p355==1)))) U AF((p235==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(E(TRUE U (p60==1)) U (!((E(!(!(EG(!((p57==1))))) U (!((((p92==1)||(p111==1)) * !(EG(!((p24==1)))))...285
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t9, t37, t39, t42, t43, t44, t70, t74, t75, t76, t79, t82, t90, t91, t92, In...250
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.04047,110132,1,0,762,630790,242,438,2384,562023,910
FORMULA StigmergyElection-PT-03b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 356 transition count 447
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 356 transition count 447
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 350 transition count 441
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 350 transition count 441
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 347 transition count 438
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 347 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 346 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 346 transition count 437
Applied a total of 50 rules in 20 ms. Remains 346 /371 variables (removed 25) and now considering 437/462 (removed 25) transitions.
// Phase 1: matrix 437 rows 346 cols
[2024-05-29 18:29:13] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 18:29:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-29 18:29:13] [INFO ] Invariant cache hit.
[2024-05-29 18:29:13] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2024-05-29 18:29:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-05-29 18:29:19] [INFO ] Deduced a trap composed of 166 places in 125 ms of which 3 ms to minimize.
[2024-05-29 18:29:19] [INFO ] Deduced a trap composed of 167 places in 103 ms of which 2 ms to minimize.
[2024-05-29 18:29:19] [INFO ] Deduced a trap composed of 166 places in 102 ms of which 1 ms to minimize.
[2024-05-29 18:29:20] [INFO ] Deduced a trap composed of 165 places in 99 ms of which 2 ms to minimize.
[2024-05-29 18:29:20] [INFO ] Deduced a trap composed of 170 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:29:21] [INFO ] Deduced a trap composed of 170 places in 101 ms of which 2 ms to minimize.
[2024-05-29 18:29:21] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:29:21] [INFO ] Deduced a trap composed of 170 places in 109 ms of which 3 ms to minimize.
[2024-05-29 18:29:21] [INFO ] Deduced a trap composed of 164 places in 95 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-05-29 18:29:23] [INFO ] Deduced a trap composed of 166 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:29:23] [INFO ] Deduced a trap composed of 165 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:29:24] [INFO ] Deduced a trap composed of 171 places in 102 ms of which 2 ms to minimize.
[2024-05-29 18:29:24] [INFO ] Deduced a trap composed of 170 places in 103 ms of which 2 ms to minimize.
[2024-05-29 18:29:25] [INFO ] Deduced a trap composed of 165 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-05-29 18:29:29] [INFO ] Deduced a trap composed of 163 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-05-29 18:29:33] [INFO ] Deduced a trap composed of 168 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-05-29 18:29:35] [INFO ] Deduced a trap composed of 165 places in 104 ms of which 1 ms to minimize.
[2024-05-29 18:29:35] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (OVERLAPS) 437/783 variables, 346/368 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 783/783 variables, and 368 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-05-29 18:29:46] [INFO ] Deduced a trap composed of 170 places in 96 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (OVERLAPS) 437/783 variables, 346/369 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 436/805 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-05-29 18:29:58] [INFO ] Deduced a trap composed of 164 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/783 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/783 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 783/783 variables, and 806 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 20/20 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 346/371 places, 437/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60564 ms. Remains : 346/371 places, 437/462 transitions.
[2024-05-29 18:30:13] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:30:13] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:30:13] [INFO ] Input system was already deterministic with 437 transitions.
[2024-05-29 18:30:13] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:30:13] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:30:13] [INFO ] Time to serialize gal into /tmp/CTLFireability394212213690220394.gal : 2 ms
[2024-05-29 18:30:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2221264602179483473.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/CTLFireability394212213690220394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2221264602179483473.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,1.14439e+07,2.17729,70332,2,9008,5,208248,6,0,1823,347759,0


Converting to forward existential form...Done !
original formula: (EF(AG(((!(A((p87==1) U (p391==1))) * EX((p79==0))) + (((((p98==0)||(p208==0))||(p368==0))&&(p286==0))&&(p336==0))))) * ((EF((((p51==1)&&...505
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !(((!(!((E(!((p391==1)) U (!((p87==1)) * !((p391==1)))) + EG(!((p391==1)))))) * ...1432
Reverse transition relation is NOT exact ! Due to transitions t26, t27, t53, t54, t63, t98, t99, t100, t133, t134, t135, t136, t137, t153, t162, t197, t198...347
Detected timeout of ITS tools.
[2024-05-29 18:30:43] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:30:43] [INFO ] Applying decomposition
[2024-05-29 18:30:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7213682848868809076.txt' '-o' '/tmp/graph7213682848868809076.bin' '-w' '/tmp/graph7213682848868809076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7213682848868809076.bin' '-l' '-1' '-v' '-w' '/tmp/graph7213682848868809076.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:30:43] [INFO ] Decomposing Gal with order
[2024-05-29 18:30:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:30:43] [INFO ] Removed a total of 330 redundant transitions.
[2024-05-29 18:30:43] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:30:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:30:43] [INFO ] Time to serialize gal into /tmp/CTLFireability5351425469600474740.gal : 3 ms
[2024-05-29 18:30:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6815311487017285672.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/CTLFireability5351425469600474740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6815311487017285672.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14439e+07,0.12973,8736,839,21,8618,429,693,11442,57,796,0


Converting to forward existential form...Done !
original formula: (EF(AG(((!(A((i5.i0.u29.p87==1) U (i7.i1.u117.p391==1))) * EX((i4.i1.u25.p79==0))) + (((((i0.i0.u32.p98==0)||(i12.i0.u61.p208==0))||(i7.i...842
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !(((!(!((E(!((i7.i1.u117.p391==1)) U (!((i5.i0.u29.p87==1)) * !((i7.i1.u117.p391...2183
Reverse transition relation is NOT exact ! Due to transitions t54, t99, t100, t133, t136, t153, t199, t232, t233, t235, t251, t301, t302, t356, t358, i0.t3...466
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
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 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
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
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 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,1,13.8186,452092,1,0,886236,453,5975,1.30181e+06,310,1016,1972034
FORMULA StigmergyElection-PT-03b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 351 transition count 442
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 351 transition count 442
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 343 transition count 434
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 343 transition count 434
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 337 transition count 428
Applied a total of 68 rules in 17 ms. Remains 337 /371 variables (removed 34) and now considering 428/462 (removed 34) transitions.
// Phase 1: matrix 428 rows 337 cols
[2024-05-29 18:30:57] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 18:30:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 18:30:57] [INFO ] Invariant cache hit.
[2024-05-29 18:30:58] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-05-29 18:30:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:31:03] [INFO ] Deduced a trap composed of 162 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:31:03] [INFO ] Deduced a trap composed of 163 places in 100 ms of which 2 ms to minimize.
[2024-05-29 18:31:03] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:31:03] [INFO ] Deduced a trap composed of 166 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:31:03] [INFO ] Deduced a trap composed of 162 places in 103 ms of which 1 ms to minimize.
[2024-05-29 18:31:04] [INFO ] Deduced a trap composed of 164 places in 104 ms of which 2 ms to minimize.
[2024-05-29 18:31:04] [INFO ] Deduced a trap composed of 165 places in 94 ms of which 1 ms to minimize.
[2024-05-29 18:31:04] [INFO ] Deduced a trap composed of 164 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:31:05] [INFO ] Deduced a trap composed of 165 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:31:05] [INFO ] Deduced a trap composed of 164 places in 105 ms of which 2 ms to minimize.
[2024-05-29 18:31:05] [INFO ] Deduced a trap composed of 164 places in 110 ms of which 2 ms to minimize.
[2024-05-29 18:31:05] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:31:06] [INFO ] Deduced a trap composed of 165 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:31:06] [INFO ] Deduced a trap composed of 163 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:31:07] [INFO ] Deduced a trap composed of 165 places in 99 ms of which 2 ms to minimize.
[2024-05-29 18:31:07] [INFO ] Deduced a trap composed of 163 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:31:08] [INFO ] Deduced a trap composed of 165 places in 107 ms of which 2 ms to minimize.
[2024-05-29 18:31:09] [INFO ] Deduced a trap composed of 166 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/765 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:31:19] [INFO ] Deduced a trap composed of 165 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 427 unsolved
(s281 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/765 variables, and 360 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-05-29 18:31:32] [INFO ] Deduced a trap composed of 163 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/765 variables, 337/361 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 427/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 788 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 20/20 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 337/371 places, 428/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60387 ms. Remains : 337/371 places, 428/462 transitions.
[2024-05-29 18:31:58] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:31:58] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:31:58] [INFO ] Input system was already deterministic with 428 transitions.
[2024-05-29 18:31:58] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:31:58] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:31:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15384553017364532246.gal : 2 ms
[2024-05-29 18:31:58] [INFO ] Time to serialize properties into /tmp/CTLFireability8575753173554743101.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/CTLFireability15384553017364532246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8575753173554743101.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05662e+07,1.5348,52724,2,6532,5,161452,6,0,1778,242125,0


Converting to forward existential form...Done !
original formula: !(E(!((EG(EF((((p85==1)&&(p220==1))&&(p355==1)))) * EF(AX((p251==1))))) U E(E(EF((p288==1)) U EF((p156==1))) U !(((((p26==1)&&(p186==1))&...195
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((EG(E(TRUE U (((p85==1)&&(p220==1))&&(p355==1)))) * E(TRUE U !(EX(!((p251==1)))))))),E(E(TRUE...268
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t131, t132, t134, t151, t160, t194, t195, t196, t229, t230, t232, t2...319
Detected timeout of ITS tools.
[2024-05-29 18:32:28] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:32:28] [INFO ] Applying decomposition
[2024-05-29 18:32:28] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12972407428342807981.txt' '-o' '/tmp/graph12972407428342807981.bin' '-w' '/tmp/graph12972407428342807981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12972407428342807981.bin' '-l' '-1' '-v' '-w' '/tmp/graph12972407428342807981.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:32:28] [INFO ] Decomposing Gal with order
[2024-05-29 18:32:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:32:28] [INFO ] Removed a total of 314 redundant transitions.
[2024-05-29 18:32:28] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:32:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2024-05-29 18:32:28] [INFO ] Time to serialize gal into /tmp/CTLFireability833229370182343168.gal : 3 ms
[2024-05-29 18:32:28] [INFO ] Time to serialize properties into /tmp/CTLFireability16790986203062410056.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/CTLFireability833229370182343168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16790986203062410056.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05662e+07,0.103662,7796,602,18,6875,428,692,7870,56,931,0


Converting to forward existential form...Done !
original formula: !(E(!((EG(EF((((i5.i0.u26.p85==1)&&(i12.i0.u67.p220==1))&&(i20.i0.u103.p355==1)))) * EF(AX((i13.u75.p251==1))))) U E(E(EF((i15.i0.u81.p28...307
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((EG(E(TRUE U (((i5.i0.u26.p85==1)&&(i12.i0.u67.p220==1))&&(i20.i0.u103.p355==1)))) * E(TRUE U...380
Reverse transition relation is NOT exact ! Due to transitions t51, t95, t96, t132, t134, t151, t196, t229, t230, t232, t248, t293, t327, t346, t347, t349, ...382
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
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 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
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
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 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,0,4.61733,160916,1,0,294006,428,5246,590818,286,1079,762539
FORMULA StigmergyElection-PT-03b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Graph (trivial) has 377 edges and 371 vertex of which 57 / 371 are part of one of the 9 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 227 place count 322 transition count 181
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 232 rules applied. Total rules applied 459 place count 96 transition count 175
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 463 place count 93 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 464 place count 92 transition count 174
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 464 place count 92 transition count 164
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 484 place count 82 transition count 164
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 498 place count 68 transition count 148
Iterating global reduction 4 with 14 rules applied. Total rules applied 512 place count 68 transition count 148
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 4 with 2 rules applied. Total rules applied 514 place count 68 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 516 place count 66 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 516 place count 66 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 520 place count 64 transition count 144
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 523 place count 61 transition count 131
Iterating global reduction 6 with 3 rules applied. Total rules applied 526 place count 61 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 527 place count 61 transition count 130
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 529 place count 59 transition count 126
Iterating global reduction 7 with 2 rules applied. Total rules applied 531 place count 59 transition count 126
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 541 place count 54 transition count 121
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 550 place count 45 transition count 87
Iterating global reduction 7 with 9 rules applied. Total rules applied 559 place count 45 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 563 place count 45 transition count 83
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 564 place count 44 transition count 81
Iterating global reduction 8 with 1 rules applied. Total rules applied 565 place count 44 transition count 81
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 566 place count 43 transition count 79
Iterating global reduction 8 with 1 rules applied. Total rules applied 567 place count 43 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 569 place count 42 transition count 78
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 570 place count 41 transition count 75
Iterating global reduction 8 with 1 rules applied. Total rules applied 571 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 572 place count 41 transition count 74
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 575 place count 41 transition count 71
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 9 with 6 rules applied. Total rules applied 581 place count 38 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 582 place count 37 transition count 67
Applied a total of 582 rules in 18 ms. Remains 37 /371 variables (removed 334) and now considering 67/462 (removed 395) transitions.
[2024-05-29 18:32:33] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
// Phase 1: matrix 63 rows 37 cols
[2024-05-29 18:32:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:32:33] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:32:33] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-05-29 18:32:33] [INFO ] Invariant cache hit.
[2024-05-29 18:32:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:32:33] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-29 18:32:33] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-29 18:32:33] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-05-29 18:32:33] [INFO ] Invariant cache hit.
[2024-05-29 18:32:33] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 18:32:33] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:32:33] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:32:33] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:32:33] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:32:33] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:32:33] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:32:33] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:32:33] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 62/99 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 1/100 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/100 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 54 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 62/99 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 60/113 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 18:32:34] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 1/100 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/100 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 115 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1243 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 9/9 constraints]
After SMT, in 2415ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2416ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/371 places, 67/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2522 ms. Remains : 37/371 places, 67/462 transitions.
[2024-05-29 18:32:35] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:32:35] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:32:35] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-29 18:32:35] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:32:35] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:32:35] [INFO ] Time to serialize gal into /tmp/CTLFireability69378259766785009.gal : 0 ms
[2024-05-29 18:32:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11929356832103660289.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/CTLFireability69378259766785009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11929356832103660289.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,2636,0.032008,4464,2,570,5,3237,6,0,209,3592,0


Converting to forward existential form...Done !
original formula: AG(EF(EG((p48==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG((p48==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t26, t27, t28, t29, t56, t57, t58, t59, t60, t61, t62, t63, Intersec...244
(forward)formula 0,0,0.289463,15900,1,0,206,65970,156,88,1609,51498,233
FORMULA StigmergyElection-PT-03b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 371/371 places, 462/462 transitions.
Graph (trivial) has 377 edges and 371 vertex of which 57 / 371 are part of one of the 9 SCC in 2 ms
Free SCC test removed 48 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 225 rules applied. Total rules applied 226 place count 322 transition count 182
Reduce places removed 225 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 231 rules applied. Total rules applied 457 place count 97 transition count 176
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 461 place count 94 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 462 place count 93 transition count 175
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 462 place count 93 transition count 165
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 482 place count 83 transition count 165
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 496 place count 69 transition count 149
Iterating global reduction 4 with 14 rules applied. Total rules applied 510 place count 69 transition count 149
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 4 with 2 rules applied. Total rules applied 512 place count 69 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 514 place count 67 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 514 place count 67 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 518 place count 65 transition count 145
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 521 place count 62 transition count 132
Iterating global reduction 6 with 3 rules applied. Total rules applied 524 place count 62 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 525 place count 62 transition count 131
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 527 place count 60 transition count 127
Iterating global reduction 7 with 2 rules applied. Total rules applied 529 place count 60 transition count 127
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 539 place count 55 transition count 122
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 548 place count 46 transition count 88
Iterating global reduction 7 with 9 rules applied. Total rules applied 557 place count 46 transition count 88
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 562 place count 46 transition count 83
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 563 place count 45 transition count 81
Iterating global reduction 8 with 1 rules applied. Total rules applied 564 place count 45 transition count 81
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 565 place count 44 transition count 79
Iterating global reduction 8 with 1 rules applied. Total rules applied 566 place count 44 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 568 place count 43 transition count 78
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 569 place count 42 transition count 75
Iterating global reduction 8 with 1 rules applied. Total rules applied 570 place count 42 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 571 place count 42 transition count 74
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 574 place count 42 transition count 71
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 9 with 6 rules applied. Total rules applied 580 place count 39 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 581 place count 38 transition count 67
Applied a total of 581 rules in 25 ms. Remains 38 /371 variables (removed 333) and now considering 67/462 (removed 395) transitions.
[2024-05-29 18:32:35] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
// Phase 1: matrix 63 rows 38 cols
[2024-05-29 18:32:35] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:32:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 18:32:35] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-05-29 18:32:35] [INFO ] Invariant cache hit.
[2024-05-29 18:32:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:32:35] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-29 18:32:35] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-29 18:32:35] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-05-29 18:32:35] [INFO ] Invariant cache hit.
[2024-05-29 18:32:35] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 18:32:36] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:32:36] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:32:36] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:32:36] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:32:36] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:32:36] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:32:36] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:32:36] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:32:36] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 62/100 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 18:32:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:32:36] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 1/101 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 58 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 62/100 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 60/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-29 18:32:37] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 1/101 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 119 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 12/12 constraints]
After SMT, in 2853ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2854ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/371 places, 67/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2987 ms. Remains : 38/371 places, 67/462 transitions.
[2024-05-29 18:32:38] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:32:38] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:32:38] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-29 18:32:38] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:32:38] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:32:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2614973816700985259.gal : 0 ms
[2024-05-29 18:32:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12890399715711523834.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/CTLFireability2614973816700985259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12890399715711523834.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,2712,0.024635,4468,2,658,5,3795,6,0,213,4048,0


Converting to forward existential form...Done !
original formula: AG(EF((p116==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p116==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t25, t26, t27, t28, t29, t56, t57, t58, t59, t60, t61, t62, t63, Interse...245
(forward)formula 0,1,0.162442,10804,1,0,137,38277,150,60,1587,29043,142
FORMULA StigmergyElection-PT-03b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 18:32:38] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:32:39] [INFO ] Flatten gal took : 8 ms
Total runtime 788650 ms.

BK_STOP 1717007559065

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-03b"
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-03b, 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-171690532000274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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