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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 14K Apr 12 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:15 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-07-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716519701163

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-24 03:01:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:01:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:01:42] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-24 03:01:42] [INFO ] Transformed 155 places.
[2024-05-24 03:01:42] [INFO ] Transformed 320 transitions.
[2024-05-24 03:01:42] [INFO ] Found NUPN structural information;
[2024-05-24 03:01:42] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-07-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 117 transition count 224
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 117 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 116 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 116 transition count 222
Applied a total of 78 rules in 30 ms. Remains 116 /155 variables (removed 39) and now considering 222/295 (removed 73) transitions.
[2024-05-24 03:01:42] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
// Phase 1: matrix 215 rows 116 cols
[2024-05-24 03:01:42] [INFO ] Computed 13 invariants in 19 ms
[2024-05-24 03:01:42] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-24 03:01:42] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-05-24 03:01:42] [INFO ] Invariant cache hit.
[2024-05-24 03:01:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:01:43] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-24 03:01:43] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-05-24 03:01:43] [INFO ] Invariant cache hit.
[2024-05-24 03:01:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:01:44] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 12 ms to minimize.
[2024-05-24 03:01:44] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:01:44] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:01:44] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:01:44] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:01:44] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-24 03:01:44] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 6 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:01:45] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:01:46] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:01:46] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:01:46] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:01:46] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:01:46] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:01:46] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:01:46] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:01:46] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:01:46] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 3 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:01:47] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:01:48] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 2 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:01:49] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:01:50] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:01:50] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:01:50] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:01:50] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:01:50] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:01:50] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:01:50] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:01:50] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:01:50] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:01:50] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:01:50] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:01:51] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:01:51] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:01:51] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:01:51] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:01:51] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:01:51] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:01:51] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:01:51] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 19/102 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:01:52] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:01:52] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:01:52] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:01:52] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:01:52] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:01:53] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:01:53] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:01:54] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:01:54] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:01:55] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:01:55] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (OVERLAPS) 214/330 variables, 116/229 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:01:57] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 16 (OVERLAPS) 1/331 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/331 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:02:02] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/331 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/331 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:02:05] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:02:05] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:02:06] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:02:06] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/331 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/331 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 22 (OVERLAPS) 0/331 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 236 constraints, problems are : Problem set: 0 solved, 221 unsolved in 27725 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 106/106 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:02:11] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:11] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:02:12] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:02:12] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:02:13] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:02:13] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:02:13] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 214/330 variables, 116/242 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 221/463 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:02:15] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:02:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 1/331 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:02:25] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 15 (OVERLAPS) 0/331 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 467 constraints, problems are : Problem set: 0 solved, 221 unsolved in 29583 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 116/116 constraints]
After SMT, in 57452ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 57477ms
Starting structural reductions in LTL mode, iteration 1 : 116/155 places, 222/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57967 ms. Remains : 116/155 places, 222/295 transitions.
Support contains 80 out of 116 places after structural reductions.
[2024-05-24 03:02:40] [INFO ] Flatten gal took : 37 ms
[2024-05-24 03:02:40] [INFO ] Flatten gal took : 16 ms
[2024-05-24 03:02:40] [INFO ] Input system was already deterministic with 222 transitions.
Support contains 76 out of 116 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (2084 resets) in 1786 ms. (22 steps per ms) remains 23/55 properties
BEST_FIRST walk for 4002 steps (29 resets) in 70 ms. (56 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (34 resets) in 49 ms. (80 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (27 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (31 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (27 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (31 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (30 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (31 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (30 resets) in 18 ms. (210 steps per ms) remains 21/23 properties
[2024-05-24 03:02:41] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-05-24 03:02:41] [INFO ] Invariant cache hit.
[2024-05-24 03:02:41] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 40/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 47/116 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 214/330 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 03:02:42] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2024-05-24 03:02:42] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:02:42] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
Problem AtomicPropp46 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 3/132 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:42] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 1/133 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 1/331 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/331 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 134 constraints, problems are : Problem set: 1 solved, 20 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 40/68 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:42] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:02:42] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:02:42] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 9/15 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 48/116 variables, 8/26 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 3/29 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:02:43] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 12/41 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 4/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 5/50 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:02:44] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 10/60 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 7/67 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 1/68 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:02:45] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/116 variables, 8/76 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/116 variables, 1/77 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/116 variables, 6/83 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/116 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 214/330 variables, 116/199 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/330 variables, 20/219 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:46] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/330 variables, 1/220 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:47] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:02:47] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:02:47] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/330 variables, 3/223 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/330 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 23 (OVERLAPS) 1/331 variables, 1/224 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-24 03:02:47] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/331 variables, and 225 constraints, problems are : Problem set: 1 solved, 20 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 75/75 constraints]
After SMT, in 6050ms problems are : Problem set: 1 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 222/222 transitions.
Graph (trivial) has 111 edges and 116 vertex of which 4 / 116 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 468 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 110 transition count 209
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 207
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 108 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 108 transition count 205
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 10 place count 107 transition count 205
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 41 place count 76 transition count 143
Iterating global reduction 3 with 31 rules applied. Total rules applied 72 place count 76 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 75 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 75 transition count 141
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 76 place count 74 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -46
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 86 place count 69 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 90 place count 69 transition count 182
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 69 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 96 place count 66 transition count 179
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 66 transition count 179
Applied a total of 98 rules in 72 ms. Remains 66 /116 variables (removed 50) and now considering 179/222 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 66/116 places, 179/222 transitions.
RANDOM walk for 40000 steps (8 resets) in 691 ms. (57 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
Finished probabilistic random walk after 868195 steps, run visited all 20 properties in 2314 ms. (steps per millisecond=375 )
Probabilistic random walk after 868195 steps, saw 96908 distinct states, run finished after 2318 ms. (steps per millisecond=374 ) properties seen :20
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-24 03:02:50] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:02:50] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:02:50] [INFO ] Input system was already deterministic with 222 transitions.
Computed a total of 13 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 71 transition count 136
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 71 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 67 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 67 transition count 128
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 105 place count 67 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 66 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 66 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 65 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 65 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 65 transition count 114
Applied a total of 111 rules in 9 ms. Remains 65 /116 variables (removed 51) and now considering 114/222 (removed 108) transitions.
[2024-05-24 03:02:50] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
// Phase 1: matrix 111 rows 65 cols
[2024-05-24 03:02:50] [INFO ] Computed 9 invariants in 4 ms
[2024-05-24 03:02:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-24 03:02:50] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
[2024-05-24 03:02:50] [INFO ] Invariant cache hit.
[2024-05-24 03:02:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:02:50] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-24 03:02:50] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
[2024-05-24 03:02:50] [INFO ] Invariant cache hit.
[2024-05-24 03:02:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:02:51] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:02:51] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:02:51] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 110/175 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:02:52] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:02:52] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:02:52] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/176 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/176 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 81 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3109 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:02:54] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:02:54] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:02:54] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:02:54] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:02:54] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:02:54] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:02:54] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:02:54] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:02:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:02:55] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 110/175 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 113/203 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 1/176 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/176 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 204 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4851 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 16/16 constraints]
After SMT, in 7994ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7996ms
Starting structural reductions in LTL mode, iteration 1 : 65/116 places, 114/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8123 ms. Remains : 65/116 places, 114/222 transitions.
[2024-05-24 03:02:58] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:02:58] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:02:58] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-24 03:02:58] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:02:58] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:02:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality5040757955682767407.gal : 2 ms
[2024-05-24 03:02:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5295876917072970659.ctl : 5 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/CTLCardinality5040757955682767407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5295876917072970659.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,2.41081e+06,0.328093,11212,2,2531,5,29543,6,0,370,39037,0


Converting to forward existential form...Done !
original formula: AF((EF(EG((p0==1))) * ((AX((p126==1)) + E(((p19==0)||(p35==1)) U ((p133==0)||(p119==1)))) + ((AF(((p25==0)||(p97==1))) * ((p149==0)||(p3=...187
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U EG((p0==1))) * ((!(EX(!((p126==1)))) + E(((p19==0)||(p35==1)) U ((p133==0)||(p119==1)))) ...250
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...414
(forward)formula 0,0,1.03062,32952,1,0,273,140487,266,121,2721,145567,303
FORMULA HealthRecord-PT-07-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Graph (trivial) has 163 edges and 116 vertex of which 14 / 116 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 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 60 transition count 122
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 60 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 104 place count 53 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 111 place count 53 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 120 place count 53 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 51 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 51 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 49 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 49 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 134 place count 49 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 141 place count 49 transition count 76
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 2 with 4 rules applied. Total rules applied 145 place count 47 transition count 74
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 43 transition count 70
Applied a total of 149 rules in 23 ms. Remains 43 /116 variables (removed 73) and now considering 70/222 (removed 152) transitions.
[2024-05-24 03:03:00] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 43 cols
[2024-05-24 03:03:00] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:03:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:03:00] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2024-05-24 03:03:00] [INFO ] Invariant cache hit.
[2024-05-24 03:03:00] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-24 03:03:00] [INFO ] Redundant transitions in 12 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-24 03:03:00] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2024-05-24 03:03:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 03:03:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:03:00] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:03:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 60/103 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 55 constraints, problems are : Problem set: 0 solved, 56 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 03:03:01] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:03:01] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:03:01] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 60/103 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 56/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 114 constraints, problems are : Problem set: 0 solved, 56 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 6/6 constraints]
After SMT, in 1643ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1644ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/116 places, 70/222 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1768 ms. Remains : 43/116 places, 70/222 transitions.
[2024-05-24 03:03:01] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:03:01] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:03:01] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-24 03:03:01] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:01] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality9694301413817740025.gal : 2 ms
[2024-05-24 03:03:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality1533445689119129339.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/CTLCardinality9694301413817740025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1533445689119129339.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,129460,0.028272,4708,2,498,5,5133,6,0,226,5066,0


Converting to forward existential form...Done !
original formula: AG(EF((p9==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p9==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t31, t32, t41, t43...255
(forward)formula 0,0,0.115828,8140,1,0,140,27852,151,64,1605,20536,153
FORMULA HealthRecord-PT-07-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 66 transition count 126
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 66 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 107 place count 59 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 114 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 123 place count 59 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 56 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 56 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 132 place count 53 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 135 place count 53 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 144 place count 53 transition count 79
Applied a total of 144 rules in 14 ms. Remains 53 /116 variables (removed 63) and now considering 79/222 (removed 143) transitions.
[2024-05-24 03:03:01] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 53 cols
[2024-05-24 03:03:01] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:03:01] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:03:01] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 03:03:01] [INFO ] Invariant cache hit.
[2024-05-24 03:03:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:02] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-24 03:03:02] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 03:03:02] [INFO ] Invariant cache hit.
[2024-05-24 03:03:02] [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, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:03:02] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:03:02] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:03:02] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:03:02] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 75/128 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:03:02] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/129 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 68 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1783 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:03:04] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:03:04] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 75/128 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 78/147 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:03:04] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 149 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2298 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 8/8 constraints]
After SMT, in 4101ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 4103ms
Starting structural reductions in LTL mode, iteration 1 : 53/116 places, 79/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4201 ms. Remains : 53/116 places, 79/222 transitions.
[2024-05-24 03:03:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:03:06] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:06] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 03:03:06] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:03:06] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:03:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality7818199786241295931.gal : 2 ms
[2024-05-24 03:03:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality15267355245286012072.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/CTLCardinality7818199786241295931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15267355245286012072.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.08778e+06,0.126771,8932,2,2616,5,25262,6,0,287,17649,0


Converting to forward existential form...Done !
original formula: (AX(!(E(EX(TRUE) U !((((p62==0)||(p79==1))||(p64==1)))))) + EX(AG((p34==0))))
=> equivalent forward existential formula: [(FwdU(EY((Init * !(EX(!(E(TRUE U !((p34==0)))))))),EX(TRUE)) * !((((p62==0)||(p79==1))||(p64==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t21, t22, t23, t24, t40, t...287
(forward)formula 0,0,1.98815,68096,1,0,239,294616,182,156,2042,357198,309
FORMULA HealthRecord-PT-07-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 63 transition count 120
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 63 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 112 place count 57 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 57 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 124 place count 57 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 54 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 54 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 51 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 51 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 145 place count 51 transition count 78
Applied a total of 145 rules in 5 ms. Remains 51 /116 variables (removed 65) and now considering 78/222 (removed 144) transitions.
[2024-05-24 03:03:08] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 51 cols
[2024-05-24 03:03:08] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:03:08] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:03:08] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2024-05-24 03:03:08] [INFO ] Invariant cache hit.
[2024-05-24 03:03:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:08] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-24 03:03:08] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2024-05-24 03:03:08] [INFO ] Invariant cache hit.
[2024-05-24 03:03:08] [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, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:03:08] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:03:08] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:03:08] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:03:08] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 74/125 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 65 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1283 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:03:09] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:03:09] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 74/125 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 77/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints]
After SMT, in 3329ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3330ms
Starting structural reductions in LTL mode, iteration 1 : 51/116 places, 78/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3417 ms. Remains : 51/116 places, 78/222 transitions.
[2024-05-24 03:03:11] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:03:11] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:11] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-24 03:03:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:03:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:03:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality388420190206891465.gal : 1 ms
[2024-05-24 03:03:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality14759531140877157478.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/CTLCardinality388420190206891465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14759531140877157478.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,653193,0.307053,16336,2,4151,5,64780,6,0,278,39711,0


Converting to forward existential form...Done !
original formula: EX(EF(AX(((p98==0)&&(p149==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EX(!(((p98==0)&&(p149==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t21, t22, t47, t51, t...267
(forward)formula 0,1,1.13338,40664,1,0,143,160206,170,66,2049,140325,162
FORMULA HealthRecord-PT-07-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 74 transition count 142
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 74 transition count 142
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 69 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 69 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 99 place count 69 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 68 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 68 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 67 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 67 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 67 transition count 120
Applied a total of 105 rules in 11 ms. Remains 67 /116 variables (removed 49) and now considering 120/222 (removed 102) transitions.
[2024-05-24 03:03:12] [INFO ] Flow matrix only has 117 transitions (discarded 3 similar events)
// Phase 1: matrix 117 rows 67 cols
[2024-05-24 03:03:12] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:03:12] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:03:12] [INFO ] Flow matrix only has 117 transitions (discarded 3 similar events)
[2024-05-24 03:03:12] [INFO ] Invariant cache hit.
[2024-05-24 03:03:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:12] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-24 03:03:12] [INFO ] Flow matrix only has 117 transitions (discarded 3 similar events)
[2024-05-24 03:03:12] [INFO ] Invariant cache hit.
[2024-05-24 03:03:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-24 03:03:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:03:13] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:03:13] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:03:13] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-24 03:03:13] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:03:13] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:03:13] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:03:13] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-24 03:03:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:03:14] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:03:14] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:03:14] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:03:14] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:03:14] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 116/183 variables, 67/90 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 1/184 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-24 03:03:15] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/184 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 92 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3813 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-24 03:03:17] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:03:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:03:17] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:03:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:03:17] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-24 03:03:17] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-24 03:03:17] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 116/183 variables, 67/98 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 119/217 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 1/184 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-24 03:03:20] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:03:21] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/184 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (OVERLAPS) 0/184 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 220 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7491 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 24/24 constraints]
After SMT, in 11335ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 11336ms
Starting structural reductions in LTL mode, iteration 1 : 67/116 places, 120/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11445 ms. Remains : 67/116 places, 120/222 transitions.
[2024-05-24 03:03:24] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:03:24] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:03:24] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-24 03:03:24] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:24] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:03:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality3510687379707912847.gal : 5 ms
[2024-05-24 03:03:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality14229207940760582750.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/CTLCardinality3510687379707912847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14229207940760582750.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,4.07512e+06,1.58374,47420,2,7895,5,161235,6,0,384,232567,0


Converting to forward existential form...Done !
original formula: !(E(EX(((((EG((p34==1)) + E((p5==0) U ((p87==0)||(p1==1)))) * (((p50==0)||(p48==1))||((p124==0)||(p136==1)))) * ((p90==0)&&((p30==0)||(p8...235
=> equivalent forward existential formula: [(FwdU(Init,EX(((((EG((p34==1)) + E((p5==0) U ((p87==0)||(p1==1)))) * (((p50==0)||(p48==1))||((p124==0)||(p136==...289
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...490
(forward)formula 0,0,12.791,329596,1,0,442,1.29158e+06,276,222,2822,2.30664e+06,461
FORMULA HealthRecord-PT-07-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 67 transition count 128
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 67 transition count 128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 63 transition count 120
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 63 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 112 place count 63 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 62 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 62 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 61 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 61 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 119 place count 61 transition count 106
Applied a total of 119 rules in 15 ms. Remains 61 /116 variables (removed 55) and now considering 106/222 (removed 116) transitions.
[2024-05-24 03:03:37] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
// Phase 1: matrix 103 rows 61 cols
[2024-05-24 03:03:37] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:03:37] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:03:37] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2024-05-24 03:03:37] [INFO ] Invariant cache hit.
[2024-05-24 03:03:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:37] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-24 03:03:37] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2024-05-24 03:03:37] [INFO ] Invariant cache hit.
[2024-05-24 03:03:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:03:37] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:03:37] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 102/163 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:03:38] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:03:38] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:03:38] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 3 ms to minimize.
[2024-05-24 03:03:38] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:03:38] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:03:38] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 1/164 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 79 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2858 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:03:40] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:03:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:03:40] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:03:40] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 102/163 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 105/187 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/164 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 188 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3785 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 12/12 constraints]
After SMT, in 6670ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 6671ms
Starting structural reductions in LTL mode, iteration 1 : 61/116 places, 106/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6781 ms. Remains : 61/116 places, 106/222 transitions.
[2024-05-24 03:03:43] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:03:43] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:43] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-24 03:03:43] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:43] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality9888733601212814207.gal : 1 ms
[2024-05-24 03:03:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4151299904717049301.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/CTLCardinality9888733601212814207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4151299904717049301.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,1.0488e+06,0.066539,6224,2,1478,5,11074,6,0,346,12047,0


Converting to forward existential form...Done !
original formula: EX(E(((p146!=1) + !(EG(E((p116==1) U ((p71==0)||(p19==1)))))) U (A(((p80==0)||(p121==1)) U AG((p134==0))) * (p154==0))))
=> equivalent forward existential formula: [(((FwdU(EY(Init),((p146!=1) + !(EG(E((p116==1) U ((p71==0)||(p19==1))))))) * (p154==0)) * !(EG(!(!(E(TRUE U !((...278
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t...353
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,1.24117,47636,1,0,402,214978,254,282,2630,254879,518
FORMULA HealthRecord-PT-07-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 64 transition count 122
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 64 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 57 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 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 127 place count 57 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 54 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 54 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 51 transition count 84
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 148 place count 51 transition count 75
Applied a total of 148 rules in 6 ms. Remains 51 /116 variables (removed 65) and now considering 75/222 (removed 147) transitions.
[2024-05-24 03:03:45] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
// Phase 1: matrix 72 rows 51 cols
[2024-05-24 03:03:45] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:03:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:03:45] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2024-05-24 03:03:45] [INFO ] Invariant cache hit.
[2024-05-24 03:03:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:45] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-24 03:03:45] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2024-05-24 03:03:45] [INFO ] Invariant cache hit.
[2024-05-24 03:03:45] [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, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-24 03:03:45] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:03:45] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:03:45] [INFO ] Deduced a trap composed of 16 places in 31 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, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 71/122 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-24 03:03:46] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 1/123 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 65 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1586 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-24 03:03:47] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:03:47] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:03:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:03:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-24 03:03:47] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:03:47] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-24 03:03:47] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 71/122 variables, 51/71 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 74/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/123 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 146 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2486 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 11/11 constraints]
After SMT, in 4086ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 4087ms
Starting structural reductions in LTL mode, iteration 1 : 51/116 places, 75/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4176 ms. Remains : 51/116 places, 75/222 transitions.
[2024-05-24 03:03:49] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:49] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:03:49] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-24 03:03:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:03:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:03:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality1893340906890863286.gal : 1 ms
[2024-05-24 03:03:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality11773251441920250151.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/CTLCardinality1893340906890863286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11773251441920250151.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,536553,0.206542,13408,2,4285,5,50460,6,0,275,34019,0


Converting to forward existential form...Done !
original formula: AG((EX((p111==0)) + AF(AX(AF((p151==0))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EX((p111==0)))),!(!(EX(!(!(EG(!((p151==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t20, t22, t56, t57, t...262
(forward)formula 0,1,0.749618,28992,1,0,159,112905,174,79,1907,98420,182
FORMULA HealthRecord-PT-07-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 70 transition count 134
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 70 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 64 transition count 122
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 64 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 64 transition count 119
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 61 transition count 110
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 61 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 58 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 58 transition count 104
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 126 place count 58 transition count 97
Applied a total of 126 rules in 9 ms. Remains 58 /116 variables (removed 58) and now considering 97/222 (removed 125) transitions.
[2024-05-24 03:03:50] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
// Phase 1: matrix 94 rows 58 cols
[2024-05-24 03:03:50] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:03:50] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:03:50] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
[2024-05-24 03:03:50] [INFO ] Invariant cache hit.
[2024-05-24 03:03:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:50] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 03:03:50] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
[2024-05-24 03:03:50] [INFO ] Invariant cache hit.
[2024-05-24 03:03:50] [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, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:03:50] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:03:50] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:03:50] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 93/151 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 1/152 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 71 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1685 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:03:52] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:03:52] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:03:52] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:03:52] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 93/151 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 96/170 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 1/152 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/152 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 171 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 7/7 constraints]
After SMT, in 4722ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4723ms
Starting structural reductions in LTL mode, iteration 1 : 58/116 places, 97/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4820 ms. Remains : 58/116 places, 97/222 transitions.
[2024-05-24 03:03:55] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:03:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:55] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-24 03:03:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:03:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality16351038218688554450.gal : 1 ms
[2024-05-24 03:03:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality10952661591322031077.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/CTLCardinality16351038218688554450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10952661591322031077.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.65095e+06,0.388678,18292,2,3117,5,61001,6,0,325,63530,0


Converting to forward existential form...Done !
original formula: E(!(E((((p53==0)||(p49==1))&&((p32==0)||(p41==1))) U (p88!=0))) U !((((p148==1) * EX(AG(((p57==0)||(p114==1))))) + AX(E((p60==1) U (p103=...163
=> equivalent forward existential formula: [(EY((FwdU(Init,!(E((((p53==0)||(p49==1))&&((p32==0)||(p41==1))) U (p88!=0)))) * !(((p148==1) * EX(!(E(TRUE U !(...224
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t19, t21, t23, t24, t25, t...337
(forward)formula 0,0,1.77093,56416,1,0,265,299157,227,124,2357,269856,300
FORMULA HealthRecord-PT-07-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 69 transition count 131
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 69 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 65 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 65 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 64 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 64 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 63 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 63 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 108 place count 63 transition count 116
Applied a total of 108 rules in 9 ms. Remains 63 /116 variables (removed 53) and now considering 116/222 (removed 106) transitions.
[2024-05-24 03:03:56] [INFO ] Flow matrix only has 112 transitions (discarded 4 similar events)
// Phase 1: matrix 112 rows 63 cols
[2024-05-24 03:03:56] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:03:56] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:03:56] [INFO ] Flow matrix only has 112 transitions (discarded 4 similar events)
[2024-05-24 03:03:56] [INFO ] Invariant cache hit.
[2024-05-24 03:03:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:03:56] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-24 03:03:56] [INFO ] Flow matrix only has 112 transitions (discarded 4 similar events)
[2024-05-24 03:03:56] [INFO ] Invariant cache hit.
[2024-05-24 03:03:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-24 03:03:57] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:03:57] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:03:57] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 111/174 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-24 03:03:58] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:03:58] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:03:58] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 1/175 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 80 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2861 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-24 03:04:00] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:04:00] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-24 03:04:00] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:00] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 111/174 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 115/198 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 1/175 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/175 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 199 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4126 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 10/10 constraints]
After SMT, in 7029ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 7030ms
Starting structural reductions in LTL mode, iteration 1 : 63/116 places, 116/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7133 ms. Remains : 63/116 places, 116/222 transitions.
[2024-05-24 03:04:03] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:04:03] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:04:03] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-24 03:04:03] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:04:03] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:04:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality555850481154208551.gal : 1 ms
[2024-05-24 03:04:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17170958325226929973.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/CTLCardinality555850481154208551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17170958325226929973.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,1.39775e+06,0.064233,6032,2,1048,5,9722,6,0,362,10921,0


Converting to forward existential form...Done !
original formula: E(AX(EG(E(AG(((p126==0)||(p117==1))) U ((p131==0)||(p114==1))))) U AG(EX((((AG((p103==0)) + (p100!=1)) + ((p60==0)||(p107==1))) + (((p14=...197
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(EG(E(!(E(TRUE U !(((p126==0)||(p117==1))))) U ((p131==0)||(p114==1)))))))) * !(E(TRUE U !(EX(...285
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...380
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.88825,149184,1,0,580,841486,270,334,2781,878865,633
FORMULA HealthRecord-PT-07-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Graph (trivial) has 163 edges and 116 vertex of which 14 / 116 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 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 50 place count 59 transition count 120
Iterating global reduction 0 with 49 rules applied. Total rules applied 99 place count 59 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 106 place count 52 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 113 place count 52 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 122 place count 52 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 50 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 50 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 48 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 48 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 136 place count 48 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 143 place count 48 transition count 74
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 2 with 4 rules applied. Total rules applied 147 place count 46 transition count 72
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 42 transition count 68
Applied a total of 151 rules in 22 ms. Remains 42 /116 variables (removed 74) and now considering 68/222 (removed 154) transitions.
[2024-05-24 03:04:08] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
// Phase 1: matrix 59 rows 42 cols
[2024-05-24 03:04:08] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:04:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:04:08] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
[2024-05-24 03:04:08] [INFO ] Invariant cache hit.
[2024-05-24 03:04:09] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-24 03:04:09] [INFO ] Redundant transitions in 12 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-24 03:04:09] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
[2024-05-24 03:04:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-24 03:04:09] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:04:09] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:04:09] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:04:09] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-24 03:04:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 58/100 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/101 variables, and 56 constraints, problems are : Problem set: 0 solved, 54 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-24 03:04:09] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 58/100 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 54/111 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/101 variables, and 111 constraints, problems are : Problem set: 0 solved, 54 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 6/6 constraints]
After SMT, in 1481ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1483ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/116 places, 68/222 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1601 ms. Remains : 42/116 places, 68/222 transitions.
[2024-05-24 03:04:10] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:04:10] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:04:10] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-24 03:04:10] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:04:10] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:04:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13175658339140326122.gal : 0 ms
[2024-05-24 03:04:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7819502420074173930.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13175658339140326122.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7819502420074173930.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7819502420074173930.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 98
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :98 after 120
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :120 after 165
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :165 after 4158
RANDOM walk for 35886 steps (3629 resets) in 120 ms. (296 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-07-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4158 after 5040
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 63 transition count 119
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 63 transition count 119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 113 place count 56 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 120 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 129 place count 56 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 132 place count 53 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 135 place count 53 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 51 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 51 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 145 place count 51 transition count 77
Applied a total of 145 rules in 2 ms. Remains 51 /116 variables (removed 65) and now considering 77/222 (removed 145) transitions.
[2024-05-24 03:04:10] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
// Phase 1: matrix 73 rows 51 cols
[2024-05-24 03:04:10] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:04:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:04:10] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
[2024-05-24 03:04:10] [INFO ] Invariant cache hit.
[2024-05-24 03:04:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:04:10] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-24 03:04:10] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
[2024-05-24 03:04:10] [INFO ] Invariant cache hit.
[2024-05-24 03:04:10] [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, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:04:10] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:04:10] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:04:11] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 72/123 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 1/124 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 65 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1417 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:04:12] [INFO ] Deduced a trap composed of 12 places in 36 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, 76 unsolved
[2024-05-24 03:04:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:04:12] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:04:12] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 72/123 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 76/144 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 1/124 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (OVERLAPS) 0/124 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 145 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2383 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 7/7 constraints]
After SMT, in 3816ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3818ms
Starting structural reductions in LTL mode, iteration 1 : 51/116 places, 77/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3899 ms. Remains : 51/116 places, 77/222 transitions.
[2024-05-24 03:04:14] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:04:14] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:04:14] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-24 03:04:14] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:04:14] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:04:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality958172651539830745.gal : 2 ms
[2024-05-24 03:04:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality8982685406435338147.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/CTLCardinality958172651539830745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8982685406435338147.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,530721,0.111681,8936,2,2138,5,25284,6,0,275,16032,0


Converting to forward existential form...Done !
original formula: EF((EF((p124==1)) * EX(A((p56==1) U (p85==1)))))
=> equivalent forward existential formula: [((EY((FwdU(Init,TRUE) * E(TRUE U (p124==1)))) * !(EG(!((p85==1))))) * !(E(!((p85==1)) U (!((p56==1)) * !((p85==...172
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, Intersection with re...232
(forward)formula 0,0,3.17671,118532,1,0,387,714233,182,224,1989,635065,505
FORMULA HealthRecord-PT-07-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 68 transition count 129
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 68 transition count 129
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 62 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 62 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 117 place count 62 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 60 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 60 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 58 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 58 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 58 transition count 92
Applied a total of 131 rules in 3 ms. Remains 58 /116 variables (removed 58) and now considering 92/222 (removed 130) transitions.
[2024-05-24 03:04:17] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
// Phase 1: matrix 88 rows 58 cols
[2024-05-24 03:04:17] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:04:17] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:04:17] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2024-05-24 03:04:17] [INFO ] Invariant cache hit.
[2024-05-24 03:04:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:04:17] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 03:04:17] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2024-05-24 03:04:17] [INFO ] Invariant cache hit.
[2024-05-24 03:04:17] [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, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:04:18] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:04:18] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 87/145 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/146 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 71 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:04:19] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:04:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:04:19] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:04:20] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:04:20] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:04:20] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 87/145 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 91/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 1/146 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/146 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 168 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2775 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 8/8 constraints]
After SMT, in 4590ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4592ms
Starting structural reductions in LTL mode, iteration 1 : 58/116 places, 92/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4692 ms. Remains : 58/116 places, 92/222 transitions.
[2024-05-24 03:04:22] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:04:22] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:04:22] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 03:04:22] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:04:22] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:04:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality5756404730750292302.gal : 0 ms
[2024-05-24 03:04:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality10991833763649479228.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/CTLCardinality5756404730750292302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10991833763649479228.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.14405e+06,0.080032,6908,2,1544,5,14165,6,0,318,13401,0


Converting to forward existential form...Done !
original formula: EF((AG(AF(!(E((p25==1) U (p77==0))))) * (AX(((p112==0)||(p105==1))) + EX(((p51==0)&&(p125==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(!(E((p25==1) U (p77==0)))))))))) * !(EX(!(((p112==0)||(p105==1))))))] ...279
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, t21, t23, t...302
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.2757,102192,1,0,329,598346,215,189,2372,620960,354
FORMULA HealthRecord-PT-07-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Graph (trivial) has 153 edges and 116 vertex of which 14 / 116 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.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 61 transition count 124
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 61 transition count 124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 101 place count 55 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 107 place count 55 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 112 place count 55 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 52 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 52 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 49 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 49 transition count 92
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 133 place count 49 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 140 place count 49 transition count 76
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 2 with 4 rules applied. Total rules applied 144 place count 47 transition count 74
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 43 transition count 70
Applied a total of 148 rules in 20 ms. Remains 43 /116 variables (removed 73) and now considering 70/222 (removed 152) transitions.
[2024-05-24 03:04:25] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 43 cols
[2024-05-24 03:04:25] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:04:25] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:04:25] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2024-05-24 03:04:25] [INFO ] Invariant cache hit.
[2024-05-24 03:04:25] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-24 03:04:25] [INFO ] Redundant transitions in 15 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-24 03:04:25] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2024-05-24 03:04:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:04:26] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 60/103 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 56 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 60/103 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 56/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 112 constraints, problems are : Problem set: 0 solved, 56 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 4/4 constraints]
After SMT, in 1486ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1487ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/116 places, 70/222 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1610 ms. Remains : 43/116 places, 70/222 transitions.
[2024-05-24 03:04:27] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:04:27] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:04:27] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-24 03:04:27] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:04:27] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:04:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality4115754554349747558.gal : 0 ms
[2024-05-24 03:04:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality4253256174071398206.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/CTLCardinality4115754554349747558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4253256174071398206.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,159796,0.03506,4704,2,484,5,5192,6,0,226,6011,0


Converting to forward existential form...Done !
original formula: AG(E(((p36==1) * !(EG(AF((p87==0))))) U (p43==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p36==1) * !(EG(!(EG(!((p87==0))))))) U (p43==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t17, t25, t26, t36, t40...275
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.594682,28532,1,0,310,145893,164,175,1671,182495,318
FORMULA HealthRecord-PT-07-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 64 transition count 122
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 64 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 57 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 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 127 place count 57 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 54 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 53 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 53 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 138 place count 53 transition count 85
Applied a total of 138 rules in 2 ms. Remains 53 /116 variables (removed 63) and now considering 85/222 (removed 137) transitions.
[2024-05-24 03:04:28] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 53 cols
[2024-05-24 03:04:28] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:04:28] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:04:28] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:04:28] [INFO ] Invariant cache hit.
[2024-05-24 03:04:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:04:28] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-24 03:04:28] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:04:28] [INFO ] Invariant cache hit.
[2024-05-24 03:04:28] [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, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:04:28] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/134 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 65 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1331 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 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, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:04:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:04:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:04:29] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:04:29] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:04:29] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:04:29] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 81/134 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 84/154 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 155 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2236 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 8/8 constraints]
After SMT, in 3587ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3588ms
Starting structural reductions in LTL mode, iteration 1 : 53/116 places, 85/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3700 ms. Remains : 53/116 places, 85/222 transitions.
[2024-05-24 03:04:31] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:04:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:04:31] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-24 03:04:31] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:04:31] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:04:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality1257729878865835617.gal : 1 ms
[2024-05-24 03:04:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality10917330284233625294.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/CTLCardinality1257729878865835617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10917330284233625294.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,714430,0.030844,4776,2,669,5,5408,6,0,293,5023,0


Converting to forward existential form...Done !
original formula: (EF(EX(EF((p128==1)))) + EG(EX(((AG((p146==0)) * (p96==1)) * (p75==1)))))
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,TRUE)),TRUE) * (p128==1))] != FALSE + [FwdG(Init,EX(((!(E(TRUE U !((p146==0)))) * (p96==1))...180
(forward)formula 0,1,0.038977,5040,1,0,8,5408,9,1,570,5023,4
FORMULA HealthRecord-PT-07-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 222/222 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 71 transition count 135
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 71 transition count 135
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 66 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 66 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 105 place count 66 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 64 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 64 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 63 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 63 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 113 place count 63 transition count 110
Applied a total of 113 rules in 3 ms. Remains 63 /116 variables (removed 53) and now considering 110/222 (removed 112) transitions.
[2024-05-24 03:04:31] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
// Phase 1: matrix 106 rows 63 cols
[2024-05-24 03:04:31] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:04:31] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:04:31] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
[2024-05-24 03:04:31] [INFO ] Invariant cache hit.
[2024-05-24 03:04:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:04:31] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-24 03:04:31] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
[2024-05-24 03:04:31] [INFO ] Invariant cache hit.
[2024-05-24 03:04:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:04:32] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 105/168 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 1/169 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 76 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2257 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:04:34] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 105/168 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 109/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 1/169 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/169 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 193 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 10/10 constraints]
After SMT, in 6331ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6332ms
Starting structural reductions in LTL mode, iteration 1 : 63/116 places, 110/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6429 ms. Remains : 63/116 places, 110/222 transitions.
[2024-05-24 03:04:38] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:04:38] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:04:38] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-24 03:04:38] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:04:38] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:04:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality4991430494685431264.gal : 1 ms
[2024-05-24 03:04:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality6978529880437681159.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/CTLCardinality4991430494685431264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6978529880437681159.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,2.47278e+06,0.405527,17852,2,3986,5,60067,6,0,355,67125,0


Converting to forward existential form...Done !
original formula: EF(((EF(((p36==0)||(p88==0))) * AX((p17==1))) * ((p74==1) * (((EF((p61==1)) + E(EX((p52==1)) U !(((p90==0)||(p42==1))))) + (((p128==0)&&(...224
=> equivalent forward existential formula: ((([(FwdU(((FwdU(Init,TRUE) * (E(TRUE U ((p36==0)||(p88==0))) * !(EX(!((p17==1)))))) * (p74==1)),TRUE) * (p61==1...602
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, t21, t23, t...408
(forward)formula 0,1,1.80545,51056,1,0,232,215885,241,97,2684,231014,237
FORMULA HealthRecord-PT-07-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-24 03:04:40] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:04:40] [INFO ] Flatten gal took : 5 ms
Total runtime 177789 ms.

BK_STOP 1716519880134

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-07"
export BK_EXAMINATION="CTLCardinality"
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-07, examination is CTLCardinality"
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-171640604100745"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-07.tgz
mv HealthRecord-PT-07 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;