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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 125K 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 HealthRecord-PT-16-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716521175128

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:26:16] [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-24 03:26:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:26:16] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-24 03:26:16] [INFO ] Transformed 453 places.
[2024-05-24 03:26:16] [INFO ] Transformed 594 transitions.
[2024-05-24 03:26:16] [INFO ] Found NUPN structural information;
[2024-05-24 03:26:16] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 91 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 386 transition count 519
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 386 transition count 519
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 159 place count 361 transition count 488
Iterating global reduction 0 with 25 rules applied. Total rules applied 184 place count 361 transition count 488
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 187 place count 361 transition count 485
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 199 place count 349 transition count 461
Iterating global reduction 1 with 12 rules applied. Total rules applied 211 place count 349 transition count 461
Applied a total of 211 rules in 95 ms. Remains 349 /453 variables (removed 104) and now considering 461/594 (removed 133) transitions.
// Phase 1: matrix 461 rows 349 cols
[2024-05-24 03:26:16] [INFO ] Computed 14 invariants in 25 ms
[2024-05-24 03:26:17] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-24 03:26:17] [INFO ] Invariant cache hit.
[2024-05-24 03:26:17] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-24 03:26:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/349 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:26:23] [INFO ] Deduced a trap composed of 50 places in 343 ms of which 52 ms to minimize.
[2024-05-24 03:26:23] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 3 ms to minimize.
[2024-05-24 03:26:24] [INFO ] Deduced a trap composed of 149 places in 299 ms of which 2 ms to minimize.
[2024-05-24 03:26:24] [INFO ] Deduced a trap composed of 157 places in 121 ms of which 2 ms to minimize.
[2024-05-24 03:26:24] [INFO ] Deduced a trap composed of 166 places in 645 ms of which 7 ms to minimize.
[2024-05-24 03:26:25] [INFO ] Deduced a trap composed of 140 places in 640 ms of which 3 ms to minimize.
[2024-05-24 03:26:25] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:26:26] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-05-24 03:26:26] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 2 ms to minimize.
[2024-05-24 03:26:26] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-24 03:26:26] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:26:26] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:26:26] [INFO ] Deduced a trap composed of 153 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:26:27] [INFO ] Deduced a trap composed of 150 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:26:27] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:26:27] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:26:28] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:26:28] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:26:28] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:26:28] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:26:31] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:26:32] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:26:33] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:26:34] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:26:34] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 3 ms to minimize.
[2024-05-24 03:26:34] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:26:35] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:26:35] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:26:35] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:26:35] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:26:35] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-24 03:26:35] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:26:35] [INFO ] Deduced a trap composed of 152 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:26:35] [INFO ] Deduced a trap composed of 169 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:26:36] [INFO ] Deduced a trap composed of 154 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:26:36] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:26:36] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 3 ms to minimize.
[2024-05-24 03:26:36] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:26:36] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:26:38] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:26:39] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:26:39] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:26:39] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:26:40] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:26:42] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:26:42] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/810 variables, and 60 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/349 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/349 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:26:50] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 3 ms to minimize.
[2024-05-24 03:26:50] [INFO ] Deduced a trap composed of 94 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:26:50] [INFO ] Deduced a trap composed of 87 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:26:50] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:26:55] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 3 ms to minimize.
[2024-05-24 03:26:55] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:26:56] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:27:02] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 8 (OVERLAPS) 461/810 variables, 349/417 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 460/877 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:27:10] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/810 variables, and 878 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 55/55 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Starting structural reductions in LTL mode, iteration 1 : 349/453 places, 461/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60936 ms. Remains : 349/453 places, 461/594 transitions.
Support contains 91 out of 349 places after structural reductions.
[2024-05-24 03:27:17] [INFO ] Flatten gal took : 57 ms
[2024-05-24 03:27:17] [INFO ] Flatten gal took : 26 ms
[2024-05-24 03:27:17] [INFO ] Input system was already deterministic with 461 transitions.
Support contains 88 out of 349 places (down from 91) after GAL structural reductions.
RANDOM walk for 40000 steps (309 resets) in 2769 ms. (14 steps per ms) remains 44/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 44/44 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 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 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 4003 steps (8 resets) in 14 ms. (266 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 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 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 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 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 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
[2024-05-24 03:27:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem AtomicPropp68 is UNSAT
At refinement iteration 1 (OVERLAPS) 106/162 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 187/349 variables, 6/14 constraints. Problems are: Problem set: 1 solved, 42 unsolved
[2024-05-24 03:27:19] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:27:19] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 10 ms to minimize.
[2024-05-24 03:27:19] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:27:19] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:27:19] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:27:20] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:27:20] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:27:20] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:27:20] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 3 ms to minimize.
Problem AtomicPropp21 is UNSAT
[2024-05-24 03:27:20] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:27:20] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:27:20] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:27:20] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:27:21] [INFO ] Deduced a trap composed of 93 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:27:21] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:27:21] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 16/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-24 03:27:21] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:27:21] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:27:21] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:27:21] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 1 ms to minimize.
[2024-05-24 03:27:22] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
Problem AtomicPropp71 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 5/35 constraints. Problems are: Problem set: 3 solved, 40 unsolved
[2024-05-24 03:27:22] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:27:22] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 2/37 constraints. Problems are: Problem set: 3 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 461/810 variables, 349/386 constraints. Problems are: Problem set: 3 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 0/386 constraints. Problems are: Problem set: 3 solved, 40 unsolved
[2024-05-24 03:27:23] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/810 variables, and 387 constraints, problems are : Problem set: 3 solved, 40 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 3 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 40 unsolved
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 112/159 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 39 unsolved
[2024-05-24 03:27:24] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:27:24] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:27:24] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 3/12 constraints. Problems are: Problem set: 4 solved, 39 unsolved
[2024-05-24 03:27:24] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/13 constraints. Problems are: Problem set: 4 solved, 39 unsolved
[2024-05-24 03:27:24] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 1/14 constraints. Problems are: Problem set: 4 solved, 39 unsolved
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 1/15 constraints. Problems are: Problem set: 4 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 190/349 variables, 6/21 constraints. Problems are: Problem set: 4 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 23/44 constraints. Problems are: Problem set: 4 solved, 39 unsolved
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:27:25] [INFO ] Deduced a trap composed of 150 places in 106 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 2/46 constraints. Problems are: Problem set: 4 solved, 39 unsolved
[2024-05-24 03:27:26] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 1/47 constraints. Problems are: Problem set: 4 solved, 39 unsolved
[2024-05-24 03:27:26] [INFO ] Deduced a trap composed of 136 places in 100 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 1/48 constraints. Problems are: Problem set: 4 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 0/48 constraints. Problems are: Problem set: 4 solved, 39 unsolved
At refinement iteration 14 (OVERLAPS) 461/810 variables, 349/397 constraints. Problems are: Problem set: 4 solved, 39 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/810 variables, 39/436 constraints. Problems are: Problem set: 4 solved, 39 unsolved
[2024-05-24 03:27:28] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:27:28] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/810 variables, 2/438 constraints. Problems are: Problem set: 4 solved, 39 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/810 variables, and 438 constraints, problems are : Problem set: 4 solved, 39 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 39/43 constraints, Known Traps: 36/36 constraints]
After SMT, in 10037ms problems are : Problem set: 4 solved, 39 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 461/461 transitions.
Graph (trivial) has 314 edges and 349 vertex of which 28 / 349 are part of one of the 14 SCC in 6 ms
Free SCC test removed 14 places
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Graph (complete) has 662 edges and 335 vertex of which 327 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 327 transition count 321
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 122 rules applied. Total rules applied 235 place count 216 transition count 310
Reduce places removed 6 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 18 rules applied. Total rules applied 253 place count 210 transition count 298
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 16 rules applied. Total rules applied 269 place count 198 transition count 294
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 271 place count 196 transition count 294
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 271 place count 196 transition count 285
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 289 place count 187 transition count 285
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 296 place count 180 transition count 273
Iterating global reduction 5 with 7 rules applied. Total rules applied 303 place count 180 transition count 273
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 304 place count 180 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 305 place count 179 transition count 272
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 307 place count 177 transition count 268
Iterating global reduction 7 with 2 rules applied. Total rules applied 309 place count 177 transition count 268
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 310 place count 176 transition count 266
Iterating global reduction 7 with 1 rules applied. Total rules applied 311 place count 176 transition count 266
Performed 44 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 399 place count 132 transition count 220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 404 place count 132 transition count 215
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 406 place count 130 transition count 211
Iterating global reduction 8 with 2 rules applied. Total rules applied 408 place count 130 transition count 211
Performed 10 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 428 place count 120 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 434 place count 120 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 448 place count 120 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 450 place count 119 transition count 251
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 457 place count 119 transition count 244
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 464 place count 112 transition count 244
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 10 with 19 rules applied. Total rules applied 483 place count 112 transition count 244
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 497 place count 112 transition count 244
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 498 place count 112 transition count 244
Applied a total of 498 rules in 139 ms. Remains 112 /349 variables (removed 237) and now considering 244/461 (removed 217) transitions.
Running 241 sub problems to find dead transitions.
[2024-05-24 03:27:29] [INFO ] Flow matrix only has 242 transitions (discarded 2 similar events)
// Phase 1: matrix 242 rows 112 cols
[2024-05-24 03:27:29] [INFO ] Computed 7 invariants in 4 ms
[2024-05-24 03:27:29] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 4 (OVERLAPS) 242/354 variables, 112/119 constraints. Problems are: Problem set: 15 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 5/124 constraints. Problems are: Problem set: 15 solved, 226 unsolved
[2024-05-24 03:27:31] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 2 ms to minimize.
[2024-05-24 03:27:31] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:27:32] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:27:32] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:27:32] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-24 03:27:32] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 6/130 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/130 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/130 constraints. Problems are: Problem set: 17 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 130 constraints, problems are : Problem set: 17 solved, 224 unsolved in 7339 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 17 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 3/111 variables, 1/1 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 6/7 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 6/13 constraints. Problems are: Problem set: 17 solved, 224 unsolved
[2024-05-24 03:27:37] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/14 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 242/354 variables, 112/126 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 5/131 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 224/355 constraints. Problems are: Problem set: 17 solved, 224 unsolved
[2024-05-24 03:27:39] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:27:39] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:27:40] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-24 03:27:40] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:27:41] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 5/360 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/360 constraints. Problems are: Problem set: 17 solved, 224 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/360 constraints. Problems are: Problem set: 17 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 360 constraints, problems are : Problem set: 17 solved, 224 unsolved in 14068 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 224/241 constraints, Known Traps: 12/12 constraints]
After SMT, in 21563ms problems are : Problem set: 17 solved, 224 unsolved
Search for dead transitions found 17 dead transitions in 21573ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 112/349 places, 227/461 transitions.
Graph (complete) has 327 edges and 112 vertex of which 109 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 108 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 108 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 108 transition count 223
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 108 transition count 223
Applied a total of 8 rules in 31 ms. Remains 108 /112 variables (removed 4) and now considering 223/227 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21747 ms. Remains : 108/349 places, 223/461 transitions.
RANDOM walk for 40000 steps (2566 resets) in 487 ms. (81 steps per ms) remains 17/39 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (39 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (42 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (44 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (41 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (45 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (43 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (39 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (49 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
[2024-05-24 03:27:51] [INFO ] Flow matrix only has 221 transitions (discarded 2 similar events)
// Phase 1: matrix 221 rows 108 cols
[2024-05-24 03:27:51] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 03:27:51] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 48/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 198/268 variables, 70/76 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 55/323 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 6/329 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/329 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 117 constraints, problems are : Problem set: 0 solved, 17 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 108/108 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 48/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 198/268 variables, 70/76 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 55/323 variables, 34/112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 15/130 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 6/329 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/329 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 134 constraints, problems are : Problem set: 0 solved, 17 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 108/108 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 1190ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 15 properties in 2275 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 223/223 transitions.
Graph (trivial) has 73 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 106 transition count 193
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 92 transition count 193
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 29 place count 92 transition count 187
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 41 place count 86 transition count 187
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 51 place count 76 transition count 171
Iterating global reduction 2 with 10 rules applied. Total rules applied 61 place count 76 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 73 transition count 167
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 73 transition count 167
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 87 place count 63 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 94 place count 63 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 61 transition count 147
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 61 transition count 147
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 59 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 59 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 59 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 57 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 57 transition count 153
Free-agglomeration rule applied 7 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 115 place count 57 transition count 145
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 122 place count 50 transition count 145
Applied a total of 122 rules in 32 ms. Remains 50 /108 variables (removed 58) and now considering 145/223 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 50/108 places, 145/223 transitions.
RANDOM walk for 40000 steps (4772 resets) in 367 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (627 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (619 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7328 steps, run visited all 2 properties in 31 ms. (steps per millisecond=236 )
Probabilistic random walk after 7328 steps, saw 1912 distinct states, run finished after 35 ms. (steps per millisecond=209 ) properties seen :2
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-24 03:27:54] [INFO ] Flatten gal took : 18 ms
[2024-05-24 03:27:54] [INFO ] Flatten gal took : 19 ms
[2024-05-24 03:27:54] [INFO ] Input system was already deterministic with 461 transitions.
Support contains 73 out of 349 places (down from 75) after GAL structural reductions.
Computed a total of 97 stabilizing places and 108 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 325 transition count 429
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 325 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 325 transition count 428
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 313 transition count 408
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 313 transition count 408
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 313 transition count 407
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 306 transition count 394
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 306 transition count 394
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 302 transition count 390
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 302 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 299 transition count 383
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 299 transition count 383
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 297 transition count 380
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 297 transition count 380
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 295 transition count 377
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 295 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 295 transition count 376
Applied a total of 111 rules in 43 ms. Remains 295 /349 variables (removed 54) and now considering 376/461 (removed 85) transitions.
// Phase 1: matrix 376 rows 295 cols
[2024-05-24 03:27:54] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 03:27:55] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 03:27:55] [INFO ] Invariant cache hit.
[2024-05-24 03:27:55] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-24 03:27:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-24 03:27:58] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:27:58] [INFO ] Deduced a trap composed of 151 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:27:59] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:27:59] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:27:59] [INFO ] Deduced a trap composed of 139 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:27:59] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:27:59] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:28:00] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:28:00] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:28:00] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:28:00] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:28:01] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:28:01] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:28:01] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-24 03:28:04] [INFO ] Deduced a trap composed of 140 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:28:04] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:28:05] [INFO ] Deduced a trap composed of 116 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-24 03:28:09] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 376/671 variables, 295/327 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/671 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-24 03:28:21] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:28:21] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/671 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/671 variables, and 329 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-24 03:28:27] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:28:27] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-24 03:28:32] [INFO ] Deduced a trap composed of 140 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 376/671 variables, 295/332 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/671 variables, 375/707 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/671 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 10 (OVERLAPS) 0/671 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Int declared 671/671 variables, and 707 constraints, problems are : Problem set: 0 solved, 375 unsolved in 28143 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 23/23 constraints]
After SMT, in 58205ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 58214ms
Starting structural reductions in LTL mode, iteration 1 : 295/349 places, 376/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58526 ms. Remains : 295/349 places, 376/461 transitions.
[2024-05-24 03:28:53] [INFO ] Flatten gal took : 20 ms
[2024-05-24 03:28:53] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:28:53] [INFO ] Input system was already deterministic with 376 transitions.
[2024-05-24 03:28:53] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:28:53] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:28:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17443007291485737273.gal : 10 ms
[2024-05-24 03:28:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9901178486679328255.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17443007291485737273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9901178486679328255.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: !(A(!(AG((EG(((p334==1)&&(p428==1))) + (p257==1)))) U (AF(EX(!(((p334==1)&&(p405==1))))) * (((!(((p77==1)&&(p439==1))) * ((p98==1) + EX((...230
=> equivalent forward existential formula: (([FwdG((FwdU(Init,!((!(EG(!(EX(!(((p334==1)&&(p405==1))))))) * (((!(((p77==1)&&(p439==1))) * ((p98==1) + EX((p2...2662
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t35, t36, t37, t40, t41, t42, t43...758
Detected timeout of ITS tools.
[2024-05-24 03:29:23] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:29:23] [INFO ] Applying decomposition
[2024-05-24 03:29:23] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10462140905699342933.txt' '-o' '/tmp/graph10462140905699342933.bin' '-w' '/tmp/graph10462140905699342933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10462140905699342933.bin' '-l' '-1' '-v' '-w' '/tmp/graph10462140905699342933.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:29:23] [INFO ] Decomposing Gal with order
[2024-05-24 03:29:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:29:23] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-24 03:29:23] [INFO ] Flatten gal took : 76 ms
[2024-05-24 03:29:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 25 ms.
[2024-05-24 03:29:24] [INFO ] Time to serialize gal into /tmp/CTLFireability18365865482583111257.gal : 13 ms
[2024-05-24 03:29:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5749255305302800236.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/CTLFireability18365865482583111257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5749255305302800236.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.04142e+11,0.405198,17836,1120,246,24292,3660,698,51642,165,11970,0


Converting to forward existential form...Done !
original formula: !(A(!(AG((EG(((i15.u82.p334==1)&&(i19.u101.p428==1))) + (i13.i1.u72.p257==1)))) U (AF(EX(!(((i15.u82.p334==1)&&(i19.u98.p405==1))))) * ((...347
=> equivalent forward existential formula: (([FwdG((FwdU(Init,!((!(EG(!(EX(!(((i15.u82.p334==1)&&(i19.u98.p405==1))))))) * (((!(((i0.i1.u9.p77==1)&&(i19.u1...3748
Reverse transition relation is NOT exact ! Due to transitions t13, t208, t321, t322, t323, t324, t325, t332, t333, t334, t335, t337, t355, t359, i0.i1.u9.t...1378
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 322 transition count 423
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 322 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 322 transition count 422
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 69 place count 308 transition count 399
Iterating global reduction 1 with 14 rules applied. Total rules applied 83 place count 308 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 308 transition count 398
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 92 place count 300 transition count 383
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 300 transition count 383
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 295 transition count 377
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 295 transition count 377
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 291 transition count 368
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 291 transition count 368
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 122 place count 287 transition count 363
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 287 transition count 363
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 284 transition count 359
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 284 transition count 359
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 284 transition count 357
Applied a total of 134 rules in 31 ms. Remains 284 /349 variables (removed 65) and now considering 357/461 (removed 104) transitions.
// Phase 1: matrix 357 rows 284 cols
[2024-05-24 03:29:54] [INFO ] Computed 14 invariants in 4 ms
[2024-05-24 03:29:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 03:29:54] [INFO ] Invariant cache hit.
[2024-05-24 03:29:54] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2024-05-24 03:29:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:29:57] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 11 ms to minimize.
[2024-05-24 03:29:57] [INFO ] Deduced a trap composed of 145 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:29:57] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 133 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 111 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:30:00] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:30:00] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:30:00] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:30:02] [INFO ] Deduced a trap composed of 136 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:30:04] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (OVERLAPS) 357/641 variables, 284/310 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:30:10] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:30:11] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (OVERLAPS) 0/641 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 312 constraints, problems are : Problem set: 0 solved, 356 unsolved in 29776 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:30:26] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:30:28] [INFO ] Deduced a trap composed of 136 places in 87 ms of which 3 ms to minimize.
[2024-05-24 03:30:28] [INFO ] Deduced a trap composed of 113 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:30:31] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:30:31] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:30:31] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:30:31] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:30:32] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:30:32] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:30:32] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:30:34] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:30:36] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:30:37] [INFO ] Deduced a trap composed of 137 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 10 (OVERLAPS) 357/641 variables, 284/325 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 356/681 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:30:43] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:30:46] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:30:49] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/641 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 684 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 30/30 constraints]
After SMT, in 59843ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 59856ms
Starting structural reductions in LTL mode, iteration 1 : 284/349 places, 357/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60125 ms. Remains : 284/349 places, 357/461 transitions.
[2024-05-24 03:30:54] [INFO ] Flatten gal took : 25 ms
[2024-05-24 03:30:54] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:30:54] [INFO ] Input system was already deterministic with 357 transitions.
[2024-05-24 03:30:54] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:30:54] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:30:54] [INFO ] Time to serialize gal into /tmp/CTLFireability5318991931637500286.gal : 2 ms
[2024-05-24 03:30:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10641083126279185714.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/CTLFireability5318991931637500286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10641083126279185714.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.44695e+11,2.74576,71512,2,9544,5,208575,6,0,1495,441805,0


Converting to forward existential form...Done !
original formula: AF(EX((p107==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((p107==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...644
Detected timeout of ITS tools.
[2024-05-24 03:31:24] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:31:24] [INFO ] Applying decomposition
[2024-05-24 03:31: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/graph936059993469319670.txt' '-o' '/tmp/graph936059993469319670.bin' '-w' '/tmp/graph936059993469319670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph936059993469319670.bin' '-l' '-1' '-v' '-w' '/tmp/graph936059993469319670.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:31:24] [INFO ] Decomposing Gal with order
[2024-05-24 03:31:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:31:24] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-24 03:31:24] [INFO ] Flatten gal took : 18 ms
[2024-05-24 03:31:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2024-05-24 03:31:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4636868345692553012.gal : 4 ms
[2024-05-24 03:31:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12299903779194007662.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/CTLFireability4636868345692553012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12299903779194007662.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44695e+11,0.244974,13828,897,70,18139,1787,693,35565,121,4494,0


Converting to forward existential form...Done !
original formula: AF(EX((u19.p107==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((u19.p107==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t229, t322, u19.t255, i1.i1.u8.t268, i1.i1.u8.t270, i1.i1.u8.t271, i1.i1.u8.t277, i1.i1....1207
Using 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 a local 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 a local SCC at level 2
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,24.6895,492724,1,0,791129,4875,4102,1.32999e+06,597,36224,611915
FORMULA HealthRecord-PT-16-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 321 transition count 422
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 321 transition count 422
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 321 transition count 421
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 71 place count 307 transition count 398
Iterating global reduction 1 with 14 rules applied. Total rules applied 85 place count 307 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 307 transition count 397
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 299 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 299 transition count 382
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 294 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 294 transition count 376
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 290 transition count 367
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 290 transition count 367
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 124 place count 286 transition count 362
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 286 transition count 362
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 283 transition count 358
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 283 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 136 place count 283 transition count 356
Applied a total of 136 rules in 23 ms. Remains 283 /349 variables (removed 66) and now considering 356/461 (removed 105) transitions.
// Phase 1: matrix 356 rows 283 cols
[2024-05-24 03:31:49] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 03:31:49] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-24 03:31:49] [INFO ] Invariant cache hit.
[2024-05-24 03:31:49] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2024-05-24 03:31:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:31:52] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:31:52] [INFO ] Deduced a trap composed of 134 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:31:53] [INFO ] Deduced a trap composed of 116 places in 97 ms of which 1 ms to minimize.
[2024-05-24 03:31:53] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:31:53] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:31:53] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:31:53] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:31:54] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:31:54] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:31:54] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:31:55] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:31:55] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:31:57] [INFO ] Deduced a trap composed of 135 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:31:58] [INFO ] Deduced a trap composed of 144 places in 95 ms of which 1 ms to minimize.
[2024-05-24 03:31:58] [INFO ] Deduced a trap composed of 136 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:31:58] [INFO ] Deduced a trap composed of 133 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:31:59] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:32:00] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:32:01] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:32:02] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 356/639 variables, 283/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (OVERLAPS) 0/639 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 317 constraints, problems are : Problem set: 0 solved, 355 unsolved in 26737 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:32:18] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:32:19] [INFO ] Deduced a trap composed of 157 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:32:19] [INFO ] Deduced a trap composed of 135 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:32:21] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:32:22] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 356/639 variables, 283/322 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 355/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 10 (OVERLAPS) 0/639 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Int declared 639/639 variables, and 677 constraints, problems are : Problem set: 0 solved, 355 unsolved in 24343 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 25/25 constraints]
After SMT, in 51120ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 51126ms
Starting structural reductions in LTL mode, iteration 1 : 283/349 places, 356/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51466 ms. Remains : 283/349 places, 356/461 transitions.
[2024-05-24 03:32:40] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:32:40] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:32:40] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-24 03:32:40] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:32:40] [INFO ] Flatten gal took : 19 ms
[2024-05-24 03:32:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15155969732274741551.gal : 2 ms
[2024-05-24 03:32:40] [INFO ] Time to serialize properties into /tmp/CTLFireability5040750923839335170.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/CTLFireability15155969732274741551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5040750923839335170.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.44695e+11,2.37683,71412,2,9342,5,208164,6,0,1490,440851,0


Converting to forward existential form...Done !
original formula: EF(EG(EX(((p265==0)||(p6==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX(((p265==0)||(p6==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...638
(forward)formula 0,1,19.8745,488448,1,0,689,1.63232e+06,734,320,8092,2.53471e+06,847
FORMULA HealthRecord-PT-16-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 321 transition count 422
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 321 transition count 422
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 321 transition count 421
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 71 place count 307 transition count 398
Iterating global reduction 1 with 14 rules applied. Total rules applied 85 place count 307 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 307 transition count 397
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 299 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 299 transition count 382
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 294 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 294 transition count 376
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 290 transition count 367
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 290 transition count 367
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 123 place count 287 transition count 363
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 287 transition count 363
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 284 transition count 359
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 284 transition count 359
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 284 transition count 357
Applied a total of 134 rules in 22 ms. Remains 284 /349 variables (removed 65) and now considering 357/461 (removed 104) transitions.
// Phase 1: matrix 357 rows 284 cols
[2024-05-24 03:33:00] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 03:33:01] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-24 03:33:01] [INFO ] Invariant cache hit.
[2024-05-24 03:33:01] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2024-05-24 03:33:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:33:04] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:33:04] [INFO ] Deduced a trap composed of 136 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:33:04] [INFO ] Deduced a trap composed of 116 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:33:05] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:33:05] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:33:05] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:33:07] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:33:07] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:33:09] [INFO ] Deduced a trap composed of 142 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:33:09] [INFO ] Deduced a trap composed of 136 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:33:09] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:33:09] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:33:10] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:33:10] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:33:10] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:33:10] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:33:10] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 2 ms to minimize.
[2024-05-24 03:33:10] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:33:11] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:33:11] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 2 ms to minimize.
[2024-05-24 03:33:11] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:33:11] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:33:11] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:33:11] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:33:12] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:33:12] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (OVERLAPS) 357/641 variables, 284/324 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (OVERLAPS) 0/641 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 324 constraints, problems are : Problem set: 0 solved, 356 unsolved in 23333 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-24 03:33:26] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:33:27] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:33:27] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:33:28] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (OVERLAPS) 357/641 variables, 284/328 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 356/684 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (OVERLAPS) 0/641 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 684 constraints, problems are : Problem set: 0 solved, 356 unsolved in 21452 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 30/30 constraints]
After SMT, in 44830ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 44833ms
Starting structural reductions in LTL mode, iteration 1 : 284/349 places, 357/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45164 ms. Remains : 284/349 places, 357/461 transitions.
[2024-05-24 03:33:46] [INFO ] Flatten gal took : 18 ms
[2024-05-24 03:33:46] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:33:46] [INFO ] Input system was already deterministic with 357 transitions.
[2024-05-24 03:33:46] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:33:46] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:33:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14214854401114516884.gal : 2 ms
[2024-05-24 03:33:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3273802422323760402.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/CTLFireability14214854401114516884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3273802422323760402.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.47572e+11,2.10678,66292,2,9353,5,197072,6,0,1495,405511,0


Converting to forward existential form...Done !
original formula: EG(AF(!(A(EX((p368==1)) U AF(((p77==1)&&(p414==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(!(EG(!(((p77==1)&&(p414==1)))))) U (!(EX((p368==1))) * !(!(EG(!(((p77==1)&&(p414==1))...219
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t34, t35, t36, t39, t40, t41, t44, t49...633
Detected timeout of ITS tools.
[2024-05-24 03:34:16] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:34:16] [INFO ] Applying decomposition
[2024-05-24 03:34:16] [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/graph9789999490205444484.txt' '-o' '/tmp/graph9789999490205444484.bin' '-w' '/tmp/graph9789999490205444484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9789999490205444484.bin' '-l' '-1' '-v' '-w' '/tmp/graph9789999490205444484.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:34:16] [INFO ] Decomposing Gal with order
[2024-05-24 03:34:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:34:16] [INFO ] Removed a total of 103 redundant transitions.
[2024-05-24 03:34:16] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:34:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 6 ms.
[2024-05-24 03:34:16] [INFO ] Time to serialize gal into /tmp/CTLFireability17156648825129540284.gal : 4 ms
[2024-05-24 03:34:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7355737662367701488.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/CTLFireability17156648825129540284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7355737662367701488.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47572e+11,0.83754,27600,1277,75,36305,2025,705,90987,117,6044,0


Converting to forward existential form...Done !
original formula: EG(AF(!(A(EX((u95.p368==1)) U AF(((i2.i0.u8.p77==1)&&(i20.i1.u101.p414==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(!(EG(!(((i2.i0.u8.p77==1)&&(i20.i1.u101.p414==1)))))) U (!(EX((u95.p368==1))) * !(!(E...286
Reverse transition relation is NOT exact ! Due to transitions t229, t321, i2.i0.u8.t267, i2.i0.u8.t269, i2.i0.u8.t270, i2.i0.u8.t276, i2.i0.u8.t277, i2.i0....1242
Using saturation style SCC detection
Using 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 a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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 a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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 a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 323 transition count 425
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 323 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 323 transition count 424
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 66 place count 310 transition count 403
Iterating global reduction 1 with 13 rules applied. Total rules applied 79 place count 310 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 310 transition count 402
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 87 place count 303 transition count 389
Iterating global reduction 2 with 7 rules applied. Total rules applied 94 place count 303 transition count 389
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 299 transition count 384
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 299 transition count 384
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 296 transition count 377
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 296 transition count 377
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 294 transition count 374
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 294 transition count 374
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 293 transition count 373
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 293 transition count 373
Applied a total of 114 rules in 20 ms. Remains 293 /349 variables (removed 56) and now considering 373/461 (removed 88) transitions.
// Phase 1: matrix 373 rows 293 cols
[2024-05-24 03:34:46] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 03:34:46] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-24 03:34:46] [INFO ] Invariant cache hit.
[2024-05-24 03:34:46] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-24 03:34:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-24 03:34:50] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:34:50] [INFO ] Deduced a trap composed of 150 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:34:50] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:34:50] [INFO ] Deduced a trap composed of 137 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:34:50] [INFO ] Deduced a trap composed of 124 places in 90 ms of which 1 ms to minimize.
[2024-05-24 03:34:50] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:34:50] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2024-05-24 03:34:50] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:34:51] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2024-05-24 03:34:51] [INFO ] Deduced a trap composed of 162 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:34:51] [INFO ] Deduced a trap composed of 140 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:34:51] [INFO ] Deduced a trap composed of 140 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:34:51] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:34:51] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:34:51] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:34:52] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:34:52] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:34:52] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:34:52] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:34:52] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-24 03:34:57] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (OVERLAPS) 373/666 variables, 293/328 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-24 03:35:07] [INFO ] Deduced a trap composed of 137 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/666 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/666 variables, and 329 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-24 03:35:18] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-24 03:35:21] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:35:23] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2024-05-24 03:35:23] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (OVERLAPS) 373/666 variables, 293/333 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 372/705 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (OVERLAPS) 0/666 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 705 constraints, problems are : Problem set: 0 solved, 372 unsolved in 25994 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 26/26 constraints]
After SMT, in 56055ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 56059ms
Starting structural reductions in LTL mode, iteration 1 : 293/349 places, 373/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56309 ms. Remains : 293/349 places, 373/461 transitions.
[2024-05-24 03:35:42] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:35:42] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:35:42] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-24 03:35:42] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:35:42] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:35:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12341662302921781010.gal : 3 ms
[2024-05-24 03:35:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5915865667372863546.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/CTLFireability12341662302921781010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5915865667372863546.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.941e+11,2.77104,82136,2,11425,5,240740,6,0,1547,508448,0


Converting to forward existential form...Done !
original formula: (A((p413!=1) U A(((EG((p227==1)) * (p279==1)) + (((p287==1)||(p348==1)) * EG((p451==1)))) U AG((p2==1)))) + EX(EF(((p355==0) * AG(A((p393...175
=> equivalent forward existential formula: ([((Init * !(EG(!(!((E(!(!(E(TRUE U !((p2==1))))) U (!(((EG((p227==1)) * (p279==1)) + (((p287==1)||(p348==1)) * ...773
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t34, t35, t36, t37, t40, t41, t42, t43...700
Detected timeout of ITS tools.
[2024-05-24 03:36:12] [INFO ] Flatten gal took : 18 ms
[2024-05-24 03:36:12] [INFO ] Applying decomposition
[2024-05-24 03:36:12] [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/graph5873994594196388448.txt' '-o' '/tmp/graph5873994594196388448.bin' '-w' '/tmp/graph5873994594196388448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5873994594196388448.bin' '-l' '-1' '-v' '-w' '/tmp/graph5873994594196388448.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:36:12] [INFO ] Decomposing Gal with order
[2024-05-24 03:36:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:36:12] [INFO ] Removed a total of 110 redundant transitions.
[2024-05-24 03:36:12] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:36:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2024-05-24 03:36:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4818088779533544164.gal : 3 ms
[2024-05-24 03:36:12] [INFO ] Time to serialize properties into /tmp/CTLFireability5278887846450923844.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/CTLFireability4818088779533544164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5278887846450923844.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.941e+11,1.07397,38292,1076,119,55998,3430,748,166481,121,19236,0


Converting to forward existential form...Done !
original formula: (A((i20.i1.u112.p413!=1) U A(((EG((i11.i1.u62.p227==1)) * (i17.i2.u80.p279==1)) + (((i16.i1.u83.p287==1)||(i16.i2.u90.p348==1)) * EG((i17...286
=> equivalent forward existential formula: ([((Init * !(EG(!(!((E(!(!(E(TRUE U !((i14.i0.u1.p2==1))))) U (!(((EG((i11.i1.u62.p227==1)) * (i17.i2.u80.p279==...1096
Reverse transition relation is NOT exact ! Due to transitions t92, t137, t235, t316, t317, t318, t319, t320, t332, i1.i0.u3.t273, i1.i0.u3.t275, i1.i0.u3.t...1371
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,5.09094,146268,1,0,273716,5560,5130,594482,623,19236,489928
FORMULA HealthRecord-PT-16-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 327 transition count 431
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 327 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 327 transition count 430
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 316 transition count 412
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 316 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 316 transition count 411
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 74 place count 310 transition count 400
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 310 transition count 400
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 307 transition count 397
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 307 transition count 397
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 304 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 304 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 302 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 302 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 300 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 300 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 300 transition count 385
Applied a total of 101 rules in 25 ms. Remains 300 /349 variables (removed 49) and now considering 385/461 (removed 76) transitions.
// Phase 1: matrix 385 rows 300 cols
[2024-05-24 03:36:18] [INFO ] Computed 14 invariants in 3 ms
[2024-05-24 03:36:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 03:36:18] [INFO ] Invariant cache hit.
[2024-05-24 03:36:18] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2024-05-24 03:36:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:36:22] [INFO ] Deduced a trap composed of 143 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:36:22] [INFO ] Deduced a trap composed of 158 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:36:22] [INFO ] Deduced a trap composed of 147 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:36:22] [INFO ] Deduced a trap composed of 136 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:36:22] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:36:22] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:36:23] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 1 ms to minimize.
[2024-05-24 03:36:23] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:36:23] [INFO ] Deduced a trap composed of 145 places in 77 ms of which 3 ms to minimize.
[2024-05-24 03:36:23] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 3 ms to minimize.
[2024-05-24 03:36:23] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:36:23] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:36:23] [INFO ] Deduced a trap composed of 146 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:36:25] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:36:25] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:36:25] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:36:25] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-24 03:36:28] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 4 ms to minimize.
[2024-05-24 03:36:28] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:36:28] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:36:29] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:36:29] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 2 ms to minimize.
[2024-05-24 03:36:30] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-24 03:36:32] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:36:33] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-24 03:36:34] [INFO ] Deduced a trap composed of 123 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 8 (OVERLAPS) 385/685 variables, 300/341 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-24 03:36:41] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 685/685 variables, and 342 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-24 03:36:50] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-24 03:36:54] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:36:54] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:36:54] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-24 03:36:56] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-24 03:36:59] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:36:59] [INFO ] Deduced a trap composed of 125 places in 96 ms of which 1 ms to minimize.
[2024-05-24 03:36:59] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:36:59] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2024-05-24 03:36:59] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 1 ms to minimize.
[2024-05-24 03:37:00] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:37:00] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:37:00] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:37:01] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:37:01] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 9 (OVERLAPS) 385/685 variables, 300/357 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/685 variables, 384/741 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/685 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 685/685 variables, and 741 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 43/43 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 300/349 places, 385/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60374 ms. Remains : 300/349 places, 385/461 transitions.
[2024-05-24 03:37:18] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:37:18] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:37:18] [INFO ] Input system was already deterministic with 385 transitions.
[2024-05-24 03:37:18] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:37:18] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:37:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1982482970989011407.gal : 15 ms
[2024-05-24 03:37:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11750178910167813351.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/CTLFireability1982482970989011407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11750178910167813351.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX((EX(E((((p154==1)&&(p380==1)) + AF((p163==1))) U (EG(((p334==1)&&(p423==1))) + (p327==1)))) + ((AG(EF((p217==0))) * (p307==1)) * ((p40...202
=> equivalent forward existential formula: (([FwdG(FwdU(EY(EY(Init)),(((p154==1)&&(p380==1)) + !(EG(!((p163==1)))))),((p334==1)&&(p423==1)))] != FALSE + [(...480
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t35, t36, t37, t41, t42, t43, t46...804
Detected timeout of ITS tools.
[2024-05-24 03:37:48] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:37:48] [INFO ] Applying decomposition
[2024-05-24 03:37:48] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2448464832573265895.txt' '-o' '/tmp/graph2448464832573265895.bin' '-w' '/tmp/graph2448464832573265895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2448464832573265895.bin' '-l' '-1' '-v' '-w' '/tmp/graph2448464832573265895.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:37:48] [INFO ] Decomposing Gal with order
[2024-05-24 03:37:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:37:48] [INFO ] Removed a total of 111 redundant transitions.
[2024-05-24 03:37:48] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:37:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2024-05-24 03:37:48] [INFO ] Time to serialize gal into /tmp/CTLFireability2992614025157819442.gal : 3 ms
[2024-05-24 03:37:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15831849407678187750.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/CTLFireability2992614025157819442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15831849407678187750.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.06638e+11,1.18267,44612,1681,342,61043,8784,724,176625,181,44396,0


Converting to forward existential form...Done !
original formula: EX((EX(E((((i6.i1.u33.p154==1)&&(i20.u106.p380==1)) + AF((i6.i2.u39.p163==1))) U (EG(((i20.u82.p334==1)&&(i20.u106.p423==1))) + (i17.i1.u...306
=> equivalent forward existential formula: (([FwdG(FwdU(EY(EY(Init)),(((i6.i1.u33.p154==1)&&(i20.u106.p380==1)) + !(EG(!((i6.i2.u39.p163==1)))))),((i20.u82...644
Reverse transition relation is NOT exact ! Due to transitions t106, t251, t327, t328, t329, t330, t331, t339, t340, t341, t342, t343, i1.i0.u7.t289, i1.i0....1511
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 a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,0,6.32193,204596,1,0,372872,22492,5194,752765,952,78472,655872
FORMULA HealthRecord-PT-16-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 323 transition count 424
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 323 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 323 transition count 423
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 66 place count 310 transition count 402
Iterating global reduction 1 with 13 rules applied. Total rules applied 79 place count 310 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 310 transition count 401
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 87 place count 303 transition count 388
Iterating global reduction 2 with 7 rules applied. Total rules applied 94 place count 303 transition count 388
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 298 transition count 382
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 298 transition count 382
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 295 transition count 375
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 295 transition count 375
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 292 transition count 372
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 292 transition count 372
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 290 transition count 370
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 290 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 290 transition count 369
Applied a total of 121 rules in 33 ms. Remains 290 /349 variables (removed 59) and now considering 369/461 (removed 92) transitions.
// Phase 1: matrix 369 rows 290 cols
[2024-05-24 03:37:55] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 03:37:55] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 03:37:55] [INFO ] Invariant cache hit.
[2024-05-24 03:37:55] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-24 03:37:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:37:58] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 151 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 136 places in 116 ms of which 2 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 120 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 1 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 1 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 122 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:38:04] [INFO ] Deduced a trap composed of 140 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:38:04] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:38:04] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 1 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:38:06] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:38:06] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:38:06] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:38:06] [INFO ] Deduced a trap composed of 142 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:38:07] [INFO ] Deduced a trap composed of 130 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 369/659 variables, 290/334 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/659 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 335 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/659 variables, 290/335 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 368/703 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:38:32] [INFO ] Deduced a trap composed of 138 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:38:46] [INFO ] Deduced a trap composed of 142 places in 105 ms of which 1 ms to minimize.
[2024-05-24 03:38:48] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 5 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/659 variables, 2/706 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/659 variables, and 706 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 34/34 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 290/349 places, 369/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60480 ms. Remains : 290/349 places, 369/461 transitions.
[2024-05-24 03:38:55] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:38:55] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:38:55] [INFO ] Input system was already deterministic with 369 transitions.
[2024-05-24 03:38:55] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:38:55] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:38:55] [INFO ] Time to serialize gal into /tmp/CTLFireability5853395085226983351.gal : 1 ms
[2024-05-24 03:38:55] [INFO ] Time to serialize properties into /tmp/CTLFireability14082952619970242385.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/CTLFireability5853395085226983351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14082952619970242385.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.60824e+11,2.13139,70676,2,10358,5,211024,6,0,1531,427003,0


Converting to forward existential form...Done !
original formula: AG(AX(EG((!(E((p364==1) U (p386==1))) + (p418==0)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG((!(E((p364==1) U (p386==1))) + (p418==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t37, t38, t39, t40, t43...668
Detected timeout of ITS tools.
[2024-05-24 03:39:25] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:39:25] [INFO ] Applying decomposition
[2024-05-24 03:39:25] [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/graph4815814986893293190.txt' '-o' '/tmp/graph4815814986893293190.bin' '-w' '/tmp/graph4815814986893293190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4815814986893293190.bin' '-l' '-1' '-v' '-w' '/tmp/graph4815814986893293190.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:39:25] [INFO ] Decomposing Gal with order
[2024-05-24 03:39:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:39:25] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-24 03:39:25] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:39:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 4 ms.
[2024-05-24 03:39:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1094470089798469725.gal : 3 ms
[2024-05-24 03:39:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6776306460565075072.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/CTLFireability1094470089798469725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6776306460565075072.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.60824e+11,0.715489,26828,1105,79,35681,2540,746,117026,114,10043,0


Converting to forward existential form...Done !
original formula: AG(AX(EG((!(E((i17.i1.u93.p364==1) U (i19.u100.p386==1))) + (i19.u109.p418==0)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG((!(E((i17.i1.u93.p364==1) U (i19.u100.p386==1))) + (i19.u109.p418==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t23, t207, t239, t304, t331, i1.i1.t277, i1.i1.t286, i1.i1.t291, i1.i1.t293, i1.i1....1229
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,4.22352,117116,1,0,173489,3357,4825,693209,516,10043,338570
FORMULA HealthRecord-PT-16-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 321 transition count 422
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 321 transition count 422
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 321 transition count 421
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 71 place count 307 transition count 398
Iterating global reduction 1 with 14 rules applied. Total rules applied 85 place count 307 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 307 transition count 397
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 299 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 299 transition count 382
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 294 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 294 transition count 376
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 290 transition count 367
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 290 transition count 367
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 124 place count 286 transition count 362
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 286 transition count 362
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 283 transition count 358
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 283 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 136 place count 283 transition count 356
Applied a total of 136 rules in 20 ms. Remains 283 /349 variables (removed 66) and now considering 356/461 (removed 105) transitions.
// Phase 1: matrix 356 rows 283 cols
[2024-05-24 03:39:30] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 03:39:30] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-24 03:39:30] [INFO ] Invariant cache hit.
[2024-05-24 03:39:30] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2024-05-24 03:39:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:39:33] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:39:33] [INFO ] Deduced a trap composed of 134 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:39:33] [INFO ] Deduced a trap composed of 116 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:39:33] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:39:34] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:39:34] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:39:34] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:39:34] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:39:35] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:39:35] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:39:36] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:39:36] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:39:38] [INFO ] Deduced a trap composed of 135 places in 88 ms of which 1 ms to minimize.
[2024-05-24 03:39:38] [INFO ] Deduced a trap composed of 144 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:39:38] [INFO ] Deduced a trap composed of 136 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:39:39] [INFO ] Deduced a trap composed of 133 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:39:40] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:39:40] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:39:41] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:39:42] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 356/639 variables, 283/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (OVERLAPS) 0/639 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 317 constraints, problems are : Problem set: 0 solved, 355 unsolved in 25639 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:39:58] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:39:58] [INFO ] Deduced a trap composed of 157 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:39:58] [INFO ] Deduced a trap composed of 135 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:40:01] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:40:01] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 356/639 variables, 283/322 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 355/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 10 (OVERLAPS) 0/639 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Int declared 639/639 variables, and 677 constraints, problems are : Problem set: 0 solved, 355 unsolved in 23686 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 25/25 constraints]
After SMT, in 49368ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 49371ms
Starting structural reductions in LTL mode, iteration 1 : 283/349 places, 356/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49619 ms. Remains : 283/349 places, 356/461 transitions.
[2024-05-24 03:40:19] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:40:19] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:40:19] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-24 03:40:19] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:40:19] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:40:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13928103997678113231.gal : 1 ms
[2024-05-24 03:40:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12728254340839443383.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/CTLFireability13928103997678113231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12728254340839443383.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.44695e+11,2.14347,71416,2,9342,5,208164,6,0,1490,440851,0


Converting to forward existential form...Done !
original formula: A(AF(!((AX(((p69==1)&&(p95==1))) * AG((p95==1))))) U AX(EG(((p197==1) + AG((p82==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(EG(((p197==1) + !(E(TRUE U !((p82==1))))))))))))) * !(E(!(!(EX(!(EG(((p197==1) + !(E(TRU...329
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...638
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-24 03:40:49] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:40:49] [INFO ] Applying decomposition
[2024-05-24 03:40:49] [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/graph6239865427154913740.txt' '-o' '/tmp/graph6239865427154913740.bin' '-w' '/tmp/graph6239865427154913740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6239865427154913740.bin' '-l' '-1' '-v' '-w' '/tmp/graph6239865427154913740.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:40:49] [INFO ] Decomposing Gal with order
[2024-05-24 03:40:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:40:49] [INFO ] Removed a total of 82 redundant transitions.
[2024-05-24 03:40:49] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:40:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2024-05-24 03:40:49] [INFO ] Time to serialize gal into /tmp/CTLFireability2261426205246440384.gal : 3 ms
[2024-05-24 03:40:49] [INFO ] Time to serialize properties into /tmp/CTLFireability12587693234536532706.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/CTLFireability2261426205246440384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12587693234536532706.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44695e+11,0.272435,15132,810,132,20213,1918,671,44785,168,6775,0


Converting to forward existential form...Done !
original formula: A(AF(!((AX(((i1.i0.u7.p69==1)&&(i10.i0.u13.p95==1))) * AG((i10.i0.u13.p95==1))))) U AX(EG(((i9.i2.u50.p197==1) + AG((i1.i1.u9.p82==1)))))...156
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(EG(((i9.i2.u50.p197==1) + !(E(TRUE U !((i1.i1.u9.p82==1))))))))))))) * !(E(!(!(EX(!(EG((...417
Reverse transition relation is NOT exact ! Due to transitions t131, t321, i1.i1.u9.t267, i1.i1.u9.t269, i1.i1.u9.t270, i1.i1.u9.t276, i1.i1.u9.t277, i1.i1....1219
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,1.87,69516,1,0,130946,5026,4711,222365,855,10883,242442
FORMULA HealthRecord-PT-16-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 325 transition count 427
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 325 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 325 transition count 426
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 317 transition count 413
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 317 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 317 transition count 412
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 312 transition count 402
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 312 transition count 402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 311 transition count 400
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 311 transition count 400
Applied a total of 78 rules in 14 ms. Remains 311 /349 variables (removed 38) and now considering 400/461 (removed 61) transitions.
// Phase 1: matrix 400 rows 311 cols
[2024-05-24 03:40:51] [INFO ] Computed 14 invariants in 5 ms
[2024-05-24 03:40:51] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 03:40:51] [INFO ] Invariant cache hit.
[2024-05-24 03:40:51] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2024-05-24 03:40:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 1/311 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-24 03:40:55] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:40:56] [INFO ] Deduced a trap composed of 146 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:40:56] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:40:56] [INFO ] Deduced a trap composed of 126 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:40:56] [INFO ] Deduced a trap composed of 151 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:40:56] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:40:56] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:40:57] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:40:57] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:40:57] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:40:57] [INFO ] Deduced a trap composed of 152 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:40:57] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:40:59] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:40:59] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-24 03:41:04] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-24 03:41:05] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:41:05] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:41:05] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:41:05] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:41:05] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:41:05] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:41:06] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 2 ms to minimize.
[2024-05-24 03:41:06] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:41:06] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:41:06] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 2 ms to minimize.
[2024-05-24 03:41:06] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 2 ms to minimize.
[2024-05-24 03:41:07] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:41:07] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-24 03:41:10] [INFO ] Deduced a trap composed of 144 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 8 (OVERLAPS) 400/711 variables, 311/354 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/711 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 711/711 variables, and 354 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 1/311 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-24 03:41:24] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:41:24] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:41:24] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-05-24 03:41:27] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (OVERLAPS) 400/711 variables, 311/358 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/711 variables, 399/757 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/711 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 10 (OVERLAPS) 0/711 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 399 unsolved
No progress, stopping.
After SMT solving in domain Int declared 711/711 variables, and 757 constraints, problems are : Problem set: 0 solved, 399 unsolved in 29355 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 33/33 constraints]
After SMT, in 59424ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 59428ms
Starting structural reductions in LTL mode, iteration 1 : 311/349 places, 400/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59716 ms. Remains : 311/349 places, 400/461 transitions.
[2024-05-24 03:41:51] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:41:51] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:41:51] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-24 03:41:51] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:41:51] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:41:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6177973710294784.gal : 1 ms
[2024-05-24 03:41:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11780062958727171540.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/CTLFireability6177973710294784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11780062958727171540.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 -...281
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.7309e+11,4.72482,139136,2,14068,5,395119,6,0,1646,927382,0


Converting to forward existential form...Done !
original formula: (AF(AG(((p373==0) + EX((p88==0))))) + (EF(((((EF((p82==1)) + (p282==0)) + ((p37==1)&&(p136==1))) * EX((((p334==1)&&(p378==1))||(p128==1))...272
=> equivalent forward existential formula: ([((Init * !(!(EG(!(!(E(TRUE U !(((p373==0) + EX((p88==0))))))))))) * !(E(TRUE U ((((E(TRUE U (p82==1)) + (p282=...565
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t34, t35, t36, t39, t40, t41, t44, t45...791
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-24 03:42:21] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:42:21] [INFO ] Applying decomposition
[2024-05-24 03:42:21] [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/graph5948489526256327942.txt' '-o' '/tmp/graph5948489526256327942.bin' '-w' '/tmp/graph5948489526256327942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5948489526256327942.bin' '-l' '-1' '-v' '-w' '/tmp/graph5948489526256327942.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:42:21] [INFO ] Decomposing Gal with order
[2024-05-24 03:42:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:42:21] [INFO ] Removed a total of 116 redundant transitions.
[2024-05-24 03:42:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 03:42:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2024-05-24 03:42:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12561263520054240131.gal : 3 ms
[2024-05-24 03:42:21] [INFO ] Time to serialize properties into /tmp/CTLFireability963850808496029712.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/CTLFireability12561263520054240131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability963850808496029712.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.7309e+11,3.19717,87516,2924,268,142899,6697,762,301810,186,30138,0


Converting to forward existential form...Done !
original formula: (AF(AG(((i20.u112.p373==0) + EX((i2.i6.u20.p88==0))))) + (EF(((((EF((i2.i0.u18.p82==1)) + (u87.p282==0)) + ((i2.i0.u12.p37==1)&&(i5.i0.u2...423
=> equivalent forward existential formula: ([((Init * !(!(EG(!(!(E(TRUE U !(((i20.u112.p373==0) + EX((i2.i6.u20.p88==0))))))))))) * !(E(TRUE U ((((E(TRUE U...774
Reverse transition relation is NOT exact ! Due to transitions t102, t181, t340, t341, t342, t343, t344, t356, t357, t366, i2.t299, i2.i0.t284, i2.i0.t311, ...1518
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,10.6313,254628,1,0,423348,24345,5780,917362,1056,79374,1285630
FORMULA HealthRecord-PT-16-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Graph (trivial) has 393 edges and 349 vertex of which 46 / 349 are part of one of the 17 SCC in 5 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 319 transition count 297
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 148 rules applied. Total rules applied 280 place count 188 transition count 280
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 290 place count 179 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 291 place count 178 transition count 279
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 291 place count 178 transition count 272
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 305 place count 171 transition count 272
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 341 place count 135 transition count 211
Iterating global reduction 4 with 36 rules applied. Total rules applied 377 place count 135 transition count 211
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 383 place count 135 transition count 205
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 389 place count 129 transition count 205
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 401 place count 117 transition count 181
Iterating global reduction 6 with 12 rules applied. Total rules applied 413 place count 117 transition count 181
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 414 place count 117 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 415 place count 116 transition count 180
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 422 place count 109 transition count 167
Iterating global reduction 8 with 7 rules applied. Total rules applied 429 place count 109 transition count 167
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 434 place count 104 transition count 161
Iterating global reduction 8 with 5 rules applied. Total rules applied 439 place count 104 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 441 place count 104 transition count 159
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 444 place count 101 transition count 154
Iterating global reduction 9 with 3 rules applied. Total rules applied 447 place count 101 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 448 place count 101 transition count 153
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 450 place count 99 transition count 149
Iterating global reduction 10 with 2 rules applied. Total rules applied 452 place count 99 transition count 149
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 454 place count 97 transition count 145
Iterating global reduction 10 with 2 rules applied. Total rules applied 456 place count 97 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 458 place count 97 transition count 143
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 22 rules applied. Total rules applied 480 place count 86 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 482 place count 86 transition count 130
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 485 place count 83 transition count 124
Iterating global reduction 12 with 3 rules applied. Total rules applied 488 place count 83 transition count 124
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 490 place count 81 transition count 122
Iterating global reduction 12 with 2 rules applied. Total rules applied 492 place count 81 transition count 122
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 493 place count 80 transition count 120
Iterating global reduction 12 with 1 rules applied. Total rules applied 494 place count 80 transition count 120
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 495 place count 79 transition count 118
Iterating global reduction 12 with 1 rules applied. Total rules applied 496 place count 79 transition count 118
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 497 place count 78 transition count 116
Iterating global reduction 12 with 1 rules applied. Total rules applied 498 place count 78 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 499 place count 78 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 501 place count 77 transition count 114
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 502 place count 76 transition count 113
Iterating global reduction 12 with 1 rules applied. Total rules applied 503 place count 76 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 504 place count 76 transition count 112
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 1 rules applied. Total rules applied 505 place count 76 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 506 place count 75 transition count 111
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 509 place count 75 transition count 111
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 510 place count 74 transition count 110
Iterating global reduction 14 with 1 rules applied. Total rules applied 511 place count 74 transition count 110
Applied a total of 511 rules in 66 ms. Remains 74 /349 variables (removed 275) and now considering 110/461 (removed 351) transitions.
[2024-05-24 03:42:32] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
// Phase 1: matrix 102 rows 74 cols
[2024-05-24 03:42:32] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 03:42:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:42:32] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
[2024-05-24 03:42:32] [INFO ] Invariant cache hit.
[2024-05-24 03:42:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:42:32] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-24 03:42:32] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-24 03:42:32] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
[2024-05-24 03:42:32] [INFO ] Invariant cache hit.
[2024-05-24 03:42:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-24 03:42:32] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:42:32] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 101/175 variables, 74/83 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/176 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/176 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 84 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-24 03:42:34] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 101/175 variables, 74/84 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 1/176 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 193 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3283 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 3/3 constraints]
After SMT, in 5325ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 5326ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/349 places, 110/461 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5498 ms. Remains : 74/349 places, 110/461 transitions.
[2024-05-24 03:42:37] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:42:37] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:42:37] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-24 03:42:37] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:42:37] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 4524 steps (291 resets) in 15 ms. (282 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-16-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 03:42:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13941223632289959658.gal : 1 ms
[2024-05-24 03:42:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13403953876345316395.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13941223632289959658.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13403953876345316395.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Graph (trivial) has 401 edges and 349 vertex of which 46 / 349 are part of one of the 17 SCC in 2 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 138 place count 319 transition count 291
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 154 rules applied. Total rules applied 292 place count 182 transition count 274
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 301 place count 173 transition count 274
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 301 place count 173 transition count 267
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 315 place count 166 transition count 267
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 348 place count 133 transition count 206
Iterating global reduction 3 with 33 rules applied. Total rules applied 381 place count 133 transition count 206
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 387 place count 133 transition count 200
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 393 place count 127 transition count 200
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 402 place count 118 transition count 182
Iterating global reduction 5 with 9 rules applied. Total rules applied 411 place count 118 transition count 182
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 412 place count 118 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 413 place count 117 transition count 181
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 417 place count 113 transition count 174
Iterating global reduction 7 with 4 rules applied. Total rules applied 421 place count 113 transition count 174
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 424 place count 110 transition count 170
Iterating global reduction 7 with 3 rules applied. Total rules applied 427 place count 110 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 428 place count 110 transition count 169
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 430 place count 108 transition count 166
Iterating global reduction 8 with 2 rules applied. Total rules applied 432 place count 108 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 433 place count 108 transition count 165
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 434 place count 107 transition count 163
Iterating global reduction 9 with 1 rules applied. Total rules applied 435 place count 107 transition count 163
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 436 place count 106 transition count 161
Iterating global reduction 9 with 1 rules applied. Total rules applied 437 place count 106 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 438 place count 106 transition count 160
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 462 place count 94 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 464 place count 94 transition count 146
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 468 place count 90 transition count 138
Iterating global reduction 11 with 4 rules applied. Total rules applied 472 place count 90 transition count 138
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 475 place count 87 transition count 134
Iterating global reduction 11 with 3 rules applied. Total rules applied 478 place count 87 transition count 134
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 480 place count 85 transition count 131
Iterating global reduction 11 with 2 rules applied. Total rules applied 482 place count 85 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 483 place count 85 transition count 130
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 484 place count 84 transition count 128
Iterating global reduction 12 with 1 rules applied. Total rules applied 485 place count 84 transition count 128
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 486 place count 83 transition count 126
Iterating global reduction 12 with 1 rules applied. Total rules applied 487 place count 83 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 489 place count 83 transition count 124
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 1 rules applied. Total rules applied 490 place count 83 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 491 place count 82 transition count 123
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 492 place count 81 transition count 121
Iterating global reduction 14 with 1 rules applied. Total rules applied 493 place count 81 transition count 121
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 494 place count 80 transition count 119
Iterating global reduction 14 with 1 rules applied. Total rules applied 495 place count 80 transition count 119
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 496 place count 79 transition count 118
Iterating global reduction 14 with 1 rules applied. Total rules applied 497 place count 79 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 499 place count 78 transition count 117
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 500 place count 77 transition count 116
Iterating global reduction 14 with 1 rules applied. Total rules applied 501 place count 77 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 503 place count 77 transition count 114
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 14 with 1 rules applied. Total rules applied 504 place count 77 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 505 place count 76 transition count 113
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 506 place count 76 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 507 place count 75 transition count 112
Applied a total of 507 rules in 64 ms. Remains 75 /349 variables (removed 274) and now considering 112/461 (removed 349) transitions.
[2024-05-24 03:42:37] [INFO ] Flow matrix only has 104 transitions (discarded 8 similar events)
// Phase 1: matrix 104 rows 75 cols
[2024-05-24 03:42:37] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 03:42:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-24 03:42:37] [INFO ] Flow matrix only has 104 transitions (discarded 8 similar events)
[2024-05-24 03:42:37] [INFO ] Invariant cache hit.
[2024-05-24 03:42:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:42:38] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-24 03:42:38] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-24 03:42:38] [INFO ] Flow matrix only has 104 transitions (discarded 8 similar events)
[2024-05-24 03:42:38] [INFO ] Invariant cache hit.
[2024-05-24 03:42:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 7/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:42:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:42:38] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:42:38] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:42:38] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 103/178 variables, 75/86 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/179 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 87 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2458 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 7/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:42:40] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 103/178 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 98/185 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/179 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 186 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2629 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 5/5 constraints]
After SMT, in 5104ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5105ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/349 places, 112/461 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5282 ms. Remains : 75/349 places, 112/461 transitions.
[2024-05-24 03:42:43] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:42:43] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:42:43] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-24 03:42:43] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:42:43] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:42:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8421888238002859129.gal : 1 ms
[2024-05-24 03:42:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4974097723514543080.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/ReachabilityCardinality8421888238002859129.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4974097723514543080.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/ReachabilityCardinality4974097723514543080.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 23
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :23 after 51
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :51 after 320
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :320 after 67303
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :67303 after 73728
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :73728 after 9.96147e+06
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,1.80224e+07,0.04542,5288,2,589,13,7980,7,0,405,6667,0
Total reachable state count : 18022404

Verifying 1 reachability properties.
Reachability property HealthRecord-PT-16-CTLFireability-2024-10 is true.
FORMULA HealthRecord-PT-16-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-16-CTLFireability-2024-10,327680,0.046,5548,2,300,13,7980,7,0,407,6667,0
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 40000 steps (2677 resets) in 516 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (308 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 125372 steps, run visited all 1 properties in 169 ms. (steps per millisecond=741 )
Probabilistic random walk after 125372 steps, saw 22876 distinct states, run finished after 169 ms. (steps per millisecond=741 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 322 transition count 424
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 322 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 322 transition count 423
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 310 transition count 403
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 310 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 310 transition count 402
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 86 place count 304 transition count 391
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 304 transition count 391
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 301 transition count 388
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 301 transition count 388
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 298 transition count 381
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 298 transition count 381
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 295 transition count 377
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 295 transition count 377
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 294 transition count 375
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 294 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 294 transition count 374
Applied a total of 113 rules in 27 ms. Remains 294 /349 variables (removed 55) and now considering 374/461 (removed 87) transitions.
// Phase 1: matrix 374 rows 294 cols
[2024-05-24 03:42:43] [INFO ] Computed 14 invariants in 5 ms
[2024-05-24 03:42:43] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 03:42:43] [INFO ] Invariant cache hit.
[2024-05-24 03:42:43] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2024-05-24 03:42:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/294 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-24 03:42:47] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:42:47] [INFO ] Deduced a trap composed of 156 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:42:47] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:42:47] [INFO ] Deduced a trap composed of 141 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:42:48] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:42:50] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:42:50] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-24 03:42:52] [INFO ] Deduced a trap composed of 137 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:42:53] [INFO ] Deduced a trap composed of 135 places in 103 ms of which 1 ms to minimize.
[2024-05-24 03:42:53] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2024-05-24 03:42:54] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-24 03:42:55] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-24 03:42:57] [INFO ] Deduced a trap composed of 120 places in 96 ms of which 1 ms to minimize.
[2024-05-24 03:42:57] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2024-05-24 03:42:58] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:42:58] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:42:58] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:42:58] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:42:58] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:42:58] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:42:59] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:42:59] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:42:59] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:42:59] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:42:59] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:43:00] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-24 03:43:03] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:43:03] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 1 ms to minimize.
[2024-05-24 03:43:03] [INFO ] Deduced a trap composed of 119 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:43:04] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:43:04] [INFO ] Deduced a trap composed of 148 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 9 (OVERLAPS) 374/668 variables, 294/339 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 339 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/294 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-24 03:43:16] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:43:16] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 1 ms to minimize.
[2024-05-24 03:43:17] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 374/668 variables, 294/342 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 373/715 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 9 (OVERLAPS) 0/668 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 715 constraints, problems are : Problem set: 0 solved, 373 unsolved in 22635 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 34/34 constraints]
After SMT, in 52692ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 52698ms
Starting structural reductions in LTL mode, iteration 1 : 294/349 places, 374/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52959 ms. Remains : 294/349 places, 374/461 transitions.
[2024-05-24 03:43:36] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:43:36] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:43:36] [INFO ] Input system was already deterministic with 374 transitions.
[2024-05-24 03:43:36] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:43:36] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:43:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1032410423505752723.gal : 1 ms
[2024-05-24 03:43:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13710968856256703517.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/CTLFireability1032410423505752723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13710968856256703517.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.98639e+11,3.36539,114504,2,13831,5,305356,6,0,1552,764706,0


Converting to forward existential form...Done !
original formula: (!(E(!(((EF(((p334==1)&&(p420==1))) * ((EG((p377==1)) + (p235==1)) + (p271==1))) * EG(((p227==1)||(p28==1))))) U E((p320==1) U (p340==1))...196
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(E(TRUE U (!(EG(!(EX((p191==1))))) + (p206==1))))),!(((E(TRUE U ((p334==1)&&(p420==1))) * (...260
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t33, t35, t36, t37, t38, t41, t42...732
Detected timeout of ITS tools.
[2024-05-24 03:44:06] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:44:06] [INFO ] Applying decomposition
[2024-05-24 03:44:06] [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/graph5954006652529749257.txt' '-o' '/tmp/graph5954006652529749257.bin' '-w' '/tmp/graph5954006652529749257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5954006652529749257.bin' '-l' '-1' '-v' '-w' '/tmp/graph5954006652529749257.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:44:06] [INFO ] Decomposing Gal with order
[2024-05-24 03:44:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:44:06] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-24 03:44:06] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:44:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2024-05-24 03:44:06] [INFO ] Time to serialize gal into /tmp/CTLFireability14878490128730891393.gal : 3 ms
[2024-05-24 03:44:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3684528982421986892.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/CTLFireability14878490128730891393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3684528982421986892.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.98639e+11,1.44167,49632,1294,202,61307,10572,781,252025,150,68962,0


Converting to forward existential form...Done !
original formula: (!(E(!(((EF(((i19.i1.u83.p334==1)&&(i19.i1.u107.p420==1))) * ((EG((i19.i1.u107.p377==1)) + (i9.i3.u67.p235==1)) + (i12.i2.u76.p271==1))) ...313
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(E(TRUE U (!(EG(!(EX((i8.i0.u48.p191==1))))) + (i8.i3.u55.p206==1))))),!(((E(TRUE U ((i19.i...377
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t23, t93, t237, t308, t319, t320, t321, t322, t323, t335, i1.i0.t275, i1.i0.t277, i...1426
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using 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 a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 323 transition count 425
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 323 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 323 transition count 424
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 66 place count 310 transition count 402
Iterating global reduction 1 with 13 rules applied. Total rules applied 79 place count 310 transition count 402
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 86 place count 303 transition count 389
Iterating global reduction 1 with 7 rules applied. Total rules applied 93 place count 303 transition count 389
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 98 place count 298 transition count 383
Iterating global reduction 1 with 5 rules applied. Total rules applied 103 place count 298 transition count 383
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 107 place count 294 transition count 374
Iterating global reduction 1 with 4 rules applied. Total rules applied 111 place count 294 transition count 374
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 115 place count 290 transition count 369
Iterating global reduction 1 with 4 rules applied. Total rules applied 119 place count 290 transition count 369
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 288 transition count 367
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 288 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 124 place count 288 transition count 366
Applied a total of 124 rules in 31 ms. Remains 288 /349 variables (removed 61) and now considering 366/461 (removed 95) transitions.
// Phase 1: matrix 366 rows 288 cols
[2024-05-24 03:44:36] [INFO ] Computed 14 invariants in 4 ms
[2024-05-24 03:44:36] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-24 03:44:36] [INFO ] Invariant cache hit.
[2024-05-24 03:44:36] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-05-24 03:44:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/288 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-24 03:44:40] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:44:40] [INFO ] Deduced a trap composed of 136 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:44:40] [INFO ] Deduced a trap composed of 114 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:44:40] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:44:40] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:44:40] [INFO ] Deduced a trap composed of 136 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:44:41] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:44:43] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-24 03:44:45] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:44:45] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-24 03:44:47] [INFO ] Deduced a trap composed of 136 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:44:48] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:44:48] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:44:48] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:44:48] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:44:48] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:44:49] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:44:49] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/654 variables, 288/320 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 9 (OVERLAPS) 0/654 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 320 constraints, problems are : Problem set: 0 solved, 365 unsolved in 27250 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/288 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-24 03:45:06] [INFO ] Deduced a trap composed of 136 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-24 03:45:08] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:45:08] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:45:09] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:45:09] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/654 variables, 288/325 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 365/690 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-05-24 03:45:14] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:45:14] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:45:15] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 3/693 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 11 (OVERLAPS) 0/654 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 693 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 26/26 constraints]
After SMT, in 57301ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 57305ms
Starting structural reductions in LTL mode, iteration 1 : 288/349 places, 366/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57564 ms. Remains : 288/349 places, 366/461 transitions.
[2024-05-24 03:45:34] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:45:34] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:45:34] [INFO ] Input system was already deterministic with 366 transitions.
[2024-05-24 03:45:34] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:45:34] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:45:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12830898294232417375.gal : 1 ms
[2024-05-24 03:45:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7485142659859993326.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/CTLFireability12830898294232417375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7485142659859993326.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.68976e+11,2.6941,94432,2,11357,5,280449,6,0,1520,591986,0


Converting to forward existential form...Done !
original formula: AG(EX(((p98==0) + ((EF((p309==0)) * (p245==0)) * ((p168==0)&&(p352==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((p98==0) + ((E(TRUE U (p309==0)) * (p245==0)) * ((p168==0)&&(p352==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t42...724
(forward)formula 0,0,12.4536,321980,1,0,605,1.06342e+06,756,331,8444,1.37538e+06,752
FORMULA HealthRecord-PT-16-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 322 transition count 423
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 322 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 322 transition count 422
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 69 place count 308 transition count 399
Iterating global reduction 1 with 14 rules applied. Total rules applied 83 place count 308 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 308 transition count 398
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 92 place count 300 transition count 383
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 300 transition count 383
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 295 transition count 377
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 295 transition count 377
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 291 transition count 368
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 291 transition count 368
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 121 place count 288 transition count 364
Iterating global reduction 2 with 3 rules applied. Total rules applied 124 place count 288 transition count 364
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 286 transition count 361
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 286 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 286 transition count 360
Applied a total of 129 rules in 31 ms. Remains 286 /349 variables (removed 63) and now considering 360/461 (removed 101) transitions.
// Phase 1: matrix 360 rows 286 cols
[2024-05-24 03:45:46] [INFO ] Computed 14 invariants in 6 ms
[2024-05-24 03:45:46] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 03:45:46] [INFO ] Invariant cache hit.
[2024-05-24 03:45:47] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2024-05-24 03:45:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-05-24 03:45:50] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:45:50] [INFO ] Deduced a trap composed of 136 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:45:50] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:45:50] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:45:50] [INFO ] Deduced a trap composed of 138 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:45:51] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:45:51] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:45:51] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:45:51] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:45:53] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-05-24 03:45:55] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:45:55] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:45:55] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:45:55] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:45:56] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:45:56] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:45:56] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:45:56] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:45:56] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:45:56] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:45:56] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:45:57] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:45:57] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:45:57] [INFO ] Deduced a trap composed of 136 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (OVERLAPS) 360/646 variables, 286/324 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 8 (OVERLAPS) 0/646 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 324 constraints, problems are : Problem set: 0 solved, 359 unsolved in 22645 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-05-24 03:46:12] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:46:12] [INFO ] Deduced a trap composed of 114 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:46:12] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:46:13] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (OVERLAPS) 360/646 variables, 286/328 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 359/687 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 9 (OVERLAPS) 0/646 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 687 constraints, problems are : Problem set: 0 solved, 359 unsolved in 20284 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 28/28 constraints]
After SMT, in 42978ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 42982ms
Starting structural reductions in LTL mode, iteration 1 : 286/349 places, 360/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43232 ms. Remains : 286/349 places, 360/461 transitions.
[2024-05-24 03:46:30] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:46:30] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:46:30] [INFO ] Input system was already deterministic with 360 transitions.
[2024-05-24 03:46:30] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:46:30] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:46:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13567837107709494089.gal : 1 ms
[2024-05-24 03:46:30] [INFO ] Time to serialize properties into /tmp/CTLFireability4482448274648820230.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/CTLFireability13567837107709494089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4482448274648820230.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.59308e+11,2.09691,71612,2,9375,5,208861,6,0,1506,444368,0


Converting to forward existential form...Done !
original formula: EF(EX(A((p27==1) U EX((p402==1)))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(EG(!(EX((p402==1)))))) * !(E(!(EX((p402==1))) U (!((p27==1)) * !(EX((p402==1)))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t40, t41, t42, t45...638
Detected timeout of ITS tools.
[2024-05-24 03:47:00] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:47:00] [INFO ] Applying decomposition
[2024-05-24 03:47:00] [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/graph16041928704286729315.txt' '-o' '/tmp/graph16041928704286729315.bin' '-w' '/tmp/graph16041928704286729315.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16041928704286729315.bin' '-l' '-1' '-v' '-w' '/tmp/graph16041928704286729315.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:47:00] [INFO ] Decomposing Gal with order
[2024-05-24 03:47:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:47:00] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-24 03:47:00] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:47:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 3 ms.
[2024-05-24 03:47:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10963742844738116763.gal : 2 ms
[2024-05-24 03:47:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13991370044866918687.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/CTLFireability10963742844738116763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13991370044866918687.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.59308e+11,1.19181,37392,1635,50,59139,899,735,119394,82,3141,0


Converting to forward existential form...Done !
original formula: EF(EX(A((i2.i0.u9.p27==1) U EX((i20.i2.u104.p402==1)))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(EG(!(EX((i20.i2.u104.p402==1)))))) * !(E(!(EX((i20.i2.u104.p402==1))) U (!((i2.i0.u9....208
Reverse transition relation is NOT exact ! Due to transitions t132, t325, i2.i0.t268, i2.i0.t270, i2.i0.t282, i2.i0.t284, i2.i0.t286, i2.i0.t299, i2.i0.u4....1226
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using 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 a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,28.3987,606840,1,0,900077,899,4786,1.38191e+06,399,3141,1343839
FORMULA HealthRecord-PT-16-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 322 transition count 424
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 322 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 322 transition count 423
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 69 place count 308 transition count 400
Iterating global reduction 1 with 14 rules applied. Total rules applied 83 place count 308 transition count 400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 308 transition count 399
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 92 place count 300 transition count 384
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 300 transition count 384
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 295 transition count 378
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 295 transition count 378
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 292 transition count 371
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 292 transition count 371
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 119 place count 289 transition count 367
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 289 transition count 367
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 287 transition count 364
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 287 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 287 transition count 363
Applied a total of 127 rules in 38 ms. Remains 287 /349 variables (removed 62) and now considering 363/461 (removed 98) transitions.
// Phase 1: matrix 363 rows 287 cols
[2024-05-24 03:47:28] [INFO ] Computed 14 invariants in 9 ms
[2024-05-24 03:47:28] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 03:47:28] [INFO ] Invariant cache hit.
[2024-05-24 03:47:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-24 03:47:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-24 03:47:32] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:47:32] [INFO ] Deduced a trap composed of 160 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:47:32] [INFO ] Deduced a trap composed of 139 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:47:33] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:47:33] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:47:33] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:47:33] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:47:33] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:47:34] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:47:34] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:47:34] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-24 03:47:37] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 1 ms to minimize.
[2024-05-24 03:47:37] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-24 03:47:39] [INFO ] Deduced a trap composed of 133 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:47:39] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:47:40] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 4 ms to minimize.
[2024-05-24 03:47:40] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:47:40] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-24 03:47:42] [INFO ] Deduced a trap composed of 148 places in 93 ms of which 1 ms to minimize.
[2024-05-24 03:47:42] [INFO ] Deduced a trap composed of 133 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:47:42] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-24 03:47:46] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-24 03:47:49] [INFO ] Deduced a trap composed of 121 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:47:49] [INFO ] Deduced a trap composed of 113 places in 98 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 10 (OVERLAPS) 363/650 variables, 287/325 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-24 03:47:57] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/650 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 362 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 Real declared 650/650 variables, and 326 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 25/39 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-24 03:48:01] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (OVERLAPS) 363/650 variables, 287/327 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 362/689 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-24 03:48:06] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:48:07] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 10 (OVERLAPS) 0/650 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 691 constraints, problems are : Problem set: 0 solved, 362 unsolved in 27340 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 28/28 constraints]
After SMT, in 57391ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 57394ms
Starting structural reductions in LTL mode, iteration 1 : 287/349 places, 363/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57673 ms. Remains : 287/349 places, 363/461 transitions.
[2024-05-24 03:48:26] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:48:26] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:48:26] [INFO ] Input system was already deterministic with 363 transitions.
[2024-05-24 03:48:26] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:48:26] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:48:26] [INFO ] Time to serialize gal into /tmp/CTLFireability15855195702007019936.gal : 1 ms
[2024-05-24 03:48:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9177878032777208725.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/CTLFireability15855195702007019936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9177878032777208725.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.67336e+11,2.02993,74896,2,9609,5,215061,6,0,1513,467569,0


Converting to forward existential form...Done !
original formula: (AG((AX((AX((p220==0)) * (p26==0))) * (p274==0))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(!(E(TRUE U !((!(EX(!((!(EX(!((p220==0)))) * (p26==0))))) * (p274==0)))))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...668
(forward)formula 0,0,13.9095,394272,1,0,607,1.57677e+06,750,341,8596,1.94194e+06,771
FORMULA HealthRecord-PT-16-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 349/349 places, 461/461 transitions.
Graph (trivial) has 392 edges and 349 vertex of which 46 / 349 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 319 transition count 296
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 147 rules applied. Total rules applied 280 place count 187 transition count 281
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 290 place count 179 transition count 279
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 292 place count 177 transition count 279
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 292 place count 177 transition count 272
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 306 place count 170 transition count 272
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 339 place count 137 transition count 211
Iterating global reduction 4 with 33 rules applied. Total rules applied 372 place count 137 transition count 211
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 378 place count 137 transition count 205
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 384 place count 131 transition count 205
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 394 place count 121 transition count 185
Iterating global reduction 6 with 10 rules applied. Total rules applied 404 place count 121 transition count 185
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 405 place count 121 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 406 place count 120 transition count 184
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 410 place count 116 transition count 177
Iterating global reduction 8 with 4 rules applied. Total rules applied 414 place count 116 transition count 177
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 417 place count 113 transition count 173
Iterating global reduction 8 with 3 rules applied. Total rules applied 420 place count 113 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 421 place count 113 transition count 172
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 423 place count 111 transition count 169
Iterating global reduction 9 with 2 rules applied. Total rules applied 425 place count 111 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 426 place count 111 transition count 168
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 427 place count 110 transition count 166
Iterating global reduction 10 with 1 rules applied. Total rules applied 428 place count 110 transition count 166
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 429 place count 109 transition count 164
Iterating global reduction 10 with 1 rules applied. Total rules applied 430 place count 109 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 431 place count 109 transition count 163
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 455 place count 97 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 457 place count 97 transition count 149
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 461 place count 93 transition count 141
Iterating global reduction 12 with 4 rules applied. Total rules applied 465 place count 93 transition count 141
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 468 place count 90 transition count 137
Iterating global reduction 12 with 3 rules applied. Total rules applied 471 place count 90 transition count 137
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 474 place count 87 transition count 133
Iterating global reduction 12 with 3 rules applied. Total rules applied 477 place count 87 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 478 place count 87 transition count 132
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 480 place count 85 transition count 128
Iterating global reduction 13 with 2 rules applied. Total rules applied 482 place count 85 transition count 128
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 484 place count 83 transition count 124
Iterating global reduction 13 with 2 rules applied. Total rules applied 486 place count 83 transition count 124
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 487 place count 82 transition count 122
Iterating global reduction 13 with 1 rules applied. Total rules applied 488 place count 82 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 489 place count 82 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 491 place count 82 transition count 119
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 14 with 1 rules applied. Total rules applied 492 place count 82 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 493 place count 81 transition count 118
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 494 place count 80 transition count 116
Iterating global reduction 16 with 1 rules applied. Total rules applied 495 place count 80 transition count 116
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 496 place count 79 transition count 114
Iterating global reduction 16 with 1 rules applied. Total rules applied 497 place count 79 transition count 114
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 498 place count 78 transition count 113
Iterating global reduction 16 with 1 rules applied. Total rules applied 499 place count 78 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 501 place count 77 transition count 112
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 502 place count 76 transition count 111
Iterating global reduction 16 with 1 rules applied. Total rules applied 503 place count 76 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 505 place count 76 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 505 place count 76 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 507 place count 75 transition count 108
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 508 place count 75 transition count 108
Applied a total of 508 rules in 49 ms. Remains 75 /349 variables (removed 274) and now considering 108/461 (removed 353) transitions.
[2024-05-24 03:48:40] [INFO ] Flow matrix only has 100 transitions (discarded 8 similar events)
// Phase 1: matrix 100 rows 75 cols
[2024-05-24 03:48:40] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 03:48:40] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-24 03:48:40] [INFO ] Flow matrix only has 100 transitions (discarded 8 similar events)
[2024-05-24 03:48:40] [INFO ] Invariant cache hit.
[2024-05-24 03:48:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:48:40] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-24 03:48:40] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-24 03:48:40] [INFO ] Flow matrix only has 100 transitions (discarded 8 similar events)
[2024-05-24 03:48:40] [INFO ] Invariant cache hit.
[2024-05-24 03:48:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 03:48:41] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:48:41] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:48:41] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:48:41] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:48:41] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 99/174 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/175 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 88 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2230 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 03:48:43] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 03:48:43] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 99/174 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 106/195 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 196 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3223 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 7/7 constraints]
After SMT, in 5490ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5491ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/349 places, 108/461 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5751 ms. Remains : 75/349 places, 108/461 transitions.
[2024-05-24 03:48:46] [INFO ] Flatten gal took : 1 ms
[2024-05-24 03:48:46] [INFO ] Flatten gal took : 1 ms
[2024-05-24 03:48:46] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-24 03:48:46] [INFO ] Flatten gal took : 1 ms
[2024-05-24 03:48:46] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:48:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1185313078369553484.gal : 0 ms
[2024-05-24 03:48:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14725991415431360324.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/CTLFireability1185313078369553484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14725991415431360324.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(AF(!(E(((AF(((p334==1)&&(p442==1))) * (p141==1)) * (p125==1)) U (p348==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(E(((!(EG(!(((p334==1)&&(p442==1))))) * (p141==1)) * (p125==1)) U (p348==1)))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t12, t13, t14, t15, t17, t55, t59, t60, t61, t62, t63, t76, t77, t99,...261
(forward)formula 0,0,1.92417,90104,1,0,395,549590,240,179,2493,499252,469
FORMULA HealthRecord-PT-16-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-24 03:48:48] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:48:48] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:48:48] [INFO ] Applying decomposition
[2024-05-24 03:48:48] [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/graph10473119282738072526.txt' '-o' '/tmp/graph10473119282738072526.bin' '-w' '/tmp/graph10473119282738072526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10473119282738072526.bin' '-l' '-1' '-v' '-w' '/tmp/graph10473119282738072526.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:48:48] [INFO ] Decomposing Gal with order
[2024-05-24 03:48:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:48:48] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-24 03:48:48] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:48:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-24 03:48:48] [INFO ] Time to serialize gal into /tmp/CTLFireability12425470125239124774.gal : 3 ms
[2024-05-24 03:48:48] [INFO ] Time to serialize properties into /tmp/CTLFireability7725182257016282261.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/CTLFireability12425470125239124774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7725182257016282261.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.38945e+11,3.92257,136020,2121,1025,201960,37440,892,521929,256,143601,0


Converting to forward existential form...Done !
original formula: !(A(!(AG((EG(((i19.u120.p334==1)&&(i19.u115.p428==1))) + (i14.i1.u84.p257==1)))) U (AF(EX(!(((i19.u120.p334==1)&&(i19.u120.p405==1))))) *...353
=> equivalent forward existential formula: (([FwdG((FwdU(Init,!((!(EG(!(EX(!(((i19.u120.p334==1)&&(i19.u120.p405==1))))))) * (((!(((i2.i3.u16.p77==1)&&(i19...3856
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t24, t140, t294, t407, t408, t410, u27.t320, i2.t352, i2.i3.t333, i2.i3.t365, i2.i3...1972
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,431.277,2976672,1,0,4.14658e+06,215927,1847,8.09334e+06,648,770705,1444346
FORMULA HealthRecord-PT-16-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(AF(!(A(EX((u110.p368==1)) U AF(((i2.i3.u16.p77==1)&&(i19.u120.p414==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(!(EG(!(((i2.i3.u16.p77==1)&&(i19.u120.p414==1)))))) U (!(EX((u110.p368==1))) * !(!(EG...281
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Using 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 a local SCC at level 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 1,1,891.462,3834936,1,0,4.65365e+06,215927,1847,9.39712e+06,648,770705,1527663
FORMULA HealthRecord-PT-16-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(E(!(((EF(((i19.u120.p334==1)&&(i19.u120.p420==1))) * ((EG((i19.u120.p377==1)) + (i12.i2.u74.p235==1)) + (i14.i1.u86.p271==1))) * EG(((...307
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(E(TRUE U (!(EG(!(EX((i9.i0.u57.p191==1))))) + (i9.i3.u63.p206==1))))),!(((E(TRUE U ((i19.u...371
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-24 04:04:52] [INFO ] Applying decomposition
[2024-05-24 04:04:52] [INFO ] Flatten gal took : 9 ms
[2024-05-24 04:04:52] [INFO ] Decomposing Gal with order
[2024-05-24 04:04:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:04:52] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-24 04:04:52] [INFO ] Flatten gal took : 11 ms
[2024-05-24 04:04:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 2 ms.
[2024-05-24 04:04:52] [INFO ] Time to serialize gal into /tmp/CTLFireability13216007530934861284.gal : 2 ms
[2024-05-24 04:04:52] [INFO ] Time to serialize properties into /tmp/CTLFireability89583781029527453.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/CTLFireability13216007530934861284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability89583781029527453.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,5.38945e+11,2.48321,89356,815,4998,85821,68808,399,319616,710,625741,0


Converting to forward existential form...Done !
original formula: (!(E(!(((EF(((i1.u13.p334==1)&&(i1.u14.p420==1))) * ((EG((i1.u14.p377==1)) + (i0.i1.i0.u10.p235==1)) + (i0.i1.u11.p271==1))) * EG(((i0.i1...303
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(E(TRUE U (!(EG(!(EX((i0.i1.i0.i0.u9.p191==1))))) + (i0.i1.i0.i0.u9.p206==1))))),!(((E(TRUE...367
Reverse transition relation is NOT exact ! Due to transitions t407, t410, i0.u2.t333, i0.u2.t335, i0.u2.t336, i0.u2.t340, i0.u2.t341, i0.u2.t344, i0.u2.t34...2224
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 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,1,163.43,2356020,1,0,2.03324e+06,2.26213e+06,1099,9.93378e+06,2430,1.39946e+07,346880
FORMULA HealthRecord-PT-16-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 2480275 ms.

BK_STOP 1716523656639

--------------------
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="HealthRecord-PT-16"
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 HealthRecord-PT-16, 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-171640604300818"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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