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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 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 1.6M 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-d2m06-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d2m06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716326817196

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-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 21:26:58] [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 21:26:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:26:58] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-05-21 21:26:58] [INFO ] Transformed 4763 places.
[2024-05-21 21:26:58] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:26:58] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 3580 places in 23 ms
Reduce places removed 3580 places and 0 transitions.
Support contains 76 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 353 places :
Symmetric choice reduction at 1 with 353 rule applications. Total rules 598 place count 784 transition count 1604
Iterating global reduction 1 with 353 rules applied. Total rules applied 951 place count 784 transition count 1604
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 1039 place count 784 transition count 1516
Discarding 277 places :
Symmetric choice reduction at 2 with 277 rule applications. Total rules 1316 place count 507 transition count 1239
Iterating global reduction 2 with 277 rules applied. Total rules applied 1593 place count 507 transition count 1239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1597 place count 507 transition count 1235
Discarding 189 places :
Symmetric choice reduction at 3 with 189 rule applications. Total rules 1786 place count 318 transition count 984
Iterating global reduction 3 with 189 rules applied. Total rules applied 1975 place count 318 transition count 984
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 3 with 252 rules applied. Total rules applied 2227 place count 318 transition count 732
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 2237 place count 308 transition count 717
Iterating global reduction 4 with 10 rules applied. Total rules applied 2247 place count 308 transition count 717
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 2252 place count 303 transition count 712
Iterating global reduction 4 with 5 rules applied. Total rules applied 2257 place count 303 transition count 712
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 2262 place count 298 transition count 707
Iterating global reduction 4 with 5 rules applied. Total rules applied 2267 place count 298 transition count 707
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2271 place count 298 transition count 703
Applied a total of 2271 rules in 208 ms. Remains 298 /1183 variables (removed 885) and now considering 703/2478 (removed 1775) transitions.
// Phase 1: matrix 703 rows 298 cols
[2024-05-21 21:26:58] [INFO ] Computed 2 invariants in 27 ms
[2024-05-21 21:26:59] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-21 21:26:59] [INFO ] Invariant cache hit.
[2024-05-21 21:26:59] [INFO ] State equation strengthened by 411 read => feed constraints.
[2024-05-21 21:27:00] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
Running 702 sub problems to find dead transitions.
[2024-05-21 21:27:00] [INFO ] Invariant cache hit.
[2024-05-21 21:27:00] [INFO ] State equation strengthened by 411 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 4 (OVERLAPS) 703/1001 variables, 298/300 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1001 variables, 411/711 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1001 variables, and 711 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 298/298 constraints, ReadFeed: 411/411 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 702 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 4 (OVERLAPS) 703/1001 variables, 298/300 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1001 variables, 411/711 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 702/1413 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1001 variables, and 1413 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 298/298 constraints, ReadFeed: 411/411 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 0/0 constraints]
After SMT, in 62998ms problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 63019ms
Starting structural reductions in LTL mode, iteration 1 : 298/1183 places, 703/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64773 ms. Remains : 298/1183 places, 703/2478 transitions.
Support contains 76 out of 298 places after structural reductions.
[2024-05-21 21:28:03] [INFO ] Flatten gal took : 71 ms
[2024-05-21 21:28:03] [INFO ] Flatten gal took : 42 ms
[2024-05-21 21:28:03] [INFO ] Input system was already deterministic with 703 transitions.
Support contains 73 out of 298 places (down from 76) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 60 to 59
RANDOM walk for 40000 steps (9241 resets) in 2377 ms. (16 steps per ms) remains 56/59 properties
BEST_FIRST walk for 4004 steps (198 resets) in 32 ms. (121 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (174 resets) in 45 ms. (87 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4000 steps (800 resets) in 52 ms. (75 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (163 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (185 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (159 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (183 resets) in 48 ms. (81 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (188 resets) in 28 ms. (137 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (195 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (170 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (176 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (165 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (169 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (180 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (184 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (178 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (162 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (183 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (162 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (178 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (375 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (188 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (410 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (173 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (170 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (187 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (167 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (168 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (186 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (179 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (197 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (173 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (158 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (163 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (171 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (394 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (145 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (187 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (163 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (171 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (165 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (182 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (162 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (351 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (179 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (169 resets) in 20 ms. (190 steps per ms) remains 53/55 properties
BEST_FIRST walk for 4003 steps (173 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (196 resets) in 25 ms. (154 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (174 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (189 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (174 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (165 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (383 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (208 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (182 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
[2024-05-21 21:28:05] [INFO ] Invariant cache hit.
[2024-05-21 21:28:05] [INFO ] State equation strengthened by 411 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 1 (OVERLAPS) 96/163 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 51 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/222 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 618/840 variables, 222/224 constraints. Problems are: Problem set: 2 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 326/550 constraints. Problems are: Problem set: 2 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/840 variables, 0/550 constraints. Problems are: Problem set: 2 solved, 51 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 8 (OVERLAPS) 161/1001 variables, 76/626 constraints. Problems are: Problem set: 4 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 85/711 constraints. Problems are: Problem set: 4 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/711 constraints. Problems are: Problem set: 4 solved, 49 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1001 variables, and 711 constraints, problems are : Problem set: 4 solved, 49 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 298/298 constraints, ReadFeed: 411/411 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 98/159 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 59/218 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 49 unsolved
[2024-05-21 21:28:10] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 15 ms to minimize.
[2024-05-21 21:28:10] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:28:10] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:28:11] [INFO ] Deduced a trap composed of 98 places in 68 ms of which 2 ms to minimize.
[2024-05-21 21:28:11] [INFO ] Deduced a trap composed of 98 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:28:11] [INFO ] Deduced a trap composed of 99 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 6/8 constraints. Problems are: Problem set: 4 solved, 49 unsolved
[2024-05-21 21:28:11] [INFO ] Deduced a trap composed of 103 places in 77 ms of which 1 ms to minimize.
[2024-05-21 21:28:11] [INFO ] Deduced a trap composed of 102 places in 86 ms of which 14 ms to minimize.
[2024-05-21 21:28:11] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 1 ms to minimize.
[2024-05-21 21:28:11] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:28:11] [INFO ] Deduced a trap composed of 100 places in 68 ms of which 1 ms to minimize.
[2024-05-21 21:28:11] [INFO ] Deduced a trap composed of 102 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 6/14 constraints. Problems are: Problem set: 4 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 600/818 variables, 218/232 constraints. Problems are: Problem set: 4 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/818 variables, 308/540 constraints. Problems are: Problem set: 4 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 1/541 constraints. Problems are: Problem set: 4 solved, 49 unsolved
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 101 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 104 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 104 places in 88 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 105 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 106 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:28:13] [INFO ] Deduced a trap composed of 105 places in 67 ms of which 2 ms to minimize.
[2024-05-21 21:28:14] [INFO ] Deduced a trap composed of 105 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:28:14] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 12/553 constraints. Problems are: Problem set: 4 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/818 variables, 0/553 constraints. Problems are: Problem set: 4 solved, 49 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1001 variables, and 633 constraints, problems are : Problem set: 4 solved, 49 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 298/298 constraints, ReadFeed: 308/411 constraints, PredecessorRefiner: 1/53 constraints, Known Traps: 24/24 constraints]
After SMT, in 10325ms problems are : Problem set: 4 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 287 transition count 662
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 287 transition count 662
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 287 transition count 652
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 282 transition count 644
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 282 transition count 644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 282 transition count 642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 279 transition count 637
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 279 transition count 637
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 279 transition count 635
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 278 transition count 634
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 278 transition count 634
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 277 transition count 633
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 277 transition count 633
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 276 transition count 631
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 276 transition count 631
Applied a total of 58 rules in 118 ms. Remains 276 /298 variables (removed 22) and now considering 631/703 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 276/298 places, 631/703 transitions.
RANDOM walk for 40000 steps (9179 resets) in 837 ms. (47 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (177 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (800 resets) in 36 ms. (108 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (179 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (188 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (171 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (174 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (187 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (173 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (175 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (181 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (172 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (169 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (187 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (174 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (181 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (177 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (379 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (175 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (383 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (182 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (189 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (168 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (168 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (175 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (185 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (168 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (166 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (167 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (185 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (192 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (372 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (164 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (176 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (175 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (177 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (192 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (170 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (176 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (361 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (186 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (162 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (188 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (177 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (163 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (189 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (196 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (374 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (182 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (164 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
Interrupted probabilistic random walk after 471511 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :46 out of 49
Probabilistic random walk after 471511 steps, saw 181002 distinct states, run finished after 3005 ms. (steps per millisecond=156 ) properties seen :46
// Phase 1: matrix 631 rows 276 cols
[2024-05-21 21:28:19] [INFO ] Computed 2 invariants in 11 ms
[2024-05-21 21:28:19] [INFO ] State equation strengthened by 363 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 99/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 64/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 356/526 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 88/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 375/901 variables, 103/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/901 variables, 272/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/901 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/907 variables, 3/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/907 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/907 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/907 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 907/907 variables, and 641 constraints, problems are : Problem set: 0 solved, 3 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 276/276 constraints, ReadFeed: 363/363 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 99/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 64/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 356/526 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 88/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 375/901 variables, 103/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/901 variables, 272/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/901 variables, 3/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/901 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/907 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/907 variables, 3/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/907 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/907 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 907/907 variables, and 644 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1998 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 276/276 constraints, ReadFeed: 363/363 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2552ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2473 ms.
Support contains 7 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 631/631 transitions.
Graph (complete) has 1085 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 275 transition count 621
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 54 place count 232 transition count 446
Iterating global reduction 1 with 43 rules applied. Total rules applied 97 place count 232 transition count 446
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 111 place count 232 transition count 432
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 142 place count 201 transition count 395
Iterating global reduction 2 with 31 rules applied. Total rules applied 173 place count 201 transition count 395
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 184 place count 201 transition count 384
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 209 place count 176 transition count 343
Iterating global reduction 3 with 25 rules applied. Total rules applied 234 place count 176 transition count 343
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 249 place count 176 transition count 328
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 259 place count 166 transition count 317
Iterating global reduction 4 with 10 rules applied. Total rules applied 269 place count 166 transition count 317
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 292 place count 166 transition count 294
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 299 place count 159 transition count 270
Iterating global reduction 5 with 7 rules applied. Total rules applied 306 place count 159 transition count 270
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 312 place count 159 transition count 264
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 316 place count 155 transition count 243
Iterating global reduction 6 with 4 rules applied. Total rules applied 320 place count 155 transition count 243
Applied a total of 320 rules in 44 ms. Remains 155 /276 variables (removed 121) and now considering 243/631 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 155/276 places, 243/631 transitions.
RANDOM walk for 40000 steps (9233 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1822 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1769 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1806 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 735314 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :1 out of 3
Probabilistic random walk after 735314 steps, saw 285521 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :1
// Phase 1: matrix 243 rows 155 cols
[2024-05-21 21:28:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:28:27] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 113/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 200/318 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 47/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 78/396 variables, 36/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 42/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/398 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/398 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 247 constraints, problems are : Problem set: 0 solved, 2 unsolved in 211 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 155/155 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 113/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 200/318 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 47/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 78/396 variables, 36/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 42/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/398 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/398 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 249 constraints, problems are : Problem set: 0 solved, 2 unsolved in 451 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 155/155 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 673ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 230 ms.
Support contains 5 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 243/243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 153 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 153 transition count 233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 151 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 151 transition count 231
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 149 transition count 228
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 149 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 149 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 148 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 148 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 147 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 147 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 146 transition count 223
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 146 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 146 transition count 222
Applied a total of 20 rules in 22 ms. Remains 146 /155 variables (removed 9) and now considering 222/243 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 146/155 places, 222/243 transitions.
RANDOM walk for 40000 steps (9060 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1705 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1844 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 716441 steps, run visited all 2 properties in 1386 ms. (steps per millisecond=516 )
Probabilistic random walk after 716441 steps, saw 274400 distinct states, run finished after 1389 ms. (steps per millisecond=515 ) properties seen :2
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-21 21:28:29] [INFO ] Flatten gal took : 31 ms
[2024-05-21 21:28:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 21:28:29] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:28:29] [INFO ] Input system was already deterministic with 703 transitions.
Support contains 61 out of 298 places (down from 65) after GAL structural reductions.
Computed a total of 5 stabilizing places and 45 stable transitions
Graph (complete) has 1292 edges and 298 vertex of which 297 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 241 transition count 444
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 241 transition count 444
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 131 place count 241 transition count 427
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 170 place count 202 transition count 379
Iterating global reduction 1 with 39 rules applied. Total rules applied 209 place count 202 transition count 379
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 221 place count 202 transition count 367
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 255 place count 168 transition count 315
Iterating global reduction 2 with 34 rules applied. Total rules applied 289 place count 168 transition count 315
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 307 place count 168 transition count 297
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 321 place count 154 transition count 269
Iterating global reduction 3 with 14 rules applied. Total rules applied 335 place count 154 transition count 269
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 348 place count 154 transition count 256
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 359 place count 143 transition count 228
Iterating global reduction 4 with 11 rules applied. Total rules applied 370 place count 143 transition count 228
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 378 place count 143 transition count 220
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 385 place count 136 transition count 195
Iterating global reduction 5 with 7 rules applied. Total rules applied 392 place count 136 transition count 195
Applied a total of 392 rules in 31 ms. Remains 136 /298 variables (removed 162) and now considering 195/703 (removed 508) transitions.
// Phase 1: matrix 195 rows 136 cols
[2024-05-21 21:28:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:28:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 21:28:29] [INFO ] Invariant cache hit.
[2024-05-21 21:28:30] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 21:28:30] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-21 21:28:30] [INFO ] Redundant transitions in 11 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-21 21:28:30] [INFO ] Invariant cache hit.
[2024-05-21 21:28:30] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/331 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 62/200 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 200 constraints, problems are : Problem set: 0 solved, 194 unsolved in 6706 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/331 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 62/200 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 194/394 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 394 constraints, problems are : Problem set: 0 solved, 194 unsolved in 13190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 20154ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 20156ms
Starting structural reductions in SI_CTL mode, iteration 1 : 136/298 places, 195/703 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20573 ms. Remains : 136/298 places, 195/703 transitions.
[2024-05-21 21:28:50] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:28:50] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:28:50] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-21 21:28:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:28:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:28:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7540399573325017573.gal : 4 ms
[2024-05-21 21:28:50] [INFO ] Time to serialize properties into /tmp/CTLFireability3313966534791909220.ctl : 6 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/CTLFireability7540399573325017573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3313966534791909220.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.
Detected timeout of ITS tools.
[2024-05-21 21:29:20] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:29:20] [INFO ] Applying decomposition
[2024-05-21 21:29:20] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15847977898151256615.txt' '-o' '/tmp/graph15847977898151256615.bin' '-w' '/tmp/graph15847977898151256615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15847977898151256615.bin' '-l' '-1' '-v' '-w' '/tmp/graph15847977898151256615.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:29:20] [INFO ] Decomposing Gal with order
[2024-05-21 21:29:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:29:20] [INFO ] Removed a total of 242 redundant transitions.
[2024-05-21 21:29:20] [INFO ] Flatten gal took : 53 ms
[2024-05-21 21:29:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 15 ms.
[2024-05-21 21:29:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3358779885357365248.gal : 5 ms
[2024-05-21 21:29:20] [INFO ] Time to serialize properties into /tmp/CTLFireability18437010583701389043.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/CTLFireability3358779885357365248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18437010583701389043.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.00902e+06,8.2969,243156,2972,2257,181073,64842,583,1.50852e+06,202,929122,0


Converting to forward existential form...Done !
original formula: AG((EF(((EF(((i0.u0.s1>=1)&&(i6.i1.u21.l4101>=1))) + (i0.u0.s1<1)) + (i1.u6.l4148<1))) + ((i4.u3.s2>=1)&&(i6.i1.u21.l4181>=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((i4.u3.s2>=1)&&(i6.i1.u21.l4181>=1)))) * !(E(TRUE U ((E(TRUE U ((i0.u0.s1>=1)&&(i6.i1.u2...215
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t13, t67, t92, t98, t105, t115, t116, t121, t125, t132, t138, t139, t140, t141, t143,...646
(forward)formula 0,1,10.9186,243940,1,0,181073,78414,2197,1.50852e+06,938,929122,500422
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 238 transition count 431
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 238 transition count 431
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 138 place count 238 transition count 413
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 180 place count 196 transition count 362
Iterating global reduction 1 with 42 rules applied. Total rules applied 222 place count 196 transition count 362
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 234 place count 196 transition count 350
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 269 place count 161 transition count 293
Iterating global reduction 2 with 35 rules applied. Total rules applied 304 place count 161 transition count 293
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 321 place count 161 transition count 276
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 337 place count 145 transition count 245
Iterating global reduction 3 with 16 rules applied. Total rules applied 353 place count 145 transition count 245
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 361 place count 145 transition count 237
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 374 place count 132 transition count 207
Iterating global reduction 4 with 13 rules applied. Total rules applied 387 place count 132 transition count 207
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 396 place count 132 transition count 198
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 403 place count 125 transition count 179
Iterating global reduction 5 with 7 rules applied. Total rules applied 410 place count 125 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 411 place count 125 transition count 178
Applied a total of 411 rules in 78 ms. Remains 125 /298 variables (removed 173) and now considering 178/703 (removed 525) transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-21 21:29:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:29:31] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 21:29:31] [INFO ] Invariant cache hit.
[2024-05-21 21:29:32] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 21:29:32] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2024-05-21 21:29:32] [INFO ] Redundant transitions in 4 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-21 21:29:32] [INFO ] Invariant cache hit.
[2024-05-21 21:29:32] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 59/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 21:29:37] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/303 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 187 constraints, problems are : Problem set: 0 solved, 177 unsolved in 8660 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/303 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 59/187 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 177/364 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 364 constraints, problems are : Problem set: 0 solved, 177 unsolved in 12932 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 1/1 constraints]
After SMT, in 21802ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 21804ms
Starting structural reductions in SI_CTL mode, iteration 1 : 125/298 places, 178/703 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22355 ms. Remains : 125/298 places, 178/703 transitions.
[2024-05-21 21:29:54] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:29:54] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:29:54] [INFO ] Input system was already deterministic with 178 transitions.
[2024-05-21 21:29:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:29:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:29:54] [INFO ] Time to serialize gal into /tmp/CTLFireability16058226576478191215.gal : 2 ms
[2024-05-21 21:29:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8000739492761289949.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/CTLFireability16058226576478191215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8000739492761289949.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(AG(((s1>=1)&&(l3076>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((s1>=1)&&(l3076>=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t84, t88, t89, t90, t92, t93, t94, t96, t...577
(forward)formula 0,0,23.2748,529824,1,0,313,1.77324e+06,382,125,5008,1.58854e+06,379
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 243 transition count 463
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 243 transition count 463
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 129 place count 243 transition count 444
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 168 place count 204 transition count 396
Iterating global reduction 1 with 39 rules applied. Total rules applied 207 place count 204 transition count 396
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 218 place count 204 transition count 385
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 250 place count 172 transition count 332
Iterating global reduction 2 with 32 rules applied. Total rules applied 282 place count 172 transition count 332
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 300 place count 172 transition count 314
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 314 place count 158 transition count 287
Iterating global reduction 3 with 14 rules applied. Total rules applied 328 place count 158 transition count 287
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 335 place count 158 transition count 280
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 346 place count 147 transition count 265
Iterating global reduction 4 with 11 rules applied. Total rules applied 357 place count 147 transition count 265
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 366 place count 147 transition count 256
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 374 place count 139 transition count 230
Iterating global reduction 5 with 8 rules applied. Total rules applied 382 place count 139 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 383 place count 139 transition count 229
Applied a total of 383 rules in 14 ms. Remains 139 /298 variables (removed 159) and now considering 229/703 (removed 474) transitions.
// Phase 1: matrix 229 rows 139 cols
[2024-05-21 21:30:17] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:30:17] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 21:30:17] [INFO ] Invariant cache hit.
[2024-05-21 21:30:17] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-21 21:30:17] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 21:30:18] [INFO ] Invariant cache hit.
[2024-05-21 21:30:18] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/368 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 99/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 240 constraints, problems are : Problem set: 0 solved, 228 unsolved in 7849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/368 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 99/240 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 228/468 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/368 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 468 constraints, problems are : Problem set: 0 solved, 228 unsolved in 14511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 22646ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 22648ms
Starting structural reductions in LTL mode, iteration 1 : 139/298 places, 229/703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23060 ms. Remains : 139/298 places, 229/703 transitions.
[2024-05-21 21:30:40] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:30:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:30:40] [INFO ] Input system was already deterministic with 229 transitions.
[2024-05-21 21:30:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:30:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:30:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12287277719985706274.gal : 2 ms
[2024-05-21 21:30:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17712694093553911272.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/CTLFireability12287277719985706274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17712694093553911272.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.48415e+06,17.1444,474816,2,32369,5,1.20238e+06,6,0,785,1.59894e+06,0


Converting to forward existential form...Done !
original formula: AF(AG((A(E(((s1>=1)&&(l1702>=1)) U ((s1>=1)&&(l3092>=1))) U !((((s1>=1)&&(l3829>=1))||((s1>=1)&&(l3837>=1))))) + AG(EX(((s1>=1)&&(l2801>=...163
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!((E(!(!((((s1>=1)&&(l3829>=1))||((s1>=1)&&(l3837>=1))))) U (!(E(((s1>=1)&&(l1702>=1)...359
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t71, t73, t74, t78, t79, t80, t88, t89, t94, t95, t96, t97, t98, t99, t...807
Detected timeout of ITS tools.
[2024-05-21 21:31:10] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:31:10] [INFO ] Applying decomposition
[2024-05-21 21:31:10] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph362295899886966973.txt' '-o' '/tmp/graph362295899886966973.bin' '-w' '/tmp/graph362295899886966973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph362295899886966973.bin' '-l' '-1' '-v' '-w' '/tmp/graph362295899886966973.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:31:10] [INFO ] Decomposing Gal with order
[2024-05-21 21:31:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:31:10] [INFO ] Removed a total of 204 redundant transitions.
[2024-05-21 21:31:10] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:31:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 5 ms.
[2024-05-21 21:31:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15083963202031978537.gal : 2 ms
[2024-05-21 21:31:10] [INFO ] Time to serialize properties into /tmp/CTLFireability138573572087610910.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/CTLFireability15083963202031978537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability138573572087610910.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.48415e+06,4.14527,134852,1798,3464,108702,132749,523,340433,347,757771,0


Converting to forward existential form...Done !
original formula: AF(AG((A(E(((i1.u1.s1>=1)&&(i4.u8.l1702>=1)) U ((i1.u1.s1>=1)&&(i4.u9.l3092>=1))) U !((((i1.u1.s1>=1)&&(u11.l3829>=1))||((i1.u1.s1>=1)&&(...219
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!((E(!(!((((i1.u1.s1>=1)&&(u11.l3829>=1))||((i1.u1.s1>=1)&&(u11.l3837>=1))))) U (!(E(...455
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t13, t78, t80, t87, t107, t161, t173, t176, t177, t180, t181, t183, t184, t185, t186,...596
(forward)formula 0,0,16.3275,453808,1,0,455948,400194,2391,1.2618e+06,1979,2.37098e+06,1564650
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 243 transition count 471
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 243 transition count 471
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 131 place count 243 transition count 450
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 171 place count 203 transition count 401
Iterating global reduction 1 with 40 rules applied. Total rules applied 211 place count 203 transition count 401
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 227 place count 203 transition count 385
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 261 place count 169 transition count 329
Iterating global reduction 2 with 34 rules applied. Total rules applied 295 place count 169 transition count 329
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 316 place count 169 transition count 308
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 331 place count 154 transition count 279
Iterating global reduction 3 with 15 rules applied. Total rules applied 346 place count 154 transition count 279
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 360 place count 154 transition count 265
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 371 place count 143 transition count 243
Iterating global reduction 4 with 11 rules applied. Total rules applied 382 place count 143 transition count 243
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 391 place count 143 transition count 234
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 397 place count 137 transition count 216
Iterating global reduction 5 with 6 rules applied. Total rules applied 403 place count 137 transition count 216
Applied a total of 403 rules in 25 ms. Remains 137 /298 variables (removed 161) and now considering 216/703 (removed 487) transitions.
// Phase 1: matrix 216 rows 137 cols
[2024-05-21 21:31:27] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 21:31:27] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 21:31:27] [INFO ] Invariant cache hit.
[2024-05-21 21:31:27] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-21 21:31:27] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-21 21:31:27] [INFO ] Redundant transitions in 2 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-21 21:31:27] [INFO ] Invariant cache hit.
[2024-05-21 21:31:27] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/353 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 89/228 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 228 constraints, problems are : Problem set: 0 solved, 215 unsolved in 6207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/353 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 89/228 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 215/443 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 443 constraints, problems are : Problem set: 0 solved, 215 unsolved in 13063 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 19549ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 19551ms
Starting structural reductions in SI_CTL mode, iteration 1 : 137/298 places, 216/703 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19925 ms. Remains : 137/298 places, 216/703 transitions.
[2024-05-21 21:31:47] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:31:47] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:31:47] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-21 21:31:47] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:31:47] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:31:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10366715913681193927.gal : 2 ms
[2024-05-21 21:31:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6536981404559832678.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/CTLFireability10366715913681193927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6536981404559832678.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 21:32:17] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:32:17] [INFO ] Applying decomposition
[2024-05-21 21:32:17] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17965179659567150481.txt' '-o' '/tmp/graph17965179659567150481.bin' '-w' '/tmp/graph17965179659567150481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17965179659567150481.bin' '-l' '-1' '-v' '-w' '/tmp/graph17965179659567150481.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:32:17] [INFO ] Decomposing Gal with order
[2024-05-21 21:32:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:32:17] [INFO ] Removed a total of 189 redundant transitions.
[2024-05-21 21:32:17] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:32:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 6 ms.
[2024-05-21 21:32:17] [INFO ] Time to serialize gal into /tmp/CTLFireability5958543889707120155.gal : 3 ms
[2024-05-21 21:32:17] [INFO ] Time to serialize properties into /tmp/CTLFireability17655954328185998046.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/CTLFireability5958543889707120155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17655954328185998046.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.90607e+06,4.11767,140668,1986,2510,87787,89041,498,806769,316,701526,0


Converting to forward existential form...Done !
original formula: (A(((i0.u0.s1>=1)&&(i6.u17.l4101>=1)) U AG(A(!((((i0.u0.s1>=1)&&(i0.u0.l3080>=1))||((i0.u0.s1>=1)&&(i1.u14.l3696>=1)))) U EG(((i0.u0.s1>=...300
=> equivalent forward existential formula: ([((Init * !(EG(!(!(E(TRUE U !(!((E(!(EG(((i0.u0.s1>=1)&&(i2.u3.l1>=1)))) U (!(!((((i0.u0.s1>=1)&&(i0.u0.l3080>=...1159
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t11, t13, t69, t70, t121, t125, t127, t133, t147, t148, t152, t154, t163, t164, t165,...886
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,15.1183,402968,1,0,307895,237810,2498,2.01359e+06,1856,1.99213e+06,805998
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 239 transition count 438
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 239 transition count 438
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 136 place count 239 transition count 420
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 177 place count 198 transition count 370
Iterating global reduction 1 with 41 rules applied. Total rules applied 218 place count 198 transition count 370
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 230 place count 198 transition count 358
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 264 place count 164 transition count 302
Iterating global reduction 2 with 34 rules applied. Total rules applied 298 place count 164 transition count 302
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 315 place count 164 transition count 285
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 330 place count 149 transition count 256
Iterating global reduction 3 with 15 rules applied. Total rules applied 345 place count 149 transition count 256
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 353 place count 149 transition count 248
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 365 place count 137 transition count 219
Iterating global reduction 4 with 12 rules applied. Total rules applied 377 place count 137 transition count 219
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 386 place count 137 transition count 210
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 393 place count 130 transition count 185
Iterating global reduction 5 with 7 rules applied. Total rules applied 400 place count 130 transition count 185
Applied a total of 400 rules in 10 ms. Remains 130 /298 variables (removed 168) and now considering 185/703 (removed 518) transitions.
// Phase 1: matrix 185 rows 130 cols
[2024-05-21 21:32:32] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:32:32] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 21:32:32] [INFO ] Invariant cache hit.
[2024-05-21 21:32:32] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:32:32] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-21 21:32:32] [INFO ] Invariant cache hit.
[2024-05-21 21:32:32] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/315 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-21 21:32:35] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-21 21:32:36] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:32:36] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:32:36] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-21 21:32:38] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/315 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 198 constraints, problems are : Problem set: 0 solved, 184 unsolved in 9857 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 185/315 variables, 130/137 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 61/198 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 184/382 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 382 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10307 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 5/5 constraints]
After SMT, in 20370ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 20372ms
Starting structural reductions in LTL mode, iteration 1 : 130/298 places, 185/703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20674 ms. Remains : 130/298 places, 185/703 transitions.
[2024-05-21 21:32:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:32:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:32:53] [INFO ] Input system was already deterministic with 185 transitions.
[2024-05-21 21:32:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:32:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:32:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16904493073210060536.gal : 2 ms
[2024-05-21 21:32:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1132235250294111495.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/CTLFireability16904493073210060536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1132235250294111495.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 21:33:23] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:33:23] [INFO ] Applying decomposition
[2024-05-21 21:33:23] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5119868130767710612.txt' '-o' '/tmp/graph5119868130767710612.bin' '-w' '/tmp/graph5119868130767710612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5119868130767710612.bin' '-l' '-1' '-v' '-w' '/tmp/graph5119868130767710612.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:33:23] [INFO ] Decomposing Gal with order
[2024-05-21 21:33:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:33:23] [INFO ] Removed a total of 212 redundant transitions.
[2024-05-21 21:33:23] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:33:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 7 ms.
[2024-05-21 21:33:23] [INFO ] Time to serialize gal into /tmp/CTLFireability906141073959268025.gal : 2 ms
[2024-05-21 21:33:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4918589403842825611.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/CTLFireability906141073959268025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4918589403842825611.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.96071e+06,4.3439,136548,2741,1164,176564,17848,575,660628,181,160221,0


Converting to forward existential form...Done !
original formula: AX(EX(AF(((i1.u0.s1>=1)&&(i7.u21.l4261>=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(!(((i1.u0.s1>=1)&&(i7.u21.l4261>=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t13, t68, t71, t73, t74, t75, t83, t86, t87, t90, t98, t114, t118, t119, t120, t124, t125...583
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,19.4751,495492,1,0,529642,69178,2385,3.4388e+06,953,477958,1248790
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 240 transition count 445
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 240 transition count 445
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 136 place count 240 transition count 425
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 178 place count 198 transition count 374
Iterating global reduction 1 with 42 rules applied. Total rules applied 220 place count 198 transition count 374
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 232 place count 198 transition count 362
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 267 place count 163 transition count 305
Iterating global reduction 2 with 35 rules applied. Total rules applied 302 place count 163 transition count 305
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 320 place count 163 transition count 287
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 336 place count 147 transition count 256
Iterating global reduction 3 with 16 rules applied. Total rules applied 352 place count 147 transition count 256
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 360 place count 147 transition count 248
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 372 place count 135 transition count 225
Iterating global reduction 4 with 12 rules applied. Total rules applied 384 place count 135 transition count 225
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 394 place count 135 transition count 215
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 402 place count 127 transition count 189
Iterating global reduction 5 with 8 rules applied. Total rules applied 410 place count 127 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 411 place count 127 transition count 188
Applied a total of 411 rules in 22 ms. Remains 127 /298 variables (removed 171) and now considering 188/703 (removed 515) transitions.
// Phase 1: matrix 188 rows 127 cols
[2024-05-21 21:33:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:33:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 21:33:43] [INFO ] Invariant cache hit.
[2024-05-21 21:33:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 21:33:43] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 21:33:43] [INFO ] Redundant transitions in 1 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-21 21:33:43] [INFO ] Invariant cache hit.
[2024-05-21 21:33:43] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 68/197 constraints. Problems are: Problem set: 0 solved, 187 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 197 constraints, problems are : Problem set: 0 solved, 187 unsolved in 4922 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 68/197 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 187/384 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 384 constraints, problems are : Problem set: 0 solved, 187 unsolved in 12971 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 18130ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 18131ms
Starting structural reductions in SI_CTL mode, iteration 1 : 127/298 places, 188/703 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18462 ms. Remains : 127/298 places, 188/703 transitions.
[2024-05-21 21:34:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:34:01] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:34:01] [INFO ] Input system was already deterministic with 188 transitions.
[2024-05-21 21:34:01] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:34:01] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:34:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7053781587446885725.gal : 2 ms
[2024-05-21 21:34:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4872026398234041352.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/CTLFireability7053781587446885725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4872026398234041352.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.75803e+06,8.76584,260404,2,22981,5,705800,6,0,696,817028,0


Converting to forward existential form...Done !
original formula: EF((AF(((s1>=1)&&(l3086>=1))) * ((s1<1)||(l1694<1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((s1<1)||(l1694<1))) * !(EG(!(((s1>=1)&&(l3086>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t70, t74, t75, t76, t84, t85, t90, t91, t92, t94, t95, t96, t98, t...625
Detected timeout of ITS tools.
[2024-05-21 21:34:31] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:34:31] [INFO ] Applying decomposition
[2024-05-21 21:34:31] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1183774677263288860.txt' '-o' '/tmp/graph1183774677263288860.bin' '-w' '/tmp/graph1183774677263288860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1183774677263288860.bin' '-l' '-1' '-v' '-w' '/tmp/graph1183774677263288860.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:34:31] [INFO ] Decomposing Gal with order
[2024-05-21 21:34:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:34:31] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-21 21:34:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:34:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 4 ms.
[2024-05-21 21:34:31] [INFO ] Time to serialize gal into /tmp/CTLFireability13663483703257136969.gal : 16 ms
[2024-05-21 21:34:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9881767404750850942.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/CTLFireability13663483703257136969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9881767404750850942.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.75803e+06,1.41518,55476,1393,1451,49042,28794,524,239472,245,292149,0


Converting to forward existential form...Done !
original formula: EF((AF(((i0.u0.s1>=1)&&(u7.l3086>=1))) * ((i0.u0.s1<1)||(i0.u0.l1694<1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((i0.u0.s1<1)||(i0.u0.l1694<1))) * !(EG(!(((i0.u0.s1>=1)&&(u7.l3086>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t13, t80, t95, t97, t99, t100, t107, t108, t136, t137, t138, t139, t140, t141, t142, ...638
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,3.93737,125900,1,0,113116,67561,2120,592333,1264,694201,197748
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 244 transition count 462
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 244 transition count 462
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 126 place count 244 transition count 444
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 163 place count 207 transition count 399
Iterating global reduction 1 with 37 rules applied. Total rules applied 200 place count 207 transition count 399
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 211 place count 207 transition count 388
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 242 place count 176 transition count 338
Iterating global reduction 2 with 31 rules applied. Total rules applied 273 place count 176 transition count 338
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 287 place count 176 transition count 324
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 301 place count 162 transition count 296
Iterating global reduction 3 with 14 rules applied. Total rules applied 315 place count 162 transition count 296
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 333 place count 162 transition count 278
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 343 place count 152 transition count 258
Iterating global reduction 4 with 10 rules applied. Total rules applied 353 place count 152 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 360 place count 152 transition count 251
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 367 place count 145 transition count 226
Iterating global reduction 5 with 7 rules applied. Total rules applied 374 place count 145 transition count 226
Applied a total of 374 rules in 17 ms. Remains 145 /298 variables (removed 153) and now considering 226/703 (removed 477) transitions.
// Phase 1: matrix 226 rows 145 cols
[2024-05-21 21:34:35] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:34:35] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 21:34:35] [INFO ] Invariant cache hit.
[2024-05-21 21:34:35] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 21:34:35] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-21 21:34:36] [INFO ] Invariant cache hit.
[2024-05-21 21:34:36] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 226/371 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 85/232 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 0/371 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 232 constraints, problems are : Problem set: 0 solved, 225 unsolved in 7217 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 226/371 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 85/232 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 225/457 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 0/371 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 457 constraints, problems are : Problem set: 0 solved, 225 unsolved in 17853 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints]
After SMT, in 25371ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 25375ms
Starting structural reductions in LTL mode, iteration 1 : 145/298 places, 226/703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25756 ms. Remains : 145/298 places, 226/703 transitions.
[2024-05-21 21:35:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:35:01] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:35:01] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-21 21:35:01] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:35:01] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:35:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12683429947351839901.gal : 1 ms
[2024-05-21 21:35:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12773975470950270626.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/CTLFireability12683429947351839901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12773975470950270626.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44481e+06,23.0047,628072,2,47514,5,1.66996e+06,6,0,806,1.89468e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 21:35:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:35:31] [INFO ] Applying decomposition
[2024-05-21 21:35:31] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph479045299887189257.txt' '-o' '/tmp/graph479045299887189257.bin' '-w' '/tmp/graph479045299887189257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph479045299887189257.bin' '-l' '-1' '-v' '-w' '/tmp/graph479045299887189257.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:35:31] [INFO ] Decomposing Gal with order
[2024-05-21 21:35:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:35:31] [INFO ] Removed a total of 264 redundant transitions.
[2024-05-21 21:35:31] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:35:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 4 ms.
[2024-05-21 21:35:31] [INFO ] Time to serialize gal into /tmp/CTLFireability3713458375186436706.gal : 2 ms
[2024-05-21 21:35:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7563914299891195405.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/CTLFireability3713458375186436706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7563914299891195405.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44481e+06,7.10954,197548,2564,1702,154815,64927,643,1.23558e+06,271,477042,0


Converting to forward existential form...Done !
original formula: EF(((AF((((i7.u3.s1>=1)&&(i6.u25.l4117>=1))&&((i7.u3.s1>=1)&&(i5.u26.l4263>=1)))) * EG(((i3.u10.p224>=1)&&(i7.u3.l0>=1)))) * (AX(EF(((i7....264
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,TRUE) * (!(EG(!((((i7.u3.s1>=1)&&(i6.u25.l4117>=1))&&((i7.u3.s1>=1)&&(i5.u26.l4263>=1))))))...773
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t13, t28, t72, t77, t78, t80, t81, t82, t83, t85, t86, t88, t92, t93, t95, t96, t100,...756
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,13.9735,312760,1,0,216163,109182,3052,2.22295e+06,1577,1.28788e+06,467683
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 240 transition count 440
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 240 transition count 440
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 133 place count 240 transition count 423
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 174 place count 199 transition count 373
Iterating global reduction 1 with 41 rules applied. Total rules applied 215 place count 199 transition count 373
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 226 place count 199 transition count 362
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 260 place count 165 transition count 306
Iterating global reduction 2 with 34 rules applied. Total rules applied 294 place count 165 transition count 306
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 311 place count 165 transition count 289
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 326 place count 150 transition count 260
Iterating global reduction 3 with 15 rules applied. Total rules applied 341 place count 150 transition count 260
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 348 place count 150 transition count 253
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 360 place count 138 transition count 230
Iterating global reduction 4 with 12 rules applied. Total rules applied 372 place count 138 transition count 230
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 381 place count 138 transition count 221
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 388 place count 131 transition count 203
Iterating global reduction 5 with 7 rules applied. Total rules applied 395 place count 131 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 396 place count 131 transition count 202
Applied a total of 396 rules in 10 ms. Remains 131 /298 variables (removed 167) and now considering 202/703 (removed 501) transitions.
// Phase 1: matrix 202 rows 131 cols
[2024-05-21 21:35:45] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:35:45] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 21:35:45] [INFO ] Invariant cache hit.
[2024-05-21 21:35:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:35:45] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 21:35:45] [INFO ] Invariant cache hit.
[2024-05-21 21:35:45] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/333 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 78/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 211 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/333 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 78/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/333 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 12301 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 17681ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 17684ms
Starting structural reductions in LTL mode, iteration 1 : 131/298 places, 202/703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18045 ms. Remains : 131/298 places, 202/703 transitions.
[2024-05-21 21:36:03] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:36:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:36:03] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-21 21:36:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:36:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:36:03] [INFO ] Time to serialize gal into /tmp/CTLFireability12732474633917234850.gal : 2 ms
[2024-05-21 21:36:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3777378979593230775.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/CTLFireability12732474633917234850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3777378979593230775.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (!(E(EG(AG(AX(((s1>=1)&&(l3846>=1))))) U EF(((s1>=1)&&(l3079>=1))))) * AF(EG(((s1>=1)&&(l1665>=1)))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,EG(!(E(TRUE U !(!(EX(!(((s1>=1)&&(l3846>=1)))))))))),TRUE) * ((s1>=1)&&(l3079>=1)))] = FALSE *...206
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t70, t71, t75, t76, t77, t86, t87, t91, t92, t93, t101, t103, t104, t10...642
Detected timeout of ITS tools.
[2024-05-21 21:36:33] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:36:33] [INFO ] Applying decomposition
[2024-05-21 21:36:33] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10960349088807486759.txt' '-o' '/tmp/graph10960349088807486759.bin' '-w' '/tmp/graph10960349088807486759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10960349088807486759.bin' '-l' '-1' '-v' '-w' '/tmp/graph10960349088807486759.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:36:33] [INFO ] Decomposing Gal with order
[2024-05-21 21:36:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:36:33] [INFO ] Removed a total of 232 redundant transitions.
[2024-05-21 21:36:33] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:36:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 4 ms.
[2024-05-21 21:36:33] [INFO ] Time to serialize gal into /tmp/CTLFireability13941477081853635502.gal : 2 ms
[2024-05-21 21:36:33] [INFO ] Time to serialize properties into /tmp/CTLFireability559897012004994541.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/CTLFireability13941477081853635502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability559897012004994541.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.02679e+06,7.70144,258172,2511,2168,276151,89329,556,1.43152e+06,218,644702,0


Converting to forward existential form...Done !
original formula: (!(E(EG(AG(AX(((i0.i0.u0.s1>=1)&&(u13.l3846>=1))))) U EF(((i0.i0.u0.s1>=1)&&(i0.i1.u9.l3079>=1))))) * AF(EG(((i0.i0.u0.s1>=1)&&(i0.i0.u0....168
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,EG(!(E(TRUE U !(!(EX(!(((i0.i0.u0.s1>=1)&&(u13.l3846>=1)))))))))),TRUE) * ((i0.i0.u0.s1>=1)&&(...255
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t13, t49, t70, t138, t148, t149, t150, t152, t154, t155, t156, t161, t162, t163, t164...680
(forward)formula 0,0,14.5022,320724,1,0,337222,123700,2341,1.80832e+06,1093,803529,1160148
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 245 transition count 458
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 245 transition count 458
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 121 place count 245 transition count 443
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 160 place count 206 transition count 398
Iterating global reduction 1 with 39 rules applied. Total rules applied 199 place count 206 transition count 398
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 214 place count 206 transition count 383
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 246 place count 174 transition count 329
Iterating global reduction 2 with 32 rules applied. Total rules applied 278 place count 174 transition count 329
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 294 place count 174 transition count 313
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 308 place count 160 transition count 288
Iterating global reduction 3 with 14 rules applied. Total rules applied 322 place count 160 transition count 288
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 330 place count 160 transition count 280
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 339 place count 151 transition count 267
Iterating global reduction 4 with 9 rules applied. Total rules applied 348 place count 151 transition count 267
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 354 place count 151 transition count 261
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 358 place count 147 transition count 256
Iterating global reduction 5 with 4 rules applied. Total rules applied 362 place count 147 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 363 place count 147 transition count 255
Applied a total of 363 rules in 11 ms. Remains 147 /298 variables (removed 151) and now considering 255/703 (removed 448) transitions.
// Phase 1: matrix 255 rows 147 cols
[2024-05-21 21:36:48] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:36:48] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 21:36:48] [INFO ] Invariant cache hit.
[2024-05-21 21:36:48] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-21 21:36:48] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-05-21 21:36:48] [INFO ] Invariant cache hit.
[2024-05-21 21:36:48] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/402 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 115/264 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/402 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 264 constraints, problems are : Problem set: 0 solved, 254 unsolved in 8266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/402 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 115/264 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 254/518 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 518 constraints, problems are : Problem set: 0 solved, 254 unsolved in 20622 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 29247ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 29251ms
Starting structural reductions in LTL mode, iteration 1 : 147/298 places, 255/703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29706 ms. Remains : 147/298 places, 255/703 transitions.
[2024-05-21 21:37:18] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:37:18] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:37:18] [INFO ] Input system was already deterministic with 255 transitions.
[2024-05-21 21:37:18] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:37:18] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:37:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9340949552242536282.gal : 1 ms
[2024-05-21 21:37:18] [INFO ] Time to serialize properties into /tmp/CTLFireability3121590797144182360.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/CTLFireability9340949552242536282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3121590797144182360.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.
Detected timeout of ITS tools.
[2024-05-21 21:37:48] [INFO ] Flatten gal took : 25 ms
[2024-05-21 21:37:48] [INFO ] Applying decomposition
[2024-05-21 21:37:48] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2786143803692997790.txt' '-o' '/tmp/graph2786143803692997790.bin' '-w' '/tmp/graph2786143803692997790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2786143803692997790.bin' '-l' '-1' '-v' '-w' '/tmp/graph2786143803692997790.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:37:48] [INFO ] Decomposing Gal with order
[2024-05-21 21:37:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:37:48] [INFO ] Removed a total of 249 redundant transitions.
[2024-05-21 21:37:48] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:37:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 3 ms.
[2024-05-21 21:37:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8040859593973370213.gal : 2 ms
[2024-05-21 21:37:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5078437312184716513.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/CTLFireability8040859593973370213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5078437312184716513.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 240 transition count 442
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 240 transition count 442
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 135 place count 240 transition count 423
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 175 place count 200 transition count 374
Iterating global reduction 1 with 40 rules applied. Total rules applied 215 place count 200 transition count 374
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 227 place count 200 transition count 362
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 260 place count 167 transition count 309
Iterating global reduction 2 with 33 rules applied. Total rules applied 293 place count 167 transition count 309
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 309 place count 167 transition count 293
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 325 place count 151 transition count 262
Iterating global reduction 3 with 16 rules applied. Total rules applied 341 place count 151 transition count 262
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 354 place count 151 transition count 249
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 366 place count 139 transition count 220
Iterating global reduction 4 with 12 rules applied. Total rules applied 378 place count 139 transition count 220
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 387 place count 139 transition count 211
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 393 place count 133 transition count 193
Iterating global reduction 5 with 6 rules applied. Total rules applied 399 place count 133 transition count 193
Applied a total of 399 rules in 17 ms. Remains 133 /298 variables (removed 165) and now considering 193/703 (removed 510) transitions.
// Phase 1: matrix 193 rows 133 cols
[2024-05-21 21:38:18] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:38:18] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 21:38:18] [INFO ] Invariant cache hit.
[2024-05-21 21:38:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:38:18] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-21 21:38:18] [INFO ] Invariant cache hit.
[2024-05-21 21:38:18] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/326 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 192 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 201 constraints, problems are : Problem set: 0 solved, 192 unsolved in 7017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/326 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 192/393 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 393 constraints, problems are : Problem set: 0 solved, 192 unsolved in 13356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 20601ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 20604ms
Starting structural reductions in LTL mode, iteration 1 : 133/298 places, 193/703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20987 ms. Remains : 133/298 places, 193/703 transitions.
[2024-05-21 21:38:39] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:38:39] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:38:39] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-21 21:38:39] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:38:39] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:38:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7044990987283015447.gal : 1 ms
[2024-05-21 21:38:39] [INFO ] Time to serialize properties into /tmp/CTLFireability154238060858691694.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/CTLFireability7044990987283015447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability154238060858691694.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,2.71056e+06,15.4897,425396,2,30334,5,1.11551e+06,6,0,725,1.39304e+06,0


Converting to forward existential form...Done !
original formula: E(EF((!(EX(((s1>=1)&&(l4105>=1)))) + ((s1>=1)&&(l3076>=1)))) U ((s1>=1)&&(l2796>=1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (!(EX(((s1>=1)&&(l4105>=1)))) + ((s1>=1)&&(l3076>=1))))) * ((s1>=1)&&(l2796>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t71, t72, t77, t78, t79, t87, t88, t92, t93, t94, t96, t97, t98, t...638
Detected timeout of ITS tools.
[2024-05-21 21:39:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:39:09] [INFO ] Applying decomposition
[2024-05-21 21:39:09] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9442845252684092346.txt' '-o' '/tmp/graph9442845252684092346.bin' '-w' '/tmp/graph9442845252684092346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9442845252684092346.bin' '-l' '-1' '-v' '-w' '/tmp/graph9442845252684092346.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:39:09] [INFO ] Decomposing Gal with order
[2024-05-21 21:39:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:39:09] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-21 21:39:09] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:39:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 3 ms.
[2024-05-21 21:39:09] [INFO ] Time to serialize gal into /tmp/CTLFireability4184665551688401579.gal : 2 ms
[2024-05-21 21:39:09] [INFO ] Time to serialize properties into /tmp/CTLFireability12977251805370588855.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/CTLFireability4184665551688401579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12977251805370588855.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.71056e+06,7.25494,177160,1877,1530,137325,132731,514,691805,212,1.08233e+06,0


Converting to forward existential form...Done !
original formula: E(EF((!(EX(((i2.u4.s1>=1)&&(i1.u19.l4105>=1)))) + ((i2.u4.s1>=1)&&(u14.l3076>=1)))) U ((i2.u4.s1>=1)&&(i2.u4.l2796>=1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (!(EX(((i2.u4.s1>=1)&&(i1.u19.l4105>=1)))) + ((i2.u4.s1>=1)&&(u14.l3076>=1))))) * ((i2.u4.s...190
Reverse transition relation is NOT exact ! Due to transitions t5, t13, t70, t79, t87, t101, t106, t107, t109, t123, t129, t138, t140, t141, t142, t143, t14...563
(forward)formula 0,1,15.2454,257980,1,0,189427,189108,2336,1.05237e+06,1185,1.77597e+06,411606
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 249 transition count 493
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 249 transition count 493
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 122 place count 249 transition count 469
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 154 place count 217 transition count 429
Iterating global reduction 1 with 32 rules applied. Total rules applied 186 place count 217 transition count 429
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 197 place count 217 transition count 418
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 223 place count 191 transition count 378
Iterating global reduction 2 with 26 rules applied. Total rules applied 249 place count 191 transition count 378
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 265 place count 191 transition count 362
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 276 place count 180 transition count 344
Iterating global reduction 3 with 11 rules applied. Total rules applied 287 place count 180 transition count 344
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 310 place count 180 transition count 321
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 316 place count 174 transition count 311
Iterating global reduction 4 with 6 rules applied. Total rules applied 322 place count 174 transition count 311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 327 place count 174 transition count 306
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 332 place count 169 transition count 290
Iterating global reduction 5 with 5 rules applied. Total rules applied 337 place count 169 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 338 place count 169 transition count 289
Applied a total of 338 rules in 17 ms. Remains 169 /298 variables (removed 129) and now considering 289/703 (removed 414) transitions.
// Phase 1: matrix 289 rows 169 cols
[2024-05-21 21:39:24] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:39:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 21:39:24] [INFO ] Invariant cache hit.
[2024-05-21 21:39:25] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 21:39:25] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-21 21:39:25] [INFO ] Invariant cache hit.
[2024-05-21 21:39:25] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/458 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 123/294 constraints. Problems are: Problem set: 0 solved, 288 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 294 constraints, problems are : Problem set: 0 solved, 288 unsolved in 10908 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/458 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 123/294 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 288/582 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 582 constraints, problems are : Problem set: 0 solved, 288 unsolved in 27583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 39071ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 39074ms
Starting structural reductions in LTL mode, iteration 1 : 169/298 places, 289/703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39567 ms. Remains : 169/298 places, 289/703 transitions.
[2024-05-21 21:40:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:40:04] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:40:04] [INFO ] Input system was already deterministic with 289 transitions.
[2024-05-21 21:40:04] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:40:04] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:40:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15636619185268416614.gal : 1 ms
[2024-05-21 21:40:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17873525947112796125.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/CTLFireability15636619185268416614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17873525947112796125.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.
Detected timeout of ITS tools.
[2024-05-21 21:40:34] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:40:34] [INFO ] Applying decomposition
[2024-05-21 21:40:34] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5107532269493355305.txt' '-o' '/tmp/graph5107532269493355305.bin' '-w' '/tmp/graph5107532269493355305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5107532269493355305.bin' '-l' '-1' '-v' '-w' '/tmp/graph5107532269493355305.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:40:34] [INFO ] Decomposing Gal with order
[2024-05-21 21:40:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:40:34] [INFO ] Removed a total of 264 redundant transitions.
[2024-05-21 21:40:34] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:40:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 3 ms.
[2024-05-21 21:40:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6501919952124429130.gal : 2 ms
[2024-05-21 21:40:34] [INFO ] Time to serialize properties into /tmp/CTLFireability42905468270150042.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/CTLFireability6501919952124429130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability42905468270150042.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 241 transition count 452
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 241 transition count 452
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 132 place count 241 transition count 434
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 171 place count 202 transition count 386
Iterating global reduction 1 with 39 rules applied. Total rules applied 210 place count 202 transition count 386
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 218 place count 202 transition count 378
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 250 place count 170 transition count 325
Iterating global reduction 2 with 32 rules applied. Total rules applied 282 place count 170 transition count 325
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 299 place count 170 transition count 308
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 312 place count 157 transition count 283
Iterating global reduction 3 with 13 rules applied. Total rules applied 325 place count 157 transition count 283
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 330 place count 157 transition count 278
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 343 place count 144 transition count 248
Iterating global reduction 4 with 13 rules applied. Total rules applied 356 place count 144 transition count 248
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 365 place count 144 transition count 239
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 373 place count 136 transition count 213
Iterating global reduction 5 with 8 rules applied. Total rules applied 381 place count 136 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 382 place count 136 transition count 212
Applied a total of 382 rules in 16 ms. Remains 136 /298 variables (removed 162) and now considering 212/703 (removed 491) transitions.
// Phase 1: matrix 212 rows 136 cols
[2024-05-21 21:41:04] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:41:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 21:41:04] [INFO ] Invariant cache hit.
[2024-05-21 21:41:04] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-21 21:41:04] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-21 21:41:04] [INFO ] Invariant cache hit.
[2024-05-21 21:41:04] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/348 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 82/220 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-21 21:41:08] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-21 21:41:08] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/348 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 222 constraints, problems are : Problem set: 0 solved, 211 unsolved in 8987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/348 variables, 136/140 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 82/222 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 211/433 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 0/348 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 433 constraints, problems are : Problem set: 0 solved, 211 unsolved in 13325 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 2/2 constraints]
After SMT, in 22570ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 22573ms
Starting structural reductions in LTL mode, iteration 1 : 136/298 places, 212/703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22932 ms. Remains : 136/298 places, 212/703 transitions.
[2024-05-21 21:41:27] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:41:27] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:41:27] [INFO ] Input system was already deterministic with 212 transitions.
[2024-05-21 21:41:27] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:41:27] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:41:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11809109564876335070.gal : 1 ms
[2024-05-21 21:41:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12768459717149382527.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/CTLFireability11809109564876335070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12768459717149382527.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.5245e+06,16.6539,347600,2,25497,5,950618,6,0,756,1.06688e+06,0


Converting to forward existential form...Done !
original formula: EX(EF(EX((EX(((s1>=1)&&(l3825>=1))) + (((s1>=1)&&(l3843>=1))&&((s1<1)||(l3841<1)))))))
=> equivalent forward existential formula: ([(EY(EY(FwdU(EY(Init),TRUE))) * ((s1>=1)&&(l3825>=1)))] != FALSE + [(EY(FwdU(EY(Init),TRUE)) * (((s1>=1)&&(l384...195
(forward)formula 0,1,26.8226,351296,1,0,11,970256,9,1,1487,1.11695e+06,6
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 239 transition count 432
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 239 transition count 432
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 136 place count 239 transition count 414
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 177 place count 198 transition count 364
Iterating global reduction 1 with 41 rules applied. Total rules applied 218 place count 198 transition count 364
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 229 place count 198 transition count 353
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 264 place count 163 transition count 296
Iterating global reduction 2 with 35 rules applied. Total rules applied 299 place count 163 transition count 296
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 316 place count 163 transition count 279
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 332 place count 147 transition count 248
Iterating global reduction 3 with 16 rules applied. Total rules applied 348 place count 147 transition count 248
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 356 place count 147 transition count 240
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 368 place count 135 transition count 218
Iterating global reduction 4 with 12 rules applied. Total rules applied 380 place count 135 transition count 218
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 389 place count 135 transition count 209
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 397 place count 127 transition count 183
Iterating global reduction 5 with 8 rules applied. Total rules applied 405 place count 127 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 406 place count 127 transition count 182
Applied a total of 406 rules in 14 ms. Remains 127 /298 variables (removed 171) and now considering 182/703 (removed 521) transitions.
// Phase 1: matrix 182 rows 127 cols
[2024-05-21 21:41:54] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:41:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 21:41:54] [INFO ] Invariant cache hit.
[2024-05-21 21:41:54] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:41:54] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-21 21:41:54] [INFO ] Invariant cache hit.
[2024-05-21 21:41:54] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 190 constraints, problems are : Problem set: 0 solved, 181 unsolved in 4862 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 181/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 371 constraints, problems are : Problem set: 0 solved, 181 unsolved in 9713 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 14802ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 14805ms
Starting structural reductions in LTL mode, iteration 1 : 127/298 places, 182/703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15164 ms. Remains : 127/298 places, 182/703 transitions.
[2024-05-21 21:42:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:42:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:42:09] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-21 21:42:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:42:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:42:09] [INFO ] Time to serialize gal into /tmp/CTLFireability10498680693491283451.gal : 2 ms
[2024-05-21 21:42:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13491020006100415513.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/CTLFireability10498680693491283451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13491020006100415513.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.73791e+06,13.2953,284420,2,22765,5,730894,6,0,690,955423,0


Converting to forward existential form...Done !
original formula: AX(EG(EX(AX(((p267<1)||(l0<1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(EX(!(EX(!(((p267<1)||(l0<1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t70, t74, t75, t76, t84, t93, t95, t96, t97, t99, t100, t120, t129...569
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 21:42:39] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:42:39] [INFO ] Applying decomposition
[2024-05-21 21:42:39] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4685522793436111775.txt' '-o' '/tmp/graph4685522793436111775.bin' '-w' '/tmp/graph4685522793436111775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4685522793436111775.bin' '-l' '-1' '-v' '-w' '/tmp/graph4685522793436111775.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:42:39] [INFO ] Decomposing Gal with order
[2024-05-21 21:42:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:42:39] [INFO ] Removed a total of 194 redundant transitions.
[2024-05-21 21:42:39] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:42:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 2 ms.
[2024-05-21 21:42:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9616519686988122288.gal : 2 ms
[2024-05-21 21:42:39] [INFO ] Time to serialize properties into /tmp/CTLFireability17003300617758580975.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/CTLFireability9616519686988122288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17003300617758580975.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.73791e+06,5.2443,164040,1829,1881,79965,42370,515,1.12405e+06,201,947008,0


Converting to forward existential form...Done !
original formula: AX(EG(EX(AX(((i5.u15.p267<1)||(i5.u0.l0<1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(EX(!(EX(!(((i5.u15.p267<1)||(i5.u0.l0<1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t13, t72, t74, t76, t94, t97, t99, t100, t120, t131, t132, t133, t134, t135, t136, t137, ...529
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,13.0997,354332,1,0,139376,61918,2231,3.11918e+06,1067,1.51657e+06,363299
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 241 transition count 449
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 241 transition count 449
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 132 place count 241 transition count 431
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 174 place count 199 transition count 380
Iterating global reduction 1 with 42 rules applied. Total rules applied 216 place count 199 transition count 380
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 229 place count 199 transition count 367
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 264 place count 164 transition count 310
Iterating global reduction 2 with 35 rules applied. Total rules applied 299 place count 164 transition count 310
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 319 place count 164 transition count 290
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 334 place count 149 transition count 260
Iterating global reduction 3 with 15 rules applied. Total rules applied 349 place count 149 transition count 260
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 358 place count 149 transition count 251
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 369 place count 138 transition count 229
Iterating global reduction 4 with 11 rules applied. Total rules applied 380 place count 138 transition count 229
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 388 place count 138 transition count 221
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 396 place count 130 transition count 195
Iterating global reduction 5 with 8 rules applied. Total rules applied 404 place count 130 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 405 place count 130 transition count 194
Applied a total of 405 rules in 27 ms. Remains 130 /298 variables (removed 168) and now considering 194/703 (removed 509) transitions.
// Phase 1: matrix 194 rows 130 cols
[2024-05-21 21:42:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:42:53] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 21:42:53] [INFO ] Invariant cache hit.
[2024-05-21 21:42:53] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 21:42:53] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-21 21:42:53] [INFO ] Invariant cache hit.
[2024-05-21 21:42:53] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/324 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 70/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 202 constraints, problems are : Problem set: 0 solved, 193 unsolved in 5111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/324 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 70/202 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 193/395 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 395 constraints, problems are : Problem set: 0 solved, 193 unsolved in 12199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 17532ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 17534ms
Starting structural reductions in LTL mode, iteration 1 : 130/298 places, 194/703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17904 ms. Remains : 130/298 places, 194/703 transitions.
[2024-05-21 21:43:11] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:43:11] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:43:11] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-21 21:43:11] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:43:11] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:43:11] [INFO ] Time to serialize gal into /tmp/CTLFireability17036663111550697632.gal : 1 ms
[2024-05-21 21:43:11] [INFO ] Time to serialize properties into /tmp/CTLFireability1368806056413631018.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/CTLFireability17036663111550697632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1368806056413631018.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AX((EX(AG(((s1<1)||(l3083<1)))) + (EG(((s1<1)||(l3663<1))) * EF(((s1<1)||(l1680<1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((EX(!(E(TRUE U !(((s1<1)||(l3083<1)))))) + (EG(((s1<1)||(l3663<1))) * E(TRUE U ((s1<1)||(l16...178
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t70, t74, t75, t76, t84, t85, t90, t91, t92, t93, t94, t95, t96, t...653
Detected timeout of ITS tools.
[2024-05-21 21:43:41] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:43:41] [INFO ] Applying decomposition
[2024-05-21 21:43:41] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1629698656154351039.txt' '-o' '/tmp/graph1629698656154351039.bin' '-w' '/tmp/graph1629698656154351039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1629698656154351039.bin' '-l' '-1' '-v' '-w' '/tmp/graph1629698656154351039.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:43:41] [INFO ] Decomposing Gal with order
[2024-05-21 21:43:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:43:41] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-21 21:43:41] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:43:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 173 labels/synchronizations in 3 ms.
[2024-05-21 21:43:41] [INFO ] Time to serialize gal into /tmp/CTLFireability7357805093490281308.gal : 2 ms
[2024-05-21 21:43:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17749167694376168652.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/CTLFireability7357805093490281308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17749167694376168652.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.53586e+06,0.699621,31300,1504,994,36641,9081,549,85002,214,123558,0


Converting to forward existential form...Done !
original formula: EX(AX((EX(AG(((i3.u2.s1<1)||(i4.u13.l3083<1)))) + (EG(((i3.u2.s1<1)||(i5.u16.l3663<1))) * EF(((i3.u2.s1<1)||(i4.u12.l1680<1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((EX(!(E(TRUE U !(((i3.u2.s1<1)||(i4.u13.l3083<1)))))) + (EG(((i3.u2.s1<1)||(i5.u16.l3663<1))...217
Reverse transition relation is NOT exact ! Due to transitions t0, t13, t14, t93, t96, t100, t101, t109, t113, t114, t116, t132, t142, t143, t144, t147, t14...537
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,4.63562,156700,1,0,241282,47744,2292,452811,1158,381156,601582
FORMULA DBSingleClientW-PT-d2m06-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 703/703 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 239 transition count 438
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 239 transition count 438
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 136 place count 239 transition count 420
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 177 place count 198 transition count 370
Iterating global reduction 1 with 41 rules applied. Total rules applied 218 place count 198 transition count 370
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 230 place count 198 transition count 358
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 263 place count 165 transition count 303
Iterating global reduction 2 with 33 rules applied. Total rules applied 296 place count 165 transition count 303
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 313 place count 165 transition count 286
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 328 place count 150 transition count 260
Iterating global reduction 3 with 15 rules applied. Total rules applied 343 place count 150 transition count 260
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 351 place count 150 transition count 252
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 363 place count 138 transition count 223
Iterating global reduction 4 with 12 rules applied. Total rules applied 375 place count 138 transition count 223
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 384 place count 138 transition count 214
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 391 place count 131 transition count 189
Iterating global reduction 5 with 7 rules applied. Total rules applied 398 place count 131 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 399 place count 131 transition count 188
Applied a total of 399 rules in 15 ms. Remains 131 /298 variables (removed 167) and now considering 188/703 (removed 515) transitions.
// Phase 1: matrix 188 rows 131 cols
[2024-05-21 21:43:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:43:45] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 21:43:45] [INFO ] Invariant cache hit.
[2024-05-21 21:43:45] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:43:46] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-05-21 21:43:46] [INFO ] Invariant cache hit.
[2024-05-21 21:43:46] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/319 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 61/194 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 194 constraints, problems are : Problem set: 0 solved, 187 unsolved in 6341 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/319 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 61/194 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 187/381 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 381 constraints, problems are : Problem set: 0 solved, 187 unsolved in 11325 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 17901ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 17903ms
Starting structural reductions in LTL mode, iteration 1 : 131/298 places, 188/703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18257 ms. Remains : 131/298 places, 188/703 transitions.
[2024-05-21 21:44:04] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:44:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:44:04] [INFO ] Input system was already deterministic with 188 transitions.
[2024-05-21 21:44:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:44:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:44:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8928380192790540874.gal : 2 ms
[2024-05-21 21:44:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7120494612640568762.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/CTLFireability8928380192790540874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7120494612640568762.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,3.03783e+06,19.8382,476452,2,31919,5,1.24397e+06,6,0,712,1.60682e+06,0


Converting to forward existential form...Done !
original formula: EG(EX(AX(((s1<1)||(l4156<1)))))
=> equivalent forward existential formula: [FwdG(Init,EX(!(EX(!(((s1<1)||(l4156<1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t111, t113, t114...653
Detected timeout of ITS tools.
[2024-05-21 21:44:34] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:44:34] [INFO ] Applying decomposition
[2024-05-21 21:44:34] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16958483167538897360.txt' '-o' '/tmp/graph16958483167538897360.bin' '-w' '/tmp/graph16958483167538897360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16958483167538897360.bin' '-l' '-1' '-v' '-w' '/tmp/graph16958483167538897360.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:44:34] [INFO ] Decomposing Gal with order
[2024-05-21 21:44:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:44:34] [INFO ] Removed a total of 229 redundant transitions.
[2024-05-21 21:44:34] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:44:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 2 ms.
[2024-05-21 21:44:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11630697394462121707.gal : 2 ms
[2024-05-21 21:44:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2668962129130383900.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/CTLFireability11630697394462121707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2668962129130383900.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.03783e+06,10.2011,255548,2336,1652,222070,145006,596,1.36771e+06,166,1.18165e+06,0


Converting to forward existential form...Done !
original formula: EG(EX(AX(((i6.u0.s1<1)||(i6.u22.l4156<1)))))
=> equivalent forward existential formula: [FwdG(Init,EX(!(EX(!(((i6.u0.s1<1)||(i6.u22.l4156<1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t14, t73, t74, t75, t83, t84, t87, t88, t90, t111, t133, t134, t135, t136, t137, t138, t139, ...683
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
[2024-05-21 21:45:04] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:45:04] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:45:04] [INFO ] Applying decomposition
[2024-05-21 21:45:04] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13655127364070865447.txt' '-o' '/tmp/graph13655127364070865447.bin' '-w' '/tmp/graph13655127364070865447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13655127364070865447.bin' '-l' '-1' '-v' '-w' '/tmp/graph13655127364070865447.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:45:04] [INFO ] Decomposing Gal with order
[2024-05-21 21:45:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:45:04] [INFO ] Removed a total of 610 redundant transitions.
[2024-05-21 21:45:04] [INFO ] Flatten gal took : 45 ms
[2024-05-21 21:45:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 528 labels/synchronizations in 6 ms.
[2024-05-21 21:45:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9271106237729975327.gal : 4 ms
[2024-05-21 21:45:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7528476628466948077.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/CTLFireability9271106237729975327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7528476628466948077.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 21:53:10] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:53:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1303477339696113224.gal : 3 ms
[2024-05-21 21:53:10] [INFO ] Time to serialize properties into /tmp/CTLFireability697562690447724706.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/CTLFireability1303477339696113224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability697562690447724706.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 3 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 22:03:50] [INFO ] Flatten gal took : 17 ms
[2024-05-21 22:03:50] [INFO ] Input system was already deterministic with 703 transitions.
[2024-05-21 22:03:50] [INFO ] Transformed 298 places.
[2024-05-21 22:03:50] [INFO ] Transformed 703 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 22:03:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9855989468820356601.gal : 3 ms
[2024-05-21 22:03:50] [INFO ] Time to serialize properties into /tmp/CTLFireability1005747464143742746.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/CTLFireability9855989468820356601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1005747464143742746.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58091e+08,686.213,4572720,2,345891,5,1.62048e+07,6,0,1895,3.1381e+06,0


Converting to forward existential form...Done !
original formula: ((EG((AF((((s1<1)||(l3080<1))&&((p319<1)||(l3093<1)))) * ((s1<1)||(l2628<1)))) + !(A((E(((s1>=1)&&(l2140>=1)) U ((s1>=1)&&(l1699>=1))) + ...328
=> equivalent forward existential formula: ([FwdG((Init * !((EG((!(EG(!((((s1<1)||(l3080<1))&&((p319<1)||(l3093<1)))))) * ((s1<1)||(l2628<1)))) + !(!((E(!(...898
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t19, t29, t32, t33, t34, t35, t36, t37, t38,...3139
Using saturation style SCC detection

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-d2m06"
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-d2m06, 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-171624189500562"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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