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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:29 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 69K 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-10-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716520179184

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-24 03:09:40] [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:09:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:09:40] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-24 03:09:40] [INFO ] Transformed 158 places.
[2024-05-24 03:09:40] [INFO ] Transformed 333 transitions.
[2024-05-24 03:09:40] [INFO ] Found NUPN structural information;
[2024-05-24 03:09:40] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-10-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 113 transition count 220
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 113 transition count 220
Applied a total of 90 rules in 22 ms. Remains 113 /158 variables (removed 45) and now considering 220/306 (removed 86) transitions.
[2024-05-24 03:09:40] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 113 cols
[2024-05-24 03:09:40] [INFO ] Computed 14 invariants in 18 ms
[2024-05-24 03:09:40] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-24 03:09:40] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2024-05-24 03:09:40] [INFO ] Invariant cache hit.
[2024-05-24 03:09:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:09:40] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-24 03:09:40] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2024-05-24 03:09:40] [INFO ] Invariant cache hit.
[2024-05-24 03:09:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:09:42] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 12 ms to minimize.
[2024-05-24 03:09:42] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:09:42] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:09:42] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:09:42] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:09:42] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:09:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:09:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:09:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 7 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:09:43] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 211/324 variables, 113/147 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:09:45] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/325 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/325 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 149 constraints, problems are : Problem set: 0 solved, 219 unsolved in 9572 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:09:51] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:09:51] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:09:51] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 211/324 variables, 113/151 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 219/370 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:09:53] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:09:53] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:09:53] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:09:54] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:09:54] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 5/375 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:09:55] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 1/325 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:10:02] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:10:05] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/325 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 15 (OVERLAPS) 0/325 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 379 constraints, problems are : Problem set: 0 solved, 219 unsolved in 25816 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 32/32 constraints]
After SMT, in 35556ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 35571ms
Starting structural reductions in LTL mode, iteration 1 : 113/158 places, 220/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35972 ms. Remains : 113/158 places, 220/306 transitions.
Support contains 75 out of 113 places after structural reductions.
[2024-05-24 03:10:16] [INFO ] Flatten gal took : 67 ms
[2024-05-24 03:10:16] [INFO ] Flatten gal took : 19 ms
[2024-05-24 03:10:16] [INFO ] Input system was already deterministic with 220 transitions.
Support contains 66 out of 113 places (down from 75) after GAL structural reductions.
RANDOM walk for 40000 steps (2508 resets) in 2067 ms. (19 steps per ms) remains 19/42 properties
BEST_FIRST walk for 4004 steps (27 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (31 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (31 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (37 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (31 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (31 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (33 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (31 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (31 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (34 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (29 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 7 ms. (500 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 8 ms. (444 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (33 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (32 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
[2024-05-24 03:10:17] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2024-05-24 03:10:17] [INFO ] Invariant cache hit.
[2024-05-24 03:10:17] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/77 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 36/113 variables, 8/14 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 211/324 variables, 113/127 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 1/128 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/325 variables, 1/129 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/325 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 129 constraints, problems are : Problem set: 1 solved, 17 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 45/76 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 5 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 5/11 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 5 (OVERLAPS) 37/113 variables, 8/21 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/22 constraints. Problems are: Problem set: 2 solved, 16 unsolved
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 3 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
Problem AtomicPropp25 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 20/42 constraints. Problems are: Problem set: 3 solved, 15 unsolved
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 7/49 constraints. Problems are: Problem set: 3 solved, 15 unsolved
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 3/52 constraints. Problems are: Problem set: 3 solved, 15 unsolved
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 4/56 constraints. Problems are: Problem set: 3 solved, 15 unsolved
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 1/57 constraints. Problems are: Problem set: 3 solved, 15 unsolved
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 5/62 constraints. Problems are: Problem set: 3 solved, 15 unsolved
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 4/66 constraints. Problems are: Problem set: 3 solved, 15 unsolved
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/113 variables, 1/67 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/113 variables, 0/67 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 211/324 variables, 113/180 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/324 variables, 15/195 constraints. Problems are: Problem set: 3 solved, 15 unsolved
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/324 variables, 1/196 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/324 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 1/325 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/325 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 0/325 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 197 constraints, problems are : Problem set: 3 solved, 15 unsolved in 3943 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/18 constraints, Known Traps: 54/54 constraints]
After SMT, in 4874ms problems are : Problem set: 3 solved, 15 unsolved
Parikh walk visited 13 properties in 1228 ms.
Support contains 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 220/220 transitions.
Graph (trivial) has 154 edges and 113 vertex of which 8 / 113 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 482 edges and 109 vertex of which 103 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 200
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 6 rules applied. Total rules applied 11 place count 100 transition count 197
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 13 place count 99 transition count 196
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 99 transition count 194
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 18 place count 96 transition count 194
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 59 place count 55 transition count 112
Iterating global reduction 3 with 41 rules applied. Total rules applied 100 place count 55 transition count 112
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 110 place count 45 transition count 92
Iterating global reduction 3 with 10 rules applied. Total rules applied 120 place count 45 transition count 92
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 129 place count 45 transition count 83
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 132 place count 42 transition count 74
Iterating global reduction 4 with 3 rules applied. Total rules applied 135 place count 42 transition count 74
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 138 place count 39 transition count 68
Iterating global reduction 4 with 3 rules applied. Total rules applied 141 place count 39 transition count 68
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 150 place count 39 transition count 59
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 5 with 2 rules applied. Total rules applied 152 place count 38 transition count 58
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 162 place count 33 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 33 transition count 88
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 166 place count 33 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 169 place count 30 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 171 place count 30 transition count 83
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 173 place count 30 transition count 144
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 176 place count 28 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 179 place count 28 transition count 140
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 180 place count 27 transition count 107
Iterating global reduction 7 with 1 rules applied. Total rules applied 181 place count 27 transition count 107
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 182 place count 26 transition count 105
Iterating global reduction 7 with 1 rules applied. Total rules applied 183 place count 26 transition count 105
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 193 place count 26 transition count 95
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 195 place count 26 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 197 place count 26 transition count 93
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 204 place count 26 transition count 93
Applied a total of 204 rules in 85 ms. Remains 26 /113 variables (removed 87) and now considering 93/220 (removed 127) transitions.
Running 77 sub problems to find dead transitions.
[2024-05-24 03:10:23] [INFO ] Flow matrix only has 75 transitions (discarded 18 similar events)
// Phase 1: matrix 75 rows 26 cols
[2024-05-24 03:10:23] [INFO ] Computed 7 invariants in 3 ms
[2024-05-24 03:10:23] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 3 (OVERLAPS) 75/101 variables, 26/33 constraints. Problems are: Problem set: 8 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 19/52 constraints. Problems are: Problem set: 8 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/52 constraints. Problems are: Problem set: 8 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/52 constraints. Problems are: Problem set: 8 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 52 constraints, problems are : Problem set: 8 solved, 69 unsolved in 852 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 75/101 variables, 26/33 constraints. Problems are: Problem set: 8 solved, 69 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 19/52 constraints. Problems are: Problem set: 11 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 66/118 constraints. Problems are: Problem set: 11 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/118 constraints. Problems are: Problem set: 11 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/118 constraints. Problems are: Problem set: 11 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 118 constraints, problems are : Problem set: 11 solved, 66 unsolved in 1182 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 66/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 2167ms problems are : Problem set: 11 solved, 66 unsolved
Search for dead transitions found 11 dead transitions in 2170ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/113 places, 82/220 transitions.
Graph (complete) has 87 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 25 /26 variables (removed 1) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2262 ms. Remains : 25/113 places, 82/220 transitions.
RANDOM walk for 40000 steps (15 resets) in 287 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (25 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (14 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 389 steps, run visited all 2 properties in 13 ms. (steps per millisecond=29 )
Probabilistic random walk after 389 steps, saw 169 distinct states, run finished after 17 ms. (steps per millisecond=22 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-10-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:10:26] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:10:26] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:10:26] [INFO ] Input system was already deterministic with 220 transitions.
Support contains 48 out of 113 places (down from 49) after GAL structural reductions.
Computed a total of 8 stabilizing places and 13 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 67 transition count 133
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 67 transition count 133
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 101 place count 58 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 110 place count 58 transition count 115
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 115 place count 58 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 118 place count 55 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 55 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 124 place count 52 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 127 place count 52 transition count 95
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 136 place count 52 transition count 86
Applied a total of 136 rules in 9 ms. Remains 52 /113 variables (removed 61) and now considering 86/220 (removed 134) transitions.
[2024-05-24 03:10:26] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 52 cols
[2024-05-24 03:10:26] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:10:26] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:10:26] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:10:26] [INFO ] Invariant cache hit.
[2024-05-24 03:10:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:10:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-24 03:10:26] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:10:26] [INFO ] Invariant cache hit.
[2024-05-24 03:10:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:10:26] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:10:27] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/134 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:10:27] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:10:27] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:10:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 67 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2229 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:10:29] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:10:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:10:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:10:29] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:10:29] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 82/134 variables, 52/71 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 85/156 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 1/135 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/135 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 157 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2494 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 10/10 constraints]
After SMT, in 4747ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4749ms
Starting structural reductions in LTL mode, iteration 1 : 52/113 places, 86/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4860 ms. Remains : 52/113 places, 86/220 transitions.
[2024-05-24 03:10:31] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:10:31] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:10:31] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-24 03:10:31] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:10:31] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:10:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality13395165250065943302.gal : 2 ms
[2024-05-24 03:10:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality1914915181234570096.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/CTLCardinality13395165250065943302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1914915181234570096.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,737028,0.184605,8940,2,1441,5,23845,6,0,290,19547,0


Converting to forward existential form...Done !
original formula: !(A(!(AF(!(((p64==0)||(p40==1))))) U AX(!(EF(((p90==1)&&(p14==0)))))))
=> equivalent forward existential formula: ([(FwdU(EY((FwdU(Init,!(!(EX(!(!(E(TRUE U ((p90==1)&&(p14==0))))))))) * !(!(!(EG(!(!(((p64==0)||(p40==1)))))))))...268
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, t36, t37, t...292
(forward)formula 0,1,2.9844,109600,1,0,446,618904,201,233,2262,635008,498
FORMULA HealthRecord-PT-10-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 67 transition count 133
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 67 transition count 133
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 101 place count 58 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 110 place count 58 transition count 115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 58 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 55 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 55 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 52 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 52 transition count 91
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 140 place count 52 transition count 82
Applied a total of 140 rules in 6 ms. Remains 52 /113 variables (removed 61) and now considering 82/220 (removed 138) transitions.
[2024-05-24 03:10:34] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 52 cols
[2024-05-24 03:10:34] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:10:34] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:10:34] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:10:34] [INFO ] Invariant cache hit.
[2024-05-24 03:10:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:10:34] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-24 03:10:34] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:10:34] [INFO ] Invariant cache hit.
[2024-05-24 03:10:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:10:34] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
[2024-05-24 03:10:34] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:10:34] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 78/130 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 65 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:10:36] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:10:36] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:10:36] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 78/130 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 81/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 149 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2094 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 6/6 constraints]
After SMT, in 3401ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3403ms
Starting structural reductions in LTL mode, iteration 1 : 52/113 places, 82/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3511 ms. Remains : 52/113 places, 82/220 transitions.
[2024-05-24 03:10:37] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:10:37] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:10:37] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-24 03:10:37] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:10:37] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:10:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality17398631632930807342.gal : 2 ms
[2024-05-24 03:10:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality15059220945734862424.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/CTLCardinality17398631632930807342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15059220945734862424.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,499375,0.039083,5004,2,850,5,7118,6,0,286,6162,0


Converting to forward existential form...Done !
original formula: EF((AF(AX(AF((p147==1)))) + AG((((EX((p92==1)) + (p65==0)) + (p85==1)) * AF((p103==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(!(EX(!(!(EG(!((p147==1)))))))))))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !((((EX...227
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t23, t24, t25, ...283
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.37127,60008,1,0,290,341642,189,153,2109,339735,381
FORMULA HealthRecord-PT-10-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 70 transition count 139
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 70 transition count 139
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 62 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 62 transition count 123
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 111 place count 62 transition count 114
Applied a total of 111 rules in 6 ms. Remains 62 /113 variables (removed 51) and now considering 114/220 (removed 106) transitions.
[2024-05-24 03:10:39] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
// Phase 1: matrix 111 rows 62 cols
[2024-05-24 03:10:39] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:10:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:10:39] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
[2024-05-24 03:10:39] [INFO ] Invariant cache hit.
[2024-05-24 03:10:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:10:39] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-24 03:10:39] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
[2024-05-24 03:10:39] [INFO ] Invariant cache hit.
[2024-05-24 03:10:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:10:39] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:10:39] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:10:39] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:10:40] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:10:40] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:10:40] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 110/172 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/173 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:10:41] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/173 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/173 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 79 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3193 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:10:42] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:10:42] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:10:43] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 110/172 variables, 62/81 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 113/194 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 1/173 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 195 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3536 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 10/10 constraints]
After SMT, in 6761ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 6763ms
Starting structural reductions in LTL mode, iteration 1 : 62/113 places, 114/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6865 ms. Remains : 62/113 places, 114/220 transitions.
[2024-05-24 03:10:46] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:10:46] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:10:46] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-24 03:10:46] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:10:46] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:10:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality10182420537637962180.gal : 2 ms
[2024-05-24 03:10:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality8519231368971593913.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/CTLCardinality10182420537637962180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8519231368971593913.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.57854e+06,0.198429,12100,2,1633,5,31019,6,0,358,42518,0


Converting to forward existential form...Done !
original formula: (AG(AF(((EX(((p125==0)||(p155==1))) + ((p76==0)&&(p46==1))) + AG(((p26==0)&&(p95==1)))))) + AF(((AG(AX(((p150==0)||(p97==1)))) * (p107==0...171
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(!(EG(!(((EX(((p125==0)||(p155==1))) + ((p76==0)&&(p46==1))) + !(E(TRUE U !(((p26==0...267
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
Using saturation style SCC detection
(forward)formula 0,0,4.94713,163328,1,0,464,779668,264,247,2779,960501,469
FORMULA HealthRecord-PT-10-CTLCardinality-2024-03 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 : 113/113 places, 220/220 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 64 transition count 127
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 64 transition count 127
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 54 transition count 107
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 54 transition count 107
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 54 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 51 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 51 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 49 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 49 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 143 place count 49 transition count 79
Applied a total of 143 rules in 10 ms. Remains 49 /113 variables (removed 64) and now considering 79/220 (removed 141) transitions.
[2024-05-24 03:10:51] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 49 cols
[2024-05-24 03:10:51] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:10:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:10:51] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 03:10:51] [INFO ] Invariant cache hit.
[2024-05-24 03:10:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:10:51] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-24 03:10:51] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 03:10:51] [INFO ] Invariant cache hit.
[2024-05-24 03:10:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:10:51] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:10:51] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 75/124 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/125 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 61 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:10:52] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:10:52] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 75/124 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 78/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 141 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1838 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 4/4 constraints]
After SMT, in 3071ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3073ms
Starting structural reductions in LTL mode, iteration 1 : 49/113 places, 79/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3156 ms. Remains : 49/113 places, 79/220 transitions.
[2024-05-24 03:10:54] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:10:54] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:10:54] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 03:10:54] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:10:54] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:10:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality9868884864598827182.gal : 1 ms
[2024-05-24 03:10:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11962923244595892204.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/CTLCardinality9868884864598827182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11962923244595892204.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,404604,0.039797,5264,2,714,5,8450,6,0,271,6764,0


Converting to forward existential form...Done !
original formula: EX(EG(EF(AG((p139==0)))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(TRUE U !(E(TRUE U !((p139==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t13, t14, t16, t18, t20, Intersection with reachab...227
(forward)formula 0,1,0.304511,15572,1,0,140,66119,180,72,2043,46675,185
FORMULA HealthRecord-PT-10-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 70 transition count 139
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 70 transition count 139
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 62 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 62 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 108 place count 62 transition count 117
Applied a total of 108 rules in 4 ms. Remains 62 /113 variables (removed 51) and now considering 117/220 (removed 103) transitions.
[2024-05-24 03:10:54] [INFO ] Flow matrix only has 114 transitions (discarded 3 similar events)
// Phase 1: matrix 114 rows 62 cols
[2024-05-24 03:10:54] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:10:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:10:54] [INFO ] Flow matrix only has 114 transitions (discarded 3 similar events)
[2024-05-24 03:10:54] [INFO ] Invariant cache hit.
[2024-05-24 03:10:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:10:54] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-24 03:10:54] [INFO ] Flow matrix only has 114 transitions (discarded 3 similar events)
[2024-05-24 03:10:54] [INFO ] Invariant cache hit.
[2024-05-24 03:10:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:10:55] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:10:55] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 113/175 variables, 62/73 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 1/176 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/176 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 74 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2189 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:10:57] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:10:57] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:10:57] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:10:57] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:10:57] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:10:57] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 113/175 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 116/195 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 1/176 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 196 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3927 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 8/8 constraints]
After SMT, in 6152ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 6153ms
Starting structural reductions in LTL mode, iteration 1 : 62/113 places, 117/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6251 ms. Remains : 62/113 places, 117/220 transitions.
[2024-05-24 03:11:01] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:11:01] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:11:01] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-24 03:11:01] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:11:01] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:11:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality9626413036597963715.gal : 3 ms
[2024-05-24 03:11:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality16562666274545275806.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/CTLCardinality9626413036597963715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16562666274545275806.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.45436e+06,0.239218,13440,2,2284,5,41782,6,0,361,44370,0


Converting to forward existential form...Done !
original formula: EX((EF((p120==1)) * (EX((p11==0)) + (EG((p28==1)) * !(A((p49==1) U ((p8==0)||(p124==1))))))))
=> equivalent forward existential formula: ([(EY((EY(Init) * E(TRUE U (p120==1)))) * (p11==0))] != FALSE + ([(FwdU(((EY(Init) * E(TRUE U (p120==1))) * EG((...337
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...373
(forward)formula 0,1,1.07301,39584,1,0,225,194011,252,95,2711,125575,261
FORMULA HealthRecord-PT-10-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Graph (trivial) has 141 edges and 113 vertex of which 10 / 113 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 63 transition count 130
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 63 transition count 130
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 100 place count 54 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 109 place count 54 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 118 place count 54 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 51 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 51 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 48 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 48 transition count 88
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 138 place count 48 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 48 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 45 transition count 73
Applied a total of 148 rules in 24 ms. Remains 45 /113 variables (removed 68) and now considering 73/220 (removed 147) transitions.
[2024-05-24 03:11:02] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
// Phase 1: matrix 66 rows 45 cols
[2024-05-24 03:11:02] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:11:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 03:11:02] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
[2024-05-24 03:11:02] [INFO ] Invariant cache hit.
[2024-05-24 03:11:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:02] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-24 03:11:02] [INFO ] Redundant transitions in 13 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-24 03:11:02] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
[2024-05-24 03:11:02] [INFO ] Invariant cache hit.
[2024-05-24 03:11:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 65/110 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/111 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 58 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 03:11:03] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 65/110 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 72/130 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/111 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 131 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1616 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints]
After SMT, in 2748ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2748ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/113 places, 73/220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2868 ms. Remains : 45/113 places, 73/220 transitions.
[2024-05-24 03:11:05] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:11:05] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:05] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-24 03:11:05] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:05] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality3340810720135451466.gal : 1 ms
[2024-05-24 03:11:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality18264933606423724469.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/CTLCardinality3340810720135451466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18264933606423724469.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,238145,0.072791,6844,2,906,5,14681,6,0,245,14096,0


Converting to forward existential form...Done !
original formula: EF(((AF(((p30==1) + AG(((p54==0)&&(p71==1))))) * (p38==0)) * (p140==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p140==1)) * (p38==0)) * !(EG(!(((p30==1) + !(E(TRUE U !(((p54==0)&&(p71==1))))))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t16, t17, t30, t31, Intersection...240
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.69248,67252,1,0,308,383069,171,178,1887,386192,315
FORMULA HealthRecord-PT-10-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Graph (trivial) has 147 edges and 113 vertex of which 10 / 113 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 65 transition count 135
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 65 transition count 135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 94 place count 56 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 103 place count 56 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 112 place count 56 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 54 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 54 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 52 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 52 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 125 place count 52 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 52 transition count 89
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 133 place count 50 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 49 transition count 86
Applied a total of 134 rules in 15 ms. Remains 49 /113 variables (removed 64) and now considering 86/220 (removed 134) transitions.
[2024-05-24 03:11:06] [INFO ] Flow matrix only has 79 transitions (discarded 7 similar events)
// Phase 1: matrix 79 rows 49 cols
[2024-05-24 03:11:06] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:11:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 03:11:06] [INFO ] Flow matrix only has 79 transitions (discarded 7 similar events)
[2024-05-24 03:11:06] [INFO ] Invariant cache hit.
[2024-05-24 03:11:06] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-24 03:11:06] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-24 03:11:06] [INFO ] Flow matrix only has 79 transitions (discarded 7 similar events)
[2024-05-24 03:11:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 8/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 03:11:07] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:11:07] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:11:07] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 78/127 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 03:11:07] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/128 variables, and 62 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1142 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 8/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 03:11:08] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 78/127 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 70/133 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 03:11:08] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/128 variables, and 134 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1511 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 6/6 constraints]
After SMT, in 2678ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2679ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/113 places, 86/220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2794 ms. Remains : 49/113 places, 86/220 transitions.
[2024-05-24 03:11:09] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:11:09] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:09] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-24 03:11:09] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:09] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality10058207604909097425.gal : 0 ms
[2024-05-24 03:11:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality13954923582684258620.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/CTLCardinality10058207604909097425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13954923582684258620.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,451336,0.113462,8444,2,1507,5,23643,6,0,271,26540,0


Converting to forward existential form...Done !
original formula: AF(E(!((AF(AG(((p92==0)||(p27==1)))) * !(((p5==0)||(p49==1))))) U !(EF((p31==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!((!(EG(!(!(E(TRUE U !(((p92==0)||(p27==1)))))))) * !(((p5==0)||(p49==1))))) U !(E(TRUE U (p31==1...170
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t18, t19, t20, t30...365
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.21904,53644,1,0,295,267116,204,145,2084,285098,306
FORMULA HealthRecord-PT-10-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Graph (trivial) has 150 edges and 113 vertex of which 6 / 113 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 64 transition count 130
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 64 transition count 130
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 101 place count 54 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 111 place count 54 transition count 110
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 54 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 51 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 51 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 48 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 48 transition count 86
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 141 place count 48 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 48 transition count 76
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 2 with 2 rules applied. Total rules applied 144 place count 47 transition count 75
Applied a total of 144 rules in 32 ms. Remains 47 /113 variables (removed 66) and now considering 75/220 (removed 145) transitions.
[2024-05-24 03:11:10] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
// Phase 1: matrix 68 rows 47 cols
[2024-05-24 03:11:10] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:11:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:11:10] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2024-05-24 03:11:10] [INFO ] Invariant cache hit.
[2024-05-24 03:11:10] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-24 03:11:10] [INFO ] Redundant transitions in 11 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-24 03:11:11] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2024-05-24 03:11:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 2/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-24 03:11:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:11:11] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 6/47 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 67/114 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 59 constraints, problems are : Problem set: 0 solved, 59 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 2/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 6/47 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 67/114 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 59/118 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/114 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 118 constraints, problems are : Problem set: 0 solved, 59 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
After SMT, in 1588ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 1589ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/113 places, 75/220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1744 ms. Remains : 47/113 places, 75/220 transitions.
[2024-05-24 03:11:12] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:11:12] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:11:12] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-24 03:11:12] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:12] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:11:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4838599497082336465.gal : 1 ms
[2024-05-24 03:11:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality1736793720388701814.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/CTLCardinality4838599497082336465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1736793720388701814.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,328543,0.027515,4436,2,570,5,4577,6,0,250,3932,0


Converting to forward existential form...Done !
original formula: EF(EG((EF(((p106==0)&&(p1==1))) * (p63==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(E(TRUE U ((p106==0)&&(p1==1))) * (p63==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t13, t14, t16, t18, Intersection with reachabl...226
(forward)formula 0,1,0.254577,14732,1,0,132,59813,170,66,1820,45995,167
FORMULA HealthRecord-PT-10-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 65 transition count 129
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 65 transition count 129
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 106 place count 55 transition count 109
Iterating global reduction 0 with 10 rules applied. Total rules applied 116 place count 55 transition count 109
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 124 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 53 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 53 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 51 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 51 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 138 place count 51 transition count 85
Applied a total of 138 rules in 8 ms. Remains 51 /113 variables (removed 62) and now considering 85/220 (removed 135) transitions.
[2024-05-24 03:11:12] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 51 cols
[2024-05-24 03:11:12] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:11:12] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:11:12] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:11:12] [INFO ] Invariant cache hit.
[2024-05-24 03:11:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:12] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-24 03:11:13] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:11:13] [INFO ] Invariant cache hit.
[2024-05-24 03:11:13] [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, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:11:13] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:11:13] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/132 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 63 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1319 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 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/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:11:14] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:11:14] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 81/132 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 84/148 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/133 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 149 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
After SMT, in 3375ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3376ms
Starting structural reductions in LTL mode, iteration 1 : 51/113 places, 85/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3495 ms. Remains : 51/113 places, 85/220 transitions.
[2024-05-24 03:11:16] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:11:16] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:16] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-24 03:11:16] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:16] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality5115172027249663747.gal : 1 ms
[2024-05-24 03:11:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality14953341633533109227.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/CTLCardinality5115172027249663747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14953341633533109227.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,576648,0.059215,6104,2,1007,5,12095,6,0,285,9847,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(AG(((p126!=0)&&(p4!=1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(E(TRUE U !(((p126!=0)&&(p4!=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t40, t41, ...252
(forward)formula 0,0,0.294291,15080,1,0,145,55547,189,68,2155,44027,182
FORMULA HealthRecord-PT-10-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 64 transition count 127
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 64 transition count 127
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 55 transition count 109
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 55 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 122 place count 55 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 49 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 143 place count 49 transition count 79
Applied a total of 143 rules in 8 ms. Remains 49 /113 variables (removed 64) and now considering 79/220 (removed 141) transitions.
[2024-05-24 03:11:16] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 49 cols
[2024-05-24 03:11:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:11:16] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:11:16] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 03:11:16] [INFO ] Invariant cache hit.
[2024-05-24 03:11:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:16] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-24 03:11:16] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 03:11:16] [INFO ] Invariant cache hit.
[2024-05-24 03:11:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:11:17] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:11:17] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 75/124 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/125 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 61 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:11:18] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:11:18] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 75/124 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 78/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 141 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1877 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 4/4 constraints]
After SMT, in 3148ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3149ms
Starting structural reductions in LTL mode, iteration 1 : 49/113 places, 79/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3247 ms. Remains : 49/113 places, 79/220 transitions.
[2024-05-24 03:11:19] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:11:19] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:19] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 03:11:19] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:11:19] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:11:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality12571390851085283701.gal : 1 ms
[2024-05-24 03:11:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17382201157174894712.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/CTLCardinality12571390851085283701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17382201157174894712.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,404604,0.034714,4740,2,623,5,6159,6,0,271,5293,0


Converting to forward existential form...Done !
original formula: EX(EF(AG((p121==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !((p121==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t14, t16, t18, t20, Intersection with reachab...227
(forward)formula 0,0,0.122665,8700,1,0,130,25508,176,63,1959,18191,167
FORMULA HealthRecord-PT-10-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 67 transition count 133
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 67 transition count 133
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 101 place count 58 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 110 place count 58 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 58 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 55 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 55 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 52 transition count 94
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 136 place count 52 transition count 86
Applied a total of 136 rules in 8 ms. Remains 52 /113 variables (removed 61) and now considering 86/220 (removed 134) transitions.
[2024-05-24 03:11:20] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 52 cols
[2024-05-24 03:11:20] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:11:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 03:11:20] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:11:20] [INFO ] Invariant cache hit.
[2024-05-24 03:11:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:20] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-24 03:11:20] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:11:20] [INFO ] Invariant cache hit.
[2024-05-24 03:11:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:11:20] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:11:20] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/134 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:11:21] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:11:21] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/135 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:11:21] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/135 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 67 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2118 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:11:22] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:11:22] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 82/134 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 85/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 154 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2067 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 7/7 constraints]
After SMT, in 4202ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4203ms
Starting structural reductions in LTL mode, iteration 1 : 52/113 places, 86/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4312 ms. Remains : 52/113 places, 86/220 transitions.
[2024-05-24 03:11:24] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:24] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:11:24] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-24 03:11:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality18124029703396206971.gal : 5 ms
[2024-05-24 03:11:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality13836387253182661483.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/CTLCardinality18124029703396206971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13836387253182661483.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,673605,0.055339,6096,2,819,5,11640,6,0,290,11599,0


Converting to forward existential form...Done !
original formula: AG(((AF(!(A((p150==1) U (p65==1)))) + (p32==0)) + AX(((p68==0)||(p116==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((!(EG(!(!(!((E(!((p65==1)) U (!((p150==1)) * !((p65==1)))) + EG(!((p65==1))))))))) + (...203
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t15, t16, t18, t20, t22, t30, t31, t39, t40, t...272
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.77585,71936,1,0,314,427138,204,179,2146,442327,328
FORMULA HealthRecord-PT-10-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 66 transition count 131
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 66 transition count 131
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 58 transition count 115
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 58 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 58 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 55 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 55 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 52 transition count 94
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 137 place count 52 transition count 85
Applied a total of 137 rules in 9 ms. Remains 52 /113 variables (removed 61) and now considering 85/220 (removed 135) transitions.
[2024-05-24 03:11:26] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 52 cols
[2024-05-24 03:11:26] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:11:26] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:11:26] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:11:26] [INFO ] Invariant cache hit.
[2024-05-24 03:11:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:26] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-24 03:11:26] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:11:26] [INFO ] Invariant cache hit.
[2024-05-24 03:11:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:11:26] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:11:26] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/133 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 64 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1324 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:11:27] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 81/133 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 84/148 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 149 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2091 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
After SMT, in 3431ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3432ms
Starting structural reductions in LTL mode, iteration 1 : 52/113 places, 85/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3516 ms. Remains : 52/113 places, 85/220 transitions.
[2024-05-24 03:11:29] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:11:29] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:29] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-24 03:11:29] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:11:29] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality14596307044245049745.gal : 2 ms
[2024-05-24 03:11:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality16049967746713941244.ctl : 73 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/CTLCardinality14596307044245049745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16049967746713941244.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,544573,0.03385,5036,2,687,5,6643,6,0,289,5483,0


Converting to forward existential form...Done !
original formula: EX(AF((!(A((p101==1) U (p106==0))) + EF(((p154==0)&&(p143==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((!(!((E(!((p106==0)) U (!((p101==1)) * !((p106==0)))) + EG(!((p106==0)))))) + E(TRUE U ((p15...188
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t17, t19, t21, t23, t24, t25, t...262
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.05686,49356,1,0,270,273466,205,153,2168,279124,305
FORMULA HealthRecord-PT-10-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Graph (trivial) has 149 edges and 113 vertex of which 8 / 113 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 63 transition count 130
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 63 transition count 130
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 100 place count 54 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 109 place count 54 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 118 place count 54 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 52 transition count 97
Iterating global reduction 1 with 2 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 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 50 transition count 93
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 131 place count 50 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 50 transition count 86
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 2 with 2 rules applied. Total rules applied 135 place count 49 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 48 transition count 84
Applied a total of 136 rules in 27 ms. Remains 48 /113 variables (removed 65) and now considering 84/220 (removed 136) transitions.
[2024-05-24 03:11:30] [INFO ] Flow matrix only has 77 transitions (discarded 7 similar events)
// Phase 1: matrix 77 rows 48 cols
[2024-05-24 03:11:30] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:11:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 03:11:31] [INFO ] Flow matrix only has 77 transitions (discarded 7 similar events)
[2024-05-24 03:11:31] [INFO ] Invariant cache hit.
[2024-05-24 03:11:31] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-24 03:11:31] [INFO ] Redundant transitions in 14 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-24 03:11:31] [INFO ] Flow matrix only has 77 transitions (discarded 7 similar events)
[2024-05-24 03:11:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 8/48 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-24 03:11:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:11:31] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-24 03:11:31] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 76/124 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/125 variables, and 60 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 8/48 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-24 03:11:32] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 76/124 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 68/129 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/125 variables, and 129 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 4/4 constraints]
After SMT, in 2145ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2146ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/113 places, 84/220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2280 ms. Remains : 48/113 places, 84/220 transitions.
[2024-05-24 03:11:33] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:11:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:11:33] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-24 03:11:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:11:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:11:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6920853776742654453.gal : 0 ms
[2024-05-24 03:11:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality8804787457023700897.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/CTLCardinality6920853776742654453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8804787457023700897.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,265687,0.086415,7144,2,947,5,15763,6,0,265,15659,0


Converting to forward existential form...Done !
original formula: (!(A((AG((p11==0)) + AF((p129==1))) U (p106==0))) + AF((p130==1)))
=> equivalent forward existential formula: [FwdG((Init * !(!(!((E(!((p106==0)) U (!((!(E(TRUE U !((p11==0)))) + !(EG(!((p129==1)))))) * !((p106==0)))) + EG...197
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t17, t18, t20, t22, t38, t39...260
Hit Full ! (commute/partial/dont) 80/0/4
(forward)formula 0,0,1.58986,66680,1,0,300,398792,205,149,2061,351573,352
FORMULA HealthRecord-PT-10-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-24 03:11:34] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:11:34] [INFO ] Flatten gal took : 5 ms
Total runtime 114575 ms.

BK_STOP 1716520294984

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

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