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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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-d2m05-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716326146227

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-d2m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 21:15:47] [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:15:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:15:47] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-05-21 21:15:47] [INFO ] Transformed 4763 places.
[2024-05-21 21:15:47] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:15:47] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Deduced a syphon composed of 3580 places in 24 ms
Reduce places removed 3580 places and 0 transitions.
Support contains 135 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 326 places :
Symmetric choice reduction at 1 with 326 rule applications. Total rules 571 place count 811 transition count 1797
Iterating global reduction 1 with 326 rules applied. Total rules applied 897 place count 811 transition count 1797
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 1 with 152 rules applied. Total rules applied 1049 place count 811 transition count 1645
Discarding 246 places :
Symmetric choice reduction at 2 with 246 rule applications. Total rules 1295 place count 565 transition count 1399
Iterating global reduction 2 with 246 rules applied. Total rules applied 1541 place count 565 transition count 1399
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1543 place count 565 transition count 1397
Discarding 161 places :
Symmetric choice reduction at 3 with 161 rule applications. Total rules 1704 place count 404 transition count 1184
Iterating global reduction 3 with 161 rules applied. Total rules applied 1865 place count 404 transition count 1184
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2076 place count 404 transition count 973
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 2081 place count 399 transition count 966
Iterating global reduction 4 with 5 rules applied. Total rules applied 2086 place count 399 transition count 966
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 2105 place count 399 transition count 947
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2107 place count 397 transition count 945
Iterating global reduction 5 with 2 rules applied. Total rules applied 2109 place count 397 transition count 945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2110 place count 397 transition count 944
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2111 place count 396 transition count 943
Iterating global reduction 6 with 1 rules applied. Total rules applied 2112 place count 396 transition count 943
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2113 place count 395 transition count 941
Iterating global reduction 6 with 1 rules applied. Total rules applied 2114 place count 395 transition count 941
Applied a total of 2114 rules in 224 ms. Remains 395 /1183 variables (removed 788) and now considering 941/2478 (removed 1537) transitions.
// Phase 1: matrix 941 rows 395 cols
[2024-05-21 21:15:48] [INFO ] Computed 2 invariants in 30 ms
[2024-05-21 21:15:48] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-21 21:15:48] [INFO ] Invariant cache hit.
[2024-05-21 21:15:48] [INFO ] State equation strengthened by 564 read => feed constraints.
[2024-05-21 21:15:50] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
Running 940 sub problems to find dead transitions.
[2024-05-21 21:15:50] [INFO ] Invariant cache hit.
[2024-05-21 21:15:50] [INFO ] State equation strengthened by 564 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 4 (OVERLAPS) 941/1336 variables, 395/397 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 564/961 constraints. Problems are: Problem set: 0 solved, 940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 961 constraints, problems are : Problem set: 0 solved, 940 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 395/395 constraints, ReadFeed: 564/564 constraints, PredecessorRefiner: 940/940 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 4 (OVERLAPS) 941/1336 variables, 395/397 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1336 variables, 564/961 constraints. Problems are: Problem set: 0 solved, 940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1901 constraints, problems are : Problem set: 0 solved, 940 unsolved in 31066 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 395/395 constraints, ReadFeed: 564/564 constraints, PredecessorRefiner: 940/940 constraints, Known Traps: 0/0 constraints]
After SMT, in 65696ms problems are : Problem set: 0 solved, 940 unsolved
Search for dead transitions found 0 dead transitions in 65719ms
Starting structural reductions in LTL mode, iteration 1 : 395/1183 places, 941/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67900 ms. Remains : 395/1183 places, 941/2478 transitions.
Support contains 135 out of 395 places after structural reductions.
[2024-05-21 21:16:56] [INFO ] Flatten gal took : 80 ms
[2024-05-21 21:16:56] [INFO ] Flatten gal took : 50 ms
[2024-05-21 21:16:56] [INFO ] Input system was already deterministic with 941 transitions.
Reduction of identical properties reduced properties to check from 109 to 106
RANDOM walk for 40000 steps (9253 resets) in 3589 ms. (11 steps per ms) remains 98/106 properties
BEST_FIRST walk for 4003 steps (174 resets) in 72 ms. (54 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4002 steps (174 resets) in 41 ms. (95 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (161 resets) in 52 ms. (75 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4002 steps (183 resets) in 43 ms. (90 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4002 steps (373 resets) in 40 ms. (97 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4002 steps (178 resets) in 34 ms. (114 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (184 resets) in 28 ms. (138 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (166 resets) in 20 ms. (190 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (168 resets) in 21 ms. (181 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4001 steps (185 resets) in 23 ms. (166 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4002 steps (167 resets) in 24 ms. (160 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (184 resets) in 23 ms. (166 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (181 resets) in 42 ms. (93 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (168 resets) in 35 ms. (111 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (189 resets) in 26 ms. (148 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (395 resets) in 47 ms. (83 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (172 resets) in 38 ms. (102 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4001 steps (180 resets) in 28 ms. (137 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (164 resets) in 22 ms. (174 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (378 resets) in 35 ms. (111 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (170 resets) in 27 ms. (142 steps per ms) remains 97/98 properties
BEST_FIRST walk for 4004 steps (155 resets) in 33 ms. (117 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (177 resets) in 33 ms. (117 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (176 resets) in 29 ms. (133 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (183 resets) in 46 ms. (85 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (175 resets) in 34 ms. (114 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4001 steps (192 resets) in 25 ms. (153 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (168 resets) in 28 ms. (138 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (176 resets) in 32 ms. (121 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (368 resets) in 47 ms. (83 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (196 resets) in 36 ms. (108 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (162 resets) in 29 ms. (133 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (172 resets) in 26 ms. (148 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (168 resets) in 33 ms. (117 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4001 steps (183 resets) in 24 ms. (160 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (164 resets) in 29 ms. (133 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (183 resets) in 32 ms. (121 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (165 resets) in 27 ms. (142 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (175 resets) in 32 ms. (121 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (167 resets) in 22 ms. (174 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (432 resets) in 31 ms. (125 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (190 resets) in 23 ms. (166 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (163 resets) in 21 ms. (181 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (187 resets) in 23 ms. (166 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (183 resets) in 23 ms. (166 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (169 resets) in 21 ms. (181 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (182 resets) in 20 ms. (190 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (395 resets) in 42 ms. (93 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (183 resets) in 27 ms. (143 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (416 resets) in 38 ms. (102 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (379 resets) in 31 ms. (125 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (389 resets) in 40 ms. (97 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (185 resets) in 27 ms. (142 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (172 resets) in 25 ms. (153 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (175 resets) in 23 ms. (166 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (418 resets) in 29 ms. (133 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (180 resets) in 25 ms. (154 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (162 resets) in 20 ms. (190 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (179 resets) in 22 ms. (174 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (164 resets) in 20 ms. (190 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (186 resets) in 23 ms. (166 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (170 resets) in 21 ms. (181 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (185 resets) in 21 ms. (181 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (172 resets) in 23 ms. (166 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (166 resets) in 21 ms. (182 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (173 resets) in 21 ms. (181 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (368 resets) in 31 ms. (125 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (204 resets) in 22 ms. (174 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (177 resets) in 24 ms. (160 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4004 steps (156 resets) in 30 ms. (129 steps per ms) remains 97/97 properties
Interrupted probabilistic random walk after 231451 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :82 out of 97
Probabilistic random walk after 231451 steps, saw 91055 distinct states, run finished after 3004 ms. (steps per millisecond=77 ) properties seen :82
[2024-05-21 21:17:01] [INFO ] Invariant cache hit.
[2024-05-21 21:17:01] [INFO ] State equation strengthened by 564 read => feed constraints.
Problem AtomicPropp63 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp85 is UNSAT
At refinement iteration 1 (OVERLAPS) 132/176 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 80/256 variables, 1/2 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 603/859 variables, 256/258 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/859 variables, 226/484 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/859 variables, 0/484 constraints. Problems are: Problem set: 9 solved, 6 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 8 (OVERLAPS) 467/1326 variables, 134/618 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1326 variables, 333/951 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1326 variables, 0/951 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/1336 variables, 5/956 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1336 variables, 5/961 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1336 variables, 0/961 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1336 variables, 0/961 constraints. Problems are: Problem set: 13 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 961 constraints, problems are : Problem set: 13 solved, 2 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 395/395 constraints, ReadFeed: 564/564 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 143/150 variables, 1/1 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/1 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/238 variables, 1/2 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/2 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 470/708 variables, 238/240 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/708 variables, 93/333 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/708 variables, 0/333 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 598/1306 variables, 142/475 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1306 variables, 456/931 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1306 variables, 2/933 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1306 variables, 0/933 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 30/1336 variables, 15/948 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1336 variables, 15/963 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1336 variables, 0/963 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1336 variables, 0/963 constraints. Problems are: Problem set: 13 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 963 constraints, problems are : Problem set: 13 solved, 2 unsolved in 1958 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 395/395 constraints, ReadFeed: 564/564 constraints, PredecessorRefiner: 2/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 3042ms problems are : Problem set: 13 solved, 2 unsolved
Parikh walk visited 0 properties in 416 ms.
Support contains 7 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 941/941 transitions.
Graph (complete) has 1595 edges and 395 vertex of which 394 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 394 transition count 932
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 105 place count 299 transition count 573
Iterating global reduction 1 with 95 rules applied. Total rules applied 200 place count 299 transition count 573
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 229 place count 299 transition count 544
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 300 place count 228 transition count 457
Iterating global reduction 2 with 71 rules applied. Total rules applied 371 place count 228 transition count 457
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 400 place count 228 transition count 428
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 447 place count 181 transition count 359
Iterating global reduction 3 with 47 rules applied. Total rules applied 494 place count 181 transition count 359
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 529 place count 181 transition count 324
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 544 place count 166 transition count 298
Iterating global reduction 4 with 15 rules applied. Total rules applied 559 place count 166 transition count 298
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 564 place count 166 transition count 293
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 574 place count 156 transition count 283
Iterating global reduction 5 with 10 rules applied. Total rules applied 584 place count 156 transition count 283
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 592 place count 156 transition count 275
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 601 place count 147 transition count 249
Iterating global reduction 6 with 9 rules applied. Total rules applied 610 place count 147 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 616 place count 147 transition count 243
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 619 place count 144 transition count 223
Iterating global reduction 7 with 3 rules applied. Total rules applied 622 place count 144 transition count 223
Applied a total of 622 rules in 90 ms. Remains 144 /395 variables (removed 251) and now considering 223/941 (removed 718) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 144/395 places, 223/941 transitions.
RANDOM walk for 40000 steps (9197 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1830 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1776 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 103203 steps, run visited all 2 properties in 266 ms. (steps per millisecond=387 )
Probabilistic random walk after 103203 steps, saw 43681 distinct states, run finished after 271 ms. (steps per millisecond=380 ) properties seen :2
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
[2024-05-21 21:17:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 21:17:05] [INFO ] Flatten gal took : 39 ms
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 21:17:05] [INFO ] Flatten gal took : 39 ms
[2024-05-21 21:17:05] [INFO ] Input system was already deterministic with 941 transitions.
Support contains 92 out of 395 places (down from 105) after GAL structural reductions.
Computed a total of 5 stabilizing places and 49 stable transitions
Graph (complete) has 1721 edges and 395 vertex of which 394 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 300 transition count 555
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 300 transition count 555
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 210 place count 300 transition count 535
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 281 place count 229 transition count 448
Iterating global reduction 1 with 71 rules applied. Total rules applied 352 place count 229 transition count 448
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 378 place count 229 transition count 422
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 425 place count 182 transition count 349
Iterating global reduction 2 with 47 rules applied. Total rules applied 472 place count 182 transition count 349
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 502 place count 182 transition count 319
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 519 place count 165 transition count 291
Iterating global reduction 3 with 17 rules applied. Total rules applied 536 place count 165 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 542 place count 165 transition count 285
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 553 place count 154 transition count 273
Iterating global reduction 4 with 11 rules applied. Total rules applied 564 place count 154 transition count 273
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 572 place count 154 transition count 265
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 577 place count 149 transition count 256
Iterating global reduction 5 with 5 rules applied. Total rules applied 582 place count 149 transition count 256
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 588 place count 149 transition count 250
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 590 place count 147 transition count 237
Iterating global reduction 6 with 2 rules applied. Total rules applied 592 place count 147 transition count 237
Applied a total of 592 rules in 29 ms. Remains 147 /395 variables (removed 248) and now considering 237/941 (removed 704) transitions.
// Phase 1: matrix 237 rows 147 cols
[2024-05-21 21:17:05] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 21:17:05] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 21:17:05] [INFO ] Invariant cache hit.
[2024-05-21 21:17:05] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-21 21:17:05] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-21 21:17:05] [INFO ] Invariant cache hit.
[2024-05-21 21:17:05] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 237/384 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 99/248 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/384 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 248 constraints, problems are : Problem set: 0 solved, 236 unsolved in 7285 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 237/384 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 99/248 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 236/484 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 484 constraints, problems are : Problem set: 0 solved, 236 unsolved in 20231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 27906ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 27909ms
Starting structural reductions in LTL mode, iteration 1 : 147/395 places, 237/941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28325 ms. Remains : 147/395 places, 237/941 transitions.
[2024-05-21 21:17:33] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:17:33] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:17:33] [INFO ] Input system was already deterministic with 237 transitions.
[2024-05-21 21:17:33] [INFO ] Flatten gal took : 28 ms
[2024-05-21 21:17:33] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:17:33] [INFO ] Time to serialize gal into /tmp/CTLFireability4905431614510142049.gal : 7 ms
[2024-05-21 21:17:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1752630166548876982.ctl : 41 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/CTLFireability4905431614510142049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1752630166548876982.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,422325,9.24113,265732,2,27085,5,616905,6,0,825,883937,0


Converting to forward existential form...Done !
original formula: A(!(EG(AF(!(A(((s1>=1)&&(l1678>=1)) U ((s1>=1)&&(l4129>=1))))))) U (AX(!((!(((s1>=1)&&(l4263>=1))) * EF(((p169>=1)&&(l0>=1)))))) * (AG(AX...214
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!(!((!(((s1>=1)&&(l4263>=1))) * E(TRUE U ((p169>=1)&&(l0>=1)))))))) * (!(E(TRUE U !(!(EX(...732
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t28, t29, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81, t89, t...918
Detected timeout of ITS tools.
[2024-05-21 21:18:03] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:18:03] [INFO ] Applying decomposition
[2024-05-21 21:18:03] [INFO ] Flatten gal took : 8 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/graph16509559888071086112.txt' '-o' '/tmp/graph16509559888071086112.bin' '-w' '/tmp/graph16509559888071086112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16509559888071086112.bin' '-l' '-1' '-v' '-w' '/tmp/graph16509559888071086112.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:18:04] [INFO ] Decomposing Gal with order
[2024-05-21 21:18:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:18:04] [INFO ] Removed a total of 245 redundant transitions.
[2024-05-21 21:18:04] [INFO ] Flatten gal took : 60 ms
[2024-05-21 21:18:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 211 labels/synchronizations in 13 ms.
[2024-05-21 21:18:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14690267562975966760.gal : 4 ms
[2024-05-21 21:18:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17682237946927788960.ctl : 11 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/CTLFireability14690267562975966760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17682237946927788960.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,422325,2.90182,89580,2453,2065,71574,34884,601,316587,293,677592,0


Converting to forward existential form...Done !
original formula: A(!(EG(AF(!(A(((i4.u0.s1>=1)&&(i4.u0.l1678>=1)) U ((i4.u0.s1>=1)&&(u16.l4129>=1))))))) U (AX(!((!(((i4.u0.s1>=1)&&(u16.l4263>=1))) * EF((...289
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!(!((!(((i4.u0.s1>=1)&&(u16.l4263>=1))) * E(TRUE U ((i4.u11.p169>=1)&&(i0.i0.u1.l0>=1))))...933
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t6, t13, t85, t89, t99, t106, t118, t121, t124, t125, t126, t130, t131, t149, t175, t...892
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,9.83215,262804,1,0,234555,134925,2675,953378,1613,1.94247e+06,607105
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 305 transition count 598
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 305 transition count 598
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 209 place count 305 transition count 569
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 277 place count 237 transition count 486
Iterating global reduction 1 with 68 rules applied. Total rules applied 345 place count 237 transition count 486
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 375 place count 237 transition count 456
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 420 place count 192 transition count 387
Iterating global reduction 2 with 45 rules applied. Total rules applied 465 place count 192 transition count 387
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 497 place count 192 transition count 355
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 512 place count 177 transition count 333
Iterating global reduction 3 with 15 rules applied. Total rules applied 527 place count 177 transition count 333
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 533 place count 177 transition count 327
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 542 place count 168 transition count 317
Iterating global reduction 4 with 9 rules applied. Total rules applied 551 place count 168 transition count 317
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 560 place count 168 transition count 308
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 562 place count 166 transition count 306
Iterating global reduction 5 with 2 rules applied. Total rules applied 564 place count 166 transition count 306
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 566 place count 166 transition count 304
Applied a total of 566 rules in 23 ms. Remains 166 /395 variables (removed 229) and now considering 304/941 (removed 637) transitions.
// Phase 1: matrix 304 rows 166 cols
[2024-05-21 21:18:14] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 21:18:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 21:18:14] [INFO ] Invariant cache hit.
[2024-05-21 21:18:14] [INFO ] State equation strengthened by 149 read => feed constraints.
[2024-05-21 21:18:14] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-05-21 21:18:14] [INFO ] Invariant cache hit.
[2024-05-21 21:18:14] [INFO ] State equation strengthened by 149 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 304/470 variables, 166/168 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 149/317 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 21:18:25] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 15 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/470 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 21:18:29] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 0/470 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 319 constraints, problems are : Problem set: 0 solved, 303 unsolved in 24306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 149/149 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 304/470 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 149/319 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 303/622 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/470 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 622 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, ReadFeed: 149/149 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 2/2 constraints]
After SMT, in 54805ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 54808ms
Starting structural reductions in LTL mode, iteration 1 : 166/395 places, 304/941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55360 ms. Remains : 166/395 places, 304/941 transitions.
[2024-05-21 21:19:09] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:19:09] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:19:09] [INFO ] Input system was already deterministic with 304 transitions.
[2024-05-21 21:19:09] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:19:09] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:19:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3824890279387689391.gal : 6 ms
[2024-05-21 21:19:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14887769127311531426.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/CTLFireability3824890279387689391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14887769127311531426.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,633973,23.4084,604244,2,42107,5,1.30484e+06,6,0,968,1.60447e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 21:19:39] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:19:39] [INFO ] Applying decomposition
[2024-05-21 21:19:39] [INFO ] Flatten gal took : 9 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/graph18442609158287457587.txt' '-o' '/tmp/graph18442609158287457587.bin' '-w' '/tmp/graph18442609158287457587.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18442609158287457587.bin' '-l' '-1' '-v' '-w' '/tmp/graph18442609158287457587.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:19:39] [INFO ] Decomposing Gal with order
[2024-05-21 21:19:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:19:39] [INFO ] Removed a total of 291 redundant transitions.
[2024-05-21 21:19:39] [INFO ] Flatten gal took : 27 ms
[2024-05-21 21:19:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 217 labels/synchronizations in 10 ms.
[2024-05-21 21:19:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13364728185644925196.gal : 4 ms
[2024-05-21 21:19:39] [INFO ] Time to serialize properties into /tmp/CTLFireability9605978329767727262.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/CTLFireability13364728185644925196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9605978329767727262.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,633973,21.7653,598704,4439,9529,238116,763004,720,2.36079e+06,329,5.08869e+06,0


Converting to forward existential form...Done !
original formula: A((!(((AG(EX(((i5.u0.s1>=1)&&(i5.u0.l3089>=1)))) * (i5.u0.s1>=1)) * (i7.u21.l4126>=1))) * (!(E(!(AF(((i5.u0.s1>=1)&&(i3.u4.l1748>=1)))) U...538
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(!(!(EG(!(((i1.i0.u5.p117>=1)&&(i5.u0.l0>=1))))))))) * E(E(TRUE U EX(((i5.u0.s1>=1...1424
Reverse transition relation is NOT exact ! Due to transitions t6, t13, t28, t31, t52, t53, t56, t83, t85, t89, t90, t92, t107, t109, t128, t132, t134, t179...1450
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 296 transition count 552
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 296 transition count 552
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 221 place count 296 transition count 529
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 294 place count 223 transition count 440
Iterating global reduction 1 with 73 rules applied. Total rules applied 367 place count 223 transition count 440
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 394 place count 223 transition count 413
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 443 place count 174 transition count 338
Iterating global reduction 2 with 49 rules applied. Total rules applied 492 place count 174 transition count 338
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 522 place count 174 transition count 308
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 540 place count 156 transition count 275
Iterating global reduction 3 with 18 rules applied. Total rules applied 558 place count 156 transition count 275
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 569 place count 156 transition count 264
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 580 place count 145 transition count 252
Iterating global reduction 4 with 11 rules applied. Total rules applied 591 place count 145 transition count 252
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 599 place count 145 transition count 244
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 606 place count 138 transition count 220
Iterating global reduction 5 with 7 rules applied. Total rules applied 613 place count 138 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 617 place count 138 transition count 216
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 620 place count 135 transition count 196
Iterating global reduction 6 with 3 rules applied. Total rules applied 623 place count 135 transition count 196
Applied a total of 623 rules in 20 ms. Remains 135 /395 variables (removed 260) and now considering 196/941 (removed 745) transitions.
// Phase 1: matrix 196 rows 135 cols
[2024-05-21 21:20:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:20:09] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 21:20:09] [INFO ] Invariant cache hit.
[2024-05-21 21:20:10] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:20:10] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-21 21:20:10] [INFO ] Invariant cache hit.
[2024-05-21 21:20:10] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/331 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 66/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-21 21:20:13] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 204 constraints, problems are : Problem set: 0 solved, 195 unsolved in 6558 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/331 variables, 135/138 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 66/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 195/399 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/331 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 399 constraints, problems are : Problem set: 0 solved, 195 unsolved in 11745 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 1/1 constraints]
After SMT, in 18588ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 18591ms
Starting structural reductions in LTL mode, iteration 1 : 135/395 places, 196/941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19062 ms. Remains : 135/395 places, 196/941 transitions.
[2024-05-21 21:20:28] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:20:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:20:28] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-21 21:20:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:20:28] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:20:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13489649676360611241.gal : 1 ms
[2024-05-21 21:20:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6197606523421279584.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/CTLFireability13489649676360611241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6197606523421279584.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,339742,6.04091,160228,2,17753,5,396536,6,0,736,512239,0


Converting to forward existential form...Done !
original formula: (AF(EG(((s1>=1)&&(l4270>=1)))) * EG(AX(AF(((s1>=1)&&(l4117>=1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(EG(((s1>=1)&&(l4270>=1)))))] = FALSE * [(Init * !(EG(!(EX(!(!(EG(!(((s1>=1)&&(l4117>=1)))))))))))]...164
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, t97, t99, t101, ...657
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,23.6756,502708,1,0,449,2.37206e+06,421,181,5359,1.35958e+06,532
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 297 transition count 551
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 297 transition count 551
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 218 place count 297 transition count 529
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 290 place count 225 transition count 441
Iterating global reduction 1 with 72 rules applied. Total rules applied 362 place count 225 transition count 441
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 386 place count 225 transition count 417
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 434 place count 177 transition count 343
Iterating global reduction 2 with 48 rules applied. Total rules applied 482 place count 177 transition count 343
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 512 place count 177 transition count 313
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 529 place count 160 transition count 282
Iterating global reduction 3 with 17 rules applied. Total rules applied 546 place count 160 transition count 282
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 550 place count 160 transition count 278
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 563 place count 147 transition count 264
Iterating global reduction 4 with 13 rules applied. Total rules applied 576 place count 147 transition count 264
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 584 place count 147 transition count 256
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 592 place count 139 transition count 238
Iterating global reduction 5 with 8 rules applied. Total rules applied 600 place count 139 transition count 238
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 607 place count 139 transition count 231
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 610 place count 136 transition count 211
Iterating global reduction 6 with 3 rules applied. Total rules applied 613 place count 136 transition count 211
Applied a total of 613 rules in 62 ms. Remains 136 /395 variables (removed 259) and now considering 211/941 (removed 730) transitions.
// Phase 1: matrix 211 rows 136 cols
[2024-05-21 21:20:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:20:52] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 21:20:52] [INFO ] Invariant cache hit.
[2024-05-21 21:20:53] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-21 21:20:53] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-21 21:20:53] [INFO ] Redundant transitions in 9 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-21 21:20:53] [INFO ] Invariant cache hit.
[2024-05-21 21:20:53] [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, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/347 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 82/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 0/347 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 220 constraints, problems are : Problem set: 0 solved, 210 unsolved in 6914 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: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/347 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 82/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 210/430 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 430 constraints, problems are : Problem set: 0 solved, 210 unsolved in 17599 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: 210/210 constraints, Known Traps: 0/0 constraints]
After SMT, in 24781ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 24783ms
Starting structural reductions in SI_CTL mode, iteration 1 : 136/395 places, 211/941 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25213 ms. Remains : 136/395 places, 211/941 transitions.
[2024-05-21 21:21:18] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:21:18] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:21:18] [INFO ] Input system was already deterministic with 211 transitions.
[2024-05-21 21:21:18] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:21:18] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:21:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4447861476392304841.gal : 2 ms
[2024-05-21 21:21:18] [INFO ] Time to serialize properties into /tmp/CTLFireability7822989767540971356.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/CTLFireability4447861476392304841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7822989767540971356.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,260414,3.87824,111892,2,14851,5,290632,6,0,755,362987,0


Converting to forward existential form...Done !
original formula: AG((((s1<1)||(l3829<1)) + (EF(((s1<1)||(l2630<1))) * EF(((s1>=1)&&(l3841>=1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(((s1<1)||(l3829<1)))) * !(E(TRUE U ((s1<1)||(l2630<1)))))] = FALSE * [((FwdU(Init,TRUE) ...228
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t70, t71, t75, t76, t77, t85, t94, t96, t97, t98, t100, t101, t115...683
(forward)formula 0,0,12.0294,299504,1,0,405,1.33548e+06,445,163,5339,618834,492
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 321 transition count 699
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 321 transition count 699
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 177 place count 321 transition count 670
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 231 place count 267 transition count 602
Iterating global reduction 1 with 54 rules applied. Total rules applied 285 place count 267 transition count 602
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 305 place count 267 transition count 582
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 340 place count 232 transition count 533
Iterating global reduction 2 with 35 rules applied. Total rules applied 375 place count 232 transition count 533
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 401 place count 232 transition count 507
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 411 place count 222 transition count 486
Iterating global reduction 3 with 10 rules applied. Total rules applied 421 place count 222 transition count 486
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 429 place count 222 transition count 478
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 436 place count 215 transition count 471
Iterating global reduction 4 with 7 rules applied. Total rules applied 443 place count 215 transition count 471
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 447 place count 215 transition count 467
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 450 place count 212 transition count 464
Iterating global reduction 5 with 3 rules applied. Total rules applied 453 place count 212 transition count 464
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 457 place count 212 transition count 460
Applied a total of 457 rules in 19 ms. Remains 212 /395 variables (removed 183) and now considering 460/941 (removed 481) transitions.
// Phase 1: matrix 460 rows 212 cols
[2024-05-21 21:21:30] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:21:30] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 21:21:30] [INFO ] Invariant cache hit.
[2024-05-21 21:21:30] [INFO ] State equation strengthened by 257 read => feed constraints.
[2024-05-21 21:21:31] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-05-21 21:21:31] [INFO ] Invariant cache hit.
[2024-05-21 21:21:31] [INFO ] State equation strengthened by 257 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/672 variables, 212/214 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 257/471 constraints. Problems are: Problem set: 0 solved, 459 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/672 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 672/672 variables, and 471 constraints, problems are : Problem set: 0 solved, 459 unsolved in 26366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/672 variables, 212/214 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 257/471 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 459/930 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/672 variables, and 930 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, ReadFeed: 257/257 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 0/0 constraints]
After SMT, in 57458ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 57463ms
Starting structural reductions in LTL mode, iteration 1 : 212/395 places, 460/941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58253 ms. Remains : 212/395 places, 460/941 transitions.
[2024-05-21 21:22:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:22:28] [INFO ] Flatten gal took : 20 ms
[2024-05-21 21:22:28] [INFO ] Input system was already deterministic with 460 transitions.
[2024-05-21 21:22:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:22:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:22:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5752497640060535680.gal : 2 ms
[2024-05-21 21:22:28] [INFO ] Time to serialize properties into /tmp/CTLFireability18101425124420042602.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/CTLFireability5752497640060535680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18101425124420042602.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.
Detected timeout of ITS tools.
[2024-05-21 21:22:58] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:22:58] [INFO ] Applying decomposition
[2024-05-21 21:22:58] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16181183481274604919.txt' '-o' '/tmp/graph16181183481274604919.bin' '-w' '/tmp/graph16181183481274604919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16181183481274604919.bin' '-l' '-1' '-v' '-w' '/tmp/graph16181183481274604919.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:22:58] [INFO ] Decomposing Gal with order
[2024-05-21 21:22:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:22:58] [INFO ] Removed a total of 402 redundant transitions.
[2024-05-21 21:22:58] [INFO ] Flatten gal took : 44 ms
[2024-05-21 21:22:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 331 labels/synchronizations in 11 ms.
[2024-05-21 21:22:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8672719096068334539.gal : 3 ms
[2024-05-21 21:22:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13980418279969572151.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/CTLFireability8672719096068334539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13980418279969572151.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.37478e+06,8.63012,227588,3957,9670,131984,242856,767,568365,536,1.73473e+06,0


Converting to forward existential form...Done !
original formula: (E(AF(AX(((i0.i0.u0.s1>=1)&&(i0.i1.u11.l2613>=1)))) U ((((i6.u19.p365>=1)&&(i0.i0.u0.l0>=1))&&(!((i0.i0.u0.s1>=1)&&(u14.l4263>=1)))) + !(...1438
=> equivalent forward existential formula: (([(FwdU(Init,!(EG(!(!(EX(!(((i0.i0.u0.s1>=1)&&(i0.i1.u11.l2613>=1))))))))) * (((i6.u19.p365>=1)&&(i0.i0.u0.l0>=...3859
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t62, t66, t87, t199, t200, t207, t209, t210, t212, t225, t234, t236, t320, t347, t357...2027
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,26.6095,644656,1,0,448828,573577,4619,2.20465e+06,3022,4.25142e+06,2094539
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 297 transition count 561
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 297 transition count 561
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 224 place count 297 transition count 533
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 297 place count 224 transition count 447
Iterating global reduction 1 with 73 rules applied. Total rules applied 370 place count 224 transition count 447
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 398 place count 224 transition count 419
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 447 place count 175 transition count 343
Iterating global reduction 2 with 49 rules applied. Total rules applied 496 place count 175 transition count 343
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 528 place count 175 transition count 311
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 545 place count 158 transition count 279
Iterating global reduction 3 with 17 rules applied. Total rules applied 562 place count 158 transition count 279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 568 place count 158 transition count 273
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 579 place count 147 transition count 261
Iterating global reduction 4 with 11 rules applied. Total rules applied 590 place count 147 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 595 place count 147 transition count 256
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 600 place count 142 transition count 251
Iterating global reduction 5 with 5 rules applied. Total rules applied 605 place count 142 transition count 251
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 611 place count 142 transition count 245
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 614 place count 139 transition count 225
Iterating global reduction 6 with 3 rules applied. Total rules applied 617 place count 139 transition count 225
Applied a total of 617 rules in 26 ms. Remains 139 /395 variables (removed 256) and now considering 225/941 (removed 716) transitions.
// Phase 1: matrix 225 rows 139 cols
[2024-05-21 21:23:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:23:25] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 21:23:25] [INFO ] Invariant cache hit.
[2024-05-21 21:23:25] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-21 21:23:26] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-21 21:23:26] [INFO ] Invariant cache hit.
[2024-05-21 21:23:26] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/364 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 94/235 constraints. Problems are: Problem set: 0 solved, 224 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 235 constraints, problems are : Problem set: 0 solved, 224 unsolved in 7087 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/364 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 94/235 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 224/459 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 459 constraints, problems are : Problem set: 0 solved, 224 unsolved in 16662 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
After SMT, in 24086ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 24089ms
Starting structural reductions in LTL mode, iteration 1 : 139/395 places, 225/941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24520 ms. Remains : 139/395 places, 225/941 transitions.
[2024-05-21 21:23:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:23:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:23:50] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-21 21:23:50] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:23:50] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:23:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17314191859257460225.gal : 1 ms
[2024-05-21 21:23:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4404244968637785137.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/CTLFireability17314191859257460225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4404244968637785137.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,310152,6.38593,174480,2,19588,5,436427,6,0,781,537194,0


Converting to forward existential form...Done !
original formula: E(EF(AX(!(A(((p297>=1)&&(l3104>=1)) U ((s1>=1)&&(l3080>=1)))))) U EX(((s1>=1)&&(l4263>=1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,E(TRUE U !(EX(!(!(!((E(!(((s1>=1)&&(l3080>=1))) U (!(((p297>=1)&&(l3104>=1))) * !(((s1>=1)&&(l308...239
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t52, t53, t54, t74, t75, t79, t80, t81, t89, t90, t94, t95, t96, t97, t...823
(forward)formula 0,1,29.6209,722832,1,0,487,3.16241e+06,484,195,5713,2.00354e+06,595
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 296 transition count 538
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 296 transition count 538
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 220 place count 296 transition count 516
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 293 place count 223 transition count 427
Iterating global reduction 1 with 73 rules applied. Total rules applied 366 place count 223 transition count 427
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 392 place count 223 transition count 401
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 442 place count 173 transition count 324
Iterating global reduction 2 with 50 rules applied. Total rules applied 492 place count 173 transition count 324
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 522 place count 173 transition count 294
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 541 place count 154 transition count 259
Iterating global reduction 3 with 19 rules applied. Total rules applied 560 place count 154 transition count 259
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 566 place count 154 transition count 253
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 579 place count 141 transition count 239
Iterating global reduction 4 with 13 rules applied. Total rules applied 592 place count 141 transition count 239
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 600 place count 141 transition count 231
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 607 place count 134 transition count 220
Iterating global reduction 5 with 7 rules applied. Total rules applied 614 place count 134 transition count 220
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 621 place count 134 transition count 213
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 624 place count 131 transition count 193
Iterating global reduction 6 with 3 rules applied. Total rules applied 627 place count 131 transition count 193
Applied a total of 627 rules in 46 ms. Remains 131 /395 variables (removed 264) and now considering 193/941 (removed 748) transitions.
// Phase 1: matrix 193 rows 131 cols
[2024-05-21 21:24:20] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:24:20] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 21:24:20] [INFO ] Invariant cache hit.
[2024-05-21 21:24:20] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 21:24:20] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-21 21:24:20] [INFO ] Redundant transitions in 8 ms returned []
Running 192 sub problems to find dead transitions.
[2024-05-21 21:24:20] [INFO ] Invariant cache hit.
[2024-05-21 21:24:20] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/324 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 70/203 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 203 constraints, problems are : Problem set: 0 solved, 192 unsolved in 5213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 70/70 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/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/324 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 70/203 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 192/395 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 395 constraints, problems are : Problem set: 0 solved, 192 unsolved in 14472 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 19925ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 19928ms
Starting structural reductions in SI_CTL mode, iteration 1 : 131/395 places, 193/941 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20307 ms. Remains : 131/395 places, 193/941 transitions.
[2024-05-21 21:24:40] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:24:40] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:24:40] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-21 21:24:40] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:24:40] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:24:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17092986993608056896.gal : 24 ms
[2024-05-21 21:24:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11707312513477199067.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/CTLFireability17092986993608056896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11707312513477199067.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,204534,3.61791,112268,2,12930,5,281558,6,0,717,359056,0


Converting to forward existential form...Done !
original formula: A(!(EG(((p173>=1)&&(l0>=1)))) U EG((((s1>=1)&&(l2616>=1))&&(!((s1>=1)&&(l3656>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((s1>=1)&&(l2616>=1))&&(!((s1>=1)&&(l3656>=1))))))))) * !(E(!(EG((((s1>=1)&&(l2616>=1))&&(!...287
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t71, t72, t76, t77, t78, t86, t95, t96, t101, t102, t103, t105, t1...607
(forward)formula 0,0,12.8987,320576,1,0,409,1.58906e+06,419,173,5082,750462,516
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 101 places :
Symmetric choice reduction at 0 with 101 rule applications. Total rules 101 place count 294 transition count 536
Iterating global reduction 0 with 101 rules applied. Total rules applied 202 place count 294 transition count 536
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 224 place count 294 transition count 514
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 299 place count 219 transition count 423
Iterating global reduction 1 with 75 rules applied. Total rules applied 374 place count 219 transition count 423
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 401 place count 219 transition count 396
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 451 place count 169 transition count 320
Iterating global reduction 2 with 50 rules applied. Total rules applied 501 place count 169 transition count 320
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 532 place count 169 transition count 289
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 550 place count 151 transition count 256
Iterating global reduction 3 with 18 rules applied. Total rules applied 568 place count 151 transition count 256
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 573 place count 151 transition count 251
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 586 place count 138 transition count 237
Iterating global reduction 4 with 13 rules applied. Total rules applied 599 place count 138 transition count 237
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 607 place count 138 transition count 229
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 615 place count 130 transition count 210
Iterating global reduction 5 with 8 rules applied. Total rules applied 623 place count 130 transition count 210
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 630 place count 130 transition count 203
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 633 place count 127 transition count 183
Iterating global reduction 6 with 3 rules applied. Total rules applied 636 place count 127 transition count 183
Applied a total of 636 rules in 32 ms. Remains 127 /395 variables (removed 268) and now considering 183/941 (removed 758) transitions.
// Phase 1: matrix 183 rows 127 cols
[2024-05-21 21:24:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:24:53] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 21:24:53] [INFO ] Invariant cache hit.
[2024-05-21 21:24:53] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 21:24:53] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-21 21:24:54] [INFO ] Invariant cache hit.
[2024-05-21 21:24:54] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/310 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 62/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 191 constraints, problems are : Problem set: 0 solved, 182 unsolved in 4669 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/310 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 62/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 182/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 373 constraints, problems are : Problem set: 0 solved, 182 unsolved in 10702 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 15627ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 15629ms
Starting structural reductions in LTL mode, iteration 1 : 127/395 places, 183/941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16040 ms. Remains : 127/395 places, 183/941 transitions.
[2024-05-21 21:25:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:25:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:25:09] [INFO ] Input system was already deterministic with 183 transitions.
[2024-05-21 21:25:09] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:25:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:25:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13878038956813813143.gal : 16 ms
[2024-05-21 21:25:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14601503696347082226.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/CTLFireability13878038956813813143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14601503696347082226.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,197276,2.99322,87168,2,10966,5,239043,6,0,691,280509,0


Converting to forward existential form...Done !
original formula: EF((((s1>=1)&&(l3833>=1)) * AX(((s1>=1)&&(l3079>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((s1>=1)&&(l3833>=1))) * !(EX(!(((s1>=1)&&(l3079>=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...583
(forward)formula 0,0,5.62046,137896,1,0,307,466227,384,127,4863,280509,374
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 296 transition count 552
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 296 transition count 552
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 221 place count 296 transition count 529
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 294 place count 223 transition count 440
Iterating global reduction 1 with 73 rules applied. Total rules applied 367 place count 223 transition count 440
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 393 place count 223 transition count 414
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 442 place count 174 transition count 339
Iterating global reduction 2 with 49 rules applied. Total rules applied 491 place count 174 transition count 339
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 521 place count 174 transition count 309
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 538 place count 157 transition count 277
Iterating global reduction 3 with 17 rules applied. Total rules applied 555 place count 157 transition count 277
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 564 place count 157 transition count 268
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 576 place count 145 transition count 255
Iterating global reduction 4 with 12 rules applied. Total rules applied 588 place count 145 transition count 255
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 596 place count 145 transition count 247
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 605 place count 136 transition count 221
Iterating global reduction 5 with 9 rules applied. Total rules applied 614 place count 136 transition count 221
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 620 place count 136 transition count 215
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 623 place count 133 transition count 195
Iterating global reduction 6 with 3 rules applied. Total rules applied 626 place count 133 transition count 195
Applied a total of 626 rules in 31 ms. Remains 133 /395 variables (removed 262) and now considering 195/941 (removed 746) transitions.
// Phase 1: matrix 195 rows 133 cols
[2024-05-21 21:25:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:25:15] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 21:25:15] [INFO ] Invariant cache hit.
[2024-05-21 21:25:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 21:25:15] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-21 21:25:15] [INFO ] Redundant transitions in 2 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-21 21:25:15] [INFO ] Invariant cache hit.
[2024-05-21 21:25:15] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/328 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 203 constraints, problems are : Problem set: 0 solved, 194 unsolved in 5200 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 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/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/328 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 194/397 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 397 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 17664ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 17665ms
Starting structural reductions in SI_CTL mode, iteration 1 : 133/395 places, 195/941 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18138 ms. Remains : 133/395 places, 195/941 transitions.
[2024-05-21 21:25:33] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:25:33] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:25:33] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-21 21:25:33] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:25:33] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:25:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12250377007909755505.gal : 1 ms
[2024-05-21 21:25:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8743606438455926172.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/CTLFireability12250377007909755505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8743606438455926172.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,263724,4.30664,134340,2,16011,5,328138,6,0,727,431514,0


Converting to forward existential form...Done !
original formula: AG(AF(((EG(((s1<1)||(l4114<1))) + (s1<1)) + (l3829<1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((EG(((s1<1)||(l4114<1))) + (s1<1)) + (l3829<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, t95, t97, t99, t...638
(forward)formula 0,1,16.8236,434796,1,0,441,2.07223e+06,418,179,5182,1.13404e+06,528
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 296 transition count 544
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 296 transition count 544
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 220 place count 296 transition count 522
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 293 place count 223 transition count 434
Iterating global reduction 1 with 73 rules applied. Total rules applied 366 place count 223 transition count 434
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 391 place count 223 transition count 409
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 439 place count 175 transition count 339
Iterating global reduction 2 with 48 rules applied. Total rules applied 487 place count 175 transition count 339
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 518 place count 175 transition count 308
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 534 place count 159 transition count 277
Iterating global reduction 3 with 16 rules applied. Total rules applied 550 place count 159 transition count 277
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 555 place count 159 transition count 272
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 566 place count 148 transition count 260
Iterating global reduction 4 with 11 rules applied. Total rules applied 577 place count 148 transition count 260
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 583 place count 148 transition count 254
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 591 place count 140 transition count 236
Iterating global reduction 5 with 8 rules applied. Total rules applied 599 place count 140 transition count 236
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 605 place count 140 transition count 230
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 608 place count 137 transition count 210
Iterating global reduction 6 with 3 rules applied. Total rules applied 611 place count 137 transition count 210
Applied a total of 611 rules in 36 ms. Remains 137 /395 variables (removed 258) and now considering 210/941 (removed 731) transitions.
// Phase 1: matrix 210 rows 137 cols
[2024-05-21 21:25:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:25:50] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:25:50] [INFO ] Invariant cache hit.
[2024-05-21 21:25:50] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:25:50] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-21 21:25:50] [INFO ] Redundant transitions in 1 ms returned []
Running 209 sub problems to find dead transitions.
[2024-05-21 21:25:50] [INFO ] Invariant cache hit.
[2024-05-21 21:25:50] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/347 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 73/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/347 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 212 constraints, problems are : Problem set: 0 solved, 209 unsolved in 6382 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/347 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 73/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 209/421 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 421 constraints, problems are : Problem set: 0 solved, 209 unsolved in 16319 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
After SMT, in 22990ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 22992ms
Starting structural reductions in SI_CTL mode, iteration 1 : 137/395 places, 210/941 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23361 ms. Remains : 137/395 places, 210/941 transitions.
[2024-05-21 21:26:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:26:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:26:13] [INFO ] Input system was already deterministic with 210 transitions.
[2024-05-21 21:26:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:26:13] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:26:13] [INFO ] Time to serialize gal into /tmp/CTLFireability11748507333617783052.gal : 2 ms
[2024-05-21 21:26:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5550693072134535116.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/CTLFireability11748507333617783052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5550693072134535116.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,328067,6.95622,201580,2,21864,5,534987,6,0,758,662953,0


Converting to forward existential form...Done !
original formula: AG(AF((A(!((((p157>=1)&&(l0>=1))||((s1>=1)&&(l3846>=1)))) U !(((s1>=1)&&(l3648>=1)))) + ((s1>=1)&&(l4313>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((!((E(!(!(((s1>=1)&&(l3648>=1)))) U (!(!((((p157>=1)&&(l0>=1))||((s1>=1)&&(l3846>=1)))))...259
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t28, t70, t71, t75, t76, t77, t85, t86, t87, t88, t89, t91, t92, t93, t...737
(forward)formula 0,1,14.1518,295632,1,0,418,1.14368e+06,450,160,5447,662953,483
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 297 transition count 563
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 297 transition count 563
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 220 place count 297 transition count 539
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 294 place count 223 transition count 449
Iterating global reduction 1 with 74 rules applied. Total rules applied 368 place count 223 transition count 449
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 398 place count 223 transition count 419
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 448 place count 173 transition count 342
Iterating global reduction 2 with 50 rules applied. Total rules applied 498 place count 173 transition count 342
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 531 place count 173 transition count 309
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 549 place count 155 transition count 279
Iterating global reduction 3 with 18 rules applied. Total rules applied 567 place count 155 transition count 279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 573 place count 155 transition count 273
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 585 place count 143 transition count 260
Iterating global reduction 4 with 12 rules applied. Total rules applied 597 place count 143 transition count 260
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 605 place count 143 transition count 252
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 613 place count 135 transition count 227
Iterating global reduction 5 with 8 rules applied. Total rules applied 621 place count 135 transition count 227
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 629 place count 135 transition count 219
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 631 place count 133 transition count 207
Iterating global reduction 6 with 2 rules applied. Total rules applied 633 place count 133 transition count 207
Applied a total of 633 rules in 19 ms. Remains 133 /395 variables (removed 262) and now considering 207/941 (removed 734) transitions.
// Phase 1: matrix 207 rows 133 cols
[2024-05-21 21:26:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:26:28] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 21:26:28] [INFO ] Invariant cache hit.
[2024-05-21 21:26:28] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:26:28] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-21 21:26:28] [INFO ] Invariant cache hit.
[2024-05-21 21:26:28] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/340 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 79/214 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/340 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 214 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5819 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/340 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 79/214 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 206/420 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 420 constraints, problems are : Problem set: 0 solved, 206 unsolved in 15019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 21111ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 21113ms
Starting structural reductions in LTL mode, iteration 1 : 133/395 places, 207/941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21763 ms. Remains : 133/395 places, 207/941 transitions.
[2024-05-21 21:26:50] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:26:50] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:26:50] [INFO ] Input system was already deterministic with 207 transitions.
[2024-05-21 21:26:50] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:26:50] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:26:50] [INFO ] Time to serialize gal into /tmp/CTLFireability11265462580027121623.gal : 1 ms
[2024-05-21 21:26:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15592307275142058647.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/CTLFireability11265462580027121623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15592307275142058647.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,276784,4.71833,145124,2,17753,5,372650,6,0,739,447440,0


Converting to forward existential form...Done !
original formula: AF(((EX((((s1>=1)&&(l1659>=1)) + AX(EF(((s1>=1)&&(l4144>=1)))))) * (s1>=1)) * (l3086>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((EX((((s1>=1)&&(l1659>=1)) + !(EX(!(E(TRUE U ((s1>=1)&&(l4144>=1)))))))) * (s1>=1)) * (l3086>=1)))...165
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t25, t26, t70, t71, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t...771
(forward)formula 0,0,24.7651,622496,1,0,634,2.52988e+06,444,331,5391,1.90176e+06,678
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 94 place count 301 transition count 596
Iterating global reduction 0 with 94 rules applied. Total rules applied 188 place count 301 transition count 596
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 216 place count 301 transition count 568
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 286 place count 231 transition count 485
Iterating global reduction 1 with 70 rules applied. Total rules applied 356 place count 231 transition count 485
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 387 place count 231 transition count 454
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 434 place count 184 transition count 382
Iterating global reduction 2 with 47 rules applied. Total rules applied 481 place count 184 transition count 382
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 515 place count 184 transition count 348
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 530 place count 169 transition count 319
Iterating global reduction 3 with 15 rules applied. Total rules applied 545 place count 169 transition count 319
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 558 place count 169 transition count 306
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 567 place count 160 transition count 296
Iterating global reduction 4 with 9 rules applied. Total rules applied 576 place count 160 transition count 296
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 581 place count 160 transition count 291
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 585 place count 156 transition count 287
Iterating global reduction 5 with 4 rules applied. Total rules applied 589 place count 156 transition count 287
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 595 place count 156 transition count 281
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 597 place count 154 transition count 268
Iterating global reduction 6 with 2 rules applied. Total rules applied 599 place count 154 transition count 268
Applied a total of 599 rules in 19 ms. Remains 154 /395 variables (removed 241) and now considering 268/941 (removed 673) transitions.
// Phase 1: matrix 268 rows 154 cols
[2024-05-21 21:27:15] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:27:15] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 21:27:15] [INFO ] Invariant cache hit.
[2024-05-21 21:27:15] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-21 21:27:15] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-05-21 21:27:15] [INFO ] Invariant cache hit.
[2024-05-21 21:27:15] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/422 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 124/280 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/422 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 280 constraints, problems are : Problem set: 0 solved, 267 unsolved in 9322 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/422 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 124/280 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 267/547 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 547 constraints, problems are : Problem set: 0 solved, 267 unsolved in 21194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints]
After SMT, in 30917ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 30920ms
Starting structural reductions in LTL mode, iteration 1 : 154/395 places, 268/941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31448 ms. Remains : 154/395 places, 268/941 transitions.
[2024-05-21 21:27:46] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:27:46] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:27:46] [INFO ] Input system was already deterministic with 268 transitions.
[2024-05-21 21:27:46] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:27:46] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:27:46] [INFO ] Time to serialize gal into /tmp/CTLFireability17417592197504601381.gal : 1 ms
[2024-05-21 21:27:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1993186016663091325.ctl : 3 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/CTLFireability17417592197504601381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1993186016663091325.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,407802,7.39795,218728,2,25899,5,537801,6,0,884,571720,0


Converting to forward existential form...Done !
original formula: E(((EX(E((((s1>=1)&&(l3076>=1))||((s1>=1)&&(l3079>=1))) U !(((s1>=1)&&(l3>=1))))) + AG(((((p314>=1)&&(l3101>=1)) + AG(((p356>=1)&&(l2273>...396
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((EX(E((((s1>=1)&&(l3076>=1))||((s1>=1)&&(l3079>=1))) U !(((s1>=1)&&(l3>=1))))) + !(E(TRUE U !(...556
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t54, t55, t56, t75, t76, t80, t81, t82, t83, t84, t85, t86, t87, t88, t...1005
(forward)formula 0,0,18.9275,472040,1,0,505,1.51686e+06,569,195,6340,738076,631
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 93 place count 302 transition count 575
Iterating global reduction 0 with 93 rules applied. Total rules applied 186 place count 302 transition count 575
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 209 place count 302 transition count 552
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 278 place count 233 transition count 471
Iterating global reduction 1 with 69 rules applied. Total rules applied 347 place count 233 transition count 471
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 375 place count 233 transition count 443
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 420 place count 188 transition count 377
Iterating global reduction 2 with 45 rules applied. Total rules applied 465 place count 188 transition count 377
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 494 place count 188 transition count 348
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 510 place count 172 transition count 316
Iterating global reduction 3 with 16 rules applied. Total rules applied 526 place count 172 transition count 316
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 541 place count 172 transition count 301
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 551 place count 162 transition count 290
Iterating global reduction 4 with 10 rules applied. Total rules applied 561 place count 162 transition count 290
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 568 place count 162 transition count 283
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 574 place count 156 transition count 273
Iterating global reduction 5 with 6 rules applied. Total rules applied 580 place count 156 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 585 place count 156 transition count 268
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 586 place count 155 transition count 263
Iterating global reduction 6 with 1 rules applied. Total rules applied 587 place count 155 transition count 263
Applied a total of 587 rules in 17 ms. Remains 155 /395 variables (removed 240) and now considering 263/941 (removed 678) transitions.
// Phase 1: matrix 263 rows 155 cols
[2024-05-21 21:28:05] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:28:05] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 21:28:05] [INFO ] Invariant cache hit.
[2024-05-21 21:28:05] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-21 21:28:06] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-21 21:28:06] [INFO ] Invariant cache hit.
[2024-05-21 21:28:06] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/418 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 110/267 constraints. Problems are: Problem set: 0 solved, 262 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/418 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 267 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/418 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 110/267 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 262/529 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 529 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20815 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 30078ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 30083ms
Starting structural reductions in LTL mode, iteration 1 : 155/395 places, 263/941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30564 ms. Remains : 155/395 places, 263/941 transitions.
[2024-05-21 21:28:36] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:28:36] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:28:36] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-21 21:28:36] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:28:36] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:28:36] [INFO ] Time to serialize gal into /tmp/CTLFireability17578592981994473116.gal : 1 ms
[2024-05-21 21:28:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17305289670964116167.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/CTLFireability17578592981994473116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17305289670964116167.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,462249,16.3153,438912,2,29733,5,1.07814e+06,6,0,883,1.28195e+06,0


Converting to forward existential form...Done !
original formula: AG((!(E((((s1>=1)&&(l4313>=1))||((s1>=1)&&(l2673>=1))) U ((AX(((s1>=1)&&(l4109>=1))) + (((s1>=1)&&(l4308>=1))&&((p350>=1)&&(l0>=1)))) + (...380
=> equivalent forward existential formula: ([(EY(FwdU((FwdU(Init,TRUE) * !(!(E((((s1>=1)&&(l4313>=1))||((s1>=1)&&(l2673>=1))) U ((!(EX(!(((s1>=1)&&(l4109>=...800
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t28, t29, t30, t44, t74, t76, t77, t78, t79, t80, t81, t82, t83, t84, t...1041
Detected timeout of ITS tools.
[2024-05-21 21:29:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:29:06] [INFO ] Applying decomposition
[2024-05-21 21:29:06] [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/graph13986331648535934173.txt' '-o' '/tmp/graph13986331648535934173.bin' '-w' '/tmp/graph13986331648535934173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13986331648535934173.bin' '-l' '-1' '-v' '-w' '/tmp/graph13986331648535934173.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:29:06] [INFO ] Decomposing Gal with order
[2024-05-21 21:29:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:29:06] [INFO ] Removed a total of 287 redundant transitions.
[2024-05-21 21:29:06] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:29:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 25 ms.
[2024-05-21 21:29:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6390742429928112869.gal : 3 ms
[2024-05-21 21:29:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16421027236662072476.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6390742429928112869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16421027236662072476.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,462249,4.05167,129984,2071,3176,73599,62250,538,679981,250,838756,0


Converting to forward existential form...Done !
original formula: AG((!(E((((i0.u0.s1>=1)&&(i0.u0.l4313>=1))||((i0.u0.s1>=1)&&(i0.u8.l2673>=1))) U ((AX(((i0.u0.s1>=1)&&(i8.u21.l4109>=1))) + (((i0.u0.s1>=...535
=> equivalent forward existential formula: ([(EY(FwdU((FwdU(Init,TRUE) * !(!(E((((i0.u0.s1>=1)&&(i0.u0.l4313>=1))||((i0.u0.s1>=1)&&(i0.u8.l2673>=1))) U ((!...1087
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t13, t19, t20, t84, t85, t93, t98, t115, t117, t128, t129, t130, t133, t147, t148, t1...813
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,12.4635,400972,1,0,158700,146988,2466,2.83516e+06,1368,2.60466e+06,484820
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 298 transition count 568
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 298 transition count 568
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 221 place count 298 transition count 541
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 294 place count 225 transition count 452
Iterating global reduction 1 with 73 rules applied. Total rules applied 367 place count 225 transition count 452
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 395 place count 225 transition count 424
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 444 place count 176 transition count 348
Iterating global reduction 2 with 49 rules applied. Total rules applied 493 place count 176 transition count 348
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 525 place count 176 transition count 316
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 542 place count 159 transition count 288
Iterating global reduction 3 with 17 rules applied. Total rules applied 559 place count 159 transition count 288
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 565 place count 159 transition count 282
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 576 place count 148 transition count 270
Iterating global reduction 4 with 11 rules applied. Total rules applied 587 place count 148 transition count 270
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 596 place count 148 transition count 261
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 602 place count 142 transition count 244
Iterating global reduction 5 with 6 rules applied. Total rules applied 608 place count 142 transition count 244
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 613 place count 142 transition count 239
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 616 place count 139 transition count 219
Iterating global reduction 6 with 3 rules applied. Total rules applied 619 place count 139 transition count 219
Applied a total of 619 rules in 29 ms. Remains 139 /395 variables (removed 256) and now considering 219/941 (removed 722) transitions.
// Phase 1: matrix 219 rows 139 cols
[2024-05-21 21:29:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:29:19] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 21:29:19] [INFO ] Invariant cache hit.
[2024-05-21 21:29:19] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-21 21:29:19] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 21:29:19] [INFO ] Invariant cache hit.
[2024-05-21 21:29:19] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/358 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 86/227 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/358 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 227 constraints, problems are : Problem set: 0 solved, 218 unsolved in 6793 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/358 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 86/227 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 218/445 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/358 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 445 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13983 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 21044ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 21046ms
Starting structural reductions in LTL mode, iteration 1 : 139/395 places, 219/941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21506 ms. Remains : 139/395 places, 219/941 transitions.
[2024-05-21 21:29:40] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:29:40] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:29:40] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-21 21:29:40] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:29:40] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:29:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6287421599100068957.gal : 1 ms
[2024-05-21 21:29:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11266994106412361354.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/CTLFireability6287421599100068957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11266994106412361354.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,411806,6.90825,196784,2,20564,5,487934,6,0,775,686342,0


Converting to forward existential form...Done !
original formula: EX(A(!(((s1>=1)&&(l4281>=1))) U !((AF(((s1>=1)&&(l1678>=1))) + ((E(((s1>=1)&&(l1>=1)) U ((s1>=1)&&(l4129>=1))) * (s1>=1)) * (l3080>=1))))...157
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!((!(EG(!(((s1>=1)&&(l1678>=1))))) + ((E(((s1>=1)&&(l1>=1)) U ((s1>=1)&&(l4129>=1))) * (s1>...462
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t69, t70, t74, t75, t76, t84, t85, t87, t88, t89, t90, t91, t92, t...818
Using saturation style SCC detection
(forward)formula 0,1,22.737,587740,1,0,545,2.82388e+06,475,231,5567,1.53246e+06,637
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 941/941 transitions.
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 100 place count 295 transition count 545
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 295 transition count 545
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 223 place count 295 transition count 522
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 296 place count 222 transition count 433
Iterating global reduction 1 with 73 rules applied. Total rules applied 369 place count 222 transition count 433
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 396 place count 222 transition count 406
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 444 place count 174 transition count 334
Iterating global reduction 2 with 48 rules applied. Total rules applied 492 place count 174 transition count 334
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 520 place count 174 transition count 306
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 538 place count 156 transition count 272
Iterating global reduction 3 with 18 rules applied. Total rules applied 556 place count 156 transition count 272
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 567 place count 156 transition count 261
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 577 place count 146 transition count 250
Iterating global reduction 4 with 10 rules applied. Total rules applied 587 place count 146 transition count 250
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 595 place count 146 transition count 242
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 602 place count 139 transition count 218
Iterating global reduction 5 with 7 rules applied. Total rules applied 609 place count 139 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 612 place count 139 transition count 215
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 615 place count 136 transition count 195
Iterating global reduction 6 with 3 rules applied. Total rules applied 618 place count 136 transition count 195
Applied a total of 618 rules in 18 ms. Remains 136 /395 variables (removed 259) and now considering 195/941 (removed 746) transitions.
// Phase 1: matrix 195 rows 136 cols
[2024-05-21 21:30:03] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:30:03] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 21:30:03] [INFO ] Invariant cache hit.
[2024-05-21 21:30:03] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:30:03] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-21 21:30:03] [INFO ] Invariant cache hit.
[2024-05-21 21:30:03] [INFO ] State equation strengthened by 61 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, 61/199 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 199 constraints, problems are : Problem set: 0 solved, 194 unsolved in 5212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 61/61 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, 61/199 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 194/393 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 393 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 18217ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 18219ms
Starting structural reductions in LTL mode, iteration 1 : 136/395 places, 195/941 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18630 ms. Remains : 136/395 places, 195/941 transitions.
[2024-05-21 21:30:22] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:30:22] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:30:22] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-21 21:30:22] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:30:22] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:30:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9936125201699081047.gal : 19 ms
[2024-05-21 21:30:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5320706944726677908.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/CTLFireability9936125201699081047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5320706944726677908.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,332510,5.01536,155908,2,16085,5,382627,6,0,739,581879,0


Converting to forward existential form...Done !
original formula: EF((EX(EG((((s1<1)||(l4112<1))&&((s1<1)||(l3675<1))))) * EF(EX(((p342>=1)&&(l2273>=1))))))
=> equivalent forward existential formula: [(EY(FwdU((FwdU(Init,TRUE) * EX(EG((((s1<1)||(l4112<1))&&((s1<1)||(l3675<1)))))),TRUE)) * ((p342>=1)&&(l2273>=1)...167
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, t95, t96, t98, t...650
(forward)formula 0,1,18.0314,453620,1,0,452,2.04092e+06,414,182,5455,1.17953e+06,526
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-21 21:30:40] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:30:40] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:30:40] [INFO ] Applying decomposition
[2024-05-21 21:30:40] [INFO ] Flatten gal took : 20 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/graph2549225190635380261.txt' '-o' '/tmp/graph2549225190635380261.bin' '-w' '/tmp/graph2549225190635380261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2549225190635380261.bin' '-l' '-1' '-v' '-w' '/tmp/graph2549225190635380261.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:30:40] [INFO ] Decomposing Gal with order
[2024-05-21 21:30:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:30:40] [INFO ] Removed a total of 826 redundant transitions.
[2024-05-21 21:30:40] [INFO ] Flatten gal took : 82 ms
[2024-05-21 21:30:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 835 labels/synchronizations in 58 ms.
[2024-05-21 21:30:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1805415852949111110.gal : 9 ms
[2024-05-21 21:30:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12574763172237960299.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/CTLFireability1805415852949111110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12574763172237960299.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,8.43544e+06,196.478,2944832,8778,23417,429758,1.57268e+06,1321,8.53729e+06,1014,4.16994e+07,0


Converting to forward existential form...Done !
original formula: A((!(((AG(EX(((i1.u2.s1>=1)&&(i0.u0.l3089>=1)))) * (i1.u2.s1>=1)) * (u32.l4126>=1))) * (!(E(!(AF(((i1.u2.s1>=1)&&(i3.u19.l1748>=1)))) U (...531
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(!(!(EG(!(((i3.u14.p117>=1)&&(i1.u2.l0>=1))))))))) * E(E(TRUE U EX(((i1.u2.s1>=1)&...1409
Reverse transition relation is NOT exact ! Due to transitions t6, t33, t36, t45, t46, t50, t51, t57, t67, t70, t71, t72, t90, t103, t104, t107, t109, t110,...3707
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-21 21:37:38] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:37:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2452665713860285766.gal : 4 ms
[2024-05-21 21:37:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7386865709495148340.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/CTLFireability2452665713860285766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7386865709495148340.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,8.43544e+06,541.625,10558692,2,188556,5,1.29823e+07,6,0,2521,9.35496e+06,0


Converting to forward existential form...Done !
original formula: A((!(((AG(EX(((s1>=1)&&(l3089>=1)))) * (s1>=1)) * (l4126>=1))) * (!(E(!(AF(((s1>=1)&&(l1748>=1)))) U (E(((s1>=1)&&(l2167>=1)) U ((s1>=1)&...387
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(!(!(EG(!(((p117>=1)&&(l0>=1))))))))) * E(E(TRUE U EX(((s1>=1)&&(l4281>=1)))) U !(...1097
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t33, t36, t37, t38, t41, t42, t43, t45, t46,...4320
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 137
[2024-05-21 21:58:39] [INFO ] Flatten gal took : 27 ms
[2024-05-21 21:58:39] [INFO ] Input system was already deterministic with 941 transitions.
[2024-05-21 21:58:39] [INFO ] Transformed 395 places.
[2024-05-21 21:58:39] [INFO ] Transformed 941 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 21:58:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8693151353711279575.gal : 3 ms
[2024-05-21 21:58:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5762789911716379116.ctl : 8 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/CTLFireability8693151353711279575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5762789911716379116.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 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,8.43544e+06,271.825,3129620,2,205868,5,5.78334e+06,6,0,2521,1.02676e+06,0


Converting to forward existential form...Done !
original formula: A((!(((AG(EX(((s1>=1)&&(l3089>=1)))) * (s1>=1)) * (l4126>=1))) * (!(E(!(AF(((s1>=1)&&(l1748>=1)))) U (E(((s1>=1)&&(l2167>=1)) U ((s1>=1)&...387
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(!(!(EG(!(((p117>=1)&&(l0>=1))))))))) * E(E(TRUE U EX(((s1>=1)&&(l4281>=1)))) U !(...1097
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t33, t36, t37, t38, t41, t42, t43, t45, t46,...4320

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

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