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.r180-tall-171640602500042.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 FlexibleBarrier-PT-08b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602500042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 241K 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 FlexibleBarrier-PT-08b-CTLFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2023-12
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2023-13
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2023-14
FORMULA_NAME FlexibleBarrier-PT-08b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716416616191

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 22:23:37] [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-22 22:23:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:23:37] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-22 22:23:37] [INFO ] Transformed 920 places.
[2024-05-22 22:23:37] [INFO ] Transformed 1057 transitions.
[2024-05-22 22:23:37] [INFO ] Found NUPN structural information;
[2024-05-22 22:23:37] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Support contains 112 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 300 places :
Symmetric choice reduction at 0 with 300 rule applications. Total rules 300 place count 620 transition count 757
Iterating global reduction 0 with 300 rules applied. Total rules applied 600 place count 620 transition count 757
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 722 place count 498 transition count 635
Iterating global reduction 0 with 122 rules applied. Total rules applied 844 place count 498 transition count 635
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 903 place count 439 transition count 576
Iterating global reduction 0 with 59 rules applied. Total rules applied 962 place count 439 transition count 576
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 977 place count 439 transition count 561
Applied a total of 977 rules in 146 ms. Remains 439 /920 variables (removed 481) and now considering 561/1057 (removed 496) transitions.
// Phase 1: matrix 561 rows 439 cols
[2024-05-22 22:23:37] [INFO ] Computed 10 invariants in 25 ms
[2024-05-22 22:23:38] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-22 22:23:38] [INFO ] Invariant cache hit.
[2024-05-22 22:23:38] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Running 560 sub problems to find dead transitions.
[2024-05-22 22:23:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-05-22 22:23:45] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 20 ms to minimize.
[2024-05-22 22:23:45] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 3 ms to minimize.
[2024-05-22 22:23:46] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 3 ms to minimize.
[2024-05-22 22:23:46] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 4 ms to minimize.
[2024-05-22 22:23:46] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 2 ms to minimize.
[2024-05-22 22:23:47] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (OVERLAPS) 561/1000 variables, 439/455 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-05-22 22:23:59] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:24:02] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 457 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (OVERLAPS) 561/1000 variables, 439/457 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 560/1017 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-05-22 22:24:19] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 3 ms to minimize.
[2024-05-22 22:24:20] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2024-05-22 22:24:21] [INFO ] Deduced a trap composed of 296 places in 119 ms of which 3 ms to minimize.
[2024-05-22 22:24:21] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-22 22:24:22] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2024-05-22 22:24:23] [INFO ] Deduced a trap composed of 135 places in 119 ms of which 3 ms to minimize.
[2024-05-22 22:24:23] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-22 22:24:25] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-05-22 22:24:26] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:24:26] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 2 ms to minimize.
[2024-05-22 22:24:27] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-05-22 22:24:28] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
[2024-05-22 22:24:29] [INFO ] Deduced a trap composed of 270 places in 130 ms of which 2 ms to minimize.
[2024-05-22 22:24:29] [INFO ] Deduced a trap composed of 294 places in 133 ms of which 2 ms to minimize.
[2024-05-22 22:24:30] [INFO ] Deduced a trap composed of 290 places in 120 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 15/1032 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1032 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 23/23 constraints]
After SMT, in 60307ms problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Starting structural reductions in LTL mode, iteration 1 : 439/920 places, 561/1057 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61173 ms. Remains : 439/920 places, 561/1057 transitions.
Support contains 112 out of 439 places after structural reductions.
[2024-05-22 22:24:39] [INFO ] Flatten gal took : 56 ms
[2024-05-22 22:24:39] [INFO ] Flatten gal took : 29 ms
[2024-05-22 22:24:39] [INFO ] Input system was already deterministic with 561 transitions.
Support contains 108 out of 439 places (down from 112) after GAL structural reductions.
RANDOM walk for 40000 steps (627 resets) in 2068 ms. (19 steps per ms) remains 45/79 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
[2024-05-22 22:24:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 1 (OVERLAPS) 384/439 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 561/1000 variables, 439/449 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 0/1000 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 449 constraints, problems are : Problem set: 1 solved, 40 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 385/439 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 40 unsolved
[2024-05-22 22:24:41] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 3 ms to minimize.
[2024-05-22 22:24:41] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 2 ms to minimize.
[2024-05-22 22:24:41] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 22:24:42] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 2 ms to minimize.
[2024-05-22 22:24:42] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 2 ms to minimize.
[2024-05-22 22:24:42] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
Problem AtomicPropp36 is UNSAT
[2024-05-22 22:24:42] [INFO ] Deduced a trap composed of 100 places in 49 ms of which 1 ms to minimize.
[2024-05-22 22:24:42] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-22 22:24:42] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 3 ms to minimize.
[2024-05-22 22:24:42] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-22 22:24:42] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 3 ms to minimize.
[2024-05-22 22:24:43] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 12/22 constraints. Problems are: Problem set: 2 solved, 39 unsolved
[2024-05-22 22:24:43] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 1/23 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 561/1000 variables, 439/462 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 39/501 constraints. Problems are: Problem set: 2 solved, 39 unsolved
[2024-05-22 22:24:44] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 1/502 constraints. Problems are: Problem set: 2 solved, 39 unsolved
[2024-05-22 22:24:45] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:24:45] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:24:45] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 3/505 constraints. Problems are: Problem set: 2 solved, 39 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 505 constraints, problems are : Problem set: 2 solved, 39 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 39/41 constraints, Known Traps: 17/17 constraints]
After SMT, in 6481ms problems are : Problem set: 2 solved, 39 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 561/561 transitions.
Graph (trivial) has 287 edges and 439 vertex of which 36 / 439 are part of one of the 6 SCC in 12 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 409 transition count 482
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 366 transition count 479
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 364 transition count 479
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 92 place count 364 transition count 460
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 130 place count 345 transition count 460
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 165 place count 310 transition count 425
Iterating global reduction 3 with 35 rules applied. Total rules applied 200 place count 310 transition count 425
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 205 place count 310 transition count 420
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 210 place count 305 transition count 415
Iterating global reduction 4 with 5 rules applied. Total rules applied 215 place count 305 transition count 415
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 218 place count 305 transition count 412
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 5 with 112 rules applied. Total rules applied 330 place count 249 transition count 356
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 332 place count 247 transition count 354
Iterating global reduction 5 with 2 rules applied. Total rules applied 334 place count 247 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 336 place count 247 transition count 352
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 338 place count 246 transition count 352
Free-agglomeration rule applied 71 times.
Iterating global reduction 6 with 71 rules applied. Total rules applied 409 place count 246 transition count 281
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 6 with 71 rules applied. Total rules applied 480 place count 175 transition count 281
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 481 place count 174 transition count 280
Iterating global reduction 7 with 1 rules applied. Total rules applied 482 place count 174 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 483 place count 174 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 493 place count 174 transition count 269
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 495 place count 174 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 496 place count 173 transition count 268
Applied a total of 496 rules in 144 ms. Remains 173 /439 variables (removed 266) and now considering 268/561 (removed 293) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 173/439 places, 268/561 transitions.
RANDOM walk for 40000 steps (674 resets) in 972 ms. (41 steps per ms) remains 8/39 properties
BEST_FIRST walk for 40002 steps (106 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (112 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (111 resets) in 56 ms. (701 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (113 resets) in 41 ms. (952 steps per ms) remains 6/7 properties
[2024-05-22 22:24:47] [INFO ] Flow matrix only has 258 transitions (discarded 10 similar events)
// Phase 1: matrix 258 rows 173 cols
[2024-05-22 22:24:47] [INFO ] Computed 10 invariants in 9 ms
[2024-05-22 22:24:47] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 143/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 251/405 variables, 154/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 23/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 25/430 variables, 18/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/431 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/431 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 206 constraints, problems are : Problem set: 0 solved, 6 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 143/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 22:24:47] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 251/405 variables, 154/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 23/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 25/430 variables, 18/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/431 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/431 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 213 constraints, problems are : Problem set: 0 solved, 6 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 728ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 1451 steps, including 48 resets, run visited all 1 properties in 4 ms. (steps per millisecond=362 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 255 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-22 22:24:48] [INFO ] Flatten gal took : 23 ms
[2024-05-22 22:24:48] [INFO ] Flatten gal took : 23 ms
[2024-05-22 22:24:48] [INFO ] Input system was already deterministic with 561 transitions.
Support contains 103 out of 439 places (down from 105) after GAL structural reductions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Graph (trivial) has 357 edges and 439 vertex of which 49 / 439 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 398 transition count 464
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 343 transition count 464
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 111 place count 343 transition count 438
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 163 place count 317 transition count 438
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 231 place count 249 transition count 370
Iterating global reduction 2 with 68 rules applied. Total rules applied 299 place count 249 transition count 370
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 304 place count 249 transition count 365
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 320 place count 233 transition count 349
Iterating global reduction 3 with 16 rules applied. Total rules applied 336 place count 233 transition count 349
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 352 place count 233 transition count 333
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 400 place count 209 transition count 309
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 409 place count 200 transition count 300
Iterating global reduction 4 with 9 rules applied. Total rules applied 418 place count 200 transition count 300
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 427 place count 200 transition count 291
Applied a total of 427 rules in 53 ms. Remains 200 /439 variables (removed 239) and now considering 291/561 (removed 270) transitions.
[2024-05-22 22:24:48] [INFO ] Flow matrix only has 277 transitions (discarded 14 similar events)
// Phase 1: matrix 277 rows 200 cols
[2024-05-22 22:24:48] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 22:24:48] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 22:24:48] [INFO ] Flow matrix only has 277 transitions (discarded 14 similar events)
[2024-05-22 22:24:48] [INFO ] Invariant cache hit.
[2024-05-22 22:24:48] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-22 22:24:48] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-22 22:24:48] [INFO ] Redundant transitions in 18 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-22 22:24:48] [INFO ] Flow matrix only has 277 transitions (discarded 14 similar events)
[2024-05-22 22:24:48] [INFO ] Invariant cache hit.
[2024-05-22 22:24:48] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-22 22:24:51] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-22 22:24:51] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-22 22:24:51] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-22 22:24:51] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 22:24:51] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 22:24:52] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:24:52] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 22:24:52] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-22 22:24:52] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:24:52] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 276/476 variables, 200/220 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 33/253 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/477 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/477 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 254 constraints, problems are : Problem set: 0 solved, 290 unsolved in 15053 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 276/476 variables, 200/220 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 33/253 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 290/543 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/477 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/477 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 544 constraints, problems are : Problem set: 0 solved, 290 unsolved in 17206 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 10/10 constraints]
After SMT, in 32384ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 32392ms
Starting structural reductions in SI_CTL mode, iteration 1 : 200/439 places, 291/561 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32727 ms. Remains : 200/439 places, 291/561 transitions.
[2024-05-22 22:25:21] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:25:21] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:25:21] [INFO ] Input system was already deterministic with 291 transitions.
[2024-05-22 22:25:21] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:25:21] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:25:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10351123288307105586.gal : 8 ms
[2024-05-22 22:25:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11000515120555229571.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/CTLFireability10351123288307105586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11000515120555229571.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.16872e+12,3.38036,102508,2,10923,5,545155,6,0,1085,369111,0


Converting to forward existential form...Done !
original formula: EF(EG((((AG(((p606==1)||(p280==1))) + AF((p655==0))) + EG((p48==1))) * ((p905==1)||(p474==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((!(E(TRUE U !(((p606==1)||(p280==1))))) + !(EG(!((p655==0))))) + EG((p48==1))) * ((p905=...182
Reverse transition relation is NOT exact ! Due to transitions t61, t88, t164, t195, t197, t200, t202, t203, t205, t207, t209, t212, t290, Intersection wit...238
Detected timeout of ITS tools.
[2024-05-22 22:25:51] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:25:51] [INFO ] Applying decomposition
[2024-05-22 22:25:51] [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/graph2696594065655881022.txt' '-o' '/tmp/graph2696594065655881022.bin' '-w' '/tmp/graph2696594065655881022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2696594065655881022.bin' '-l' '-1' '-v' '-w' '/tmp/graph2696594065655881022.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:25:51] [INFO ] Decomposing Gal with order
[2024-05-22 22:25:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:25:51] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-22 22:25:51] [INFO ] Flatten gal took : 50 ms
[2024-05-22 22:25:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 8 ms.
[2024-05-22 22:25:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1813924228822794207.gal : 5 ms
[2024-05-22 22:25:51] [INFO ] Time to serialize properties into /tmp/CTLFireability137804325965939989.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/CTLFireability1813924228822794207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability137804325965939989.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16872e+12,0.062651,5812,104,150,2094,5243,570,2932,384,2990,0


Converting to forward existential form...Done !
original formula: EF(EG((((AG(((i8.u21.p606==1)||(i4.u9.p280==1))) + AF((i3.u25.p655==0))) + EG((i0.u2.p48==1))) * ((u24.p905==1)||(i6.u17.p474==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((!(E(TRUE U !(((i8.u21.p606==1)||(i4.u9.p280==1))))) + !(EG(!((i3.u25.p655==0))))) + EG(...219
Reverse transition relation is NOT exact ! Due to transitions t202, t290, i0.t195, i0.u2.t164, i1.t197, i2.t200, i4.t203, i5.t205, i6.t207, i6.u17.t88, i7....282
Using saturation style SCC detection
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,4.06321,146732,1,0,133316,232297,3455,227157,1867,307536,516606
FORMULA FlexibleBarrier-PT-08b-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Graph (trivial) has 412 edges and 439 vertex of which 49 / 439 are part of one of the 8 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 397 transition count 461
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 340 transition count 461
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 115 place count 340 transition count 435
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 167 place count 314 transition count 435
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 238 place count 243 transition count 364
Iterating global reduction 2 with 71 rules applied. Total rules applied 309 place count 243 transition count 364
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 314 place count 243 transition count 359
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 314 place count 243 transition count 358
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 316 place count 242 transition count 358
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 333 place count 225 transition count 341
Iterating global reduction 3 with 17 rules applied. Total rules applied 350 place count 225 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 367 place count 225 transition count 324
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 411 place count 203 transition count 302
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 422 place count 192 transition count 291
Iterating global reduction 4 with 11 rules applied. Total rules applied 433 place count 192 transition count 291
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 444 place count 192 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 452 place count 192 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 454 place count 190 transition count 270
Applied a total of 454 rules in 81 ms. Remains 190 /439 variables (removed 249) and now considering 270/561 (removed 291) transitions.
[2024-05-22 22:25:55] [INFO ] Flow matrix only has 263 transitions (discarded 7 similar events)
// Phase 1: matrix 263 rows 190 cols
[2024-05-22 22:25:55] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:25:55] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 22:25:55] [INFO ] Flow matrix only has 263 transitions (discarded 7 similar events)
[2024-05-22 22:25:55] [INFO ] Invariant cache hit.
[2024-05-22 22:25:55] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-22 22:25:55] [INFO ] Redundant transitions in 2 ms returned []
Running 147 sub problems to find dead transitions.
[2024-05-22 22:25:55] [INFO ] Flow matrix only has 263 transitions (discarded 7 similar events)
[2024-05-22 22:25:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 262/452 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/453 variables, and 200 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 262/452 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 147/347 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/452 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/453 variables, and 347 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4403 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 8649ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 8650ms
Starting structural reductions in SI_CTL mode, iteration 1 : 190/439 places, 270/561 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8957 ms. Remains : 190/439 places, 270/561 transitions.
[2024-05-22 22:26:04] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:26:04] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:26:04] [INFO ] Input system was already deterministic with 270 transitions.
[2024-05-22 22:26:04] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:26:04] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:26:04] [INFO ] Time to serialize gal into /tmp/CTLFireability1913654186700816570.gal : 2 ms
[2024-05-22 22:26:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13582310890490212955.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/CTLFireability1913654186700816570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13582310890490212955.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.79643e+11,1.08049,39564,2,4298,5,220153,6,0,1025,99567,0


Converting to forward existential form...Done !
original formula: EG(AF(AG((p624==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !((p624==0))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-22 22:26:34] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:26:34] [INFO ] Applying decomposition
[2024-05-22 22:26:34] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9845966065368620902.txt' '-o' '/tmp/graph9845966065368620902.bin' '-w' '/tmp/graph9845966065368620902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9845966065368620902.bin' '-l' '-1' '-v' '-w' '/tmp/graph9845966065368620902.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:26:34] [INFO ] Decomposing Gal with order
[2024-05-22 22:26:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:26:34] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-22 22:26:34] [INFO ] Flatten gal took : 20 ms
[2024-05-22 22:26:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 3 ms.
[2024-05-22 22:26:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4320287832732840945.gal : 3 ms
[2024-05-22 22:26:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6325432357610462135.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/CTLFireability4320287832732840945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6325432357610462135.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,7.79643e+11,0.041819,5476,32,100,1186,956,413,1827,339,962,0


Converting to forward existential form...Done !
original formula: EG(AF(AG((i7.u23.p624==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !((i7.u23.p624==0))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 377 transition count 499
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 377 transition count 499
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 129 place count 377 transition count 494
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 164 place count 342 transition count 459
Iterating global reduction 1 with 35 rules applied. Total rules applied 199 place count 342 transition count 459
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 217 place count 342 transition count 441
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 227 place count 332 transition count 431
Iterating global reduction 2 with 10 rules applied. Total rules applied 237 place count 332 transition count 431
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 246 place count 332 transition count 422
Applied a total of 246 rules in 33 ms. Remains 332 /439 variables (removed 107) and now considering 422/561 (removed 139) transitions.
// Phase 1: matrix 422 rows 332 cols
[2024-05-22 22:27:04] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:27:04] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 22:27:04] [INFO ] Invariant cache hit.
[2024-05-22 22:27:05] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-22 22:27:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/754 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/754 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (OVERLAPS) 0/754 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 342 constraints, problems are : Problem set: 0 solved, 421 unsolved in 18037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 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/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/754 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/754 variables, 421/763 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 22:27:29] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 6 ms to minimize.
[2024-05-22 22:27:30] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:27:31] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:27:31] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:27:32] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-05-22 22:27:33] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 1 ms to minimize.
[2024-05-22 22:27:33] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 7/770 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 22:27:51] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 754/754 variables, and 771 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 8/8 constraints]
After SMT, in 48181ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 48185ms
Starting structural reductions in LTL mode, iteration 1 : 332/439 places, 422/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48616 ms. Remains : 332/439 places, 422/561 transitions.
[2024-05-22 22:27:53] [INFO ] Flatten gal took : 20 ms
[2024-05-22 22:27:53] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:27:53] [INFO ] Input system was already deterministic with 422 transitions.
[2024-05-22 22:27:53] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:27:53] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:27:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6954316452706683204.gal : 2 ms
[2024-05-22 22:27:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15531186244252474022.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/CTLFireability6954316452706683204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15531186244252474022.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-22 22:28:23] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:28:23] [INFO ] Applying decomposition
[2024-05-22 22:28:23] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13097905073817824329.txt' '-o' '/tmp/graph13097905073817824329.bin' '-w' '/tmp/graph13097905073817824329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13097905073817824329.bin' '-l' '-1' '-v' '-w' '/tmp/graph13097905073817824329.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:28:23] [INFO ] Decomposing Gal with order
[2024-05-22 22:28:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:28:23] [INFO ] Removed a total of 207 redundant transitions.
[2024-05-22 22:28:23] [INFO ] Flatten gal took : 25 ms
[2024-05-22 22:28:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 10 ms.
[2024-05-22 22:28:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4177127279795185435.gal : 5 ms
[2024-05-22 22:28:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5599292788659854972.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/CTLFireability4177127279795185435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5599292788659854972.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.97177e+14,15.8505,409212,6662,1380,749416,16436,954,1.39686e+06,381,130744,0


Converting to forward existential form...Done !
original formula: AG(EX(!(A(((u81.p905==1)||(((i3.i1.u22.p143==1)&&(i12.i0.u71.p592==1))&&(u81.p716==1))) U ((i9.i1.u51.p418==1)&&(i0.i0.u5.p33==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!((E(!(((i9.i1.u51.p418==1)&&(i0.i0.u5.p33==1))) U (!(((u81.p905==1)||(((i3.i1.u22.p1...315
Reverse transition relation is NOT exact ! Due to transitions t1, t88, t89, t120, t121, t151, t152, t182, t183, t213, t214, t244, t245, t276, t339, t340, t...932
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 381 transition count 503
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 381 transition count 503
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 120 place count 381 transition count 499
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 153 place count 348 transition count 466
Iterating global reduction 1 with 33 rules applied. Total rules applied 186 place count 348 transition count 466
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 203 place count 348 transition count 449
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 212 place count 339 transition count 440
Iterating global reduction 2 with 9 rules applied. Total rules applied 221 place count 339 transition count 440
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 229 place count 339 transition count 432
Applied a total of 229 rules in 28 ms. Remains 339 /439 variables (removed 100) and now considering 432/561 (removed 129) transitions.
// Phase 1: matrix 432 rows 339 cols
[2024-05-22 22:28:53] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 22:28:53] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 22:28:53] [INFO ] Invariant cache hit.
[2024-05-22 22:28:54] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-05-22 22:28:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-22 22:28:58] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 432/771 variables, 339/350 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 6 (OVERLAPS) 0/771 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 431 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 350 constraints, problems are : Problem set: 0 solved, 431 unsolved in 23712 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 432/771 variables, 339/350 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 431/781 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-22 22:29:24] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:29:25] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 3 ms to minimize.
[2024-05-22 22:29:26] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-22 22:29:26] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 2 ms to minimize.
[2024-05-22 22:29:27] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-22 22:29:27] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2024-05-22 22:29:28] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-22 22:29:29] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:29:30] [INFO ] Deduced a trap composed of 253 places in 93 ms of which 2 ms to minimize.
[2024-05-22 22:29:30] [INFO ] Deduced a trap composed of 279 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:29:30] [INFO ] Deduced a trap composed of 254 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 11/792 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-22 22:29:37] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:29:41] [INFO ] Deduced a trap composed of 253 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 2/794 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-05-22 22:29:46] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/771 variables, and 795 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 15/15 constraints]
After SMT, in 53859ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 53863ms
Starting structural reductions in LTL mode, iteration 1 : 339/439 places, 432/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54288 ms. Remains : 339/439 places, 432/561 transitions.
[2024-05-22 22:29:47] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:29:48] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:29:48] [INFO ] Input system was already deterministic with 432 transitions.
[2024-05-22 22:29:48] [INFO ] Flatten gal took : 22 ms
[2024-05-22 22:29:48] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:29:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6902898290661867262.gal : 10 ms
[2024-05-22 22:29:48] [INFO ] Time to serialize properties into /tmp/CTLFireability17332570023277410301.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/CTLFireability6902898290661867262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17332570023277410301.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-22 22:30:18] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:30:18] [INFO ] Applying decomposition
[2024-05-22 22:30:18] [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/graph2204355786533959475.txt' '-o' '/tmp/graph2204355786533959475.bin' '-w' '/tmp/graph2204355786533959475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2204355786533959475.bin' '-l' '-1' '-v' '-w' '/tmp/graph2204355786533959475.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:30:18] [INFO ] Decomposing Gal with order
[2024-05-22 22:30:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:30:18] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-22 22:30:18] [INFO ] Flatten gal took : 21 ms
[2024-05-22 22:30:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 7 ms.
[2024-05-22 22:30:18] [INFO ] Time to serialize gal into /tmp/CTLFireability7966254839039774136.gal : 4 ms
[2024-05-22 22:30:18] [INFO ] Time to serialize properties into /tmp/CTLFireability16958129972021682846.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/CTLFireability7966254839039774136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16958129972021682846.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.50224e+14,15.4443,417744,13636,1493,789046,45391,1024,1.46925e+06,392,159932,0


Converting to forward existential form...Done !
original formula: AG((AG(E((i14.u84.p707==1) U (((i6.i0.u33.p340==1)&&(i12.u74.p611==1))&&(i14.u84.p886==1)))) + (((i6.i0.u42.p337==0) * (AF((i3.i2.u86.p91...389
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(!(E(TRUE U !(E((i14.u84.p707==1) U (((i6.i0.u33.p340==1)&&(i12.u74.p611==1))&&(i14.u84....1162
Reverse transition relation is NOT exact ! Due to transitions t1, t63, t94, t95, t126, t140, t158, t190, t191, t221, t235, t252, t266, t284, t346, t348, t3...956
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 387 transition count 509
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 387 transition count 509
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 387 transition count 506
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 137 place count 357 transition count 476
Iterating global reduction 1 with 30 rules applied. Total rules applied 167 place count 357 transition count 476
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 183 place count 357 transition count 460
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 190 place count 350 transition count 453
Iterating global reduction 2 with 7 rules applied. Total rules applied 197 place count 350 transition count 453
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 204 place count 350 transition count 446
Applied a total of 204 rules in 24 ms. Remains 350 /439 variables (removed 89) and now considering 446/561 (removed 115) transitions.
// Phase 1: matrix 446 rows 350 cols
[2024-05-22 22:30:48] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 22:30:48] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 22:30:48] [INFO ] Invariant cache hit.
[2024-05-22 22:30:48] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-22 22:30:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/350 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-22 22:30:53] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-22 22:30:53] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2024-05-22 22:30:54] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2024-05-22 22:30:55] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (OVERLAPS) 446/796 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (OVERLAPS) 0/796 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 445 unsolved
No progress, stopping.
After SMT solving in domain Real declared 796/796 variables, and 364 constraints, problems are : Problem set: 0 solved, 445 unsolved in 25897 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 350/350 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/350 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (OVERLAPS) 446/796 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 445/809 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-22 22:31:22] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:31:22] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-22 22:31:23] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-05-22 22:31:24] [INFO ] Deduced a trap composed of 103 places in 74 ms of which 2 ms to minimize.
[2024-05-22 22:31:25] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2024-05-22 22:31:26] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-05-22 22:31:27] [INFO ] Deduced a trap composed of 258 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:31:27] [INFO ] Deduced a trap composed of 265 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 8/817 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-22 22:31:33] [INFO ] Deduced a trap composed of 111 places in 73 ms of which 2 ms to minimize.
[2024-05-22 22:31:33] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 2 ms to minimize.
[2024-05-22 22:31:38] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/796 variables, 3/820 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/796 variables, and 820 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 350/350 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 15/15 constraints]
After SMT, in 56034ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 56038ms
Starting structural reductions in LTL mode, iteration 1 : 350/439 places, 446/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56340 ms. Remains : 350/439 places, 446/561 transitions.
[2024-05-22 22:31:44] [INFO ] Flatten gal took : 14 ms
[2024-05-22 22:31:44] [INFO ] Flatten gal took : 14 ms
[2024-05-22 22:31:44] [INFO ] Input system was already deterministic with 446 transitions.
[2024-05-22 22:31:44] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:31:44] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:31:44] [INFO ] Time to serialize gal into /tmp/CTLFireability7444501160609577426.gal : 2 ms
[2024-05-22 22:31:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3130502466995228425.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/CTLFireability7444501160609577426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3130502466995228425.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-22 22:32:14] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:32:14] [INFO ] Applying decomposition
[2024-05-22 22:32:14] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2878587668025644843.txt' '-o' '/tmp/graph2878587668025644843.bin' '-w' '/tmp/graph2878587668025644843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2878587668025644843.bin' '-l' '-1' '-v' '-w' '/tmp/graph2878587668025644843.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:32:14] [INFO ] Decomposing Gal with order
[2024-05-22 22:32:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:32:14] [INFO ] Removed a total of 213 redundant transitions.
[2024-05-22 22:32:14] [INFO ] Flatten gal took : 19 ms
[2024-05-22 22:32:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 7 ms.
[2024-05-22 22:32:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14435023536830820288.gal : 4 ms
[2024-05-22 22:32:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13733805781709473688.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/CTLFireability14435023536830820288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13733805781709473688.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,4.57471e+14,12.7874,373012,8591,2218,664099,42516,1151,1.53476e+06,400,168786,0


Converting to forward existential form...Done !
original formula: A(((A((i14.u86.p754==1) U ((AF((((i1.i1.u24.p172==1)&&(i2.i1.u34.p209==1))&&(i14.u87.p726==1))) + (AX((i5.i1.u37.p283==1)) * (i11.i0.u72....613
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((((EX((((i7.i1.u47.p424==1)&&(i12.u84.p615==1))&&(i14.u87.p891==1))) * !((E(!((i6.i1.u49...2089
Reverse transition relation is NOT exact ! Due to transitions t1, t64, t95, t96, t127, t128, t158, t173, t204, t228, t261, t293, t356, t357, t358, t359, t3...1029
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Graph (trivial) has 411 edges and 439 vertex of which 49 / 439 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 397 transition count 461
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 340 transition count 461
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 115 place count 340 transition count 436
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 165 place count 315 transition count 436
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 237 place count 243 transition count 364
Iterating global reduction 2 with 72 rules applied. Total rules applied 309 place count 243 transition count 364
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 314 place count 243 transition count 359
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 314 place count 243 transition count 358
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 316 place count 242 transition count 358
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 333 place count 225 transition count 341
Iterating global reduction 3 with 17 rules applied. Total rules applied 350 place count 225 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 367 place count 225 transition count 324
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 411 place count 203 transition count 302
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 423 place count 191 transition count 290
Iterating global reduction 4 with 12 rules applied. Total rules applied 435 place count 191 transition count 290
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 447 place count 191 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 455 place count 191 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 457 place count 189 transition count 268
Applied a total of 457 rules in 50 ms. Remains 189 /439 variables (removed 250) and now considering 268/561 (removed 293) transitions.
[2024-05-22 22:32:45] [INFO ] Flow matrix only has 261 transitions (discarded 7 similar events)
// Phase 1: matrix 261 rows 189 cols
[2024-05-22 22:32:45] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:32:45] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-22 22:32:45] [INFO ] Flow matrix only has 261 transitions (discarded 7 similar events)
[2024-05-22 22:32:45] [INFO ] Invariant cache hit.
[2024-05-22 22:32:45] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-05-22 22:32:45] [INFO ] Redundant transitions in 4 ms returned []
Running 146 sub problems to find dead transitions.
[2024-05-22 22:32:45] [INFO ] Flow matrix only has 261 transitions (discarded 7 similar events)
[2024-05-22 22:32:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 9/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 260/449 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/449 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/450 variables, and 199 constraints, problems are : Problem set: 0 solved, 146 unsolved in 4128 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 9/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 260/449 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 146/345 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/449 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/450 variables, and 345 constraints, problems are : Problem set: 0 solved, 146 unsolved in 4477 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 8650ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 8652ms
Starting structural reductions in SI_CTL mode, iteration 1 : 189/439 places, 268/561 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8962 ms. Remains : 189/439 places, 268/561 transitions.
[2024-05-22 22:32:53] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:32:53] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:32:53] [INFO ] Input system was already deterministic with 268 transitions.
[2024-05-22 22:32:54] [INFO ] Flatten gal took : 21 ms
[2024-05-22 22:32:54] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:32:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7881660614728938909.gal : 7 ms
[2024-05-22 22:32:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1034778750433181646.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7881660614728938909.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1034778750433181646.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1034778750433181646.prop.
RANDOM walk for 40000 steps (2194 resets) in 459 ms. (86 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 48
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :48 after 512
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :512 after 125440
BEST_FIRST walk for 40004 steps (64 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :125440 after 7.22534e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :7.22534e+06 after 1.91319e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.91319e+09 after 7.78561e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.78561e+09 after 1.00084e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.00084e+10 after 1.00277e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.00277e+10 after 1.00436e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.00436e+10 after 1.00606e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.00606e+10 after 1.02259e+10
Invariant property FlexibleBarrier-PT-08b-CTLFireability-2024-05 does not hold.
FORMULA FlexibleBarrier-PT-08b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.38263e+10,1.84941,50312,2,22450,17,247511,6,0,1019,127527,0
Total reachable state count : 33826337550

Verifying 1 reachability properties.
Invariant property FlexibleBarrier-PT-08b-CTLFireability-2024-05 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FlexibleBarrier-PT-08b-CTLFireability-2024-05,2.21184e+08,1.85297,50312,2,7396,17,247511,7,0,1025,127527,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 2153708 steps, run timeout after 3001 ms. (steps per millisecond=717 ) properties seen :0 out of 1
Probabilistic random walk after 2153708 steps, saw 400739 distinct states, run finished after 3004 ms. (steps per millisecond=716 ) properties seen :0
Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Graph (trivial) has 358 edges and 439 vertex of which 49 / 439 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 397 transition count 464
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 343 transition count 464
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 109 place count 343 transition count 437
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 163 place count 316 transition count 437
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 232 place count 247 transition count 368
Iterating global reduction 2 with 69 rules applied. Total rules applied 301 place count 247 transition count 368
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 306 place count 247 transition count 363
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 321 place count 232 transition count 348
Iterating global reduction 3 with 15 rules applied. Total rules applied 336 place count 232 transition count 348
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 350 place count 232 transition count 334
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 394 place count 210 transition count 312
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 407 place count 197 transition count 299
Iterating global reduction 4 with 13 rules applied. Total rules applied 420 place count 197 transition count 299
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 433 place count 197 transition count 286
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 435 place count 195 transition count 284
Applied a total of 435 rules in 37 ms. Remains 195 /439 variables (removed 244) and now considering 284/561 (removed 277) transitions.
[2024-05-22 22:32:57] [INFO ] Flow matrix only has 270 transitions (discarded 14 similar events)
// Phase 1: matrix 270 rows 195 cols
[2024-05-22 22:32:57] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:32:57] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 22:32:57] [INFO ] Flow matrix only has 270 transitions (discarded 14 similar events)
[2024-05-22 22:32:57] [INFO ] Invariant cache hit.
[2024-05-22 22:32:57] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-22 22:32:57] [INFO ] Redundant transitions in 2 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-22 22:32:57] [INFO ] Flow matrix only has 270 transitions (discarded 14 similar events)
[2024-05-22 22:32:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 269/464 variables, 195/205 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/465 variables, and 205 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6278 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 269/464 variables, 195/205 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 208/413 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/465 variables, and 413 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6903 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 13256ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 13260ms
Starting structural reductions in SI_CTL mode, iteration 1 : 195/439 places, 284/561 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13530 ms. Remains : 195/439 places, 284/561 transitions.
[2024-05-22 22:33:10] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:33:10] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:33:10] [INFO ] Input system was already deterministic with 284 transitions.
[2024-05-22 22:33:10] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:33:10] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:33:10] [INFO ] Time to serialize gal into /tmp/CTLFireability7809932199974869830.gal : 2 ms
[2024-05-22 22:33:10] [INFO ] Time to serialize properties into /tmp/CTLFireability12802964315033985559.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/CTLFireability7809932199974869830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12802964315033985559.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,9.96433e+11,2.53722,70876,2,6782,5,390279,6,0,1059,237780,0


Converting to forward existential form...Done !
original formula: E(!(AF((p390==1))) U ((p571==1) + EG(((p905==1) * AF((p17==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,!(!(EG(!((p390==1)))))) * (p571==1))] != FALSE + [FwdG(FwdU(Init,!(!(EG(!((p390==1)))))),((p905==1)...189
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 282/0/2
Detected timeout of ITS tools.
[2024-05-22 22:33:40] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:33:40] [INFO ] Applying decomposition
[2024-05-22 22:33:40] [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/graph2104363903515759203.txt' '-o' '/tmp/graph2104363903515759203.bin' '-w' '/tmp/graph2104363903515759203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2104363903515759203.bin' '-l' '-1' '-v' '-w' '/tmp/graph2104363903515759203.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:33:40] [INFO ] Decomposing Gal with order
[2024-05-22 22:33:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:33:40] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-22 22:33:40] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:33:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 2 ms.
[2024-05-22 22:33:40] [INFO ] Time to serialize gal into /tmp/CTLFireability18374572729943297860.gal : 2 ms
[2024-05-22 22:33:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14766706324716520366.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/CTLFireability18374572729943297860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14766706324716520366.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,9.96433e+11,0.044471,5532,51,102,1465,2143,523,2004,378,1532,0


Converting to forward existential form...Done !
original formula: E(!(AF((i4.u14.p390==1))) U ((i6.u19.p571==1) + EG(((u25.p905==1) * AF((i0.u2.p17==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,!(!(EG(!((i4.u14.p390==1)))))) * (i6.u19.p571==1))] != FALSE + [FwdG(FwdU(Init,!(!(EG(!((i4.u14.p39...220
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,28.5207,975648,1,0,735186,2.48682e+06,1997,1.08505e+06,1327,2.76161e+06,2187615
FORMULA FlexibleBarrier-PT-08b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 379 transition count 501
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 379 transition count 501
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 125 place count 379 transition count 496
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 160 place count 344 transition count 461
Iterating global reduction 1 with 35 rules applied. Total rules applied 195 place count 344 transition count 461
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 215 place count 344 transition count 441
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 223 place count 336 transition count 433
Iterating global reduction 2 with 8 rules applied. Total rules applied 231 place count 336 transition count 433
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 238 place count 336 transition count 426
Applied a total of 238 rules in 22 ms. Remains 336 /439 variables (removed 103) and now considering 426/561 (removed 135) transitions.
// Phase 1: matrix 426 rows 336 cols
[2024-05-22 22:34:09] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:34:09] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-22 22:34:09] [INFO ] Invariant cache hit.
[2024-05-22 22:34:09] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-22 22:34:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:34:14] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-22 22:34:14] [INFO ] Deduced a trap composed of 83 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 426/762 variables, 336/348 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 348 constraints, problems are : Problem set: 0 solved, 425 unsolved in 23358 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 426/762 variables, 336/348 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 425/773 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:34:40] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:34:41] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 3 ms to minimize.
[2024-05-22 22:34:41] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 22:34:42] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:34:43] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-22 22:34:44] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2024-05-22 22:34:45] [INFO ] Deduced a trap composed of 250 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:34:45] [INFO ] Deduced a trap composed of 254 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:34:46] [INFO ] Deduced a trap composed of 273 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 9/782 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:34:51] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-22 22:34:52] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/762 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 784 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 13/13 constraints]
After SMT, in 53491ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 53495ms
Starting structural reductions in LTL mode, iteration 1 : 336/439 places, 426/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53840 ms. Remains : 336/439 places, 426/561 transitions.
[2024-05-22 22:35:03] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:35:03] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:35:03] [INFO ] Input system was already deterministic with 426 transitions.
[2024-05-22 22:35:03] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:35:03] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:35:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13073654358327664007.gal : 2 ms
[2024-05-22 22:35:03] [INFO ] Time to serialize properties into /tmp/CTLFireability4843794234721871653.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/CTLFireability13073654358327664007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4843794234721871653.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-22 22:35:33] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:35:33] [INFO ] Applying decomposition
[2024-05-22 22:35:33] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9601793969443349675.txt' '-o' '/tmp/graph9601793969443349675.bin' '-w' '/tmp/graph9601793969443349675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9601793969443349675.bin' '-l' '-1' '-v' '-w' '/tmp/graph9601793969443349675.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:35:33] [INFO ] Decomposing Gal with order
[2024-05-22 22:35:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:35:33] [INFO ] Removed a total of 207 redundant transitions.
[2024-05-22 22:35:33] [INFO ] Flatten gal took : 29 ms
[2024-05-22 22:35:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 22:35:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11495935424746771702.gal : 3 ms
[2024-05-22 22:35:33] [INFO ] Time to serialize properties into /tmp/CTLFireability291129819188835250.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/CTLFireability11495935424746771702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability291129819188835250.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,3.33679e+14,18.2008,398708,8098,1379,687110,20766,959,1.7459e+06,377,133959,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 386 transition count 508
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 386 transition count 508
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 111 place count 386 transition count 503
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 140 place count 357 transition count 474
Iterating global reduction 1 with 29 rules applied. Total rules applied 169 place count 357 transition count 474
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 184 place count 357 transition count 459
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 190 place count 351 transition count 453
Iterating global reduction 2 with 6 rules applied. Total rules applied 196 place count 351 transition count 453
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 201 place count 351 transition count 448
Applied a total of 201 rules in 15 ms. Remains 351 /439 variables (removed 88) and now considering 448/561 (removed 113) transitions.
// Phase 1: matrix 448 rows 351 cols
[2024-05-22 22:36:03] [INFO ] Computed 10 invariants in 8 ms
[2024-05-22 22:36:03] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 22:36:03] [INFO ] Invariant cache hit.
[2024-05-22 22:36:03] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2024-05-22 22:36:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 448/799 variables, 351/361 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (OVERLAPS) 0/799 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 447 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 361 constraints, problems are : Problem set: 0 solved, 447 unsolved in 20088 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 448/799 variables, 351/361 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 447/808 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-22 22:36:31] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 3 ms to minimize.
[2024-05-22 22:36:32] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-22 22:36:32] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-22 22:36:33] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:36:34] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:36:34] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-05-22 22:36:35] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:36:35] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-05-22 22:36:36] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-22 22:36:37] [INFO ] Deduced a trap composed of 258 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:36:37] [INFO ] Deduced a trap composed of 256 places in 91 ms of which 2 ms to minimize.
[2024-05-22 22:36:37] [INFO ] Deduced a trap composed of 255 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 12/820 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-22 22:36:48] [INFO ] Deduced a trap composed of 259 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:36:48] [INFO ] Deduced a trap composed of 259 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 2/822 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/799 variables, and 822 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 14/14 constraints]
After SMT, in 50235ms problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 50239ms
Starting structural reductions in LTL mode, iteration 1 : 351/439 places, 448/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50589 ms. Remains : 351/439 places, 448/561 transitions.
[2024-05-22 22:36:54] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:36:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:36:54] [INFO ] Input system was already deterministic with 448 transitions.
[2024-05-22 22:36:54] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:36:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:36:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9035116758383247533.gal : 2 ms
[2024-05-22 22:36:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5646484583804032522.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/CTLFireability9035116758383247533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5646484583804032522.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-22 22:37:24] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:37:24] [INFO ] Applying decomposition
[2024-05-22 22:37:24] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17546992176221348183.txt' '-o' '/tmp/graph17546992176221348183.bin' '-w' '/tmp/graph17546992176221348183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17546992176221348183.bin' '-l' '-1' '-v' '-w' '/tmp/graph17546992176221348183.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:37:24] [INFO ] Decomposing Gal with order
[2024-05-22 22:37:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:37:24] [INFO ] Removed a total of 217 redundant transitions.
[2024-05-22 22:37:24] [INFO ] Flatten gal took : 18 ms
[2024-05-22 22:37:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 22:37:24] [INFO ] Time to serialize gal into /tmp/CTLFireability2388318981359432176.gal : 4 ms
[2024-05-22 22:37:24] [INFO ] Time to serialize properties into /tmp/CTLFireability1885474588952034984.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/CTLFireability2388318981359432176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1885474588952034984.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,4.79393e+14,25.3436,617784,14159,1549,1.15292e+06,34891,985,2.35573e+06,406,167885,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 378 transition count 500
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 378 transition count 500
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 127 place count 378 transition count 495
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 162 place count 343 transition count 460
Iterating global reduction 1 with 35 rules applied. Total rules applied 197 place count 343 transition count 460
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 216 place count 343 transition count 441
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 224 place count 335 transition count 433
Iterating global reduction 2 with 8 rules applied. Total rules applied 232 place count 335 transition count 433
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 239 place count 335 transition count 426
Applied a total of 239 rules in 20 ms. Remains 335 /439 variables (removed 104) and now considering 426/561 (removed 135) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-22 22:37:54] [INFO ] Computed 10 invariants in 10 ms
[2024-05-22 22:37:54] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 22:37:54] [INFO ] Invariant cache hit.
[2024-05-22 22:37:54] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-22 22:37:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/761 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/761 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 0/761 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 761/761 variables, and 345 constraints, problems are : Problem set: 0 solved, 425 unsolved in 18168 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/761 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/761 variables, 425/770 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:38:19] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:38:20] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:38:20] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:38:21] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
[2024-05-22 22:38:21] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 3 ms to minimize.
[2024-05-22 22:38:21] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:38:22] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-22 22:38:23] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 2 ms to minimize.
[2024-05-22 22:38:23] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 2 ms to minimize.
[2024-05-22 22:38:24] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 2 ms to minimize.
[2024-05-22 22:38:25] [INFO ] Deduced a trap composed of 251 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:38:25] [INFO ] Deduced a trap composed of 250 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:38:25] [INFO ] Deduced a trap composed of 251 places in 87 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/761 variables, 13/783 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:38:30] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-22 22:38:35] [INFO ] Deduced a trap composed of 251 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 2/785 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 785 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 15/15 constraints]
After SMT, in 48305ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 48308ms
Starting structural reductions in LTL mode, iteration 1 : 335/439 places, 426/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48675 ms. Remains : 335/439 places, 426/561 transitions.
[2024-05-22 22:38:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:38:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:38:43] [INFO ] Input system was already deterministic with 426 transitions.
[2024-05-22 22:38:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:38:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:38:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4232667078903759718.gal : 2 ms
[2024-05-22 22:38:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14948364500336273946.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/CTLFireability4232667078903759718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14948364500336273946.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-22 22:39:13] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:39:13] [INFO ] Applying decomposition
[2024-05-22 22:39:13] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11683978725223264772.txt' '-o' '/tmp/graph11683978725223264772.bin' '-w' '/tmp/graph11683978725223264772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11683978725223264772.bin' '-l' '-1' '-v' '-w' '/tmp/graph11683978725223264772.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:39:13] [INFO ] Decomposing Gal with order
[2024-05-22 22:39:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:39:13] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-22 22:39:13] [INFO ] Flatten gal took : 17 ms
[2024-05-22 22:39:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 22:39:13] [INFO ] Time to serialize gal into /tmp/CTLFireability11394597630379759266.gal : 3 ms
[2024-05-22 22:39:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3471141588111714113.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/CTLFireability11394597630379759266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3471141588111714113.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.14268e+14,20.6382,547604,11095,1536,1.02576e+06,27618,913,2.15261e+06,391,142133,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Graph (trivial) has 408 edges and 439 vertex of which 49 / 439 are part of one of the 8 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 397 transition count 462
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 341 transition count 462
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 113 place count 341 transition count 436
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 165 place count 315 transition count 436
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 236 place count 244 transition count 365
Iterating global reduction 2 with 71 rules applied. Total rules applied 307 place count 244 transition count 365
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 312 place count 244 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 312 place count 244 transition count 359
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 314 place count 243 transition count 359
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 330 place count 227 transition count 343
Iterating global reduction 3 with 16 rules applied. Total rules applied 346 place count 227 transition count 343
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 362 place count 227 transition count 327
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 406 place count 205 transition count 305
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 418 place count 193 transition count 293
Iterating global reduction 4 with 12 rules applied. Total rules applied 430 place count 193 transition count 293
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 442 place count 193 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 450 place count 193 transition count 273
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 452 place count 191 transition count 271
Applied a total of 452 rules in 53 ms. Remains 191 /439 variables (removed 248) and now considering 271/561 (removed 290) transitions.
[2024-05-22 22:39:43] [INFO ] Flow matrix only has 264 transitions (discarded 7 similar events)
// Phase 1: matrix 264 rows 191 cols
[2024-05-22 22:39:43] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 22:39:43] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 22:39:43] [INFO ] Flow matrix only has 264 transitions (discarded 7 similar events)
[2024-05-22 22:39:43] [INFO ] Invariant cache hit.
[2024-05-22 22:39:43] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-05-22 22:39:43] [INFO ] Redundant transitions in 1 ms returned []
Running 148 sub problems to find dead transitions.
[2024-05-22 22:39:43] [INFO ] Flow matrix only has 264 transitions (discarded 7 similar events)
[2024-05-22 22:39:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 8/191 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-22 22:39:44] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:39:44] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 263/454 variables, 191/203 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/454 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/455 variables, and 203 constraints, problems are : Problem set: 0 solved, 148 unsolved in 4820 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 8/191 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 263/454 variables, 191/203 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 148/351 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/454 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/455 variables, and 351 constraints, problems are : Problem set: 0 solved, 148 unsolved in 4453 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 2/2 constraints]
After SMT, in 9316ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 9318ms
Starting structural reductions in SI_CTL mode, iteration 1 : 191/439 places, 271/561 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9638 ms. Remains : 191/439 places, 271/561 transitions.
[2024-05-22 22:39:53] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:39:53] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:39:53] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-22 22:39:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:39:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:39:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15597912785064414139.gal : 1 ms
[2024-05-22 22:39:53] [INFO ] Time to serialize properties into /tmp/CTLFireability14379281593411708893.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/CTLFireability15597912785064414139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14379281593411708893.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,7.58647e+11,1.18178,44696,2,5920,5,246709,6,0,1030,115036,0


Converting to forward existential form...Done !
original formula: EF(((EF(AG((p789==1))) * (p139==1)) * ((p508==1)&&(p711==1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * ((p508==1)&&(p711==1))) * (p139==1)),TRUE) * !(E(TRUE U !((p789==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t48, t76, t196, t200, Intersection with reachable at each step enabled. (destroyed/rever...187
Detected timeout of ITS tools.
[2024-05-22 22:40:23] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:40:23] [INFO ] Applying decomposition
[2024-05-22 22:40:23] [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/graph16013518402684384216.txt' '-o' '/tmp/graph16013518402684384216.bin' '-w' '/tmp/graph16013518402684384216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16013518402684384216.bin' '-l' '-1' '-v' '-w' '/tmp/graph16013518402684384216.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:40:23] [INFO ] Decomposing Gal with order
[2024-05-22 22:40:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:40:23] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-22 22:40:23] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:40:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 2 ms.
[2024-05-22 22:40:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7061698311246888750.gal : 2 ms
[2024-05-22 22:40:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14795272095227184209.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/CTLFireability7061698311246888750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14795272095227184209.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,7.58647e+11,0.084788,6840,46,105,4634,954,480,8483,337,1030,0


Converting to forward existential form...Done !
original formula: EF(((EF(AG((i8.u25.p789==1))) * (i1.u3.p139==1)) * ((i5.u17.p508==1)&&(i8.u24.p711==1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * ((i5.u17.p508==1)&&(i8.u24.p711==1))) * (i1.u3.p139==1)),TRUE) * !(E(TRUE U !((i8.u25...178
Reverse transition relation is NOT exact ! Due to transitions t196, t200, i2.u7.t76, i4.u13.t48, i8.t0, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,0.500017,27696,1,0,22652,65304,2794,58024,1566,189509,8054
FORMULA FlexibleBarrier-PT-08b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Graph (trivial) has 399 edges and 439 vertex of which 43 / 439 are part of one of the 7 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 402 transition count 468
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 347 transition count 468
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 111 place count 347 transition count 444
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 159 place count 323 transition count 444
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 223 place count 259 transition count 380
Iterating global reduction 2 with 64 rules applied. Total rules applied 287 place count 259 transition count 380
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 291 place count 259 transition count 376
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 291 place count 259 transition count 374
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 295 place count 257 transition count 374
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 311 place count 241 transition count 358
Iterating global reduction 3 with 16 rules applied. Total rules applied 327 place count 241 transition count 358
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 343 place count 241 transition count 342
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 397 place count 214 transition count 315
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 405 place count 206 transition count 307
Iterating global reduction 4 with 8 rules applied. Total rules applied 413 place count 206 transition count 307
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 421 place count 206 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 429 place count 206 transition count 291
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 430 place count 206 transition count 291
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 432 place count 204 transition count 289
Applied a total of 432 rules in 64 ms. Remains 204 /439 variables (removed 235) and now considering 289/561 (removed 272) transitions.
[2024-05-22 22:40:23] [INFO ] Flow matrix only has 283 transitions (discarded 6 similar events)
// Phase 1: matrix 283 rows 204 cols
[2024-05-22 22:40:23] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 22:40:23] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 22:40:23] [INFO ] Flow matrix only has 283 transitions (discarded 6 similar events)
[2024-05-22 22:40:23] [INFO ] Invariant cache hit.
[2024-05-22 22:40:24] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-05-22 22:40:24] [INFO ] Redundant transitions in 1 ms returned []
Running 170 sub problems to find dead transitions.
[2024-05-22 22:40:24] [INFO ] Flow matrix only has 283 transitions (discarded 6 similar events)
[2024-05-22 22:40:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 8/204 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-22 22:40:25] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 282/486 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/486 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/487 variables, and 215 constraints, problems are : Problem set: 0 solved, 170 unsolved in 5980 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 8/204 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 282/486 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 170/385 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-22 22:40:32] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/486 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/487 variables, and 386 constraints, problems are : Problem set: 0 solved, 170 unsolved in 7159 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints]
After SMT, in 13175ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 13176ms
Starting structural reductions in SI_CTL mode, iteration 1 : 204/439 places, 289/561 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13548 ms. Remains : 204/439 places, 289/561 transitions.
[2024-05-22 22:40:37] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:40:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:40:37] [INFO ] Input system was already deterministic with 289 transitions.
[2024-05-22 22:40:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:40:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:40:37] [INFO ] Time to serialize gal into /tmp/CTLFireability5853859457631034068.gal : 10 ms
[2024-05-22 22:40:37] [INFO ] Time to serialize properties into /tmp/CTLFireability11282710388248721058.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/CTLFireability5853859457631034068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11282710388248721058.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.51468e+12,3.64701,110656,2,5940,5,639556,6,0,1101,318229,0


Converting to forward existential form...Done !
original formula: AG(((EF((((p125==0)||(p256==0))||(p696==0))) + EG(((!(E((p188==1) U (p193==1))) + (p795==0)) + (p396==0)))) + (A((p524==1) U (p775==1)) *...171
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((!((E(!((p775==1)) U (!((p524==1)) * !((p775==1)))) + EG(!((p775==1))))) * E(TRUE U (p76...290
Reverse transition relation is NOT exact ! Due to transitions t18, t45, t54, t207, t209, t213, t214, t218, t219, Intersection with reachable at each step ...212
Detected timeout of ITS tools.
[2024-05-22 22:41:07] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:41:07] [INFO ] Applying decomposition
[2024-05-22 22:41:07] [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/graph17266212679765686858.txt' '-o' '/tmp/graph17266212679765686858.bin' '-w' '/tmp/graph17266212679765686858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17266212679765686858.bin' '-l' '-1' '-v' '-w' '/tmp/graph17266212679765686858.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:41:07] [INFO ] Decomposing Gal with order
[2024-05-22 22:41:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:41:07] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-22 22:41:07] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:41:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 3 ms.
[2024-05-22 22:41:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13294282898204664884.gal : 2 ms
[2024-05-22 22:41:07] [INFO ] Time to serialize properties into /tmp/CTLFireability11804533194360344723.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/CTLFireability13294282898204664884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11804533194360344723.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.51468e+12,0.053028,5656,77,112,2169,1265,578,3176,379,1498,0


Converting to forward existential form...Done !
original formula: AG(((EF((((i1.u3.p125==0)||(i2.u9.p256==0))||(u27.p696==0))) + EG(((!(E((i2.u6.p188==1) U (i2.u9.p193==1))) + (u27.p795==0)) + (i4.i0.u14...233
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((!((E(!((u27.p775==1)) U (!((i7.i0.u20.p524==1)) * !((u27.p775==1)))) + EG(!((u27.p775==...360
Reverse transition relation is NOT exact ! Due to transitions t207, t209, t214, u27.t218, u27.t219, i3.u12.t54, i4.i1.u16.t45, i7.i0.t213, i7.i1.u22.t18, ...253
(forward)formula 0,1,0.267913,16476,1,0,7470,46165,3306,13378,1830,113169,10217
FORMULA FlexibleBarrier-PT-08b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 377 transition count 499
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 377 transition count 499
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 129 place count 377 transition count 494
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 165 place count 341 transition count 458
Iterating global reduction 1 with 36 rules applied. Total rules applied 201 place count 341 transition count 458
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 220 place count 341 transition count 439
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 230 place count 331 transition count 429
Iterating global reduction 2 with 10 rules applied. Total rules applied 240 place count 331 transition count 429
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 331 transition count 420
Applied a total of 249 rules in 19 ms. Remains 331 /439 variables (removed 108) and now considering 420/561 (removed 141) transitions.
// Phase 1: matrix 420 rows 331 cols
[2024-05-22 22:41:07] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 22:41:07] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 22:41:07] [INFO ] Invariant cache hit.
[2024-05-22 22:41:08] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-05-22 22:41:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/751 variables, 331/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (OVERLAPS) 0/751 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
No progress, stopping.
After SMT solving in domain Real declared 751/751 variables, and 341 constraints, problems are : Problem set: 0 solved, 419 unsolved in 17573 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/751 variables, 331/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 419/760 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 22:41:31] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-22 22:41:32] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-22 22:41:32] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:41:32] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-22 22:41:32] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-22 22:41:33] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:41:33] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 3 ms to minimize.
[2024-05-22 22:41:34] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:41:34] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:41:35] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:41:36] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:41:36] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:41:37] [INFO ] Deduced a trap composed of 248 places in 90 ms of which 2 ms to minimize.
[2024-05-22 22:41:37] [INFO ] Deduced a trap composed of 249 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:41:37] [INFO ] Deduced a trap composed of 252 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/751 variables, 15/775 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/751 variables, and 775 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 15/15 constraints]
After SMT, in 47701ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 47704ms
Starting structural reductions in LTL mode, iteration 1 : 331/439 places, 420/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48012 ms. Remains : 331/439 places, 420/561 transitions.
[2024-05-22 22:41:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:41:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:41:55] [INFO ] Input system was already deterministic with 420 transitions.
[2024-05-22 22:41:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:41:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:41:55] [INFO ] Time to serialize gal into /tmp/CTLFireability698705702440947664.gal : 1 ms
[2024-05-22 22:41:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11974982540761265291.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/CTLFireability698705702440947664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11974982540761265291.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-22 22:42:25] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:42:25] [INFO ] Applying decomposition
[2024-05-22 22:42:25] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2154034037209994594.txt' '-o' '/tmp/graph2154034037209994594.bin' '-w' '/tmp/graph2154034037209994594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2154034037209994594.bin' '-l' '-1' '-v' '-w' '/tmp/graph2154034037209994594.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:42:25] [INFO ] Decomposing Gal with order
[2024-05-22 22:42:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:42:25] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-22 22:42:25] [INFO ] Flatten gal took : 16 ms
[2024-05-22 22:42:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 22:42:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17395527907246531692.gal : 2 ms
[2024-05-22 22:42:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9320404431855442902.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/CTLFireability17395527907246531692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9320404431855442902.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.83433e+14,14.5992,419312,10196,1406,866513,18237,914,1.36297e+06,378,63615,0


Converting to forward existential form...Done !
original formula: A(!(A(AX(((i3.u19.p155==1)&&(i1.i1.i1.u84.p917==1))) U AG((AG(((i9.u45.p419==1)&&(u83.p905==1))) + (u83.p865==1))))) U AG((i7.u41.p330==1...158
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((i7.u41.p330==1)))))))) * !(E(!(!(E(TRUE U !((i7.u41.p330==1))))) U (!(!(!((E(!(!(...536
Reverse transition relation is NOT exact ! Due to transitions t1, t60, t89, t103, t121, t122, t152, t153, t183, t184, t214, t215, t245, t246, t276, t338, t...862
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 380 transition count 502
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 380 transition count 502
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 123 place count 380 transition count 497
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 156 place count 347 transition count 464
Iterating global reduction 1 with 33 rules applied. Total rules applied 189 place count 347 transition count 464
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 207 place count 347 transition count 446
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 215 place count 339 transition count 438
Iterating global reduction 2 with 8 rules applied. Total rules applied 223 place count 339 transition count 438
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 230 place count 339 transition count 431
Applied a total of 230 rules in 21 ms. Remains 339 /439 variables (removed 100) and now considering 431/561 (removed 130) transitions.
// Phase 1: matrix 431 rows 339 cols
[2024-05-22 22:42:56] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 22:42:56] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-22 22:42:56] [INFO ] Invariant cache hit.
[2024-05-22 22:42:56] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-05-22 22:42:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 431/770 variables, 339/349 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (OVERLAPS) 0/770 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 349 constraints, problems are : Problem set: 0 solved, 430 unsolved in 18598 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 431/770 variables, 339/349 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 430/779 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-05-22 22:43:21] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:43:21] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:43:22] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:43:22] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:43:23] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:43:23] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-22 22:43:23] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-22 22:43:24] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-22 22:43:25] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:43:25] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 2 ms to minimize.
[2024-05-22 22:43:26] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 2 ms to minimize.
[2024-05-22 22:43:27] [INFO ] Deduced a trap composed of 253 places in 90 ms of which 2 ms to minimize.
[2024-05-22 22:43:27] [INFO ] Deduced a trap composed of 250 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/770 variables, 13/792 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 770/770 variables, and 792 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 13/13 constraints]
After SMT, in 48725ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 48730ms
Starting structural reductions in LTL mode, iteration 1 : 339/439 places, 431/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49046 ms. Remains : 339/439 places, 431/561 transitions.
[2024-05-22 22:43:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:43:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:43:45] [INFO ] Input system was already deterministic with 431 transitions.
[2024-05-22 22:43:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:43:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:43:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1990231600207943313.gal : 2 ms
[2024-05-22 22:43:45] [INFO ] Time to serialize properties into /tmp/CTLFireability10845203130286754477.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/CTLFireability1990231600207943313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10845203130286754477.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-22 22:44:15] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:44:15] [INFO ] Applying decomposition
[2024-05-22 22:44:15] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4223978119358314387.txt' '-o' '/tmp/graph4223978119358314387.bin' '-w' '/tmp/graph4223978119358314387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4223978119358314387.bin' '-l' '-1' '-v' '-w' '/tmp/graph4223978119358314387.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:44:15] [INFO ] Decomposing Gal with order
[2024-05-22 22:44:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:44:15] [INFO ] Removed a total of 214 redundant transitions.
[2024-05-22 22:44:15] [INFO ] Flatten gal took : 26 ms
[2024-05-22 22:44:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 22:44:15] [INFO ] Time to serialize gal into /tmp/CTLFireability8380041041196749617.gal : 3 ms
[2024-05-22 22:44:15] [INFO ] Time to serialize properties into /tmp/CTLFireability11237465162268775345.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/CTLFireability8380041041196749617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11237465162268775345.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.57731e+14,19.1084,513064,10881,1428,952775,17820,926,2.20253e+06,380,67907,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 376 transition count 498
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 376 transition count 498
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 131 place count 376 transition count 493
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 168 place count 339 transition count 456
Iterating global reduction 1 with 37 rules applied. Total rules applied 205 place count 339 transition count 456
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 225 place count 339 transition count 436
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 235 place count 329 transition count 426
Iterating global reduction 2 with 10 rules applied. Total rules applied 245 place count 329 transition count 426
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 254 place count 329 transition count 417
Applied a total of 254 rules in 15 ms. Remains 329 /439 variables (removed 110) and now considering 417/561 (removed 144) transitions.
// Phase 1: matrix 417 rows 329 cols
[2024-05-22 22:44:45] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 22:44:45] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 22:44:45] [INFO ] Invariant cache hit.
[2024-05-22 22:44:45] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-22 22:44:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/329 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 417/746 variables, 329/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (OVERLAPS) 0/746 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 339 constraints, problems are : Problem set: 0 solved, 416 unsolved in 17723 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/329 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 417/746 variables, 329/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 416/755 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-22 22:45:09] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:45:10] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-22 22:45:10] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:45:11] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 1 ms to minimize.
[2024-05-22 22:45:12] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:45:12] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:45:13] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2024-05-22 22:45:13] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2024-05-22 22:45:14] [INFO ] Deduced a trap composed of 248 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:45:14] [INFO ] Deduced a trap composed of 248 places in 90 ms of which 2 ms to minimize.
[2024-05-22 22:45:15] [INFO ] Deduced a trap composed of 248 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 11/766 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 746/746 variables, and 766 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 11/11 constraints]
After SMT, in 47843ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 47847ms
Starting structural reductions in LTL mode, iteration 1 : 329/439 places, 417/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48162 ms. Remains : 329/439 places, 417/561 transitions.
[2024-05-22 22:45:33] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:45:33] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:45:33] [INFO ] Input system was already deterministic with 417 transitions.
[2024-05-22 22:45:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:45:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:45:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17129648067823929332.gal : 2 ms
[2024-05-22 22:45:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5518926068529165280.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/CTLFireability17129648067823929332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5518926068529165280.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-22 22:46:03] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:46:03] [INFO ] Applying decomposition
[2024-05-22 22:46:03] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16288331659349383167.txt' '-o' '/tmp/graph16288331659349383167.bin' '-w' '/tmp/graph16288331659349383167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16288331659349383167.bin' '-l' '-1' '-v' '-w' '/tmp/graph16288331659349383167.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:46:03] [INFO ] Decomposing Gal with order
[2024-05-22 22:46:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:46:03] [INFO ] Removed a total of 192 redundant transitions.
[2024-05-22 22:46:03] [INFO ] Flatten gal took : 16 ms
[2024-05-22 22:46:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 22:46:03] [INFO ] Time to serialize gal into /tmp/CTLFireability373010163085415887.gal : 3 ms
[2024-05-22 22:46:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13289331477726303829.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/CTLFireability373010163085415887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13289331477726303829.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.71781e+14,9.48905,271620,7700,2220,515199,42269,917,965630,380,243828,0


Converting to forward existential form...Done !
original formula: EX(AF((u83.p905==1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((u83.p905==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t88, t102, t119, t120, t150, t151, t181, t182, t213, t243, t244, t274, t336, t337, t338, ...929
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 561/561 transitions.
Graph (trivial) has 314 edges and 439 vertex of which 24 / 439 are part of one of the 4 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 418 transition count 484
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 115 place count 362 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 361 transition count 482
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 116 place count 361 transition count 454
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 172 place count 333 transition count 454
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 233 place count 272 transition count 393
Iterating global reduction 3 with 61 rules applied. Total rules applied 294 place count 272 transition count 393
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 299 place count 272 transition count 388
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 316 place count 255 transition count 371
Iterating global reduction 4 with 17 rules applied. Total rules applied 333 place count 255 transition count 371
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 349 place count 255 transition count 355
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 417 place count 221 transition count 321
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 427 place count 211 transition count 311
Iterating global reduction 5 with 10 rules applied. Total rules applied 437 place count 211 transition count 311
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 447 place count 211 transition count 301
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 449 place count 211 transition count 301
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 451 place count 209 transition count 299
Applied a total of 451 rules in 36 ms. Remains 209 /439 variables (removed 230) and now considering 299/561 (removed 262) transitions.
[2024-05-22 22:46:33] [INFO ] Flow matrix only has 293 transitions (discarded 6 similar events)
// Phase 1: matrix 293 rows 209 cols
[2024-05-22 22:46:33] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 22:46:34] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-22 22:46:34] [INFO ] Flow matrix only has 293 transitions (discarded 6 similar events)
[2024-05-22 22:46:34] [INFO ] Invariant cache hit.
[2024-05-22 22:46:34] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-22 22:46:34] [INFO ] Redundant transitions in 1 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-22 22:46:34] [INFO ] Flow matrix only has 293 transitions (discarded 6 similar events)
[2024-05-22 22:46:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 5/209 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 292/501 variables, 209/219 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/502 variables, and 219 constraints, problems are : Problem set: 0 solved, 254 unsolved in 7958 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 5/209 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 292/501 variables, 209/219 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 254/473 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/502 variables, and 473 constraints, problems are : Problem set: 0 solved, 254 unsolved in 8570 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 16624ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 16627ms
Starting structural reductions in SI_CTL mode, iteration 1 : 209/439 places, 299/561 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17089 ms. Remains : 209/439 places, 299/561 transitions.
[2024-05-22 22:46:50] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:46:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:46:50] [INFO ] Input system was already deterministic with 299 transitions.
[2024-05-22 22:46:50] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:46:50] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:46:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12846644102328434663.gal : 1 ms
[2024-05-22 22:46:50] [INFO ] Time to serialize properties into /tmp/CTLFireability14206301033998191183.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/CTLFireability12846644102328434663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14206301033998191183.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.02975e+12,5.51207,159676,2,22326,5,884323,6,0,1134,536480,0


Converting to forward existential form...Done !
original formula: AF((((p587==1) * EF((p519==1))) * ((p313==1) + (A(((p905==1)&&(p649==1)) U EF((p341==1))) * (((p462==0)||(p19==1)) + ((p649==1) + (A((p50...196
=> equivalent forward existential formula: [FwdG(Init,!((((p587==1) * E(TRUE U (p519==1))) * ((p313==1) + (!((E(!(E(TRUE U (p341==1))) U (!(((p905==1)&&(p6...373
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-22 22:47:20] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:47:20] [INFO ] Applying decomposition
[2024-05-22 22:47:20] [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/graph17379875902267262485.txt' '-o' '/tmp/graph17379875902267262485.bin' '-w' '/tmp/graph17379875902267262485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17379875902267262485.bin' '-l' '-1' '-v' '-w' '/tmp/graph17379875902267262485.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:47:20] [INFO ] Decomposing Gal with order
[2024-05-22 22:47:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:47:20] [INFO ] Removed a total of 124 redundant transitions.
[2024-05-22 22:47:20] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:47:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 2 ms.
[2024-05-22 22:47:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11218516594466951988.gal : 2 ms
[2024-05-22 22:47:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9564001191614606052.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/CTLFireability11218516594466951988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9564001191614606052.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.02975e+12,0.058859,5680,84,102,2866,2529,641,3394,395,2073,0


Converting to forward existential form...Done !
original formula: AF((((i7.i1.u22.p587==1) * EF((i7.i1.u19.p519==1))) * ((i3.i0.u9.p313==1) + (A(((u28.p905==1)&&(i8.u27.p649==1)) U EF((u11.p341==1))) * (...278
=> equivalent forward existential formula: [FwdG(Init,!((((i7.i1.u22.p587==1) * E(TRUE U (i7.i1.u19.p519==1))) * ((i3.i0.u9.p313==1) + (!((E(!(E(TRUE U (u1...477
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-22 22:47:51] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:47:51] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:47:51] [INFO ] Applying decomposition
[2024-05-22 22:47:51] [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/graph6728723489554201235.txt' '-o' '/tmp/graph6728723489554201235.bin' '-w' '/tmp/graph6728723489554201235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6728723489554201235.bin' '-l' '-1' '-v' '-w' '/tmp/graph6728723489554201235.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:47:51] [INFO ] Decomposing Gal with order
[2024-05-22 22:47:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:47:51] [INFO ] Removed a total of 242 redundant transitions.
[2024-05-22 22:47:51] [INFO ] Flatten gal took : 20 ms
[2024-05-22 22:47:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2024-05-22 22:47:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14334306605376490741.gal : 4 ms
[2024-05-22 22:47:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1222818230096132822.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/CTLFireability14334306605376490741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1222818230096132822.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 11 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.19727e+15,317.093,4988372,62290,1435,6.81513e+06,37524,1292,2.19298e+07,417,211484,0


Converting to forward existential form...Done !
original formula: EG(AF(AG((i12.u100.p624==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !((i12.u100.p624==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t130, t159, t160, t196, t206, t250, t325, t365, t442, t444, t445, t446, t448, t449, t556,...1511
ITS-tools command line returned an error code 137
[2024-05-22 23:13:26] [INFO ] Applying decomposition
[2024-05-22 23:13:26] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:13:26] [INFO ] Decomposing Gal with order
[2024-05-22 23:13:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:13:26] [INFO ] Removed a total of 131 redundant transitions.
[2024-05-22 23:13:26] [INFO ] Flatten gal took : 19 ms
[2024-05-22 23:13:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 363 labels/synchronizations in 10 ms.
[2024-05-22 23:13:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12936345285615781320.gal : 3 ms
[2024-05-22 23:13:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3796504484646177569.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/CTLFireability12936345285615781320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3796504484646177569.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 11 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 23:22:33] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:22:33] [INFO ] Input system was already deterministic with 561 transitions.
[2024-05-22 23:22:33] [INFO ] Transformed 439 places.
[2024-05-22 23:22:33] [INFO ] Transformed 561 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-22 23:22:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10978347749355201338.gal : 3 ms
[2024-05-22 23:22:33] [INFO ] Time to serialize properties into /tmp/CTLFireability873329146322987097.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/CTLFireability10978347749355201338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability873329146322987097.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 11 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-08b"
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 FlexibleBarrier-PT-08b, 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 r180-tall-171640602500042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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