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.r092-tall-171624189300466.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 DBSingleClientW-PT-d0m08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189300466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716317906184

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 18:58:27] [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-21 18:58:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:58:27] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-21 18:58:27] [INFO ] Transformed 553 places.
[2024-05-21 18:58:27] [INFO ] Transformed 150 transitions.
[2024-05-21 18:58:27] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Support contains 77 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 99 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 99 transition count 136
Applied a total of 24 rules in 24 ms. Remains 99 /109 variables (removed 10) and now considering 136/150 (removed 14) transitions.
// Phase 1: matrix 136 rows 99 cols
[2024-05-21 18:58:27] [INFO ] Computed 2 invariants in 13 ms
[2024-05-21 18:58:27] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 18:58:27] [INFO ] Invariant cache hit.
[2024-05-21 18:58:27] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 18:58:27] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2024-05-21 18:58:27] [INFO ] Invariant cache hit.
[2024-05-21 18:58:27] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/235 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 61/162 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/235 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 162 constraints, problems are : Problem set: 0 solved, 135 unsolved in 3496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/235 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 61/162 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 135/297 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/235 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 297 constraints, problems are : Problem set: 0 solved, 135 unsolved in 5585 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 9293ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 9306ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 136/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9681 ms. Remains : 99/109 places, 136/150 transitions.
Support contains 77 out of 99 places after structural reductions.
[2024-05-21 18:58:37] [INFO ] Flatten gal took : 35 ms
[2024-05-21 18:58:37] [INFO ] Flatten gal took : 13 ms
[2024-05-21 18:58:37] [INFO ] Input system was already deterministic with 136 transitions.
RANDOM walk for 40000 steps (9154 resets) in 2386 ms. (16 steps per ms) remains 47/74 properties
BEST_FIRST walk for 4004 steps (204 resets) in 53 ms. (74 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (403 resets) in 108 ms. (36 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (214 resets) in 53 ms. (74 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (178 resets) in 49 ms. (80 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (196 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (189 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (216 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (205 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (612 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (218 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (410 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (198 resets) in 33 ms. (117 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4002 steps (375 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (119 resets) in 19 ms. (200 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4003 steps (211 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (403 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (195 resets) in 30 ms. (129 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4002 steps (419 resets) in 69 ms. (57 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (416 resets) in 20 ms. (190 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (187 resets) in 18 ms. (210 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (193 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (215 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (211 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (205 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (187 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (392 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (800 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (193 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (215 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (122 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (212 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (198 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (116 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (413 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (199 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (179 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (202 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (375 resets) in 25 ms. (153 steps per ms) remains 40/42 properties
BEST_FIRST walk for 4003 steps (187 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (404 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (800 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (382 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (369 resets) in 15 ms. (250 steps per ms) remains 35/40 properties
BEST_FIRST walk for 4004 steps (139 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
[2024-05-21 18:58:38] [INFO ] Invariant cache hit.
[2024-05-21 18:58:38] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 1 (OVERLAPS) 22/71 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 29 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 19/90 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 133/223 variables, 90/92 constraints. Problems are: Problem set: 6 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 58/150 constraints. Problems are: Problem set: 6 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 6 solved, 29 unsolved
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 8 (OVERLAPS) 12/235 variables, 9/159 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 3/162 constraints. Problems are: Problem set: 8 solved, 27 unsolved
[2024-05-21 18:58:39] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 11 ms to minimize.
[2024-05-21 18:58:39] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-21 18:58:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 3/165 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/165 constraints. Problems are: Problem set: 8 solved, 27 unsolved
[2024-05-21 18:58:40] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/235 variables, 1/166 constraints. Problems are: Problem set: 8 solved, 27 unsolved
[2024-05-21 18:58:40] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 1/167 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/167 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 0/235 variables, 0/167 constraints. Problems are: Problem set: 8 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 167 constraints, problems are : Problem set: 8 solved, 27 unsolved in 2095 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 8 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 29/67 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 27 unsolved
[2024-05-21 18:58:40] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 21/88 variables, 1/3 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 4/7 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 133/221 variables, 88/95 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 58/153 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 4/157 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/157 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 11/168 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/171 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 23/194 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 1/195 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/195 constraints. Problems are: Problem set: 8 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 0/235 variables, 0/195 constraints. Problems are: Problem set: 8 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 195 constraints, problems are : Problem set: 8 solved, 27 unsolved in 1713 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 27/35 constraints, Known Traps: 6/6 constraints]
After SMT, in 3868ms problems are : Problem set: 8 solved, 27 unsolved
Fused 27 Parikh solutions to 21 different solutions.
Parikh walk visited 1 properties in 1043 ms.
Support contains 37 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 88 transition count 124
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 88 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 86 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 86 transition count 122
Applied a total of 26 rules in 32 ms. Remains 86 /99 variables (removed 13) and now considering 122/136 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 86/99 places, 122/136 transitions.
RANDOM walk for 40000 steps (9063 resets) in 302 ms. (132 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (191 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (203 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (208 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (188 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (201 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (106 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (188 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (427 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (377 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (200 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (215 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (187 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (190 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (204 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (392 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (197 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (106 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (206 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (183 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (123 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (171 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (419 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (384 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (800 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (422 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (408 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 111225 steps, run visited all 26 properties in 519 ms. (steps per millisecond=214 )
Probabilistic random walk after 111225 steps, saw 44897 distinct states, run finished after 523 ms. (steps per millisecond=212 ) properties seen :26
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2024-05-21 18:58:44] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:58:44] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:58:44] [INFO ] Input system was already deterministic with 136 transitions.
Support contains 64 out of 99 places (down from 68) after GAL structural reductions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 330 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 76 transition count 94
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 76 transition count 93
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 68 transition count 85
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 63 transition count 73
Applied a total of 78 rules in 23 ms. Remains 63 /99 variables (removed 36) and now considering 73/136 (removed 63) transitions.
// Phase 1: matrix 73 rows 63 cols
[2024-05-21 18:58:44] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 18:58:44] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 18:58:44] [INFO ] Invariant cache hit.
[2024-05-21 18:58:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 18:58:44] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-21 18:58:44] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-21 18:58:44] [INFO ] Invariant cache hit.
[2024-05-21 18:58:44] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 87 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 159 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1765 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2878ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2879ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/99 places, 73/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3022 ms. Remains : 63/99 places, 73/136 transitions.
[2024-05-21 18:58:47] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:58:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:58:47] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-21 18:58:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:58:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:58:47] [INFO ] Time to serialize gal into /tmp/CTLFireability6242684304163905321.gal : 2 ms
[2024-05-21 18:58:47] [INFO ] Time to serialize properties into /tmp/CTLFireability14637429570162256715.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/CTLFireability6242684304163905321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14637429570162256715.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.28621e+06,2.74998,88560,2,13743,5,307747,6,0,325,371947,0


Converting to forward existential form...Done !
original formula: AF(EG(E(((s3>=1)&&(l0>=1)) U E(((s1>=1)&&(l487>=1)) U ((s1>=1)&&(l345>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(((s3>=1)&&(l0>=1)) U E(((s1>=1)&&(l487>=1)) U ((s1>=1)&&(l345>=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t44, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
Using saturation style SCC detection
(forward)formula 0,0,9.6593,236964,1,0,229,1.00556e+06,180,108,2369,1.22997e+06,253
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 106
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 106
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 75 transition count 99
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 75 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 75 transition count 97
Applied a total of 50 rules in 12 ms. Remains 75 /99 variables (removed 24) and now considering 97/136 (removed 39) transitions.
// Phase 1: matrix 97 rows 75 cols
[2024-05-21 18:58:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:58:57] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 18:58:57] [INFO ] Invariant cache hit.
[2024-05-21 18:58:57] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 18:58:57] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-21 18:58:57] [INFO ] Invariant cache hit.
[2024-05-21 18:58:57] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/172 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 34/111 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:58:59] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:58:59] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/172 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/172 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 113 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2894 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 97/172 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 34/113 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 96/209 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/172 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 209 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2818 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
After SMT, in 5777ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 5778ms
Starting structural reductions in LTL mode, iteration 1 : 75/99 places, 97/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5948 ms. Remains : 75/99 places, 97/136 transitions.
[2024-05-21 18:59:03] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:59:03] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:59:03] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-21 18:59:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:59:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:59:03] [INFO ] Time to serialize gal into /tmp/CTLFireability16123512884550161640.gal : 3 ms
[2024-05-21 18:59:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16196460571375675731.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/CTLFireability16123512884550161640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16196460571375675731.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.68744e+07,8.66875,222832,2,21671,5,790752,6,0,397,875276,0


Converting to forward existential form...Done !
original formula: A(AX(EX(((s1>=1)&&(l485>=1)))) U E(!((AG(((s1>=1)&&(l110>=1))) + E(((s1>=1)&&(l336>=1)) U EF(((s1>=1)&&(l496>=1)))))) U (!((AF(((s1>=1)&&...341
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((!(E(TRUE U !(((s1>=1)&&(l110>=1))))) + E(((s1>=1)&&(l336>=1)) U E(TRUE U ((s1>=1)&&(l496>=...1092
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t59, t62, t69, t70, t7...381
Detected timeout of ITS tools.
[2024-05-21 18:59:33] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:59:33] [INFO ] Applying decomposition
[2024-05-21 18:59:33] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1017124763287072263.txt' '-o' '/tmp/graph1017124763287072263.bin' '-w' '/tmp/graph1017124763287072263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1017124763287072263.bin' '-l' '-1' '-v' '-w' '/tmp/graph1017124763287072263.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:59:33] [INFO ] Decomposing Gal with order
[2024-05-21 18:59:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:59:33] [INFO ] Removed a total of 93 redundant transitions.
[2024-05-21 18:59:33] [INFO ] Flatten gal took : 34 ms
[2024-05-21 18:59:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 7 ms.
[2024-05-21 18:59:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15695978478919676084.gal : 3 ms
[2024-05-21 18:59:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13596801846792139130.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/CTLFireability15695978478919676084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13596801846792139130.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.68744e+07,27.0838,536832,2396,1803,467541,104550,291,2.68989e+06,111,1.93728e+06,0


Converting to forward existential form...Done !
original formula: A(AX(EX(((i7.u0.s1>=1)&&(i5.u14.l485>=1)))) U E(!((AG(((i7.u0.s1>=1)&&(i3.u5.l110>=1))) + E(((i7.u0.s1>=1)&&(u11.l336>=1)) U EF(((i7.u0.s...482
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((!(E(TRUE U !(((i7.u0.s1>=1)&&(i3.u5.l110>=1))))) + E(((i7.u0.s1>=1)&&(u11.l336>=1)) U E(TR...1489
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t24, t27, t28, t29, t31, t32, t33, t62, t70, t71, t72, t73, t75, t76, t77, t78, t80, ...339
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 106
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 75 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 75 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 75 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 74 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 74 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 73 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 73 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 72 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 72 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 72 transition count 92
Applied a total of 58 rules in 13 ms. Remains 72 /99 variables (removed 27) and now considering 92/136 (removed 44) transitions.
// Phase 1: matrix 92 rows 72 cols
[2024-05-21 19:00:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:00:03] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 19:00:03] [INFO ] Invariant cache hit.
[2024-05-21 19:00:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 19:00:03] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-21 19:00:03] [INFO ] Invariant cache hit.
[2024-05-21 19:00:03] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/164 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 38/112 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 112 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1653 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/164 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 38/112 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 91/203 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 203 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3197 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4914ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4915ms
Starting structural reductions in LTL mode, iteration 1 : 72/99 places, 92/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5076 ms. Remains : 72/99 places, 92/136 transitions.
[2024-05-21 19:00:08] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:00:08] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:00:08] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-21 19:00:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:00:08] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:00:08] [INFO ] Time to serialize gal into /tmp/CTLFireability13171006637269302065.gal : 2 ms
[2024-05-21 19:00:08] [INFO ] Time to serialize properties into /tmp/CTLFireability4387254748058106365.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/CTLFireability13171006637269302065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4387254748058106365.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,2.2044e+07,2.39427,82104,2,12668,5,330442,6,0,380,276048,0


Converting to forward existential form...Done !
original formula: (EG(A((!(((((s1>=1)&&(l110>=1))||((s1>=1)&&(l33>=1)))||(((s1>=1)&&(l496>=1))&&((s1>=1)&&(l488>=1))))) + AF((((s1>=1)&&(l33>=1))&&((s1>=1)...411
=> equivalent forward existential formula: ([((EY((Init * EG(!((E(!(!(EX(!((E(TRUE U ((s1>=1)&&(l502>=1))) * !(((p15>=1)&&(l0>=1)))))))) U (!((!(((((s1>=1)...1074
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t45, t46, t47, t55, t56, t57, t58, t62, t63, t64, t68, t69,...364
Detected timeout of ITS tools.
[2024-05-21 19:00:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:00:38] [INFO ] Applying decomposition
[2024-05-21 19:00:38] [INFO ] Flatten gal took : 4 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/graph3125560306110585677.txt' '-o' '/tmp/graph3125560306110585677.bin' '-w' '/tmp/graph3125560306110585677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3125560306110585677.bin' '-l' '-1' '-v' '-w' '/tmp/graph3125560306110585677.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:00:38] [INFO ] Decomposing Gal with order
[2024-05-21 19:00:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:00:38] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-21 19:00:38] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:00:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 3 ms.
[2024-05-21 19:00:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13950012171635248179.gal : 2 ms
[2024-05-21 19:00:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3234868865067111093.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/CTLFireability13950012171635248179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3234868865067111093.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,2.2044e+07,14.0201,253356,3229,720,238244,18400,299,1.31695e+06,97,252258,0


Converting to forward existential form...Done !
original formula: (EG(A((!(((((i3.u1.s1>=1)&&(i3.u1.l110>=1))||((i3.u1.s1>=1)&&(i4.u12.l33>=1)))||(((i3.u1.s1>=1)&&(i5.u15.l496>=1))&&((i3.u1.s1>=1)&&(i4.u...601
=> equivalent forward existential formula: ([((EY((Init * EG(!((E(!(!(EX(!((E(TRUE U ((i3.u1.s1>=1)&&(i6.u16.l502>=1))) * !(((i3.u8.p15>=1)&&(i3.u1.l0>=1))...1466
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t8, t9, t28, t32, t45, t46, t47, t55, t56, t57, t62, t63, t64, t69, t70, t71, t72, t7...357
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 76 transition count 98
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 76 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 76 transition count 97
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 67 transition count 88
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 61 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 61 transition count 73
Applied a total of 82 rules in 22 ms. Remains 61 /99 variables (removed 38) and now considering 73/136 (removed 63) transitions.
// Phase 1: matrix 73 rows 61 cols
[2024-05-21 19:01:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:01:08] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 19:01:08] [INFO ] Invariant cache hit.
[2024-05-21 19:01:08] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 19:01:08] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-21 19:01:08] [INFO ] Invariant cache hit.
[2024-05-21 19:01:08] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/134 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 89 constraints, problems are : Problem set: 0 solved, 72 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/134 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 72/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 161 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1948 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2932ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2934ms
Starting structural reductions in LTL mode, iteration 1 : 61/99 places, 73/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3088 ms. Remains : 61/99 places, 73/136 transitions.
[2024-05-21 19:01:11] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:01:11] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:01:11] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-21 19:01:11] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:01:11] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:01:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10111423781827738919.gal : 1 ms
[2024-05-21 19:01:11] [INFO ] Time to serialize properties into /tmp/CTLFireability6762554444707016922.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/CTLFireability10111423781827738919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6762554444707016922.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.72445e+06,1.43386,50168,2,9919,5,165826,6,0,317,187779,0


Converting to forward existential form...Done !
original formula: (AX(((s1<1)||(l149<1))) * AF(EX(((s1>=1)&&(l336>=1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(((s1<1)||(l149<1))))] = FALSE * [FwdG(Init,!(EX(((s1>=1)&&(l336>=1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t48, t53, t54, t55, t5...336
(forward)formula 0,0,10.9953,304980,1,0,418,1.199e+06,168,238,2166,1.85512e+06,343
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-03 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 : 99/99 places, 136/136 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 84 transition count 114
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 84 transition count 114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 81 transition count 111
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 81 transition count 111
Applied a total of 36 rules in 2 ms. Remains 81 /99 variables (removed 18) and now considering 111/136 (removed 25) transitions.
// Phase 1: matrix 111 rows 81 cols
[2024-05-21 19:01:23] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:01:23] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:01:23] [INFO ] Invariant cache hit.
[2024-05-21 19:01:23] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 19:01:23] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 19:01:23] [INFO ] Invariant cache hit.
[2024-05-21 19:01:23] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/192 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 46/129 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 129 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/192 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 46/129 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 110/239 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 239 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3777 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6031ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6033ms
Starting structural reductions in LTL mode, iteration 1 : 81/99 places, 111/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6189 ms. Remains : 81/99 places, 111/136 transitions.
[2024-05-21 19:01:29] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:01:29] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:01:29] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-21 19:01:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:01:29] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:01:29] [INFO ] Time to serialize gal into /tmp/CTLFireability853123140624000067.gal : 1 ms
[2024-05-21 19:01:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14783111593605638616.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/CTLFireability853123140624000067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14783111593605638616.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,5.3002e+07,16.9421,400164,2,23051,5,1.6472e+06,6,0,435,1.18242e+06,0


Converting to forward existential form...Done !
original formula: ((AG(AF(((s1<1)||(l150<1)))) * A(!(((EX(((s1>=1)&&(l339>=1))) + (AF(!(((s1<1)||(l150<1)))) * !(((s1>=1)&&(l340>=1))))) * A((((s1>=1)&&(l3...678
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!(((s1<1)||(l150<1))))] = FALSE * (([(((((FwdU(Init,!((((((((s1>=1)&&(l487>=1))||((s1>=1...2901
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t53, t54, t55, t65, t6...438
Detected timeout of ITS tools.
[2024-05-21 19:01:59] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:01:59] [INFO ] Applying decomposition
[2024-05-21 19:01:59] [INFO ] Flatten gal took : 4 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/graph16451054914024501150.txt' '-o' '/tmp/graph16451054914024501150.bin' '-w' '/tmp/graph16451054914024501150.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16451054914024501150.bin' '-l' '-1' '-v' '-w' '/tmp/graph16451054914024501150.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:01:59] [INFO ] Decomposing Gal with order
[2024-05-21 19:01:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:01:59] [INFO ] Removed a total of 112 redundant transitions.
[2024-05-21 19:01:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:01:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 4 ms.
[2024-05-21 19:01:59] [INFO ] Time to serialize gal into /tmp/CTLFireability658282051816433824.gal : 1 ms
[2024-05-21 19:01:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3631775319873974443.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/CTLFireability658282051816433824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3631775319873974443.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 75 transition count 93
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 75 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 75 transition count 92
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 66 transition count 83
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 62 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 61 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 60 transition count 68
Applied a total of 84 rules in 17 ms. Remains 60 /99 variables (removed 39) and now considering 68/136 (removed 68) transitions.
// Phase 1: matrix 68 rows 60 cols
[2024-05-21 19:02:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:02:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:02:29] [INFO ] Invariant cache hit.
[2024-05-21 19:02:29] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 19:02:29] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-21 19:02:29] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2024-05-21 19:02:29] [INFO ] Invariant cache hit.
[2024-05-21 19:02:29] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 83 constraints, problems are : Problem set: 0 solved, 67 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 67/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 150 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1775 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 2706ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 2706ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/99 places, 68/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2861 ms. Remains : 60/99 places, 68/136 transitions.
[2024-05-21 19:02:32] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:02:32] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:02:32] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-21 19:02:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:02:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:02:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11044561458783544743.gal : 3 ms
RANDOM walk for 10625 steps (2431 resets) in 32 ms. (321 steps per ms) remains 0/1 properties
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 19:02:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17453123792572933160.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11044561458783544743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17453123792572933160.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 76 transition count 98
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 76 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 76 transition count 97
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 67 transition count 88
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 59 transition count 69
Applied a total of 88 rules in 12 ms. Remains 59 /99 variables (removed 40) and now considering 69/136 (removed 67) transitions.
// Phase 1: matrix 69 rows 59 cols
[2024-05-21 19:02:32] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:02:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 19:02:32] [INFO ] Invariant cache hit.
[2024-05-21 19:02:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:02:32] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-21 19:02:32] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-21 19:02:32] [INFO ] Invariant cache hit.
[2024-05-21 19:02:32] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 68 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 154 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1427 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 2293ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2294ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/99 places, 69/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2407 ms. Remains : 59/99 places, 69/136 transitions.
[2024-05-21 19:02:34] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:02:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:02:34] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-21 19:02:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:02:34] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:02:34] [INFO ] Time to serialize gal into /tmp/CTLFireability529360739959072254.gal : 1 ms
[2024-05-21 19:02:34] [INFO ] Time to serialize properties into /tmp/CTLFireability14492076257733543944.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/CTLFireability529360739959072254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14492076257733543944.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,2.4251e+06,0.976852,38824,2,10621,5,134529,6,0,305,145373,0


Converting to forward existential form...Done !
original formula: AG(EF(((s1>=1)&&(l149>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((s1>=1)&&(l149>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t45, t50, t51, t52, t5...331
(forward)formula 0,0,7.50517,214248,1,0,192,1.02302e+06,159,80,2084,961283,207
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 103
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 78 transition count 101
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 70 transition count 93
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 70 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 70 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 68 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 66 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 66 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 65 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 65 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 65 transition count 81
Applied a total of 74 rules in 8 ms. Remains 65 /99 variables (removed 34) and now considering 81/136 (removed 55) transitions.
// Phase 1: matrix 81 rows 65 cols
[2024-05-21 19:02:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:02:42] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 19:02:42] [INFO ] Invariant cache hit.
[2024-05-21 19:02:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 19:02:42] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-21 19:02:42] [INFO ] Invariant cache hit.
[2024-05-21 19:02:42] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/146 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 98 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/146 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 80/178 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 178 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2236 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3353ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3354ms
Starting structural reductions in LTL mode, iteration 1 : 65/99 places, 81/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3489 ms. Remains : 65/99 places, 81/136 transitions.
[2024-05-21 19:02:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:02:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:02:45] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-21 19:02:45] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:02:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:02:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16146203512664152405.gal : 1 ms
[2024-05-21 19:02:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7337226086269315076.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/CTLFireability16146203512664152405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7337226086269315076.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.00471e+06,2.73593,88860,2,11750,5,330119,6,0,341,312310,0


Converting to forward existential form...Done !
original formula: E(!(A(!(((s1>=1)&&(l149>=1))) U ((s3>=1)&&(l0>=1)))) U AG(EX((((s1>=1)&&(l486>=1))&&(l33>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(!((E(!(((s3>=1)&&(l0>=1))) U (!(!(((s1>=1)&&(l149>=1)))) * !(((s3>=1)&&(l0>=1))))) + EG(!(((s3>=1)...237
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t48, t49, t50,...364
(forward)formula 0,0,5.68076,127488,1,0,172,571828,183,65,2359,460534,179
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 76 transition count 96
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 76 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 76 transition count 95
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 68 transition count 87
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 60 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 60 transition count 70
Applied a total of 84 rules in 16 ms. Remains 60 /99 variables (removed 39) and now considering 70/136 (removed 66) transitions.
// Phase 1: matrix 70 rows 60 cols
[2024-05-21 19:02:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:02:51] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 19:02:51] [INFO ] Invariant cache hit.
[2024-05-21 19:02:51] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:02:51] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-21 19:02:51] [INFO ] Invariant cache hit.
[2024-05-21 19:02:51] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 85 constraints, problems are : Problem set: 0 solved, 69 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 154 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1729 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2721ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2722ms
Starting structural reductions in LTL mode, iteration 1 : 60/99 places, 70/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2852 ms. Remains : 60/99 places, 70/136 transitions.
[2024-05-21 19:02:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:02:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:02:54] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-21 19:02:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:02:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:02:54] [INFO ] Time to serialize gal into /tmp/CTLFireability4155413537134603883.gal : 4 ms
[2024-05-21 19:02:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13415100858290512657.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/CTLFireability4155413537134603883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13415100858290512657.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.09883e+06,1.30242,40092,2,9637,5,146526,6,0,310,146149,0


Converting to forward existential form...Done !
original formula: EX(AG((AX(((s1<1)||(l354<1))) + EG(((p11<1)||(l154<1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(EX(!(((s1<1)||(l354<1))))) + EG(((p11<1)||(l154<1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t37, t38, t39, t45, t50, t51, t52, t53, t54, t55, t56, t57, t58, t5...306
(forward)formula 0,0,20.4245,568740,1,0,366,3.00506e+06,169,165,2185,2.97957e+06,445
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 109
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 82 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 78 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 78 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 77 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 77 transition count 102
Applied a total of 46 rules in 7 ms. Remains 77 /99 variables (removed 22) and now considering 102/136 (removed 34) transitions.
// Phase 1: matrix 102 rows 77 cols
[2024-05-21 19:03:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:03:15] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 19:03:15] [INFO ] Invariant cache hit.
[2024-05-21 19:03:15] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 19:03:15] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-21 19:03:15] [INFO ] Invariant cache hit.
[2024-05-21 19:03:15] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/179 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 118 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1796 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/179 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 101/219 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 219 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 5130ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 5131ms
Starting structural reductions in LTL mode, iteration 1 : 77/99 places, 102/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5278 ms. Remains : 77/99 places, 102/136 transitions.
[2024-05-21 19:03:20] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:03:20] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:03:20] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-21 19:03:20] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:03:20] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:03:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9255878449153255749.gal : 1 ms
[2024-05-21 19:03:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11922056604983495730.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/CTLFireability9255878449153255749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11922056604983495730.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.59244e+07,11.4966,301344,2,18964,5,1.11364e+06,6,0,410,1.01568e+06,0


Converting to forward existential form...Done !
original formula: (AF(((!(A(A(((s1>=1)&&(l353>=1)) U ((s1>=1)&&(l486>=1))) U (((s1>=1)&&(l110>=1))&&((s1>=1)&&(l489>=1))))) * EF((AX(((s1>=1)&&(l486>=1))) ...372
=> equivalent forward existential formula: ([FwdG(Init,!(((!(!((E(!((((s1>=1)&&(l110>=1))&&((s1>=1)&&(l489>=1)))) U (!(!((E(!(((s1>=1)&&(l486>=1))) U (!(((...875
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54, t55, t5...414
Detected timeout of ITS tools.
[2024-05-21 19:03:50] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:03:50] [INFO ] Applying decomposition
[2024-05-21 19:03:50] [INFO ] Flatten gal took : 3 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/graph3555210317294337784.txt' '-o' '/tmp/graph3555210317294337784.bin' '-w' '/tmp/graph3555210317294337784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3555210317294337784.bin' '-l' '-1' '-v' '-w' '/tmp/graph3555210317294337784.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:03:50] [INFO ] Decomposing Gal with order
[2024-05-21 19:03:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:03:50] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-21 19:03:50] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:03:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 3 ms.
[2024-05-21 19:03:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9214059862264815965.gal : 1 ms
[2024-05-21 19:03:50] [INFO ] Time to serialize properties into /tmp/CTLFireability71215277533440050.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/CTLFireability9214059862264815965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability71215277533440050.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.59244e+07,2.67505,84024,1768,1757,99410,23845,256,193721,144,402237,0


Converting to forward existential form...Done !
original formula: (AF(((!(A(A(((u3.s1>=1)&&(u11.l353>=1)) U ((u3.s1>=1)&&(i6.u12.l486>=1))) U (((u3.s1>=1)&&(u3.l110>=1))&&((u3.s1>=1)&&(u1.l489>=1))))) * ...467
=> equivalent forward existential formula: ([FwdG(Init,!(((!(!((E(!((((u3.s1>=1)&&(u3.l110>=1))&&((u3.s1>=1)&&(u1.l489>=1)))) U (!(!((E(!(((u3.s1>=1)&&(i6....1058
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t9, t19, t29, t54, t55, t56, t64, t66, t67, t68, t77, t78, t80, t81, t82, t83, t84, t...354
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
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
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
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
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
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
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
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
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 7
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 95
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 77 transition count 94
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 70 transition count 87
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 70 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 70 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 68 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 68 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 68 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 67 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 67 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 66 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 65 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 65 transition count 75
Applied a total of 74 rules in 3 ms. Remains 65 /99 variables (removed 34) and now considering 75/136 (removed 61) transitions.
// Phase 1: matrix 75 rows 65 cols
[2024-05-21 19:04:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:04:20] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:04:20] [INFO ] Invariant cache hit.
[2024-05-21 19:04:20] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:04:20] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-21 19:04:20] [INFO ] Invariant cache hit.
[2024-05-21 19:04:20] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/140 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/140 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 74/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 164 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1837 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2941ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2941ms
Starting structural reductions in LTL mode, iteration 1 : 65/99 places, 75/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3065 ms. Remains : 65/99 places, 75/136 transitions.
[2024-05-21 19:04:23] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:04:23] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:04:23] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-21 19:04:23] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:04:23] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:04:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17767211423925881468.gal : 0 ms
[2024-05-21 19:04:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3172536458160248353.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/CTLFireability17767211423925881468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3172536458160248353.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.8204e+06,5.50559,158528,2,19574,5,494654,6,0,335,722694,0


Converting to forward existential form...Done !
original formula: (!(A(((s1>=1)&&(l487>=1)) U AX(EX(AX(((s1>=1)&&(l116>=1))))))) + (AG(((p13<1)||(l155<1))) * EG(!(E(((s1>=1)&&(l342>=1)) U ((p37>=1)&&(l12...166
=> equivalent forward existential formula: ([(FwdU((Init * !(!(!((E(!(!(EX(!(EX(!(EX(!(((s1>=1)&&(l116>=1)))))))))) U (!(((s1>=1)&&(l487>=1))) * !(!(EX(!(E...572
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t20, t29, t44, t45, t53, t54, t55, t56, t57, t58, t59, t60, t61, t6...316
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 19:04:53] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:04:53] [INFO ] Applying decomposition
[2024-05-21 19:04:53] [INFO ] Flatten gal took : 2 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/graph5631573882584422393.txt' '-o' '/tmp/graph5631573882584422393.bin' '-w' '/tmp/graph5631573882584422393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5631573882584422393.bin' '-l' '-1' '-v' '-w' '/tmp/graph5631573882584422393.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:04:53] [INFO ] Decomposing Gal with order
[2024-05-21 19:04:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:04:53] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-21 19:04:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:04:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 2 ms.
[2024-05-21 19:04:53] [INFO ] Time to serialize gal into /tmp/CTLFireability11432730000378856052.gal : 1 ms
[2024-05-21 19:04:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1864786764321486378.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/CTLFireability11432730000378856052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1864786764321486378.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 76 transition count 95
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 76 transition count 95
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 67 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 64 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 60 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 59 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 87 place count 59 transition count 67
Applied a total of 87 rules in 8 ms. Remains 59 /99 variables (removed 40) and now considering 67/136 (removed 69) transitions.
// Phase 1: matrix 67 rows 59 cols
[2024-05-21 19:05:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:05:23] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 19:05:23] [INFO ] Invariant cache hit.
[2024-05-21 19:05:23] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:05:23] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-21 19:05:23] [INFO ] Invariant cache hit.
[2024-05-21 19:05:23] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 66 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 66/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 150 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 2452ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2453ms
Starting structural reductions in LTL mode, iteration 1 : 59/99 places, 67/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2562 ms. Remains : 59/99 places, 67/136 transitions.
[2024-05-21 19:05:26] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:05:26] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:05:26] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-21 19:05:26] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:05:26] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:05:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10224938662484572338.gal : 1 ms
[2024-05-21 19:05:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17295094671940510690.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/CTLFireability10224938662484572338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17295094671940510690.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,2.4133e+06,0.622928,28020,2,9045,5,96180,6,0,303,96215,0


Converting to forward existential form...Done !
original formula: !(E(((s1>=1)&&(l497>=1)) U (AF(((p14>=1)&&(l156>=1))) + AX(EF(((s2>=1)&&(l496>=1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,((s1>=1)&&(l497>=1))) * !(EG(!(((p14>=1)&&(l156>=1))))))] = FALSE * [(FwdU(Init,((s1>=1)&&(l497>=1)...211
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t41, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t5...291
Hit Full ! (commute/partial/dont) 1/64/66
(forward)formula 0,0,7.52934,225512,1,0,194,1.15072e+06,162,87,2158,982759,220
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 95
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 77 transition count 94
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 69 transition count 86
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 67 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 67 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 65 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 64 transition count 74
Applied a total of 75 rules in 7 ms. Remains 64 /99 variables (removed 35) and now considering 74/136 (removed 62) transitions.
// Phase 1: matrix 74 rows 64 cols
[2024-05-21 19:05:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:05:33] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:05:33] [INFO ] Invariant cache hit.
[2024-05-21 19:05:34] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:05:34] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 19:05:34] [INFO ] Invariant cache hit.
[2024-05-21 19:05:34] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/138 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 89 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/138 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 73/162 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 162 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2766ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2767ms
Starting structural reductions in LTL mode, iteration 1 : 64/99 places, 74/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2886 ms. Remains : 64/99 places, 74/136 transitions.
[2024-05-21 19:05:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:05:36] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:05:36] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-21 19:05:36] [INFO ] Flatten gal took : 19 ms
[2024-05-21 19:05:36] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:05:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16686530118006189030.gal : 1 ms
[2024-05-21 19:05:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12177566562277176873.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/CTLFireability16686530118006189030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12177566562277176873.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,5.3123e+06,1.95239,64904,2,12164,5,208998,6,0,330,277897,0


Converting to forward existential form...Done !
original formula: (E(!(AX(AG(!(((s1>=1)&&(l127>=1)))))) U EX(((s7>=1)&&(l0>=1)))) + AF(((EX(EF(((s1>=1)&&(l110>=1)))) * (p20>=1)) * (l115>=1))))
=> equivalent forward existential formula: [FwdG((Init * !(E(!(!(EX(!(!(E(TRUE U !(!(((s1>=1)&&(l127>=1)))))))))) U EX(((s7>=1)&&(l0>=1)))))),!(((EX(E(TRUE...216
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t29, t47, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...306
(forward)formula 0,1,21.5884,589620,1,0,421,2.6822e+06,182,223,2324,3.2981e+06,441
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 99
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 77 transition count 98
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 68 transition count 89
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 65 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 63 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 61 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 61 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 61 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 82 place count 60 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 60 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 85 place count 60 transition count 71
Applied a total of 85 rules in 4 ms. Remains 60 /99 variables (removed 39) and now considering 71/136 (removed 65) transitions.
// Phase 1: matrix 71 rows 60 cols
[2024-05-21 19:05:58] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:05:58] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:05:58] [INFO ] Invariant cache hit.
[2024-05-21 19:05:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:05:58] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-21 19:05:58] [INFO ] Invariant cache hit.
[2024-05-21 19:05:58] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 87 constraints, problems are : Problem set: 0 solved, 70 unsolved in 893 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 70/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 157 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1544 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2470ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2471ms
Starting structural reductions in LTL mode, iteration 1 : 60/99 places, 71/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2581 ms. Remains : 60/99 places, 71/136 transitions.
[2024-05-21 19:06:01] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:06:01] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:06:01] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-21 19:06:01] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:06:01] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:06:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2539758447769003359.gal : 1 ms
[2024-05-21 19:06:01] [INFO ] Time to serialize properties into /tmp/CTLFireability11944992199434591658.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/CTLFireability2539758447769003359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11944992199434591658.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,2.55019e+06,2.03136,65540,2,11763,5,245879,6,0,311,237444,0


Converting to forward existential form...Done !
original formula: AG(!(A(EX(EF(((s1>=1)&&(l123>=1)))) U EG(E(((s1>=1)&&(l149>=1)) U ((p26>=1)&&(l0>=1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(EG(E(((s1>=1)&&(l149>=1)) U ((p26>=1)&&(l0>=1)))))))) * !(E(!(EG(E(((s1>=1)&&(l149>=...292
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t46, t51, t52, t53, t5...336
Using saturation style SCC detection
(forward)formula 0,1,9.39044,250904,1,0,271,1.22126e+06,176,128,2196,1.08676e+06,311
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2023-13 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 : 99/99 places, 136/136 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 99
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 77 transition count 98
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 68 transition count 89
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 65 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 63 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 61 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 60 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 60 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 85 place count 60 transition count 71
Applied a total of 85 rules in 11 ms. Remains 60 /99 variables (removed 39) and now considering 71/136 (removed 65) transitions.
// Phase 1: matrix 71 rows 60 cols
[2024-05-21 19:06:10] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:06:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 19:06:10] [INFO ] Invariant cache hit.
[2024-05-21 19:06:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:06:10] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-21 19:06:10] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-21 19:06:10] [INFO ] Invariant cache hit.
[2024-05-21 19:06:10] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 87 constraints, problems are : Problem set: 0 solved, 70 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 70/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 157 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2573ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2574ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/99 places, 71/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2709 ms. Remains : 60/99 places, 71/136 transitions.
[2024-05-21 19:06:13] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:06:13] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:06:13] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-21 19:06:13] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:06:13] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:06:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4476628508835691412.gal : 1 ms
[2024-05-21 19:06:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4260987022764372656.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/CTLFireability4476628508835691412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4260987022764372656.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,2.55019e+06,1.35884,50084,2,11827,5,172522,6,0,311,197171,0


Converting to forward existential form...Done !
original formula: EF(AG((EF(((s1>=1)&&(l149>=1))) + ((p22>=1)&&(l0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U ((s1>=1)&&(l149>=1))) + ((p22>=1)&&(l0>=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t46, t51, t52, t53, t5...336
(forward)formula 0,0,10.3356,293796,1,0,203,1.36774e+06,164,85,2094,1.3478e+06,222
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 76 transition count 95
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 76 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 76 transition count 93
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 56 place count 68 transition count 85
Iterating global reduction 1 with 8 rules applied. Total rules applied 64 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 66 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 63 transition count 73
Applied a total of 78 rules in 3 ms. Remains 63 /99 variables (removed 36) and now considering 73/136 (removed 63) transitions.
// Phase 1: matrix 73 rows 63 cols
[2024-05-21 19:06:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:06:23] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 19:06:23] [INFO ] Invariant cache hit.
[2024-05-21 19:06:23] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:06:23] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-21 19:06:23] [INFO ] Invariant cache hit.
[2024-05-21 19:06:23] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 88 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 160 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1818 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2886ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2887ms
Starting structural reductions in LTL mode, iteration 1 : 63/99 places, 73/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3007 ms. Remains : 63/99 places, 73/136 transitions.
[2024-05-21 19:06:26] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:06:26] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:06:26] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-21 19:06:26] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:06:26] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:06:26] [INFO ] Time to serialize gal into /tmp/CTLFireability699340785812498037.gal : 0 ms
[2024-05-21 19:06:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6791101134044509607.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/CTLFireability699340785812498037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6791101134044509607.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,5.15219e+06,3.48262,103860,2,14784,5,421659,6,0,325,378376,0


Converting to forward existential form...Done !
original formula: EF(EX(EX((EF(((s1>=1)&&(l485>=1))) * ((s1<1)||(l114<1))))))
=> equivalent forward existential formula: [(FwdU((EY(EY(FwdU(Init,TRUE))) * ((s1<1)||(l114<1))),TRUE) * ((s1>=1)&&(l485>=1)))] != FALSE
(forward)formula 0,1,3.78994,103860,1,0,11,421659,10,2,708,378376,6
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-21 19:06:30] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:06:30] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:06:30] [INFO ] Applying decomposition
[2024-05-21 19:06:30] [INFO ] Flatten gal took : 4 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/graph16739394760115533951.txt' '-o' '/tmp/graph16739394760115533951.bin' '-w' '/tmp/graph16739394760115533951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16739394760115533951.bin' '-l' '-1' '-v' '-w' '/tmp/graph16739394760115533951.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:06:30] [INFO ] Decomposing Gal with order
[2024-05-21 19:06:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:06:30] [INFO ] Removed a total of 167 redundant transitions.
[2024-05-21 19:06:30] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:06:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 4 ms.
[2024-05-21 19:06:30] [INFO ] Time to serialize gal into /tmp/CTLFireability18403878226221557508.gal : 45 ms
[2024-05-21 19:06:30] [INFO ] Time to serialize properties into /tmp/CTLFireability10727096916488940456.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/CTLFireability18403878226221557508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10727096916488940456.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 5 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.30142e+08,11.3977,208576,4970,634,252825,16205,378,767549,82,94057,0


Converting to forward existential form...Done !
original formula: A(AX(EX(((i1.u1.s1>=1)&&(i7.u15.l485>=1)))) U E(!((AG(((i1.u1.s1>=1)&&(i3.u4.l110>=1))) + E(((i1.u1.s1>=1)&&(i1.u9.l336>=1)) U EF(((i1.u1...489
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((!(E(TRUE U !(((i1.u1.s1>=1)&&(i3.u4.l110>=1))))) + E(((i1.u1.s1>=1)&&(i1.u9.l336>=1)) U E(...1510
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t8, t9, t26, t27, t28, t31, t32, t36, t56, t57, t58, t59, t60, t61, t73, t74, t75, t7...458
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
(forward)formula 0,1,41.2249,745028,1,0,908622,44807,1658,4.46118e+06,433,318430,1399332
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG(A((!(((((i1.u1.s1>=1)&&(i3.u4.l110>=1))||((i1.u1.s1>=1)&&(i0.u10.l33>=1)))||(((i1.u1.s1>=1)&&(i7.u15.l496>=1))&&((i1.u1.s1>=1)&&(u13....594
=> equivalent forward existential formula: ([((EY((Init * EG(!((E(!(!(EX(!((E(TRUE U ((i1.u1.s1>=1)&&(i0.u16.l502>=1))) * !(((u5.p15>=1)&&(i1.u1.l0>=1)))))...1438
(forward)formula 1,1,108.551,2082756,1,0,2.42172e+06,66041,1763,1.31261e+07,442,420059,3417038
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((AG(AF(((i1.u1.s1<1)||(i3.u7.l150<1)))) * A(!(((EX(((i1.u1.s1>=1)&&(i0.u10.l339>=1))) + (AF(!(((i1.u1.s1<1)||(i3.u7.l150<1)))) * !(((i1....968
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!(((i1.u1.s1<1)||(i3.u7.l150<1))))] = FALSE * (([(((((FwdU(Init,!((((((((i1.u1.s1>=1)&&(...3979
(forward)formula 2,0,199.027,2201960,1,0,2.60338e+06,67725,1221,1.34728e+07,317,430128,2269925
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(((!(A(A(((i1.u1.s1>=1)&&(i0.u0.l353>=1)) U ((i1.u1.s1>=1)&&(i7.u15.l486>=1))) U (((i1.u1.s1>=1)&&(i3.u4.l110>=1))&&((i1.u1.s1>=1)&&(u...528
=> equivalent forward existential formula: ([FwdG(Init,!(((!(!((E(!((((i1.u1.s1>=1)&&(i3.u4.l110>=1))&&((i1.u1.s1>=1)&&(u13.l489>=1)))) U (!(!((E(!(((i1.u1...1169
(forward)formula 3,0,256.486,2381216,1,0,2.60338e+06,67725,1399,1.55875e+07,323,430128,3740743
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(A(((i1.u1.s1>=1)&&(u13.l487>=1)) U AX(EX(AX(((i1.u1.s1>=1)&&(i3.u4.l116>=1))))))) + (AG(((u5.p13<1)||(i7.u12.l155<1))) * EG(!(E(((i1.u...219
=> equivalent forward existential formula: ([(FwdU((Init * !(!(!((E(!(!(EX(!(EX(!(EX(!(((i1.u1.s1>=1)&&(i3.u4.l116>=1)))))))))) U (!(((i1.u1.s1>=1)&&(u13.l...695
(forward)formula 4,0,297.79,2423720,1,0,2.60338e+06,67725,1229,1.58066e+07,321,430128,1097403
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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

BK_STOP 1716318689258

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m08"
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 DBSingleClientW-PT-d0m08, 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 r092-tall-171624189300466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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