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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 20:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:43 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 67K 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-06-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716519576194

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 02:59:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 02:59:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:59:37] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-24 02:59:37] [INFO ] Transformed 154 places.
[2024-05-24 02:59:37] [INFO ] Transformed 319 transitions.
[2024-05-24 02:59:37] [INFO ] Found NUPN structural information;
[2024-05-24 02:59:37] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Support contains 66 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 294/294 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 101 transition count 195
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 101 transition count 195
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 99 transition count 191
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 99 transition count 191
Applied a total of 110 rules in 23 ms. Remains 99 /154 variables (removed 55) and now considering 191/294 (removed 103) transitions.
[2024-05-24 02:59:37] [INFO ] Flow matrix only has 186 transitions (discarded 5 similar events)
// Phase 1: matrix 186 rows 99 cols
[2024-05-24 02:59:37] [INFO ] Computed 11 invariants in 17 ms
[2024-05-24 02:59:37] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-24 02:59:37] [INFO ] Flow matrix only has 186 transitions (discarded 5 similar events)
[2024-05-24 02:59:37] [INFO ] Invariant cache hit.
[2024-05-24 02:59:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:59:37] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-24 02:59:38] [INFO ] Flow matrix only has 186 transitions (discarded 5 similar events)
[2024-05-24 02:59:38] [INFO ] Invariant cache hit.
[2024-05-24 02:59:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-24 02:59:39] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 11 ms to minimize.
[2024-05-24 02:59:39] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:59:39] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:59:39] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:59:39] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:59:39] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:59:39] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-24 02:59:40] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:59:40] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:59:40] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 02:59:40] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-24 02:59:40] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:59:41] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 185/284 variables, 99/123 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-24 02:59:42] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 1/285 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 0/285 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 125 constraints, problems are : Problem set: 0 solved, 190 unsolved in 8601 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-24 02:59:47] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:59:47] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-24 02:59:47] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:59:48] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:59:48] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:59:48] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-24 02:59:48] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:59:48] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:59:48] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-24 02:59:48] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:59:48] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:59:49] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:59:49] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:59:49] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:59:49] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:59:49] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:59:49] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-24 02:59:49] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:59:49] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:59:49] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-24 02:59:50] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 5 ms to minimize.
[2024-05-24 02:59:50] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:59:50] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-24 02:59:50] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-05-24 02:59:51] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-24 02:59:51] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 3 ms to minimize.
[2024-05-24 02:59:52] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 185/284 variables, 99/151 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 190/341 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-24 02:59:54] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 17 (OVERLAPS) 0/285 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 343 constraints, problems are : Problem set: 0 solved, 190 unsolved in 18039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 42/42 constraints]
After SMT, in 26772ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 26786ms
Starting structural reductions in LTL mode, iteration 1 : 99/154 places, 191/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27211 ms. Remains : 99/154 places, 191/294 transitions.
Support contains 66 out of 99 places after structural reductions.
[2024-05-24 03:00:05] [INFO ] Flatten gal took : 40 ms
[2024-05-24 03:00:05] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:00:05] [INFO ] Input system was already deterministic with 191 transitions.
Support contains 65 out of 99 places (down from 66) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 53 to 52
RANDOM walk for 40000 steps (2021 resets) in 1539 ms. (25 steps per ms) remains 15/52 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (25 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (26 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (27 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 7 ms. (500 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (26 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (26 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (24 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (25 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (25 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (25 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
[2024-05-24 03:00:05] [INFO ] Flow matrix only has 186 transitions (discarded 5 similar events)
[2024-05-24 03:00:05] [INFO ] Invariant cache hit.
[2024-05-24 03:00:05] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 42/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 3 (OVERLAPS) 36/99 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-24 03:00:06] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 3 ms to minimize.
[2024-05-24 03:00:06] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-24 03:00:06] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:00:06] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
Problem AtomicPropp26 is UNSAT
[2024-05-24 03:00:06] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:00:06] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:00:06] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 7/18 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-24 03:00:06] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/19 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-24 03:00:06] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 2 ms to minimize.
[2024-05-24 03:00:06] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:00:07] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 3/22 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 185/284 variables, 99/121 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-24 03:00:07] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 1/122 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/122 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/123 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/123 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/285 variables, 0/123 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 123 constraints, problems are : Problem set: 2 solved, 13 unsolved in 1529 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 43/61 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-24 03:00:07] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-24 03:00:07] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 38/99 variables, 8/16 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 9/25 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-24 03:00:07] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:00:07] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:00:07] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:00:07] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:00:07] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:00:08] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 6/31 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-24 03:00:08] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:00:08] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:00:08] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 3/34 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 185/284 variables, 99/133 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 13/146 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-24 03:00:08] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 1/147 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-24 03:00:08] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 1/148 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 1/285 variables, 1/149 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/285 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 149 constraints, problems are : Problem set: 2 solved, 13 unsolved in 1771 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/15 constraints, Known Traps: 25/25 constraints]
After SMT, in 3317ms problems are : Problem set: 2 solved, 13 unsolved
Finished Parikh walk after 1610 steps, including 57 resets, run visited all 1 properties in 7 ms. (steps per millisecond=230 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 260 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-24 03:00:09] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:00:09] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:00:09] [INFO ] Input system was already deterministic with 191 transitions.
Computed a total of 11 stabilizing places and 19 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 62 transition count 119
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 62 transition count 119
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 54 transition count 102
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 54 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 98 place count 54 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 51 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 51 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 107 place count 51 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 49 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 49 transition count 79
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 117 place count 49 transition count 73
Applied a total of 117 rules in 14 ms. Remains 49 /99 variables (removed 50) and now considering 73/191 (removed 118) transitions.
[2024-05-24 03:00:09] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
// Phase 1: matrix 70 rows 49 cols
[2024-05-24 03:00:09] [INFO ] Computed 9 invariants in 4 ms
[2024-05-24 03:00:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:00:09] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2024-05-24 03:00:09] [INFO ] Invariant cache hit.
[2024-05-24 03:00:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:00:09] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-24 03:00:09] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2024-05-24 03:00:09] [INFO ] Invariant cache hit.
[2024-05-24 03:00:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:00:09] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:00:09] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:00:10] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 69/118 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 62 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:00:11] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:00:11] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 69/118 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 72/135 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 136 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1853 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints]
After SMT, in 3065ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3066ms
Starting structural reductions in LTL mode, iteration 1 : 49/99 places, 73/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3171 ms. Remains : 49/99 places, 73/191 transitions.
[2024-05-24 03:00:12] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:00:12] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:12] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-24 03:00:12] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:12] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9953808508188535370.gal : 2 ms
[2024-05-24 03:00:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2549533381519198310.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9953808508188535370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2549533381519198310.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,457092,0.118436,8904,2,2073,5,25533,6,0,265,16777,0


Converting to forward existential form...Done !
original formula: EF(EX((p21==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (p21==1))] != FALSE
(forward)formula 0,1,0.149386,9156,1,0,8,25533,8,1,465,16777,2
FORMULA HealthRecord-PT-06-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 66 transition count 127
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 66 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 59 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 59 transition count 113
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 88 place count 59 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 58 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 58 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 57 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 57 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 95 place count 57 transition count 97
Applied a total of 95 rules in 11 ms. Remains 57 /99 variables (removed 42) and now considering 97/191 (removed 94) transitions.
[2024-05-24 03:00:12] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
// Phase 1: matrix 94 rows 57 cols
[2024-05-24 03:00:12] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:00:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:00:12] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
[2024-05-24 03:00:12] [INFO ] Invariant cache hit.
[2024-05-24 03:00:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:00:13] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 03:00:13] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
[2024-05-24 03:00:13] [INFO ] Invariant cache hit.
[2024-05-24 03:00:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:00:13] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:00:13] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:00:13] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 93/150 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 1/151 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 70 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:00:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:00:15] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:00:15] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 93/150 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 96/168 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 169 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2661 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 6/6 constraints]
After SMT, in 4407ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4408ms
Starting structural reductions in LTL mode, iteration 1 : 57/99 places, 97/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4524 ms. Remains : 57/99 places, 97/191 transitions.
[2024-05-24 03:00:17] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:17] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:17] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-24 03:00:17] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:17] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10172834983163741932.gal : 2 ms
[2024-05-24 03:00:17] [INFO ] Time to serialize properties into /tmp/CTLFireability2865790619015607986.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/CTLFireability10172834983163741932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2865790619015607986.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.37344e+06,0.083707,6956,2,1121,5,15239,6,0,321,16094,0


Converting to forward existential form...Done !
original formula: A(AX(EG(E((p45!=1) U A((p76==1) U (p44==1))))) U E(!(EX(((p54==1)||(p49==1)))) U !(EX(!(AF((p23==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(EX(((p54==1)||(p49==1)))) U !(EX(!(!(EG(!((p23==1)))))))))))) * !(E(!(E(!(EX(((p54==1)||(p4...379
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t15, t16, t18, t19, t21, t23, t25, t39, t40, t...287
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
(forward)formula 0,1,5.59958,170912,1,0,726,1.04592e+06,240,412,2367,1.06706e+06,831
FORMULA HealthRecord-PT-06-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Graph (trivial) has 123 edges and 99 vertex of which 12 / 99 are part of one of the 6 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 33 place count 60 transition count 122
Iterating global reduction 0 with 32 rules applied. Total rules applied 65 place count 60 transition count 122
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 71 place count 54 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 77 place count 54 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 83 place count 54 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 51 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 51 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 92 place count 51 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 49 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 49 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 49 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 49 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 47 transition count 75
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 44 transition count 72
Applied a total of 114 rules in 33 ms. Remains 44 /99 variables (removed 55) and now considering 72/191 (removed 119) transitions.
[2024-05-24 03:00:23] [INFO ] Flow matrix only has 63 transitions (discarded 9 similar events)
// Phase 1: matrix 63 rows 44 cols
[2024-05-24 03:00:23] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:00:23] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:00:23] [INFO ] Flow matrix only has 63 transitions (discarded 9 similar events)
[2024-05-24 03:00:23] [INFO ] Invariant cache hit.
[2024-05-24 03:00:23] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 03:00:23] [INFO ] Redundant transitions in 15 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-24 03:00:23] [INFO ] Flow matrix only has 63 transitions (discarded 9 similar events)
[2024-05-24 03:00:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 03:00:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:00:23] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:00:23] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:00:23] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:00:23] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:00:23] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:00:23] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:00:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:00:23] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 62/106 variables, 44/62 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/107 variables, and 62 constraints, problems are : Problem set: 0 solved, 56 unsolved in 985 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 03:00:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 62/106 variables, 44/63 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 56/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 56 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 10/10 constraints]
After SMT, in 1863ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1865ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/99 places, 72/191 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2005 ms. Remains : 44/99 places, 72/191 transitions.
[2024-05-24 03:00:25] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:00:25] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:00:25] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-24 03:00:25] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:25] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9941132813444321362.gal : 1 ms
[2024-05-24 03:00:25] [INFO ] Time to serialize properties into /tmp/CTLFireability11962764928603413520.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/CTLFireability9941132813444321362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11962764928603413520.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,107574,0.0179,3896,2,397,5,2632,6,0,233,2313,0


Converting to forward existential form...Done !
original formula: (AG(EF(EG(((p101==0)||(p35==0))))) + (AG(AF((p106==1))) * EF(EG(AG((p113==1))))))
=> equivalent forward existential formula: ([FwdG(FwdU((Init * !(!(E(TRUE U !(E(TRUE U EG(((p101==0)||(p35==0))))))))),TRUE),!((p106==1)))] = FALSE * [((In...271
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t17, t18, t19, t20, t41, t47...255
(forward)formula 0,1,0.62429,28864,1,0,265,154680,176,130,1690,157011,306
FORMULA HealthRecord-PT-06-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 65 transition count 125
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 65 transition count 125
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 60 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 60 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 81 place count 60 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 58 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 58 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 88 place count 58 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 57 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 57 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 57 transition count 98
Applied a total of 93 rules in 6 ms. Remains 57 /99 variables (removed 42) and now considering 98/191 (removed 93) transitions.
[2024-05-24 03:00:25] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
// Phase 1: matrix 95 rows 57 cols
[2024-05-24 03:00:25] [INFO ] Computed 9 invariants in 4 ms
[2024-05-24 03:00:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:00:25] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2024-05-24 03:00:25] [INFO ] Invariant cache hit.
[2024-05-24 03:00:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:00:25] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-24 03:00:25] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2024-05-24 03:00:25] [INFO ] Invariant cache hit.
[2024-05-24 03:00:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:00:26] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:00:26] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:00:26] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:00:26] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 94/151 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/152 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/152 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 71 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2149 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:00:28] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 94/151 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 97/168 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 169 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2539 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 5/5 constraints]
After SMT, in 4712ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 4713ms
Starting structural reductions in LTL mode, iteration 1 : 57/99 places, 98/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4820 ms. Remains : 57/99 places, 98/191 transitions.
[2024-05-24 03:00:30] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:00:30] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:00:30] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-24 03:00:30] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:30] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13206173699886232720.gal : 3 ms
[2024-05-24 03:00:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13264573442844597259.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/CTLFireability13206173699886232720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13264573442844597259.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,746506,0.028433,4584,2,577,5,4020,6,0,322,3744,0


Converting to forward existential form...Done !
original formula: A((AF((EG(AF((p89==1))) * ((p112==1)||(p122==1)))) + ((p38==1)&&(p151==1))) U !((EF(AX(A((p113==1) U (((p16==1)&&(p35==1))&&((p54==1)&&(p...230
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(TRUE U !(EX(!(!((E(!((((p16==1)&&(p35==1))&&((p54==1)&&(p141==1)))) U (!((p113==1)) * !(((...996
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21, t22, t...312
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
(forward)formula 0,0,1.56485,63196,1,0,548,367731,246,305,2409,345328,677
FORMULA HealthRecord-PT-06-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 64 transition count 123
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 64 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 57 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 57 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 93 place count 57 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 55 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 55 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 55 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 54 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 54 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 54 transition count 87
Applied a total of 104 rules in 6 ms. Remains 54 /99 variables (removed 45) and now considering 87/191 (removed 104) transitions.
[2024-05-24 03:00:32] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 54 cols
[2024-05-24 03:00:32] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:00:32] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:00:32] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-05-24 03:00:32] [INFO ] Invariant cache hit.
[2024-05-24 03:00:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:00:32] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-24 03:00:32] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-05-24 03:00:32] [INFO ] Invariant cache hit.
[2024-05-24 03:00:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-24 03:00:32] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:00:32] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 83/137 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 66 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1396 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-24 03:00:33] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 83/137 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 86/152 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 153 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2163 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 3/3 constraints]
After SMT, in 3576ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3577ms
Starting structural reductions in LTL mode, iteration 1 : 54/99 places, 87/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3681 ms. Remains : 54/99 places, 87/191 transitions.
[2024-05-24 03:00:35] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:00:35] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:00:35] [INFO ] Input system was already deterministic with 87 transitions.
[2024-05-24 03:00:35] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:35] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:35] [INFO ] Time to serialize gal into /tmp/CTLFireability3523264483726459706.gal : 1 ms
[2024-05-24 03:00:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17826440787591628936.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/CTLFireability3523264483726459706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17826440787591628936.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,723906,0.074415,6888,2,1461,5,14967,6,0,299,13429,0


Converting to forward existential form...Done !
original formula: (AF(AX((AG(((p16==1)&&(p151==1))) * (p49==0)))) + EF(((p45==1)||(p149==1))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U ((p45==1)||(p149==1))))),!(!(EX(!((!(E(TRUE U !(((p16==1)&&(p151==1))))) * (p49==0)))))...166
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t7, t8, t10, t11, t12, t13, t15, t16, t18, t19, t21, t23, t25, t37, t38, ...268
(forward)formula 0,1,0.483565,21376,1,0,161,96595,200,80,2158,78594,202
FORMULA HealthRecord-PT-06-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Graph (trivial) has 135 edges and 99 vertex of which 14 / 99 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 33 place count 59 transition count 120
Iterating global reduction 0 with 32 rules applied. Total rules applied 65 place count 59 transition count 120
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 74 place count 50 transition count 101
Iterating global reduction 0 with 9 rules applied. Total rules applied 83 place count 50 transition count 101
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 93 place count 50 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 47 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 47 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 102 place count 47 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 45 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 45 transition count 76
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 112 place count 45 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 45 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 43 transition count 63
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 124 place count 40 transition count 60
Applied a total of 124 rules in 21 ms. Remains 40 /99 variables (removed 59) and now considering 60/191 (removed 131) transitions.
[2024-05-24 03:00:36] [INFO ] Flow matrix only has 50 transitions (discarded 10 similar events)
// Phase 1: matrix 50 rows 40 cols
[2024-05-24 03:00:36] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:00:36] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:00:36] [INFO ] Flow matrix only has 50 transitions (discarded 10 similar events)
[2024-05-24 03:00:36] [INFO ] Invariant cache hit.
[2024-05-24 03:00:36] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-24 03:00:36] [INFO ] Redundant transitions in 14 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-24 03:00:36] [INFO ] Flow matrix only has 50 transitions (discarded 10 similar events)
[2024-05-24 03:00:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 2/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-24 03:00:36] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:00:36] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:00:36] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:00:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-24 03:00:36] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 6/40 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 49/89 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/90 variables, and 55 constraints, problems are : Problem set: 0 solved, 44 unsolved in 746 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 2/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 6/40 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 49/89 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 44/99 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/90 variables, and 99 constraints, problems are : Problem set: 0 solved, 44 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints]
After SMT, in 1306ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1308ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/99 places, 60/191 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1428 ms. Remains : 40/99 places, 60/191 transitions.
[2024-05-24 03:00:37] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:00:37] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:00:37] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-24 03:00:37] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:00:37] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1414443898144971298.gal : 1 ms
[2024-05-24 03:00:37] [INFO ] Time to serialize properties into /tmp/CTLFireability8297374398371356833.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/CTLFireability1414443898144971298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8297374398371356833.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,73012,0.01741,4092,2,446,5,2925,6,0,202,2723,0


Converting to forward existential form...Done !
original formula: EF(AG((p72==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p72==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t13, t14, Intersection with reachable at each ...216
(forward)formula 0,1,0.082618,6996,1,0,109,18674,131,54,1435,14293,127
FORMULA HealthRecord-PT-06-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 64 transition count 122
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 64 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 56 transition count 105
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 56 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 95 place count 56 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 54 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 54 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 53 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 53 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 53 transition count 85
Applied a total of 105 rules in 5 ms. Remains 53 /99 variables (removed 46) and now considering 85/191 (removed 106) transitions.
[2024-05-24 03:00:38] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 53 cols
[2024-05-24 03:00:38] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 03:00:38] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:00:38] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-05-24 03:00:38] [INFO ] Invariant cache hit.
[2024-05-24 03:00:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:00:38] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-24 03:00:38] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-05-24 03:00:38] [INFO ] Invariant cache hit.
[2024-05-24 03:00:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:00:38] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:00:38] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 80/133 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 1/134 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 66 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:00:39] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 80/133 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 151 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
After SMT, in 3595ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3596ms
Starting structural reductions in LTL mode, iteration 1 : 53/99 places, 85/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3691 ms. Remains : 53/99 places, 85/191 transitions.
[2024-05-24 03:00:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:41] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-24 03:00:41] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11262921730587123900.gal : 1 ms
[2024-05-24 03:00:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2136021292059853645.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/CTLFireability11262921730587123900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2136021292059853645.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,716616,0.199122,12168,2,2414,5,41126,6,0,290,29932,0


Converting to forward existential form...Done !
original formula: (AG(((!(E((p67==1) U ((p35==1)&&(p151==1)))) + ((p103==0)&&(p12==0))) + (p50==0))) + AX(EG((((p16==1)&&(p35==1))&&((p54==1)&&(p134==1))))...157
=> equivalent forward existential formula: [(EY((Init * !(!(E(TRUE U !(((!(E((p67==1) U ((p35==1)&&(p151==1)))) + ((p103==0)&&(p12==0))) + (p50==0)))))))) ...219
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t16, t18, t20, t22, t34, t35, t42, t...257
(forward)formula 0,0,0.740123,26912,1,0,164,126097,199,84,2157,88792,210
FORMULA HealthRecord-PT-06-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Graph (trivial) has 132 edges and 99 vertex of which 14 / 99 are part of one of the 7 SCC in 2 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 60 transition count 123
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 60 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 72 place count 51 transition count 104
Iterating global reduction 0 with 9 rules applied. Total rules applied 81 place count 51 transition count 104
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 91 place count 51 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 48 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 48 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 48 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 46 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 46 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 109 place count 46 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 46 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 44 transition count 67
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 41 transition count 64
Applied a total of 121 rules in 21 ms. Remains 41 /99 variables (removed 58) and now considering 64/191 (removed 127) transitions.
[2024-05-24 03:00:42] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 41 cols
[2024-05-24 03:00:42] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:00:42] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:00:42] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-24 03:00:42] [INFO ] Invariant cache hit.
[2024-05-24 03:00:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-24 03:00:42] [INFO ] Redundant transitions in 12 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 03:00:42] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-24 03:00:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:00:42] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:00:42] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:00:42] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 1 ms to minimize.
[2024-05-24 03:00:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:00:42] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 54/95 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/96 variables, and 55 constraints, problems are : Problem set: 0 solved, 48 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:00:43] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:00:43] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 54/95 variables, 41/57 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 48/105 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/95 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/96 variables, and 105 constraints, problems are : Problem set: 0 solved, 48 unsolved in 747 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 7/7 constraints]
After SMT, in 1454ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1454ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/99 places, 64/191 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1567 ms. Remains : 41/99 places, 64/191 transitions.
[2024-05-24 03:00:44] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:00:44] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:44] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-24 03:00:44] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:00:44] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6054064341172497843.gal : 1 ms
[2024-05-24 03:00:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7444030421996138749.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/CTLFireability6054064341172497843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7444030421996138749.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,94180,0.027107,4384,2,435,5,3660,6,0,213,3484,0


Converting to forward existential form...Done !
original formula: AF(AG(((p140!=1)&&(p49!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p140!=1)&&(p49!=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t15, t16, t24, t25, Intersection with...235
(forward)formula 0,0,0.21909,13624,1,0,169,51098,146,110,1507,65270,190
FORMULA HealthRecord-PT-06-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 65 transition count 125
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 65 transition count 125
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 59 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 59 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 86 place count 59 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 56 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 56 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 95 place count 56 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 55 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 55 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 100 place count 55 transition count 90
Applied a total of 100 rules in 14 ms. Remains 55 /99 variables (removed 44) and now considering 90/191 (removed 101) transitions.
[2024-05-24 03:00:44] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 55 cols
[2024-05-24 03:00:44] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:00:44] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:00:44] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:00:44] [INFO ] Invariant cache hit.
[2024-05-24 03:00:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:00:44] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-24 03:00:44] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:00:44] [INFO ] Invariant cache hit.
[2024-05-24 03:00:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:00:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:00:44] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:00:44] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 86/141 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/142 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 68 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1494 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:00:46] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:00:46] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:00:46] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:00:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 86/141 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 89/160 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 1/142 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 161 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2872 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints]
After SMT, in 4386ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4387ms
Starting structural reductions in LTL mode, iteration 1 : 55/99 places, 90/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4487 ms. Remains : 55/99 places, 90/191 transitions.
[2024-05-24 03:00:48] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:00:48] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:00:48] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-24 03:00:48] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:48] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:48] [INFO ] Time to serialize gal into /tmp/CTLFireability13153360976674686812.gal : 1 ms
[2024-05-24 03:00:48] [INFO ] Time to serialize properties into /tmp/CTLFireability16908183679505569028.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/CTLFireability13153360976674686812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16908183679505569028.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.13919e+06,0.047309,5316,2,831,5,7175,6,0,306,8130,0


Converting to forward existential form...Done !
original formula: AF((EG(((EF((p53==1)) * (p98==0)) * !(E(((p108==1)&&(p123==1)) U (p97==1))))) * AX((p63==0))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(((E(TRUE U (p53==1)) * (p98==0)) * !(E(((p108==1)&&(p123==1)) U (p97==1))))) * !(EX(!((p63==0))...169
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t23, t24, t...287
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.282656,15348,1,0,214,63383,217,107,2289,58342,248
FORMULA HealthRecord-PT-06-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 67 transition count 129
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 67 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 60 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 60 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 87 place count 60 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 58 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 58 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 94 place count 58 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 57 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 57 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 57 transition count 92
Applied a total of 99 rules in 9 ms. Remains 57 /99 variables (removed 42) and now considering 92/191 (removed 99) transitions.
[2024-05-24 03:00:49] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 57 cols
[2024-05-24 03:00:49] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:00:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:00:49] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 03:00:49] [INFO ] Invariant cache hit.
[2024-05-24 03:00:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:00:49] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 03:00:49] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 03:00:49] [INFO ] Invariant cache hit.
[2024-05-24 03:00:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:00:49] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:00:49] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:00:49] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:00:49] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:00:49] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:00:49] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 88/145 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/146 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 73 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:00:51] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:00:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:00:51] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 88/145 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 91/166 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/146 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/146 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 167 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2537 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 9/9 constraints]
After SMT, in 4712ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4714ms
Starting structural reductions in LTL mode, iteration 1 : 57/99 places, 92/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4831 ms. Remains : 57/99 places, 92/191 transitions.
[2024-05-24 03:00:53] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:00:53] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:53] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 03:00:53] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:53] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8561999602506189088.gal : 1 ms
[2024-05-24 03:00:53] [INFO ] Time to serialize properties into /tmp/CTLFireability18281828185738795124.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/CTLFireability8561999602506189088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18281828185738795124.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.02741e+06,0.101819,8228,2,2242,5,20617,6,0,316,19664,0


Converting to forward existential form...Done !
original formula: EF((EG(AG((((p93==1)||(((p16==1)&&(p35==1))&&((p54==1)&&(p122==1))))||(p83==1)))) * AG((AX(AG((p18==1))) * ((AG((p102==1)) + ((p108==1)&&...208
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EG(!(E(TRUE U !((((p93==1)||(((p16==1)&&(p35==1))&&((p54==1)&&(p122==1))))||(p83==1))))))) ...314
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...347
(forward)formula 0,0,0.431583,21092,1,0,189,86059,206,81,2213,80035,201
FORMULA HealthRecord-PT-06-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Graph (trivial) has 118 edges and 99 vertex of which 12 / 99 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 33 place count 60 transition count 122
Iterating global reduction 0 with 32 rules applied. Total rules applied 65 place count 60 transition count 122
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 71 place count 54 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 77 place count 54 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 83 place count 54 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 52 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 52 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 90 place count 52 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 51 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 51 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 51 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 100 place count 51 transition count 85
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 3 with 2 rules applied. Total rules applied 102 place count 50 transition count 84
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 47 transition count 81
Applied a total of 105 rules in 23 ms. Remains 47 /99 variables (removed 52) and now considering 81/191 (removed 110) transitions.
[2024-05-24 03:00:54] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 47 cols
[2024-05-24 03:00:54] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:00:54] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:00:54] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2024-05-24 03:00:54] [INFO ] Invariant cache hit.
[2024-05-24 03:00:54] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-24 03:00:54] [INFO ] Redundant transitions in 13 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-24 03:00:54] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2024-05-24 03:00:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/47 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:00:54] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:00:54] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:00:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:00:54] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 71/118 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/119 variables, and 60 constraints, problems are : Problem set: 0 solved, 65 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/47 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:00:55] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:00:55] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 71/118 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 65/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/119 variables, and 127 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1243 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 6/6 constraints]
After SMT, in 2155ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2156ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/99 places, 81/191 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2270 ms. Remains : 47/99 places, 81/191 transitions.
[2024-05-24 03:00:56] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:00:56] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:00:56] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-24 03:00:56] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:56] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:00:56] [INFO ] Time to serialize gal into /tmp/CTLFireability15591133336734106656.gal : 1 ms
[2024-05-24 03:00:56] [INFO ] Time to serialize properties into /tmp/CTLFireability10074426462417832548.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/CTLFireability15591133336734106656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10074426462417832548.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,114487,0.029781,4480,2,448,5,4611,6,0,254,4175,0


Converting to forward existential form...Done !
original formula: (EF((p103==1)) + AF(E((A((p113==1) U EF(((p108==1)&&(p142==1)))) * EG(((p145==1)||(p43==1)))) U !(EF(((p108==1)&&(p133==1)))))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (p103==1)))),!(E((!((E(!(E(TRUE U ((p108==1)&&(p142==1)))) U (!((p113==1)) * !(E(TRUE U...305
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t7, t8, t9, t10, t12, t13, t15, t16, t17, t19, t20, t22, t30, t31, t4...261
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.682131,34320,1,0,339,199601,197,202,1979,181957,393
FORMULA HealthRecord-PT-06-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 67 transition count 129
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 67 transition count 129
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 59 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 59 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 89 place count 59 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 56 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 56 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 56 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 54 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 54 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 107 place count 54 transition count 83
Applied a total of 107 rules in 3 ms. Remains 54 /99 variables (removed 45) and now considering 83/191 (removed 108) transitions.
[2024-05-24 03:00:57] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 54 cols
[2024-05-24 03:00:57] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:00:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:00:57] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-05-24 03:00:57] [INFO ] Invariant cache hit.
[2024-05-24 03:00:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:00:57] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-24 03:00:57] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-05-24 03:00:57] [INFO ] Invariant cache hit.
[2024-05-24 03:00:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:00:57] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:00:57] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:00:57] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:00:57] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 79/133 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 68 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1434 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:00:59] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:00:59] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:00:59] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:00:59] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:00:59] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:00:59] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:00:59] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:00:59] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:00:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 79/133 variables, 54/76 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 82/158 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:01:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (OVERLAPS) 0/134 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 160 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3291 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 14/14 constraints]
After SMT, in 4741ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4743ms
Starting structural reductions in LTL mode, iteration 1 : 54/99 places, 83/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4822 ms. Remains : 54/99 places, 83/191 transitions.
[2024-05-24 03:01:02] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:01:02] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:01:02] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-24 03:01:02] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:01:02] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:01:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12094864032249526124.gal : 1 ms
[2024-05-24 03:01:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6535959955243242790.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/CTLFireability12094864032249526124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6535959955243242790.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.06726e+06,0.214927,12648,2,3273,5,43255,6,0,295,35461,0


Converting to forward existential form...Done !
original formula: (E(EX(EF((p31==1))) U (p35==1)) + EX(AF((((EX((p43==0)) + E((((p16==1)&&(p35==1))&&((p54==1)&&(p141==1))) U (p56==1))) * EG((p79==1))) * ...301
=> equivalent forward existential formula: ([(FwdU(Init,EX(E(TRUE U (p31==1)))) * (p35==1))] != FALSE + [(EY(Init) * !(EG(!((((EX((p43==0)) + E((((p16==1)&...379
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t20, t21, t22, t23, t24, t...332
(forward)formula 0,1,4.15279,123708,1,0,306,536734,188,166,2108,807532,323
FORMULA HealthRecord-PT-06-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 65 transition count 125
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 65 transition count 125
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 60 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 60 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 60 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 59 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 59 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 58 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 58 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 91 place count 58 transition count 101
Applied a total of 91 rules in 3 ms. Remains 58 /99 variables (removed 41) and now considering 101/191 (removed 90) transitions.
[2024-05-24 03:01:06] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
// Phase 1: matrix 98 rows 58 cols
[2024-05-24 03:01:06] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:01:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:01:06] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2024-05-24 03:01:06] [INFO ] Invariant cache hit.
[2024-05-24 03:01:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:01:06] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-24 03:01:06] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2024-05-24 03:01:06] [INFO ] Invariant cache hit.
[2024-05-24 03:01:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-24 03:01:06] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:01:07] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:01:07] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-24 03:01:07] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 97/155 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 72 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2191 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-24 03:01:09] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-24 03:01:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 97/155 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 100/173 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/156 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/156 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 174 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2890 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints]
After SMT, in 5112ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5115ms
Starting structural reductions in LTL mode, iteration 1 : 58/99 places, 101/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5223 ms. Remains : 58/99 places, 101/191 transitions.
[2024-05-24 03:01:11] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:01:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:01:11] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-24 03:01:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:01:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:01:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10952291032996728691.gal : 0 ms
[2024-05-24 03:01:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4200652880865528263.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/CTLFireability10952291032996728691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4200652880865528263.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.09448e+06,0.037923,4876,2,643,5,5631,6,0,329,5402,0


Converting to forward existential form...Done !
original formula: E(EX((!(AX(!(((p16==1)&&(p151==1))))) + E((p87!=1) U EX((p27==1))))) U (EX(AG(!(AX((p66==1))))) * (p132==1)))
=> equivalent forward existential formula: [(EY((FwdU(Init,EX((!(!(EX(!(!(((p16==1)&&(p151==1))))))) + E((p87!=1) U EX((p27==1)))))) * (p132==1))) * !(E(TR...197
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...318
(forward)formula 0,1,1.20246,46744,1,0,426,219560,231,229,2431,293894,470
FORMULA HealthRecord-PT-06-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Graph (trivial) has 136 edges and 99 vertex of which 14 / 99 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 59 transition count 120
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 59 transition count 120
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 76 place count 50 transition count 101
Iterating global reduction 0 with 9 rules applied. Total rules applied 85 place count 50 transition count 101
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 95 place count 50 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 47 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 47 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 104 place count 47 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 45 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 45 transition count 76
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 114 place count 45 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 119 place count 45 transition count 65
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 129 place count 40 transition count 60
Applied a total of 129 rules in 20 ms. Remains 40 /99 variables (removed 59) and now considering 60/191 (removed 131) transitions.
[2024-05-24 03:01:12] [INFO ] Flow matrix only has 51 transitions (discarded 9 similar events)
// Phase 1: matrix 51 rows 40 cols
[2024-05-24 03:01:12] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:01:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:01:12] [INFO ] Flow matrix only has 51 transitions (discarded 9 similar events)
[2024-05-24 03:01:12] [INFO ] Invariant cache hit.
[2024-05-24 03:01:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:01:13] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-24 03:01:13] [INFO ] Redundant transitions in 18 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-24 03:01:13] [INFO ] Flow matrix only has 51 transitions (discarded 9 similar events)
[2024-05-24 03:01:13] [INFO ] Invariant cache hit.
[2024-05-24 03:01:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-24 03:01:13] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:01:13] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:01:13] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 50/90 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 1/91 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 53 constraints, problems are : Problem set: 0 solved, 59 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-24 03:01:14] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:01:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 50/90 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 59/113 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 114 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 5/5 constraints]
After SMT, in 2035ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2036ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/99 places, 60/191 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2168 ms. Remains : 40/99 places, 60/191 transitions.
[2024-05-24 03:01:15] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:01:15] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:01:15] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-24 03:01:15] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:01:15] [INFO ] Flatten gal took : 1 ms
[2024-05-24 03:01:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5019724259983445823.gal : 1 ms
[2024-05-24 03:01:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1168499801585298456.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/CTLFireability5019724259983445823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1168499801585298456.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,73013,0.016948,4100,2,390,5,2607,6,0,210,2249,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((p0==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (p0==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t13, t14, Intersection with reachable at each ...216
(forward)formula 0,0,0.062105,5948,1,0,105,11493,137,52,1521,9587,128
FORMULA HealthRecord-PT-06-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 61 transition count 117
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 61 transition count 117
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 54 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 54 transition count 102
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 99 place count 54 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 52 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 52 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 106 place count 52 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 51 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 51 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 111 place count 51 transition count 80
Applied a total of 111 rules in 5 ms. Remains 51 /99 variables (removed 48) and now considering 80/191 (removed 111) transitions.
[2024-05-24 03:01:15] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 51 cols
[2024-05-24 03:01:15] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:01:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:01:15] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 03:01:15] [INFO ] Invariant cache hit.
[2024-05-24 03:01:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:01:15] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-24 03:01:15] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 03:01:15] [INFO ] Invariant cache hit.
[2024-05-24 03:01:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:01:15] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:01:15] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:01:15] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 76/127 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 64 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:01:16] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:01:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 76/127 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 79/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/128 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1966 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
After SMT, in 3363ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3364ms
Starting structural reductions in LTL mode, iteration 1 : 51/99 places, 80/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3467 ms. Remains : 51/99 places, 80/191 transitions.
[2024-05-24 03:01:18] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:01:18] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:01:18] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-24 03:01:18] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:01:18] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:01:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10787960291338242960.gal : 1 ms
[2024-05-24 03:01:18] [INFO ] Time to serialize properties into /tmp/CTLFireability3266172960541395202.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/CTLFireability10787960291338242960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3266172960541395202.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,459279,0.035663,4736,2,810,5,5863,6,0,280,4548,0


Converting to forward existential form...Done !
original formula: AG(EX(EG(((p108==0)||(p133==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EG(((p108==0)||(p133==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t13, t14, t16, t17, t19, t21, t23, t69, Intersecti...242
(forward)formula 0,0,1.15581,48592,1,0,285,289771,178,145,1953,256842,336
FORMULA HealthRecord-PT-06-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 191/191 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 61 transition count 117
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 61 transition count 117
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 53 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 53 transition count 100
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 101 place count 53 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 50 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 50 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 50 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 48 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 48 transition count 76
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 120 place count 48 transition count 70
Applied a total of 120 rules in 5 ms. Remains 48 /99 variables (removed 51) and now considering 70/191 (removed 121) transitions.
[2024-05-24 03:01:19] [INFO ] Flow matrix only has 67 transitions (discarded 3 similar events)
// Phase 1: matrix 67 rows 48 cols
[2024-05-24 03:01:19] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:01:19] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:01:19] [INFO ] Flow matrix only has 67 transitions (discarded 3 similar events)
[2024-05-24 03:01:19] [INFO ] Invariant cache hit.
[2024-05-24 03:01:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:01:19] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-24 03:01:19] [INFO ] Flow matrix only has 67 transitions (discarded 3 similar events)
[2024-05-24 03:01:19] [INFO ] Invariant cache hit.
[2024-05-24 03:01:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-24 03:01:20] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:01:20] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 66/114 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 60 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-24 03:01:21] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 66/114 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 69/129 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 130 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1469 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 3/3 constraints]
After SMT, in 2530ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2531ms
Starting structural reductions in LTL mode, iteration 1 : 48/99 places, 70/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2620 ms. Remains : 48/99 places, 70/191 transitions.
[2024-05-24 03:01:22] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:01:22] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:01:22] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-24 03:01:22] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:01:22] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:01:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10774421244092738138.gal : 1 ms
[2024-05-24 03:01:22] [INFO ] Time to serialize properties into /tmp/CTLFireability829188988408150380.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/CTLFireability10774421244092738138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability829188988408150380.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,369612,0.168266,11588,2,3255,5,42105,6,0,258,25009,0


Converting to forward existential form...Done !
original formula: EF(AX((p69==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((p69==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t15, t17, t19, Intersection with reachable at...222
(forward)formula 0,1,0.647351,26008,1,0,116,113745,153,61,1759,85854,143
FORMULA HealthRecord-PT-06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 03:01:23] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:01:23] [INFO ] Flatten gal took : 6 ms
Total runtime 105819 ms.

BK_STOP 1716519683200

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

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