fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r092-tall-171624189500522
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DBSingleClientW-PT-d1m08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16203.651 3600000.00 3699762.00 11950.10 ???T?????F????T? normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 432K 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-d1m08-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716321921188

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-d1m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 20:05:22] [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 20:05:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:05:22] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-21 20:05:22] [INFO ] Transformed 1440 places.
[2024-05-21 20:05:22] [INFO ] Transformed 672 transitions.
[2024-05-21 20:05:22] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 98 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 157 place count 270 transition count 496
Iterating global reduction 1 with 56 rules applied. Total rules applied 213 place count 270 transition count 496
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 229 place count 270 transition count 480
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 264 place count 235 transition count 445
Iterating global reduction 2 with 35 rules applied. Total rules applied 299 place count 235 transition count 445
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 310 place count 224 transition count 433
Iterating global reduction 2 with 11 rules applied. Total rules applied 321 place count 224 transition count 433
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 332 place count 224 transition count 422
Applied a total of 332 rules in 75 ms. Remains 224 /347 variables (removed 123) and now considering 422/672 (removed 250) transitions.
// Phase 1: matrix 422 rows 224 cols
[2024-05-21 20:05:22] [INFO ] Computed 2 invariants in 17 ms
[2024-05-21 20:05:22] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-21 20:05:22] [INFO ] Invariant cache hit.
[2024-05-21 20:05:23] [INFO ] State equation strengthened by 223 read => feed constraints.
[2024-05-21 20:05:23] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-21 20:05:23] [INFO ] Invariant cache hit.
[2024-05-21 20:05:23] [INFO ] State equation strengthened by 223 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 422/646 variables, 224/226 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 223/449 constraints. Problems are: Problem set: 0 solved, 421 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (OVERLAPS) 0/646 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 421 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 449 constraints, problems are : Problem set: 0 solved, 421 unsolved in 22241 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 223/223 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 422/646 variables, 224/226 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 223/449 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 421/870 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 870 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 223/223 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints]
After SMT, in 53441ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 53458ms
Starting structural reductions in LTL mode, iteration 1 : 224/347 places, 422/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54348 ms. Remains : 224/347 places, 422/672 transitions.
Support contains 98 out of 224 places after structural reductions.
[2024-05-21 20:06:17] [INFO ] Flatten gal took : 50 ms
[2024-05-21 20:06:17] [INFO ] Flatten gal took : 27 ms
[2024-05-21 20:06:17] [INFO ] Input system was already deterministic with 422 transitions.
Support contains 95 out of 224 places (down from 98) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 74 to 69
RANDOM walk for 40000 steps (9148 resets) in 3166 ms. (12 steps per ms) remains 58/69 properties
BEST_FIRST walk for 4003 steps (184 resets) in 51 ms. (76 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (385 resets) in 70 ms. (56 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (201 resets) in 44 ms. (88 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (160 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (183 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (412 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (192 resets) in 24 ms. (160 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (199 resets) in 20 ms. (190 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4002 steps (195 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (202 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (197 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (186 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (167 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (179 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (176 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (406 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (193 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (172 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (194 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (198 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (174 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (208 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (173 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (210 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (189 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (399 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (109 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (172 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (179 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (193 resets) in 97 ms. (40 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (190 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (176 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (376 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (175 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (394 resets) in 25 ms. (153 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (200 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (178 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (368 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (405 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (386 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (184 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (208 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (180 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (197 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (383 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (169 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (191 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (181 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (412 resets) in 25 ms. (153 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (185 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (409 resets) in 32 ms. (121 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (197 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (400 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (194 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (192 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (193 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
[2024-05-21 20:06:18] [INFO ] Invariant cache hit.
[2024-05-21 20:06:18] [INFO ] State equation strengthened by 223 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 1 (OVERLAPS) 65/144 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 39/183 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 53 unsolved
[2024-05-21 20:06:19] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 11 ms to minimize.
[2024-05-21 20:06:19] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:06:19] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 1 ms to minimize.
[2024-05-21 20:06:19] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 1 ms to minimize.
[2024-05-21 20:06:19] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 2 ms to minimize.
[2024-05-21 20:06:19] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 6/8 constraints. Problems are: Problem set: 3 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 397/580 variables, 183/191 constraints. Problems are: Problem set: 3 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 198/389 constraints. Problems are: Problem set: 3 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 0/389 constraints. Problems are: Problem set: 3 solved, 53 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 9 (OVERLAPS) 66/646 variables, 41/430 constraints. Problems are: Problem set: 5 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 25/455 constraints. Problems are: Problem set: 5 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/455 constraints. Problems are: Problem set: 5 solved, 51 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/455 constraints. Problems are: Problem set: 5 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 455 constraints, problems are : Problem set: 5 solved, 51 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 223/223 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 5 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 68/140 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 51 unsolved
[2024-05-21 20:06:24] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:06:24] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 2 ms to minimize.
[2024-05-21 20:06:24] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:06:24] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:06:24] [INFO ] Deduced a trap composed of 83 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 5/6 constraints. Problems are: Problem set: 5 solved, 51 unsolved
[2024-05-21 20:06:24] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 42/182 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 6/14 constraints. Problems are: Problem set: 5 solved, 51 unsolved
[2024-05-21 20:06:24] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 1/15 constraints. Problems are: Problem set: 5 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 397/579 variables, 182/197 constraints. Problems are: Problem set: 5 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 198/395 constraints. Problems are: Problem set: 5 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 4/399 constraints. Problems are: Problem set: 5 solved, 51 unsolved
[2024-05-21 20:06:25] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:06:25] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 1 ms to minimize.
[2024-05-21 20:06:25] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 80 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 2 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 1 ms to minimize.
[2024-05-21 20:06:26] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:06:27] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:06:27] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 20/419 constraints. Problems are: Problem set: 5 solved, 51 unsolved
[2024-05-21 20:06:27] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:06:27] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 3 ms to minimize.
[2024-05-21 20:06:27] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 3/422 constraints. Problems are: Problem set: 5 solved, 51 unsolved
[2024-05-21 20:06:28] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:06:28] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:06:28] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
SMT process timed out in 10261ms, After SMT, problems are : Problem set: 5 solved, 51 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 217 transition count 414
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 217 transition count 414
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 217 transition count 411
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 215 transition count 408
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 215 transition count 408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 214 transition count 407
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 214 transition count 407
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 214 transition count 405
Applied a total of 25 rules in 53 ms. Remains 214 /224 variables (removed 10) and now considering 405/422 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 214/224 places, 405/422 transitions.
RANDOM walk for 40000 steps (9166 resets) in 633 ms. (63 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (196 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (407 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (174 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (183 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (173 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (404 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (190 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (171 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (169 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (181 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (204 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (209 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (185 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (186 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (397 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (194 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (188 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (176 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (172 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (215 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (166 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (209 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (167 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (181 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (366 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (199 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (185 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (180 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (210 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (390 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (175 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (423 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (199 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (171 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (396 resets) in 22 ms. (173 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (408 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (381 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (194 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (184 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (190 resets) in 104 ms. (38 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (203 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (366 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (205 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (199 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (212 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (376 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (189 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (368 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (158 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (184 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
Interrupted probabilistic random walk after 856458 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :50 out of 51
Probabilistic random walk after 856458 steps, saw 314449 distinct states, run finished after 3010 ms. (steps per millisecond=284 ) properties seen :50
// Phase 1: matrix 405 rows 214 cols
[2024-05-21 20:06:32] [INFO ] Computed 2 invariants in 10 ms
[2024-05-21 20:06:32] [INFO ] State equation strengthened by 215 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/374 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 47/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 221/595 variables, 65/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 156/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/595 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/619 variables, 12/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/619 variables, 12/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/619 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/619 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 619/619 variables, and 431 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, ReadFeed: 215/215 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/374 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 47/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 221/595 variables, 65/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 156/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/595 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/595 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 24/619 variables, 12/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/619 variables, 12/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/619 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 619/619 variables, and 432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, ReadFeed: 215/215 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 657ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 405/405 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 171 transition count 265
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 171 transition count 265
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 89 place count 171 transition count 262
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 123 place count 137 transition count 219
Iterating global reduction 1 with 34 rules applied. Total rules applied 157 place count 137 transition count 219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 163 place count 137 transition count 213
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 185 place count 115 transition count 178
Iterating global reduction 2 with 22 rules applied. Total rules applied 207 place count 115 transition count 178
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 216 place count 115 transition count 169
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 226 place count 105 transition count 153
Iterating global reduction 3 with 10 rules applied. Total rules applied 236 place count 105 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 240 place count 105 transition count 149
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 247 place count 98 transition count 142
Iterating global reduction 4 with 7 rules applied. Total rules applied 254 place count 98 transition count 142
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 260 place count 92 transition count 136
Iterating global reduction 4 with 6 rules applied. Total rules applied 266 place count 92 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 269 place count 92 transition count 133
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 271 place count 90 transition count 125
Iterating global reduction 5 with 2 rules applied. Total rules applied 273 place count 90 transition count 125
Applied a total of 273 rules in 45 ms. Remains 90 /214 variables (removed 124) and now considering 125/405 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 90/214 places, 125/405 transitions.
RANDOM walk for 40000 steps (9216 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1847 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 306876 steps, run visited all 1 properties in 333 ms. (steps per millisecond=921 )
Probabilistic random walk after 306876 steps, saw 120327 distinct states, run finished after 340 ms. (steps per millisecond=902 ) properties seen :1
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-21 20:06:33] [INFO ] Flatten gal took : 21 ms
[2024-05-21 20:06:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m08-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:06:33] [INFO ] Flatten gal took : 21 ms
[2024-05-21 20:06:33] [INFO ] Input system was already deterministic with 422 transitions.
Support contains 84 out of 224 places (down from 87) after GAL structural reductions.
Computed a total of 5 stabilizing places and 33 stable transitions
Graph (complete) has 862 edges and 224 vertex of which 223 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 182 transition count 306
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 182 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 90 place count 182 transition count 300
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 116 place count 156 transition count 268
Iterating global reduction 1 with 26 rules applied. Total rules applied 142 place count 156 transition count 268
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 149 place count 156 transition count 261
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 164 place count 141 transition count 240
Iterating global reduction 2 with 15 rules applied. Total rules applied 179 place count 141 transition count 240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 186 place count 141 transition count 233
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 192 place count 135 transition count 224
Iterating global reduction 3 with 6 rules applied. Total rules applied 198 place count 135 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 201 place count 135 transition count 221
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 203 place count 133 transition count 219
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 133 transition count 219
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 206 place count 132 transition count 218
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 132 transition count 218
Applied a total of 207 rules in 16 ms. Remains 132 /224 variables (removed 92) and now considering 218/422 (removed 204) transitions.
// Phase 1: matrix 218 rows 132 cols
[2024-05-21 20:06:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:06:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 20:06:34] [INFO ] Invariant cache hit.
[2024-05-21 20:06:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-21 20:06:34] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-21 20:06:34] [INFO ] Invariant cache hit.
[2024-05-21 20:06:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/350 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 96/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/350 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 230 constraints, problems are : Problem set: 0 solved, 217 unsolved in 6142 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/350 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 96/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 217/447 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/350 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 447 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14099 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 20508ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 20511ms
Starting structural reductions in LTL mode, iteration 1 : 132/224 places, 218/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20815 ms. Remains : 132/224 places, 218/422 transitions.
[2024-05-21 20:06:54] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:06:54] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:06:54] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-21 20:06:54] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:06:54] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:06:54] [INFO ] Time to serialize gal into /tmp/CTLFireability6433128356885871426.gal : 5 ms
[2024-05-21 20:06:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4423031478697870987.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6433128356885871426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4423031478697870987.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 20:07:24] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:07:24] [INFO ] Applying decomposition
[2024-05-21 20:07:24] [INFO ] Flatten gal took : 19 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/graph12026272976811336388.txt' '-o' '/tmp/graph12026272976811336388.bin' '-w' '/tmp/graph12026272976811336388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12026272976811336388.bin' '-l' '-1' '-v' '-w' '/tmp/graph12026272976811336388.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:07:25] [INFO ] Decomposing Gal with order
[2024-05-21 20:07:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:07:25] [INFO ] Removed a total of 220 redundant transitions.
[2024-05-21 20:07:25] [INFO ] Flatten gal took : 50 ms
[2024-05-21 20:07:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 173 labels/synchronizations in 12 ms.
[2024-05-21 20:07:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8661778676869716240.gal : 4 ms
[2024-05-21 20:07:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8335130665714796445.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/CTLFireability8661778676869716240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8335130665714796445.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 176 transition count 277
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 176 transition count 277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 102 place count 176 transition count 271
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 135 place count 143 transition count 229
Iterating global reduction 1 with 33 rules applied. Total rules applied 168 place count 143 transition count 229
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 175 place count 143 transition count 222
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 196 place count 122 transition count 189
Iterating global reduction 2 with 21 rules applied. Total rules applied 217 place count 122 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 226 place count 122 transition count 180
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 235 place count 113 transition count 166
Iterating global reduction 3 with 9 rules applied. Total rules applied 244 place count 113 transition count 166
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 248 place count 113 transition count 162
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 253 place count 108 transition count 157
Iterating global reduction 4 with 5 rules applied. Total rules applied 258 place count 108 transition count 157
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 262 place count 104 transition count 153
Iterating global reduction 4 with 4 rules applied. Total rules applied 266 place count 104 transition count 153
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 267 place count 103 transition count 151
Iterating global reduction 4 with 1 rules applied. Total rules applied 268 place count 103 transition count 151
Applied a total of 268 rules in 22 ms. Remains 103 /224 variables (removed 121) and now considering 151/422 (removed 271) transitions.
// Phase 1: matrix 151 rows 103 cols
[2024-05-21 20:07:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:07:55] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 20:07:55] [INFO ] Invariant cache hit.
[2024-05-21 20:07:55] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 20:07:55] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-21 20:07:55] [INFO ] Invariant cache hit.
[2024-05-21 20:07:55] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/254 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 61/166 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/254 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 166 constraints, problems are : Problem set: 0 solved, 150 unsolved in 3118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/254 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 61/166 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 150/316 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 316 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8832 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 12068ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 12069ms
Starting structural reductions in LTL mode, iteration 1 : 103/224 places, 151/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12296 ms. Remains : 103/224 places, 151/422 transitions.
[2024-05-21 20:08:07] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:08:07] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:08:07] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-21 20:08:07] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:08:07] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:08:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14315943318058442507.gal : 1 ms
[2024-05-21 20:08:07] [INFO ] Time to serialize properties into /tmp/CTLFireability15708181670243348552.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/CTLFireability14315943318058442507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15708181670243348552.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 20:08:37] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:08:37] [INFO ] Applying decomposition
[2024-05-21 20:08:37] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18333125273831853379.txt' '-o' '/tmp/graph18333125273831853379.bin' '-w' '/tmp/graph18333125273831853379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18333125273831853379.bin' '-l' '-1' '-v' '-w' '/tmp/graph18333125273831853379.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:08:37] [INFO ] Decomposing Gal with order
[2024-05-21 20:08:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:08:37] [INFO ] Removed a total of 154 redundant transitions.
[2024-05-21 20:08:37] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:08:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 4 ms.
[2024-05-21 20:08:37] [INFO ] Time to serialize gal into /tmp/CTLFireability2868894912868333234.gal : 3 ms
[2024-05-21 20:08:37] [INFO ] Time to serialize properties into /tmp/CTLFireability11757943071243836464.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/CTLFireability2868894912868333234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11757943071243836464.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 180 transition count 312
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 180 transition count 312
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 101 place count 180 transition count 299
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 131 place count 150 transition count 265
Iterating global reduction 1 with 30 rules applied. Total rules applied 161 place count 150 transition count 265
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 172 place count 150 transition count 254
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 187 place count 135 transition count 228
Iterating global reduction 2 with 15 rules applied. Total rules applied 202 place count 135 transition count 228
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 214 place count 135 transition count 216
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 219 place count 130 transition count 210
Iterating global reduction 3 with 5 rules applied. Total rules applied 224 place count 130 transition count 210
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 228 place count 126 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 232 place count 126 transition count 206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 235 place count 123 transition count 203
Iterating global reduction 3 with 3 rules applied. Total rules applied 238 place count 123 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 239 place count 122 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 240 place count 122 transition count 201
Applied a total of 240 rules in 10 ms. Remains 122 /224 variables (removed 102) and now considering 201/422 (removed 221) transitions.
// Phase 1: matrix 201 rows 122 cols
[2024-05-21 20:09:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:09:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 20:09:07] [INFO ] Invariant cache hit.
[2024-05-21 20:09:07] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-21 20:09:07] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-21 20:09:07] [INFO ] Invariant cache hit.
[2024-05-21 20:09:07] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/323 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 89/213 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:09:11] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 3 ms to minimize.
[2024-05-21 20:09:11] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:09:11] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:09:11] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:09:13] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:09:13] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:09:13] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:09:16] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:09:16] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/323 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (OVERLAPS) 0/323 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 222 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12913 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 201/323 variables, 122/133 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 89/222 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 200/422 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 0/323 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 422 constraints, problems are : Problem set: 0 solved, 200 unsolved in 12190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 9/9 constraints]
After SMT, in 25312ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 25314ms
Starting structural reductions in LTL mode, iteration 1 : 122/224 places, 201/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25567 ms. Remains : 122/224 places, 201/422 transitions.
[2024-05-21 20:09:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:09:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:09:33] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-21 20:09:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:09:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:09:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16712294071361011534.gal : 2 ms
[2024-05-21 20:09:33] [INFO ] Time to serialize properties into /tmp/CTLFireability3695294132780830500.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/CTLFireability16712294071361011534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3695294132780830500.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 20:10:03] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:10:03] [INFO ] Applying decomposition
[2024-05-21 20:10:03] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4412824739479873984.txt' '-o' '/tmp/graph4412824739479873984.bin' '-w' '/tmp/graph4412824739479873984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4412824739479873984.bin' '-l' '-1' '-v' '-w' '/tmp/graph4412824739479873984.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:10:03] [INFO ] Decomposing Gal with order
[2024-05-21 20:10:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:10:03] [INFO ] Removed a total of 207 redundant transitions.
[2024-05-21 20:10:03] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:10:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 5 ms.
[2024-05-21 20:10:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6031542710815426007.gal : 2 ms
[2024-05-21 20:10:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13542738165315013095.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/CTLFireability6031542710815426007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13542738165315013095.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 172 transition count 265
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 172 transition count 265
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 110 place count 172 transition count 259
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 147 place count 135 transition count 212
Iterating global reduction 1 with 37 rules applied. Total rules applied 184 place count 135 transition count 212
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 193 place count 135 transition count 203
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 216 place count 112 transition count 166
Iterating global reduction 2 with 23 rules applied. Total rules applied 239 place count 112 transition count 166
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 249 place count 112 transition count 156
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 259 place count 102 transition count 140
Iterating global reduction 3 with 10 rules applied. Total rules applied 269 place count 102 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 273 place count 102 transition count 136
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 280 place count 95 transition count 129
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 95 transition count 129
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 293 place count 89 transition count 123
Iterating global reduction 4 with 6 rules applied. Total rules applied 299 place count 89 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 302 place count 89 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 304 place count 87 transition count 112
Iterating global reduction 5 with 2 rules applied. Total rules applied 306 place count 87 transition count 112
Applied a total of 306 rules in 9 ms. Remains 87 /224 variables (removed 137) and now considering 112/422 (removed 310) transitions.
// Phase 1: matrix 112 rows 87 cols
[2024-05-21 20:10:33] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 20:10:33] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 20:10:33] [INFO ] Invariant cache hit.
[2024-05-21 20:10:33] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 20:10:33] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-21 20:10:33] [INFO ] Invariant cache hit.
[2024-05-21 20:10:33] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 128 constraints, problems are : Problem set: 0 solved, 111 unsolved in 1951 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 111/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 239 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4738 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 6767ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 6768ms
Starting structural reductions in LTL mode, iteration 1 : 87/224 places, 112/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6957 ms. Remains : 87/224 places, 112/422 transitions.
[2024-05-21 20:10:40] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:10:40] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:10:40] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-21 20:10:40] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:10:40] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:10:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1023102885527926824.gal : 0 ms
[2024-05-21 20:10:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10198168361113099195.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/CTLFireability1023102885527926824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10198168361113099195.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(AX(EG(((s1<1)||(l1019<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(EG(((s1<1)||(l1019<1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t58, t59, t60, t61, t62, t71, t79, t80, t81, t82, t...410
Detected timeout of ITS tools.
[2024-05-21 20:11:10] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:11:10] [INFO ] Applying decomposition
[2024-05-21 20:11:10] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14095589674727478367.txt' '-o' '/tmp/graph14095589674727478367.bin' '-w' '/tmp/graph14095589674727478367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14095589674727478367.bin' '-l' '-1' '-v' '-w' '/tmp/graph14095589674727478367.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:11:10] [INFO ] Decomposing Gal with order
[2024-05-21 20:11:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:11:10] [INFO ] Removed a total of 104 redundant transitions.
[2024-05-21 20:11:10] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:11:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 3 ms.
[2024-05-21 20:11:10] [INFO ] Time to serialize gal into /tmp/CTLFireability6985610441348911663.gal : 1 ms
[2024-05-21 20:11:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1772963196831069501.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/CTLFireability6985610441348911663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1772963196831069501.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36088e+07,5.57522,158136,2307,1119,154459,25718,353,834905,107,361212,0


Converting to forward existential form...Done !
original formula: AF(AX(EG(((i0.u0.s1<1)||(u11.l1019<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(EG(((i0.u0.s1<1)||(u11.l1019<1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t45, t46, t59, t71, t79, t80, t81, t82, t83, t85, t86, t87, t88, t92, t93, t94, t95, t96,...394
(forward)formula 0,1,20.5862,411996,1,0,402028,59054,1472,2.83334e+06,627,516082,959759
FORMULA DBSingleClientW-PT-d1m08-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 172 transition count 265
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 172 transition count 265
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 110 place count 172 transition count 259
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 147 place count 135 transition count 212
Iterating global reduction 1 with 37 rules applied. Total rules applied 184 place count 135 transition count 212
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 192 place count 135 transition count 204
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 215 place count 112 transition count 168
Iterating global reduction 2 with 23 rules applied. Total rules applied 238 place count 112 transition count 168
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 248 place count 112 transition count 158
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 258 place count 102 transition count 142
Iterating global reduction 3 with 10 rules applied. Total rules applied 268 place count 102 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 272 place count 102 transition count 138
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 279 place count 95 transition count 131
Iterating global reduction 4 with 7 rules applied. Total rules applied 286 place count 95 transition count 131
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 292 place count 89 transition count 125
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 89 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 301 place count 89 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 303 place count 87 transition count 114
Iterating global reduction 5 with 2 rules applied. Total rules applied 305 place count 87 transition count 114
Applied a total of 305 rules in 36 ms. Remains 87 /224 variables (removed 137) and now considering 114/422 (removed 308) transitions.
// Phase 1: matrix 114 rows 87 cols
[2024-05-21 20:11:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:11:31] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 20:11:31] [INFO ] Invariant cache hit.
[2024-05-21 20:11:31] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 20:11:31] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-21 20:11:31] [INFO ] Redundant transitions in 3 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-21 20:11:31] [INFO ] Invariant cache hit.
[2024-05-21 20:11:31] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/201 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 128 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2091 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/201 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 113/241 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 241 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 5886ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 5887ms
Starting structural reductions in SI_CTL mode, iteration 1 : 87/224 places, 114/422 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6110 ms. Remains : 87/224 places, 114/422 transitions.
[2024-05-21 20:11:37] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:11:37] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:11:37] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-21 20:11:37] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:11:37] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:11:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13702597024896129128.gal : 1 ms
[2024-05-21 20:11:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14931860431459330422.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/CTLFireability13702597024896129128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14931860431459330422.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(EG(AF(((s1>=1)&&(l1027>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((s1>=1)&&(l1027>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t61, t62, t63, t64, t65, t73, t81, t82, t83, t84, t...412
Detected timeout of ITS tools.
[2024-05-21 20:12:07] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:12:07] [INFO ] Applying decomposition
[2024-05-21 20:12:07] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3720402223164085612.txt' '-o' '/tmp/graph3720402223164085612.bin' '-w' '/tmp/graph3720402223164085612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3720402223164085612.bin' '-l' '-1' '-v' '-w' '/tmp/graph3720402223164085612.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:12:07] [INFO ] Decomposing Gal with order
[2024-05-21 20:12:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:12:07] [INFO ] Removed a total of 128 redundant transitions.
[2024-05-21 20:12:07] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:12:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 3 ms.
[2024-05-21 20:12:07] [INFO ] Time to serialize gal into /tmp/CTLFireability3753035624135218896.gal : 1 ms
[2024-05-21 20:12:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17714732188228300552.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/CTLFireability3753035624135218896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17714732188228300552.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.37055e+07,5.21761,106632,2424,585,102003,15178,356,633775,94,81790,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((i4.u2.s1>=1)&&(i5.u13.l1027>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((i4.u2.s1>=1)&&(i5.u13.l1027>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t11, t13, t45, t62, t63, t64, t65, t73, t81, t82, t83, t84, t85, t86, t87, t88, t89, ...403
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 173 transition count 271
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 173 transition count 271
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 110 place count 173 transition count 263
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 144 place count 139 transition count 220
Iterating global reduction 1 with 34 rules applied. Total rules applied 178 place count 139 transition count 220
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 187 place count 139 transition count 211
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 207 place count 119 transition count 179
Iterating global reduction 2 with 20 rules applied. Total rules applied 227 place count 119 transition count 179
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 235 place count 119 transition count 171
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 245 place count 109 transition count 157
Iterating global reduction 3 with 10 rules applied. Total rules applied 255 place count 109 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 262 place count 109 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 266 place count 105 transition count 146
Iterating global reduction 4 with 4 rules applied. Total rules applied 270 place count 105 transition count 146
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 273 place count 102 transition count 143
Iterating global reduction 4 with 3 rules applied. Total rules applied 276 place count 102 transition count 143
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 277 place count 101 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 278 place count 101 transition count 141
Applied a total of 278 rules in 15 ms. Remains 101 /224 variables (removed 123) and now considering 141/422 (removed 281) transitions.
// Phase 1: matrix 141 rows 101 cols
[2024-05-21 20:12:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:12:37] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 20:12:37] [INFO ] Invariant cache hit.
[2024-05-21 20:12:37] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 20:12:37] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-21 20:12:37] [INFO ] Invariant cache hit.
[2024-05-21 20:12:37] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/242 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 51/154 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 154 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/242 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 51/154 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 140/294 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 294 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6907 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 10068ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 10070ms
Starting structural reductions in LTL mode, iteration 1 : 101/224 places, 141/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10314 ms. Remains : 101/224 places, 141/422 transitions.
[2024-05-21 20:12:47] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:12:47] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:12:47] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-21 20:12:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:12:47] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:12:47] [INFO ] Time to serialize gal into /tmp/CTLFireability2706064946738283639.gal : 1 ms
[2024-05-21 20:12:47] [INFO ] Time to serialize properties into /tmp/CTLFireability1425784903227034755.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/CTLFireability2706064946738283639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1425784903227034755.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 20:13:17] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:13:17] [INFO ] Applying decomposition
[2024-05-21 20:13:17] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11946263620237012119.txt' '-o' '/tmp/graph11946263620237012119.bin' '-w' '/tmp/graph11946263620237012119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11946263620237012119.bin' '-l' '-1' '-v' '-w' '/tmp/graph11946263620237012119.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:13:17] [INFO ] Decomposing Gal with order
[2024-05-21 20:13:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:13:17] [INFO ] Removed a total of 162 redundant transitions.
[2024-05-21 20:13:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:13:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 3 ms.
[2024-05-21 20:13:17] [INFO ] Time to serialize gal into /tmp/CTLFireability467567338122992860.gal : 1 ms
[2024-05-21 20:13:17] [INFO ] Time to serialize properties into /tmp/CTLFireability18079050619097272737.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/CTLFireability467567338122992860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18079050619097272737.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 177 transition count 293
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 177 transition count 293
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 108 place count 177 transition count 279
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 140 place count 145 transition count 238
Iterating global reduction 1 with 32 rules applied. Total rules applied 172 place count 145 transition count 238
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 183 place count 145 transition count 227
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 202 place count 126 transition count 200
Iterating global reduction 2 with 19 rules applied. Total rules applied 221 place count 126 transition count 200
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 231 place count 126 transition count 190
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 239 place count 118 transition count 176
Iterating global reduction 3 with 8 rules applied. Total rules applied 247 place count 118 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 254 place count 118 transition count 169
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 258 place count 114 transition count 165
Iterating global reduction 4 with 4 rules applied. Total rules applied 262 place count 114 transition count 165
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 266 place count 110 transition count 161
Iterating global reduction 4 with 4 rules applied. Total rules applied 270 place count 110 transition count 161
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 271 place count 109 transition count 159
Iterating global reduction 4 with 1 rules applied. Total rules applied 272 place count 109 transition count 159
Applied a total of 272 rules in 9 ms. Remains 109 /224 variables (removed 115) and now considering 159/422 (removed 263) transitions.
// Phase 1: matrix 159 rows 109 cols
[2024-05-21 20:13:48] [INFO ] Computed 2 invariants in 8 ms
[2024-05-21 20:13:48] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 20:13:48] [INFO ] Invariant cache hit.
[2024-05-21 20:13:48] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 20:13:48] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-05-21 20:13:48] [INFO ] Invariant cache hit.
[2024-05-21 20:13:48] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/268 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 63/174 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/268 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 174 constraints, problems are : Problem set: 0 solved, 158 unsolved in 3386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/268 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 63/174 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 158/332 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 332 constraints, problems are : Problem set: 0 solved, 158 unsolved in 8439 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 0/0 constraints]
After SMT, in 11962ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 11963ms
Starting structural reductions in LTL mode, iteration 1 : 109/224 places, 159/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12178 ms. Remains : 109/224 places, 159/422 transitions.
[2024-05-21 20:14:00] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:14:00] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:14:00] [INFO ] Input system was already deterministic with 159 transitions.
[2024-05-21 20:14:00] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:14:00] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:14:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4811034260762421839.gal : 1 ms
[2024-05-21 20:14:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2989019604798207378.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/CTLFireability4811034260762421839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2989019604798207378.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 20:14:30] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:14:30] [INFO ] Applying decomposition
[2024-05-21 20:14:30] [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/graph4132869106088501482.txt' '-o' '/tmp/graph4132869106088501482.bin' '-w' '/tmp/graph4132869106088501482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4132869106088501482.bin' '-l' '-1' '-v' '-w' '/tmp/graph4132869106088501482.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:14:30] [INFO ] Decomposing Gal with order
[2024-05-21 20:14:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:14:30] [INFO ] Removed a total of 175 redundant transitions.
[2024-05-21 20:14:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:14:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 4 ms.
[2024-05-21 20:14:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7326279845958018612.gal : 2 ms
[2024-05-21 20:14:30] [INFO ] Time to serialize properties into /tmp/CTLFireability4417481162725109123.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/CTLFireability7326279845958018612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4417481162725109123.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 178 transition count 282
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 178 transition count 282
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 101 place count 178 transition count 273
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 134 place count 145 transition count 234
Iterating global reduction 1 with 33 rules applied. Total rules applied 167 place count 145 transition count 234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 175 place count 145 transition count 226
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 190 place count 130 transition count 204
Iterating global reduction 2 with 15 rules applied. Total rules applied 205 place count 130 transition count 204
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 213 place count 130 transition count 196
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 218 place count 125 transition count 188
Iterating global reduction 3 with 5 rules applied. Total rules applied 223 place count 125 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 227 place count 125 transition count 184
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 228 place count 124 transition count 183
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 124 transition count 183
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 230 place count 123 transition count 182
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 123 transition count 182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 232 place count 122 transition count 180
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 122 transition count 180
Applied a total of 233 rules in 17 ms. Remains 122 /224 variables (removed 102) and now considering 180/422 (removed 242) transitions.
// Phase 1: matrix 180 rows 122 cols
[2024-05-21 20:15:00] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 20:15:00] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 20:15:00] [INFO ] Invariant cache hit.
[2024-05-21 20:15:00] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 20:15:00] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-05-21 20:15:00] [INFO ] Invariant cache hit.
[2024-05-21 20:15:00] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/302 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 63/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 187 constraints, problems are : Problem set: 0 solved, 179 unsolved in 4415 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/302 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 63/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 179/366 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 366 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10528 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 15131ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15133ms
Starting structural reductions in LTL mode, iteration 1 : 122/224 places, 180/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15383 ms. Remains : 122/224 places, 180/422 transitions.
[2024-05-21 20:15:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:15:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:15:15] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-21 20:15:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:15:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:15:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15549838713663776807.gal : 1 ms
[2024-05-21 20:15:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6197649927132620404.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/CTLFireability15549838713663776807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6197649927132620404.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 20:15:45] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:15:45] [INFO ] Applying decomposition
[2024-05-21 20:15:45] [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/graph1442962502731247934.txt' '-o' '/tmp/graph1442962502731247934.bin' '-w' '/tmp/graph1442962502731247934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1442962502731247934.bin' '-l' '-1' '-v' '-w' '/tmp/graph1442962502731247934.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:15:45] [INFO ] Decomposing Gal with order
[2024-05-21 20:15:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:15:45] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-21 20:15:45] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:15:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 3 ms.
[2024-05-21 20:15:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17755437783288977334.gal : 2 ms
[2024-05-21 20:15:45] [INFO ] Time to serialize properties into /tmp/CTLFireability16263036046761813350.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/CTLFireability17755437783288977334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16263036046761813350.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 181 transition count 296
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 181 transition count 296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 90 place count 181 transition count 292
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 123 place count 148 transition count 251
Iterating global reduction 1 with 33 rules applied. Total rules applied 156 place count 148 transition count 251
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 168 place count 148 transition count 239
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 188 place count 128 transition count 209
Iterating global reduction 2 with 20 rules applied. Total rules applied 208 place count 128 transition count 209
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 220 place count 128 transition count 197
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 228 place count 120 transition count 185
Iterating global reduction 3 with 8 rules applied. Total rules applied 236 place count 120 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 240 place count 120 transition count 181
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 244 place count 116 transition count 177
Iterating global reduction 4 with 4 rules applied. Total rules applied 248 place count 116 transition count 177
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 251 place count 113 transition count 174
Iterating global reduction 4 with 3 rules applied. Total rules applied 254 place count 113 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 257 place count 113 transition count 171
Applied a total of 257 rules in 13 ms. Remains 113 /224 variables (removed 111) and now considering 171/422 (removed 251) transitions.
// Phase 1: matrix 171 rows 113 cols
[2024-05-21 20:16:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:16:16] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 20:16:16] [INFO ] Invariant cache hit.
[2024-05-21 20:16:16] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 20:16:16] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-21 20:16:16] [INFO ] Invariant cache hit.
[2024-05-21 20:16:16] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/284 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 73/188 constraints. Problems are: Problem set: 0 solved, 170 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/284 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 188 constraints, problems are : Problem set: 0 solved, 170 unsolved in 4507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/284 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 73/188 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 170/358 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/284 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 358 constraints, problems are : Problem set: 0 solved, 170 unsolved in 9221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
After SMT, in 13886ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 13889ms
Starting structural reductions in LTL mode, iteration 1 : 113/224 places, 171/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14149 ms. Remains : 113/224 places, 171/422 transitions.
[2024-05-21 20:16:30] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:16:30] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:16:30] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-21 20:16:30] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:16:30] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:16:30] [INFO ] Time to serialize gal into /tmp/CTLFireability12808219716676695462.gal : 1 ms
[2024-05-21 20:16:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3918920125400968229.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/CTLFireability12808219716676695462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3918920125400968229.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 20:17:00] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:17:00] [INFO ] Applying decomposition
[2024-05-21 20:17:00] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14897979826119454871.txt' '-o' '/tmp/graph14897979826119454871.bin' '-w' '/tmp/graph14897979826119454871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14897979826119454871.bin' '-l' '-1' '-v' '-w' '/tmp/graph14897979826119454871.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:17:00] [INFO ] Decomposing Gal with order
[2024-05-21 20:17:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:17:00] [INFO ] Removed a total of 167 redundant transitions.
[2024-05-21 20:17:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:17:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 2 ms.
[2024-05-21 20:17:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8574077464438438416.gal : 1 ms
[2024-05-21 20:17:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9503512105803869720.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/CTLFireability8574077464438438416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9503512105803869720.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 173 transition count 274
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 173 transition count 274
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 110 place count 173 transition count 266
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 148 place count 135 transition count 218
Iterating global reduction 1 with 38 rules applied. Total rules applied 186 place count 135 transition count 218
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 199 place count 135 transition count 205
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 222 place count 112 transition count 170
Iterating global reduction 2 with 23 rules applied. Total rules applied 245 place count 112 transition count 170
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 257 place count 112 transition count 158
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 267 place count 102 transition count 141
Iterating global reduction 3 with 10 rules applied. Total rules applied 277 place count 102 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 282 place count 102 transition count 136
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 288 place count 96 transition count 130
Iterating global reduction 4 with 6 rules applied. Total rules applied 294 place count 96 transition count 130
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 299 place count 91 transition count 125
Iterating global reduction 4 with 5 rules applied. Total rules applied 304 place count 91 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 307 place count 91 transition count 122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 308 place count 90 transition count 120
Iterating global reduction 5 with 1 rules applied. Total rules applied 309 place count 90 transition count 120
Applied a total of 309 rules in 20 ms. Remains 90 /224 variables (removed 134) and now considering 120/422 (removed 302) transitions.
// Phase 1: matrix 120 rows 90 cols
[2024-05-21 20:17:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:17:30] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 20:17:30] [INFO ] Invariant cache hit.
[2024-05-21 20:17:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 20:17:30] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-21 20:17:30] [INFO ] Redundant transitions in 2 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-21 20:17:30] [INFO ] Invariant cache hit.
[2024-05-21 20:17:30] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/210 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 44/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 136 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/210 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 44/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 119/255 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 255 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4110 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 6467ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 6468ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/224 places, 120/422 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6655 ms. Remains : 90/224 places, 120/422 transitions.
[2024-05-21 20:17:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:17:36] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:17:36] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-21 20:17:36] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:17:37] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:17:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13662972403378089000.gal : 1 ms
[2024-05-21 20:17:37] [INFO ] Time to serialize properties into /tmp/CTLFireability8943570365748695488.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/CTLFireability13662972403378089000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8943570365748695488.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EF(((s1<1)||(l612<1))) * EF(EG(((p61>=1)&&(l621>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * E(TRUE U ((s1<1)||(l612<1)))),TRUE),((p61>=1)&&(l621>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t44, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t...453
Detected timeout of ITS tools.
[2024-05-21 20:18:07] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:18:07] [INFO ] Applying decomposition
[2024-05-21 20:18:07] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2640572108730579193.txt' '-o' '/tmp/graph2640572108730579193.bin' '-w' '/tmp/graph2640572108730579193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2640572108730579193.bin' '-l' '-1' '-v' '-w' '/tmp/graph2640572108730579193.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:18:07] [INFO ] Decomposing Gal with order
[2024-05-21 20:18:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:18:07] [INFO ] Removed a total of 93 redundant transitions.
[2024-05-21 20:18:07] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:18:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 2 ms.
[2024-05-21 20:18:07] [INFO ] Time to serialize gal into /tmp/CTLFireability1577664796552157521.gal : 1 ms
[2024-05-21 20:18:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2108025683738481433.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/CTLFireability1577664796552157521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2108025683738481433.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46098e+07,2.30249,72912,1855,1169,86298,13328,324,385906,186,176714,0


Converting to forward existential form...Done !
original formula: (EF(((u3.s1<1)||(u0.l612<1))) * EF(EG(((i4.u11.p61>=1)&&(i4.u11.l621>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * E(TRUE U ((u3.s1<1)||(u0.l612<1)))),TRUE),((i4.u11.p61>=1)&&(i4.u11.l621>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t11, t43, t50, t56, t65, t80, t87, t89, t90, t92, t93, t94, t95, t96, t97, t98, t99, t100...384
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,8.56811,208420,1,0,188807,50524,1475,1.23864e+06,1078,1.02355e+06,192439
FORMULA DBSingleClientW-PT-d1m08-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 171 transition count 260
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 171 transition count 260
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 112 place count 171 transition count 254
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 149 place count 134 transition count 210
Iterating global reduction 1 with 37 rules applied. Total rules applied 186 place count 134 transition count 210
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 196 place count 134 transition count 200
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 218 place count 112 transition count 165
Iterating global reduction 2 with 22 rules applied. Total rules applied 240 place count 112 transition count 165
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 249 place count 112 transition count 156
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 259 place count 102 transition count 139
Iterating global reduction 3 with 10 rules applied. Total rules applied 269 place count 102 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 273 place count 102 transition count 135
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 279 place count 96 transition count 129
Iterating global reduction 4 with 6 rules applied. Total rules applied 285 place count 96 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 290 place count 91 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 295 place count 91 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 296 place count 91 transition count 123
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 298 place count 89 transition count 115
Iterating global reduction 5 with 2 rules applied. Total rules applied 300 place count 89 transition count 115
Applied a total of 300 rules in 17 ms. Remains 89 /224 variables (removed 135) and now considering 115/422 (removed 307) transitions.
// Phase 1: matrix 115 rows 89 cols
[2024-05-21 20:18:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:18:15] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 20:18:15] [INFO ] Invariant cache hit.
[2024-05-21 20:18:15] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 20:18:15] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-21 20:18:15] [INFO ] Redundant transitions in 3 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-21 20:18:15] [INFO ] Invariant cache hit.
[2024-05-21 20:18:15] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/204 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 125 constraints, problems are : Problem set: 0 solved, 114 unsolved in 2449 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/204 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 114/239 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 239 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4467 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 6999ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 7000ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/224 places, 115/422 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7203 ms. Remains : 89/224 places, 115/422 transitions.
[2024-05-21 20:18:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:18:22] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:18:22] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-21 20:18:22] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:18:22] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:18:22] [INFO ] Time to serialize gal into /tmp/CTLFireability47098430578191974.gal : 1 ms
[2024-05-21 20:18:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15902354818466523820.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/CTLFireability47098430578191974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15902354818466523820.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.16001e+07,22.919,558132,2,37629,5,1.7828e+06,6,0,471,2.30759e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.16001e+07,11.9273,259964,2994,1380,266252,48939,377,1.33367e+06,97,518401,0


Converting to forward existential form...Done !
original formula: EF((AF(((i4.u0.s1>=1)&&(i0.u2.l1306>=1))) * EF(((i4.u0.s1>=1)&&(i4.u0.l952>=1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EG(!(((i4.u0.s1>=1)&&(i0.u2.l1306>=1)))))),TRUE) * ((i4.u0.s1>=1)&&(i4.u0.l952>=1)))...165
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t45, t47, t71, t78, t80, t82, t83, t84, t86, t87, t88, t89, t90, t91, t92, t93,...434
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 177 transition count 295
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 177 transition count 295
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 104 place count 177 transition count 285
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 136 place count 145 transition count 244
Iterating global reduction 1 with 32 rules applied. Total rules applied 168 place count 145 transition count 244
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 181 place count 145 transition count 231
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 199 place count 127 transition count 200
Iterating global reduction 2 with 18 rules applied. Total rules applied 217 place count 127 transition count 200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 226 place count 127 transition count 191
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 235 place count 118 transition count 179
Iterating global reduction 3 with 9 rules applied. Total rules applied 244 place count 118 transition count 179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 251 place count 118 transition count 172
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 255 place count 114 transition count 168
Iterating global reduction 4 with 4 rules applied. Total rules applied 259 place count 114 transition count 168
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 262 place count 111 transition count 165
Iterating global reduction 4 with 3 rules applied. Total rules applied 265 place count 111 transition count 165
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 266 place count 110 transition count 163
Iterating global reduction 4 with 1 rules applied. Total rules applied 267 place count 110 transition count 163
Applied a total of 267 rules in 15 ms. Remains 110 /224 variables (removed 114) and now considering 163/422 (removed 259) transitions.
// Phase 1: matrix 163 rows 110 cols
[2024-05-21 20:19:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:19:23] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 20:19:23] [INFO ] Invariant cache hit.
[2024-05-21 20:19:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 20:19:23] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-21 20:19:23] [INFO ] Invariant cache hit.
[2024-05-21 20:19:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/273 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 72/184 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/273 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 184 constraints, problems are : Problem set: 0 solved, 162 unsolved in 3710 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/273 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 72/184 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 162/346 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 346 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
After SMT, in 13028ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 13030ms
Starting structural reductions in LTL mode, iteration 1 : 110/224 places, 163/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13276 ms. Remains : 110/224 places, 163/422 transitions.
[2024-05-21 20:19:36] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:19:36] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:19:36] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-21 20:19:36] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:19:36] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:19:36] [INFO ] Time to serialize gal into /tmp/CTLFireability668216954342404391.gal : 1 ms
[2024-05-21 20:19:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16612951749120511481.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/CTLFireability668216954342404391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16612951749120511481.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 20:20:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:20:06] [INFO ] Applying decomposition
[2024-05-21 20:20:06] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18425338419169939368.txt' '-o' '/tmp/graph18425338419169939368.bin' '-w' '/tmp/graph18425338419169939368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18425338419169939368.bin' '-l' '-1' '-v' '-w' '/tmp/graph18425338419169939368.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:20:06] [INFO ] Decomposing Gal with order
[2024-05-21 20:20:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:20:06] [INFO ] Removed a total of 194 redundant transitions.
[2024-05-21 20:20:06] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:20:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 2 ms.
[2024-05-21 20:20:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9025766420964640982.gal : 1 ms
[2024-05-21 20:20:06] [INFO ] Time to serialize properties into /tmp/CTLFireability4287613750468307597.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/CTLFireability9025766420964640982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4287613750468307597.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 172 transition count 261
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 172 transition count 261
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 110 place count 172 transition count 255
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 147 place count 135 transition count 208
Iterating global reduction 1 with 37 rules applied. Total rules applied 184 place count 135 transition count 208
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 194 place count 135 transition count 198
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 217 place count 112 transition count 161
Iterating global reduction 2 with 23 rules applied. Total rules applied 240 place count 112 transition count 161
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 249 place count 112 transition count 152
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 259 place count 102 transition count 135
Iterating global reduction 3 with 10 rules applied. Total rules applied 269 place count 102 transition count 135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 274 place count 102 transition count 130
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 280 place count 96 transition count 124
Iterating global reduction 4 with 6 rules applied. Total rules applied 286 place count 96 transition count 124
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 292 place count 90 transition count 118
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 90 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 90 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 300 place count 89 transition count 115
Iterating global reduction 5 with 1 rules applied. Total rules applied 301 place count 89 transition count 115
Applied a total of 301 rules in 14 ms. Remains 89 /224 variables (removed 135) and now considering 115/422 (removed 307) transitions.
// Phase 1: matrix 115 rows 89 cols
[2024-05-21 20:20:36] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:20:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 20:20:36] [INFO ] Invariant cache hit.
[2024-05-21 20:20:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 20:20:36] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-21 20:20:36] [INFO ] Invariant cache hit.
[2024-05-21 20:20:36] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/204 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 40/131 constraints. Problems are: Problem set: 0 solved, 114 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 131 constraints, problems are : Problem set: 0 solved, 114 unsolved in 1973 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/204 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 40/131 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 114/245 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 245 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4095 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 6157ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 6158ms
Starting structural reductions in LTL mode, iteration 1 : 89/224 places, 115/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6342 ms. Remains : 89/224 places, 115/422 transitions.
[2024-05-21 20:20:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:20:42] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:20:42] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-21 20:20:42] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:20:42] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:20:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4954887193706369585.gal : 1 ms
[2024-05-21 20:20:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10037144235826904754.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/CTLFireability4954887193706369585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10037144235826904754.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(AG(AF(EX((((s1>=1)&&(l417>=1))&&(l947>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!(EX((((s1>=1)&&(l417>=1))&&(l947>=1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t28, t41, t43, t44, t45, t46, t47, t48, t54, t55, t56, t61, t63, t65, t...438
Detected timeout of ITS tools.
[2024-05-21 20:21:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:21:12] [INFO ] Applying decomposition
[2024-05-21 20:21:12] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15232729001848436293.txt' '-o' '/tmp/graph15232729001848436293.bin' '-w' '/tmp/graph15232729001848436293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15232729001848436293.bin' '-l' '-1' '-v' '-w' '/tmp/graph15232729001848436293.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:21:12] [INFO ] Decomposing Gal with order
[2024-05-21 20:21:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:21:12] [INFO ] Removed a total of 132 redundant transitions.
[2024-05-21 20:21:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:21:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 1 ms.
[2024-05-21 20:21:12] [INFO ] Time to serialize gal into /tmp/CTLFireability17155383858695326577.gal : 1 ms
[2024-05-21 20:21:12] [INFO ] Time to serialize properties into /tmp/CTLFireability5131359810162413750.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/CTLFireability17155383858695326577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5131359810162413750.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.70851e+07,14.0648,365760,4224,1627,233692,29804,379,3.08316e+06,119,632266,0


Converting to forward existential form...Done !
original formula: AF(AG(AF(EX((((i2.u0.s1>=1)&&(i3.u2.l417>=1))&&(i0.u10.l947>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!(EX((((i2.u0.s1>=1)&&(i3.u2.l417>=1))&&(i0.u10.l947>=1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t11, t12, t13, t55, t56, t61, t65, t75, t82, t83, t84, t86, t87, t88, t89, t91, t95, ...455
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 171 transition count 260
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 171 transition count 260
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 112 place count 171 transition count 254
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 150 place count 133 transition count 206
Iterating global reduction 1 with 38 rules applied. Total rules applied 188 place count 133 transition count 206
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 198 place count 133 transition count 196
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 222 place count 109 transition count 158
Iterating global reduction 2 with 24 rules applied. Total rules applied 246 place count 109 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 256 place count 109 transition count 148
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 267 place count 98 transition count 130
Iterating global reduction 3 with 11 rules applied. Total rules applied 278 place count 98 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 283 place count 98 transition count 125
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 289 place count 92 transition count 119
Iterating global reduction 4 with 6 rules applied. Total rules applied 295 place count 92 transition count 119
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 300 place count 87 transition count 114
Iterating global reduction 4 with 5 rules applied. Total rules applied 305 place count 87 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 307 place count 87 transition count 112
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 309 place count 85 transition count 104
Iterating global reduction 5 with 2 rules applied. Total rules applied 311 place count 85 transition count 104
Applied a total of 311 rules in 18 ms. Remains 85 /224 variables (removed 139) and now considering 104/422 (removed 318) transitions.
// Phase 1: matrix 104 rows 85 cols
[2024-05-21 20:21:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:21:43] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 20:21:43] [INFO ] Invariant cache hit.
[2024-05-21 20:21:43] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:21:43] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-21 20:21:43] [INFO ] Redundant transitions in 1 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-21 20:21:43] [INFO ] Invariant cache hit.
[2024-05-21 20:21:43] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5227ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5228ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/224 places, 104/422 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5410 ms. Remains : 85/224 places, 104/422 transitions.
[2024-05-21 20:21:48] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:21:48] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:21:48] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-21 20:21:48] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:21:48] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:21:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10648758968950231216.gal : 0 ms
[2024-05-21 20:21:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6940300819840067199.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/CTLFireability10648758968950231216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6940300819840067199.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l941<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l941<1)))] != FALSE
Hit Full ! (commute/partial/dont) 2/0/102
Detected timeout of ITS tools.
[2024-05-21 20:22:18] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:22:18] [INFO ] Applying decomposition
[2024-05-21 20:22:18] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6855035945040124459.txt' '-o' '/tmp/graph6855035945040124459.bin' '-w' '/tmp/graph6855035945040124459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6855035945040124459.bin' '-l' '-1' '-v' '-w' '/tmp/graph6855035945040124459.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:22:18] [INFO ] Decomposing Gal with order
[2024-05-21 20:22:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:22:18] [INFO ] Removed a total of 108 redundant transitions.
[2024-05-21 20:22:18] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:22:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 2 ms.
[2024-05-21 20:22:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15450675712167439555.gal : 1 ms
[2024-05-21 20:22:18] [INFO ] Time to serialize properties into /tmp/CTLFireability12132853629788241360.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/CTLFireability15450675712167439555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12132853629788241360.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4105e+07,3.77727,98680,2175,466,135075,11844,344,477338,91,71090,0


Converting to forward existential form...Done !
original formula: EG(((i0.u2.s1<1)||(i0.u13.l941<1)))
=> equivalent forward existential formula: [FwdG(Init,((i0.u2.s1<1)||(i0.u13.l941<1)))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 422/422 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 175 transition count 282
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 175 transition count 282
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 107 place count 175 transition count 273
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 141 place count 141 transition count 229
Iterating global reduction 1 with 34 rules applied. Total rules applied 175 place count 141 transition count 229
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 184 place count 141 transition count 220
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 204 place count 121 transition count 191
Iterating global reduction 2 with 20 rules applied. Total rules applied 224 place count 121 transition count 191
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 234 place count 121 transition count 181
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 242 place count 113 transition count 167
Iterating global reduction 3 with 8 rules applied. Total rules applied 250 place count 113 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 255 place count 113 transition count 162
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 257 place count 111 transition count 160
Iterating global reduction 4 with 2 rules applied. Total rules applied 259 place count 111 transition count 160
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 261 place count 109 transition count 158
Iterating global reduction 4 with 2 rules applied. Total rules applied 263 place count 109 transition count 158
Applied a total of 263 rules in 13 ms. Remains 109 /224 variables (removed 115) and now considering 158/422 (removed 264) transitions.
// Phase 1: matrix 158 rows 109 cols
[2024-05-21 20:22:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:22:48] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 20:22:48] [INFO ] Invariant cache hit.
[2024-05-21 20:22:48] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 20:22:48] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-21 20:22:48] [INFO ] Invariant cache hit.
[2024-05-21 20:22:48] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/267 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 63/174 constraints. Problems are: Problem set: 0 solved, 157 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 174 constraints, problems are : Problem set: 0 solved, 157 unsolved in 3768 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/267 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 63/174 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 157/331 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 331 constraints, problems are : Problem set: 0 solved, 157 unsolved in 8480 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
After SMT, in 12382ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 12384ms
Starting structural reductions in LTL mode, iteration 1 : 109/224 places, 158/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12638 ms. Remains : 109/224 places, 158/422 transitions.
[2024-05-21 20:23:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:23:01] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:23:01] [INFO ] Input system was already deterministic with 158 transitions.
[2024-05-21 20:23:01] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:23:01] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:23:01] [INFO ] Time to serialize gal into /tmp/CTLFireability10548271348924287658.gal : 1 ms
[2024-05-21 20:23:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2173741483591475526.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/CTLFireability10548271348924287658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2173741483591475526.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 20:23:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:23:31] [INFO ] Applying decomposition
[2024-05-21 20:23:31] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10196968451474016345.txt' '-o' '/tmp/graph10196968451474016345.bin' '-w' '/tmp/graph10196968451474016345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10196968451474016345.bin' '-l' '-1' '-v' '-w' '/tmp/graph10196968451474016345.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:23:31] [INFO ] Decomposing Gal with order
[2024-05-21 20:23:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:23:31] [INFO ] Removed a total of 177 redundant transitions.
[2024-05-21 20:23:31] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:23:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 2 ms.
[2024-05-21 20:23:31] [INFO ] Time to serialize gal into /tmp/CTLFireability3320197117124370242.gal : 2 ms
[2024-05-21 20:23:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7263972512958631026.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/CTLFireability3320197117124370242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7263972512958631026.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 20:24:01] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:24:01] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:24:01] [INFO ] Applying decomposition
[2024-05-21 20:24:01] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10927699397186255490.txt' '-o' '/tmp/graph10927699397186255490.bin' '-w' '/tmp/graph10927699397186255490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10927699397186255490.bin' '-l' '-1' '-v' '-w' '/tmp/graph10927699397186255490.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:24:01] [INFO ] Decomposing Gal with order
[2024-05-21 20:24:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:24:01] [INFO ] Removed a total of 352 redundant transitions.
[2024-05-21 20:24:01] [INFO ] Flatten gal took : 25 ms
[2024-05-21 20:24:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 348 labels/synchronizations in 5 ms.
[2024-05-21 20:24:01] [INFO ] Time to serialize gal into /tmp/CTLFireability6951498731383025537.gal : 3 ms
[2024-05-21 20:24:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2190959716698438278.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/CTLFireability6951498731383025537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2190959716698438278.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 20:32:24] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:32:24] [INFO ] Time to serialize gal into /tmp/CTLFireability17229751201644884203.gal : 2 ms
[2024-05-21 20:32:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6306649722078101209.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/CTLFireability17229751201644884203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6306649722078101209.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 13 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-21 20:42:58] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:42:58] [INFO ] Input system was already deterministic with 422 transitions.
[2024-05-21 20:42:58] [INFO ] Transformed 224 places.
[2024-05-21 20:42:58] [INFO ] Transformed 422 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 20:42:58] [INFO ] Time to serialize gal into /tmp/CTLFireability2682839577052845620.gal : 3 ms
[2024-05-21 20:42:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6555320296942718948.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/CTLFireability2682839577052845620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6555320296942718948.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 13 CTL formulae.

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

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