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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.3K 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 7.2K Apr 12 12:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 12:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:44 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-d0m04-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716317112227

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-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 18:45:13] [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:45:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:45:13] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-21 18:45:13] [INFO ] Transformed 553 places.
[2024-05-21 18:45:13] [INFO ] Transformed 150 transitions.
[2024-05-21 18:45:13] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Support contains 69 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 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 101 transition count 138
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 101 transition count 138
Applied a total of 20 rules in 25 ms. Remains 101 /109 variables (removed 8) and now considering 138/150 (removed 12) transitions.
// Phase 1: matrix 138 rows 101 cols
[2024-05-21 18:45:13] [INFO ] Computed 2 invariants in 16 ms
[2024-05-21 18:45:13] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-21 18:45:13] [INFO ] Invariant cache hit.
[2024-05-21 18:45:14] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 18:45:14] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2024-05-21 18:45:14] [INFO ] Invariant cache hit.
[2024-05-21 18:45:14] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/239 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 62/165 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 165 constraints, problems are : Problem set: 0 solved, 137 unsolved in 3896 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/239 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 62/165 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 137/302 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/239 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 302 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6073 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
After SMT, in 10205ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 10218ms
Starting structural reductions in LTL mode, iteration 1 : 101/109 places, 138/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10663 ms. Remains : 101/109 places, 138/150 transitions.
Support contains 69 out of 101 places after structural reductions.
[2024-05-21 18:45:24] [INFO ] Flatten gal took : 30 ms
[2024-05-21 18:45:24] [INFO ] Flatten gal took : 30 ms
[2024-05-21 18:45:24] [INFO ] Input system was already deterministic with 138 transitions.
Support contains 67 out of 101 places (down from 69) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 59 to 58
RANDOM walk for 40000 steps (9160 resets) in 2632 ms. (15 steps per ms) remains 28/58 properties
BEST_FIRST walk for 4001 steps (399 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (212 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (206 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (207 resets) in 34 ms. (114 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4003 steps (193 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (190 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (164 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (219 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (96 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (202 resets) in 12 ms. (307 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (193 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (404 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (422 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (189 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (192 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (185 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (216 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (194 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (208 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (201 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (386 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (188 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (374 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (398 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (208 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (193 resets) in 13 ms. (285 steps per ms) remains 24/25 properties
[2024-05-21 18:45:25] [INFO ] Invariant cache hit.
[2024-05-21 18:45:25] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/66 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 16/82 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 116/198 variables, 82/84 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 40/124 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 8 (OVERLAPS) 41/239 variables, 19/143 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 22/165 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/165 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/239 variables, 0/165 constraints. Problems are: Problem set: 5 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 165 constraints, problems are : Problem set: 5 solved, 19 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 34/59 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 19 unsolved
[2024-05-21 18:45:26] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 19/78 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 110/188 variables, 78/81 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 34/115 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/116 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/116 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 49/237 variables, 22/138 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 27/165 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 18/183 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/183 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 2/239 variables, 1/184 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 1/185 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 0/185 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 0/239 variables, 0/185 constraints. Problems are: Problem set: 5 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 185 constraints, problems are : Problem set: 5 solved, 19 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 19/24 constraints, Known Traps: 1/1 constraints]
After SMT, in 2545ms problems are : Problem set: 5 solved, 19 unsolved
Fused 19 Parikh solutions to 17 different solutions.
Parikh walk visited 1 properties in 819 ms.
Support contains 24 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 89 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 89 transition count 117
Applied a total of 24 rules in 17 ms. Remains 89 /101 variables (removed 12) and now considering 117/138 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 89/101 places, 117/138 transitions.
RANDOM walk for 40000 steps (9135 resets) in 279 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (208 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (193 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (182 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (216 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (205 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (189 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (396 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (392 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (203 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (200 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (215 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (187 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (209 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (417 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (201 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (394 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (188 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (202 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
Probably explored full state space saw : 9572 states, properties seen :17
Probabilistic random walk after 23033 steps, saw 9572 distinct states, run finished after 63 ms. (steps per millisecond=365 ) properties seen :17
Explored full state space saw : 9649 states, properties seen :0
Exhaustive walk after 23110 steps, saw 9649 distinct states, run finished after 29 ms. (steps per millisecond=796 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-05-21 18:45:29] [INFO ] Flatten gal took : 19 ms
[2024-05-21 18:45:29] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:45:29] [INFO ] Input system was already deterministic with 138 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 339 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 80 transition count 98
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 80 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 43 place count 80 transition count 97
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 68 transition count 85
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 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 69 place count 68 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 65 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 65 transition count 77
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 65 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 64 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 64 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 63 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 63 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 62 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 62 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 62 transition count 71
Applied a total of 83 rules in 33 ms. Remains 62 /101 variables (removed 39) and now considering 71/138 (removed 67) transitions.
// Phase 1: matrix 71 rows 62 cols
[2024-05-21 18:45:29] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 18:45:29] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 18:45:29] [INFO ] Invariant cache hit.
[2024-05-21 18:45:29] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 18:45:29] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-21 18:45:29] [INFO ] Invariant cache hit.
[2024-05-21 18:45:29] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/133 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 85 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1205 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/133 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 70/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 155 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1759 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 3011ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3013ms
Starting structural reductions in LTL mode, iteration 1 : 62/101 places, 71/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3343 ms. Remains : 62/101 places, 71/138 transitions.
[2024-05-21 18:45:32] [INFO ] Flatten gal took : 17 ms
[2024-05-21 18:45:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:45:33] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-21 18:45:33] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:33] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8850184988307047748.gal : 3 ms
[2024-05-21 18:45:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5978983453922174521.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8850184988307047748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5978983453922174521.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,4327,0.074952,6248,2,1726,5,10307,6,0,319,6561,0


Converting to forward existential form...Done !
original formula: AF((AG(AX(((s1>=1)&&(l340>=1)))) + (AG(((p10>=1)&&(l153>=1))) * ((AF(((s6>=1)&&(l0>=1))) + (p24<1)) + (l0<1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(!(EX(!(((s1>=1)&&(l340>=1)))))))) + (!(E(TRUE U !(((p10>=1)&&(l153>=1))))) * ((!(EG(!...211
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t44, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t6...301
(forward)formula 0,0,0.643169,30492,1,0,305,129507,180,157,2208,111832,331
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 82 transition count 104
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 82 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 82 transition count 103
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 72 transition count 93
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 72 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 72 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 71 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 71 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 70 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 70 transition count 89
Applied a total of 64 rules in 8 ms. Remains 70 /101 variables (removed 31) and now considering 89/138 (removed 49) transitions.
// Phase 1: matrix 89 rows 70 cols
[2024-05-21 18:45:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:45:33] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 18:45:33] [INFO ] Invariant cache hit.
[2024-05-21 18:45:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 18:45:33] [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 88 sub problems to find dead transitions.
[2024-05-21 18:45:33] [INFO ] Invariant cache hit.
[2024-05-21 18:45:33] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/159 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 30/102 constraints. Problems are: Problem set: 0 solved, 88 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 102 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/159 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 30/102 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 88/190 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 190 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 3880ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3882ms
Starting structural reductions in LTL mode, iteration 1 : 70/101 places, 89/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4033 ms. Remains : 70/101 places, 89/138 transitions.
[2024-05-21 18:45:37] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:45:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:45:37] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-21 18:45:37] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:45:37] [INFO ] Time to serialize gal into /tmp/CTLFireability3726355753387207734.gal : 2 ms
[2024-05-21 18:45:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17354777998990531812.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/CTLFireability3726355753387207734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17354777998990531812.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,6698,0.107611,8572,2,2214,5,19625,6,0,369,12117,0


Converting to forward existential form...Done !
original formula: EF((EG(((EX(((s1<1)||(l149<1))) + (s1<1)) + (l36<1))) * EX((AX(AG(((s1>=1)&&(l338>=1)))) + ((EG(((s1<1)||(l492<1))) * (s1>=1)) * ((l127>=...208
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * EG(((EX(((s1<1)||(l149<1))) + (s1<1)) + (l36<1))))) * !(EX(!(!(E(TRUE U !(((s1>=1)&&(l3...365
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t56, t57, t65, t6...366
(forward)formula 0,1,0.696755,33704,1,0,237,144618,206,99,2571,97627,263
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 79 transition count 99
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 79 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 79 transition count 98
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 68 transition count 87
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 68 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 69 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 65 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 65 transition count 79
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 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 63 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 61 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 60 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 60 transition count 68
Applied a total of 90 rules in 23 ms. Remains 60 /101 variables (removed 41) and now considering 68/138 (removed 70) transitions.
// Phase 1: matrix 68 rows 60 cols
[2024-05-21 18:45:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:45:38] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 18:45:38] [INFO ] Invariant cache hit.
[2024-05-21 18:45:38] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 18:45:38] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 18:45:38] [INFO ] Redundant transitions in 0 ms returned []
Running 67 sub problems to find dead transitions.
[2024-05-21 18:45:38] [INFO ] Invariant cache hit.
[2024-05-21 18:45:38] [INFO ] State equation strengthened by 24 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, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 67 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 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, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 67/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 153 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1639 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 2599ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 2601ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/101 places, 68/138 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2753 ms. Remains : 60/101 places, 68/138 transitions.
[2024-05-21 18:45:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:45:41] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:41] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-21 18:45:41] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 40000 steps (9126 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-05-21 18:45:41] [INFO ] Flatten gal took : 10 ms
BEST_FIRST walk for 31920 steps (1655 resets) in 33 ms. (938 steps per ms) remains 0/1 properties
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-21 18:45:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15390562256324572808.gal : 1 ms
[2024-05-21 18:45:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12353814996194477619.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15390562256324572808.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12353814996194477619.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 78 transition count 96
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 78 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 78 transition count 95
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 66 transition count 83
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 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 73 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 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 80 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 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 90 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 58 transition count 64
Applied a total of 94 rules in 11 ms. Remains 58 /101 variables (removed 43) and now considering 64/138 (removed 74) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 18:45:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:45:41] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 18:45:41] [INFO ] Invariant cache hit.
[2024-05-21 18:45:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:45:41] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-21 18:45:41] [INFO ] Invariant cache hit.
[2024-05-21 18:45:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1373 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2205ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2206ms
Starting structural reductions in LTL mode, iteration 1 : 58/101 places, 64/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2336 ms. Remains : 58/101 places, 64/138 transitions.
[2024-05-21 18:45:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:45:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:43] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-21 18:45:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:43] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:45:43] [INFO ] Time to serialize gal into /tmp/CTLFireability12992874787439052566.gal : 1 ms
[2024-05-21 18:45:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5936716908898771793.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/CTLFireability12992874787439052566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5936716908898771793.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,3440,0.046451,5780,2,1503,5,8918,6,0,296,6384,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...286
(forward)formula 0,0,0.303177,17132,1,0,217,57384,149,111,1997,54806,202
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 79 transition count 97
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 79 transition count 97
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 79 transition count 96
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 69 transition count 86
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 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 67 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 67 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 67 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 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 66 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 64 transition count 74
Applied a total of 80 rules in 5 ms. Remains 64 /101 variables (removed 37) and now considering 74/138 (removed 64) transitions.
// Phase 1: matrix 74 rows 64 cols
[2024-05-21 18:45:44] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:45:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 18:45:44] [INFO ] Invariant cache hit.
[2024-05-21 18:45:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 18:45:44] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 18:45:44] [INFO ] Invariant cache hit.
[2024-05-21 18:45:44] [INFO ] State equation strengthened by 22 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, 22/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 88 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 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, 22/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 73/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 161 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2926ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2927ms
Starting structural reductions in LTL mode, iteration 1 : 64/101 places, 74/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3054 ms. Remains : 64/101 places, 74/138 transitions.
[2024-05-21 18:45:47] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:45:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:47] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-21 18:45:47] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:45:47] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:45:47] [INFO ] Time to serialize gal into /tmp/CTLFireability8099166152617572929.gal : 1 ms
[2024-05-21 18:45:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3423170758471703253.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/CTLFireability8099166152617572929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3423170758471703253.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,5032,0.066508,6604,2,1805,5,12533,6,0,330,8850,0


Converting to forward existential form...Done !
original formula: AF(((EX(((s1>=1)&&(l7>=1))) * EX(EG(((s0>=1)&&(l0>=1))))) * ((s1>=1)&&(l492>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((s1>=1)&&(l7>=1))) * EX(EG(((s0>=1)&&(l0>=1))))) * ((s1>=1)&&(l492>=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...306
(forward)formula 0,0,0.313736,17956,1,0,152,55361,174,61,2329,39367,171
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-04 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 : 101/101 places, 138/138 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 85 transition count 110
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 85 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 85 transition count 108
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 79 transition count 102
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 79 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 79 transition count 101
Applied a total of 47 rules in 3 ms. Remains 79 /101 variables (removed 22) and now considering 101/138 (removed 37) transitions.
// Phase 1: matrix 101 rows 79 cols
[2024-05-21 18:45:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:45:47] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 18:45:47] [INFO ] Invariant cache hit.
[2024-05-21 18:45:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 18:45:47] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 18:45:47] [INFO ] Invariant cache hit.
[2024-05-21 18:45:47] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/180 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 36/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 117 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1957 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/180 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 36/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 100/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 217 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 5403ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5404ms
Starting structural reductions in LTL mode, iteration 1 : 79/101 places, 101/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5598 ms. Remains : 79/101 places, 101/138 transitions.
[2024-05-21 18:45:53] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:45:53] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:53] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 18:45:53] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:53] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7028777286160462300.gal : 1 ms
[2024-05-21 18:45:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16146340136833119647.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/CTLFireability7028777286160462300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16146340136833119647.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,8053,0.128149,9724,2,2317,5,24124,6,0,417,13527,0


Converting to forward existential form...Done !
original formula: E(AF(((!(((p39>=1)&&(l137>=1))&&((s1>=1)&&(l110>=1))))&&(((s1>=1)&&(l509>=1))||(((s1>=1)&&(l509>=1))&&(l501>=1))))) U (((A((E(((s1>=1)&&(...450
=> equivalent forward existential formula: (([((FwdU(Init,!(EG(!(((!(((p39>=1)&&(l137>=1))&&((s1>=1)&&(l110>=1))))&&(((s1>=1)&&(l509>=1))||(((s1>=1)&&(l509...1469
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t48, t49, t50, t56, t58, t59, t60, t62, t64, t65, t66, t73,...391
(forward)formula 0,0,0.496576,24564,1,0,208,87007,232,80,2892,50069,223
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 82 transition count 108
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 82 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 82 transition count 107
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 72 transition count 97
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 72 transition count 97
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 72 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 70 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 70 transition count 90
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 70 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 69 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 69 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 68 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 68 transition count 85
Applied a total of 72 rules in 4 ms. Remains 68 /101 variables (removed 33) and now considering 85/138 (removed 53) transitions.
// Phase 1: matrix 85 rows 68 cols
[2024-05-21 18:45:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:45:53] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 18:45:53] [INFO ] Invariant cache hit.
[2024-05-21 18:45:53] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 18:45:53] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-21 18:45:53] [INFO ] Invariant cache hit.
[2024-05-21 18:45:53] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/153 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 34/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 104 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/153 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 34/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 84/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 188 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2320 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 3648ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3648ms
Starting structural reductions in LTL mode, iteration 1 : 68/101 places, 85/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3806 ms. Remains : 68/101 places, 85/138 transitions.
[2024-05-21 18:45:57] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:45:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:57] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-21 18:45:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:45:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15615334330591911484.gal : 3 ms
[2024-05-21 18:45:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13307164489836945021.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/CTLFireability15615334330591911484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13307164489836945021.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,5326,0.077624,7204,2,1855,5,14938,6,0,357,8695,0


Converting to forward existential form...Done !
original formula: E(AF(!((E(AG(((s1>=1)&&(l504>=1))) U (((s1>=1)&&(l339>=1))||((s1>=1)&&(l150>=1)))) + !(AG(((s7>=1)&&(l0>=1))))))) U AG(AX(AF(((s1>=1)&&(l...167
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(!((E(!(E(TRUE U !(((s1>=1)&&(l504>=1))))) U (((s1>=1)&&(l339>=1))||((s1>=1)&&(l150>=1)))) + !...267
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t51, t52, t53, t54, t5...376
(forward)formula 0,0,0.712044,33452,1,0,316,150095,211,138,2439,114409,375
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 85 transition count 109
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 85 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 85 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 80 transition count 103
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 80 transition count 103
Applied a total of 43 rules in 7 ms. Remains 80 /101 variables (removed 21) and now considering 103/138 (removed 35) transitions.
// Phase 1: matrix 103 rows 80 cols
[2024-05-21 18:45:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:45:58] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 18:45:58] [INFO ] Invariant cache hit.
[2024-05-21 18:45:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 18:45:58] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-21 18:45:58] [INFO ] Invariant cache hit.
[2024-05-21 18:45:58] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/183 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 37/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 119 constraints, problems are : Problem set: 0 solved, 102 unsolved in 1792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/183 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 37/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 102/221 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 221 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 5144ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 5145ms
Starting structural reductions in LTL mode, iteration 1 : 80/101 places, 103/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5305 ms. Remains : 80/101 places, 103/138 transitions.
[2024-05-21 18:46:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:46:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:46:03] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-21 18:46:03] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:46:03] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:46:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2304355776200773780.gal : 1 ms
[2024-05-21 18:46:03] [INFO ] Time to serialize properties into /tmp/CTLFireability9470950746509202410.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/CTLFireability2304355776200773780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9470950746509202410.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,8502,0.156084,11320,2,2625,5,31938,6,0,423,16766,0


Converting to forward existential form...Done !
original formula: E((EF(((((s1>=1)&&(l503>=1))&&((s1>=1)&&(l336>=1)))||((s1>=1)&&(l112>=1)))) * ((EF(AX(!(((s1>=1)&&(l91>=1))))) + ((s1>=1)&&(l32>=1))) + (...368
=> equivalent forward existential formula: [((FwdU(Init,(E(TRUE U ((((s1>=1)&&(l503>=1))&&((s1>=1)&&(l336>=1)))||((s1>=1)&&(l112>=1)))) * ((E(TRUE U !(EX(!...450
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t29, t49, t50, t51, t57, t59, t60, t61, t65, t66, t67, t75, t7...390
(forward)formula 0,1,1.20511,48316,1,0,407,210984,244,201,2914,167571,455
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 83 transition count 109
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 83 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 83 transition count 108
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 75 transition count 100
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 75 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 73 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 73 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 73 transition count 96
Applied a total of 58 rules in 3 ms. Remains 73 /101 variables (removed 28) and now considering 96/138 (removed 42) transitions.
// Phase 1: matrix 96 rows 73 cols
[2024-05-21 18:46:04] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 18:46:04] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 18:46:04] [INFO ] Invariant cache hit.
[2024-05-21 18:46:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 18:46:04] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-21 18:46:04] [INFO ] Invariant cache hit.
[2024-05-21 18:46:04] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/169 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 36/111 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-21 18:46:05] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-21 18:46:06] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 113 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2783 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 96/169 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 36/113 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 95/208 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 208 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2860 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 2/2 constraints]
After SMT, in 5713ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 5713ms
Starting structural reductions in LTL mode, iteration 1 : 73/101 places, 96/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5858 ms. Remains : 73/101 places, 96/138 transitions.
[2024-05-21 18:46:10] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:46:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:46:10] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-21 18:46:10] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:46:10] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:46:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13764495292098751480.gal : 1 ms
[2024-05-21 18:46:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10829529815295282894.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/CTLFireability13764495292098751480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10829529815295282894.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,7127,0.141874,10464,2,2727,5,26877,6,0,388,16288,0


Converting to forward existential form...Done !
original formula: EF(((EG(A(((s1>=1)&&(l487>=1)) U ((s1>=1)&&(l335>=1)))) * EG(A(((s1>=1)&&(l353>=1)) U ((s1>=1)&&(l510>=1))))) * (E(((AF(((s1>=1)&&(l345>=...358
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (EG(!((E(!(((s1>=1)&&(l335>=1))) U (!(((s1>=1)&&(l487>=1))) * !(((s1>=1)&&(l335>=1))))) +...682
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t20, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t51, t52, t5...401
Using saturation style SCC detection
(forward)formula 0,0,1.1756,47692,1,0,313,216427,224,140,2706,156021,358
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 79 transition count 97
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 79 transition count 97
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 79 transition count 96
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 57 place count 67 transition count 84
Iterating global reduction 1 with 12 rules applied. Total rules applied 69 place count 67 transition count 84
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 67 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 64 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 64 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 62 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 60 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 60 transition count 71
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 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 59 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 91 place count 59 transition count 66
Applied a total of 91 rules in 3 ms. Remains 59 /101 variables (removed 42) and now considering 66/138 (removed 72) transitions.
// Phase 1: matrix 66 rows 59 cols
[2024-05-21 18:46:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:46:11] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 18:46:11] [INFO ] Invariant cache hit.
[2024-05-21 18:46:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:46:11] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-21 18:46:11] [INFO ] Invariant cache hit.
[2024-05-21 18:46:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-21 18:46:12] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 66/125 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 65/147 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 147 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints]
After SMT, in 2581ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2582ms
Starting structural reductions in LTL mode, iteration 1 : 59/101 places, 66/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2689 ms. Remains : 59/101 places, 66/138 transitions.
[2024-05-21 18:46:14] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:46:14] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:46:14] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-21 18:46:14] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:46:14] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:46:14] [INFO ] Time to serialize gal into /tmp/CTLFireability13616856841079771200.gal : 1 ms
[2024-05-21 18:46:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7661294249585903938.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/CTLFireability13616856841079771200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7661294249585903938.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,3470,0.056806,6072,2,1536,5,10497,6,0,302,7003,0


Converting to forward existential form...Done !
original formula: EF(EG(EX(EG(((p31>=1)&&(l0>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX(EG(((p31>=1)&&(l0>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t41, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...291
(forward)formula 0,0,0.216576,13200,1,0,140,40605,158,53,2026,24993,152
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 80 transition count 102
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 80 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 80 transition count 101
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 70 transition count 91
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 70 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 68 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 67 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 66 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 66 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 73 place count 66 transition count 83
Applied a total of 73 rules in 11 ms. Remains 66 /101 variables (removed 35) and now considering 83/138 (removed 55) transitions.
// Phase 1: matrix 83 rows 66 cols
[2024-05-21 18:46:14] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 18:46:14] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 18:46:14] [INFO ] Invariant cache hit.
[2024-05-21 18:46:14] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 18:46:14] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-21 18:46:14] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-21 18:46:14] [INFO ] Invariant cache hit.
[2024-05-21 18:46:14] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/149 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 97 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/149 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 82/179 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 179 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 3544ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3546ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/101 places, 83/138 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3698 ms. Remains : 66/101 places, 83/138 transitions.
[2024-05-21 18:46:18] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:46:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:46:18] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-21 18:46:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:46:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:46:18] [INFO ] Time to serialize gal into /tmp/CTLFireability820007848166440657.gal : 1 ms
[2024-05-21 18:46:18] [INFO ] Time to serialize properties into /tmp/CTLFireability4797114040232729948.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/CTLFireability820007848166440657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4797114040232729948.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,5595,0.074499,7200,2,1676,5,15048,6,0,347,8624,0


Converting to forward existential form...Done !
original formula: (!(E(((s1>=1)&&(l488>=1)) U !(E((((s1>=1)&&(l91>=1))||((s1>=1)&&(l335>=1))) U EF(((s1>=1)&&(l338>=1))))))) * AF(EG(((s1>=1)&&(l354>=1))))...156
=> equivalent forward existential formula: ([(FwdU(Init,((s1>=1)&&(l488>=1))) * !(E((((s1>=1)&&(l91>=1))||((s1>=1)&&(l335>=1))) U E(TRUE U ((s1>=1)&&(l338>...224
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t45, t46, t47, t54, t55, t56, t57, t62, t63, t64, t65, t66, t67, t6...326
(forward)formula 0,0,0.337824,18552,1,0,179,60698,190,72,2431,42186,207
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 79 transition count 97
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 79 transition count 97
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 79 transition count 96
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 69 transition count 86
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 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 67 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 67 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 67 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 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 66 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 64 transition count 74
Applied a total of 80 rules in 17 ms. Remains 64 /101 variables (removed 37) and now considering 74/138 (removed 64) transitions.
// Phase 1: matrix 74 rows 64 cols
[2024-05-21 18:46:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:46:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 18:46:18] [INFO ] Invariant cache hit.
[2024-05-21 18:46:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 18:46:18] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-21 18:46:18] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-21 18:46:18] [INFO ] Invariant cache hit.
[2024-05-21 18:46:18] [INFO ] State equation strengthened by 22 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, 22/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 88 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 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, 22/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 73/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 161 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1877 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2958ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2958ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/101 places, 74/138 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3104 ms. Remains : 64/101 places, 74/138 transitions.
[2024-05-21 18:46:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:46:21] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:46:21] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-21 18:46:21] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:46:22] [INFO ] Flatten gal took : 19 ms
[2024-05-21 18:46:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6455850651222554356.gal : 21 ms
[2024-05-21 18:46:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1532561443698376072.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6455850651222554356.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1532561443698376072.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9273 resets) in 204 ms. (195 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1532561443698376072.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 16
BEST_FIRST walk for 40003 steps (2025 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 160
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :160 after 550
Finished probabilistic random walk after 1987 steps, run visited all 1 properties in 21 ms. (steps per millisecond=94 )
Probabilistic random walk after 1987 steps, saw 959 distinct states, run finished after 24 ms. (steps per millisecond=82 ) properties seen :1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :550 after 1032
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 80 transition count 100
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 80 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 80 transition count 99
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 69 transition count 88
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 69 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 69 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 67 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 67 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 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 66 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 65 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 65 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 65 transition count 77
Applied a total of 77 rules in 11 ms. Remains 65 /101 variables (removed 36) and now considering 77/138 (removed 61) transitions.
// Phase 1: matrix 77 rows 65 cols
[2024-05-21 18:46:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:46:22] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 18:46:22] [INFO ] Invariant cache hit.
[2024-05-21 18:46:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 18:46:22] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-21 18:46:22] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-21 18:46:22] [INFO ] Invariant cache hit.
[2024-05-21 18:46:22] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/142 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 92 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1085 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/142 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 76/168 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 168 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1872 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 2999ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3000ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/101 places, 77/138 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3156 ms. Remains : 65/101 places, 77/138 transitions.
[2024-05-21 18:46:25] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:46:25] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:46:25] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-21 18:46:25] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:46:25] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:46:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16185881434122074509.gal : 2 ms
[2024-05-21 18:46:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9691543717818018031.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/CTLFireability16185881434122074509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9691543717818018031.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,5228,0.066387,6356,2,1533,5,12182,6,0,337,7888,0


Converting to forward existential form...Done !
original formula: AG(((AF(((s1<1)||(l504<1))) + (p27<1)) + (l0<1)))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((l0<1))) * !((p27<1))),!(((s1<1)||(l504<1))))] = FALSE
(forward)formula 0,1,0.189151,12428,1,0,21,37680,23,6,1721,16845,15
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 79 transition count 99
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 79 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 79 transition count 98
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 57 place count 67 transition count 86
Iterating global reduction 1 with 12 rules applied. Total rules applied 69 place count 67 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 71 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 65 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 65 transition count 79
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 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 64 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 63 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 63 transition count 76
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 63 transition count 74
Applied a total of 82 rules in 2 ms. Remains 63 /101 variables (removed 38) and now considering 74/138 (removed 64) transitions.
// Phase 1: matrix 74 rows 63 cols
[2024-05-21 18:46:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:46:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 18:46:25] [INFO ] Invariant cache hit.
[2024-05-21 18:46:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 18:46:25] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 18:46:25] [INFO ] Invariant cache hit.
[2024-05-21 18:46:25] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/137 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 24/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-21 18:46:26] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 90 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1411 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/137 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 73/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 163 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1913 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints]
After SMT, in 3361ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3362ms
Starting structural reductions in LTL mode, iteration 1 : 63/101 places, 74/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3482 ms. Remains : 63/101 places, 74/138 transitions.
[2024-05-21 18:46:28] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:46:28] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:46:28] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-21 18:46:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:46:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:46:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16159591291609125160.gal : 1 ms
[2024-05-21 18:46:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13804369089050463957.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/CTLFireability16159591291609125160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13804369089050463957.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,4900,0.070617,6328,2,1592,5,11765,6,0,326,7849,0


Converting to forward existential form...Done !
original formula: !(A(!((EX(AG(((s1>=1)&&(l33>=1)))) + EG(((s1>=1)&&(l345>=1))))) U AG(AX(AG(((p16>=1)&&(l115>=1)))))))
=> equivalent forward existential formula: ([(FwdU(EY(FwdU((FwdU(Init,!(!(E(TRUE U !(!(EX(!(!(E(TRUE U !(((p16>=1)&&(l115>=1))))))))))))) * !(!((EX(!(E(TRU...358
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t42, t43, t44, t48, t53, t54, t55, t56, t57, t58, t59, t60,...319
(forward)formula 0,1,0.437257,23428,1,0,271,82624,183,132,2221,77162,279
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 84 transition count 113
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 84 transition count 113
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 84 transition count 111
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 77 transition count 104
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 77 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 77 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 75 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 75 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 73 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 73 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 72 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 72 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 72 transition count 92
Applied a total of 64 rules in 7 ms. Remains 72 /101 variables (removed 29) and now considering 92/138 (removed 46) transitions.
// Phase 1: matrix 92 rows 72 cols
[2024-05-21 18:46:29] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 18:46:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 18:46:29] [INFO ] Invariant cache hit.
[2024-05-21 18:46:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 18:46:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-21 18:46:29] [INFO ] Invariant cache hit.
[2024-05-21 18:46:29] [INFO ] State equation strengthened by 40 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, 40/114 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-21 18:46:30] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:46:30] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 116 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 2/2 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, 2/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/164 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 40/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 91/207 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 207 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2818 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 2/2 constraints]
After SMT, in 4974ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4975ms
Starting structural reductions in LTL mode, iteration 1 : 72/101 places, 92/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5112 ms. Remains : 72/101 places, 92/138 transitions.
[2024-05-21 18:46:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:46:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:46:34] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-21 18:46:34] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:46:34] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:46:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8483290238716394414.gal : 1 ms
[2024-05-21 18:46:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15754440043245879081.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/CTLFireability8483290238716394414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15754440043245879081.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,5852,0.109527,8584,2,2370,5,18784,6,0,380,12521,0


Converting to forward existential form...Done !
original formula: AX(((E(AG((((s1>=1)&&(l33>=1))||((s1>=1)&&(l150>=1)))) U (!(EG(((s1>=1)&&(l485>=1)))) + ((s5>=1)&&(l0>=1)))) * ((s1<1)||(l114<1))) * (((A...293
=> equivalent forward existential formula: (([(EY(Init) * !(E(!(E(TRUE U !((((s1>=1)&&(l33>=1))||((s1>=1)&&(l150>=1)))))) U (!(EG(((s1>=1)&&(l485>=1)))) + ...461
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t19, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t49,...414
(forward)formula 0,0,0.463504,22800,1,0,224,73774,211,81,2572,45816,230
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 138/138 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 79 transition count 97
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 79 transition count 97
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 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 68 transition count 85
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 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 69 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 66 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 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 81 place count 63 transition count 73
Applied a total of 81 rules in 9 ms. Remains 63 /101 variables (removed 38) and now considering 73/138 (removed 65) transitions.
// Phase 1: matrix 73 rows 63 cols
[2024-05-21 18:46:35] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 18:46:35] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 18:46:35] [INFO ] Invariant cache hit.
[2024-05-21 18:46:35] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 18:46:35] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-21 18:46:35] [INFO ] Invariant cache hit.
[2024-05-21 18:46:35] [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
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 984 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 1823 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 2844ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2844ms
Starting structural reductions in LTL mode, iteration 1 : 63/101 places, 73/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2962 ms. Remains : 63/101 places, 73/138 transitions.
[2024-05-21 18:46:38] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:46:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:46:38] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-21 18:46:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:46:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:46:38] [INFO ] Time to serialize gal into /tmp/CTLFireability14049342475500379939.gal : 1 ms
[2024-05-21 18:46:38] [INFO ] Time to serialize properties into /tmp/CTLFireability5800286908806179060.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/CTLFireability14049342475500379939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5800286908806179060.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,4900,0.061852,6320,2,1636,5,10625,6,0,325,7666,0


Converting to forward existential form...Done !
original formula: E(AF(((s1>=1)&&(l503>=1))) U EX(((s3>=1)&&(l0>=1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,!(EG(!(((s1>=1)&&(l503>=1))))))) * ((s3>=1)&&(l0>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t46, t48, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
(forward)formula 0,0,0.519584,25336,1,0,219,105993,174,93,2189,82503,259
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-21 18:46:38] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:46:38] [INFO ] Flatten gal took : 4 ms
Total runtime 85221 ms.

BK_STOP 1716317198640

--------------------
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-d0m04"
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-d0m04, 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-171624189300434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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