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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 12 20:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 46K 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-01-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716518887242

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-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-24 02:48:08] [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 02:48:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:48:08] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-24 02:48:08] [INFO ] Transformed 117 places.
[2024-05-24 02:48:08] [INFO ] Transformed 218 transitions.
[2024-05-24 02:48:08] [INFO ] Found NUPN structural information;
[2024-05-24 02:48:08] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
Support contains 65 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 213/213 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 97 transition count 174
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 97 transition count 174
Applied a total of 40 rules in 19 ms. Remains 97 /117 variables (removed 20) and now considering 174/213 (removed 39) transitions.
[2024-05-24 02:48:08] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
// Phase 1: matrix 167 rows 97 cols
[2024-05-24 02:48:08] [INFO ] Computed 13 invariants in 10 ms
[2024-05-24 02:48:08] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-24 02:48:08] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
[2024-05-24 02:48:08] [INFO ] Invariant cache hit.
[2024-05-24 02:48:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:48:08] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-24 02:48:08] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
[2024-05-24 02:48:08] [INFO ] Invariant cache hit.
[2024-05-24 02:48:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-24 02:48:09] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 18 ms to minimize.
[2024-05-24 02:48:09] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-24 02:48:10] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-24 02:48:11] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-24 02:48:11] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-24 02:48:11] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:48:11] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:48:11] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-24 02:48:11] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 3 ms to minimize.
[2024-05-24 02:48:11] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:48:12] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-24 02:48:12] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2024-05-24 02:48:12] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:48:12] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-24 02:48:12] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-24 02:48:12] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-24 02:48:13] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:48:13] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-24 02:48:14] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 166/263 variables, 97/145 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-24 02:48:15] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 13 (OVERLAPS) 1/264 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 15 (OVERLAPS) 0/264 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 147 constraints, problems are : Problem set: 0 solved, 173 unsolved in 10284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 166/263 variables, 97/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 173/319 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-24 02:48:20] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:48:21] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 1/264 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-24 02:48:26] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/264 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-24 02:48:27] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 14 (OVERLAPS) 0/264 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 324 constraints, problems are : Problem set: 0 solved, 173 unsolved in 13069 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 40/40 constraints]
After SMT, in 23441ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 23461ms
Starting structural reductions in LTL mode, iteration 1 : 97/117 places, 174/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23802 ms. Remains : 97/117 places, 174/213 transitions.
Support contains 65 out of 97 places after structural reductions.
[2024-05-24 02:48:32] [INFO ] Flatten gal took : 35 ms
[2024-05-24 02:48:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HealthRecord-PT-01-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 02:48:32] [INFO ] Flatten gal took : 24 ms
[2024-05-24 02:48:32] [INFO ] Input system was already deterministic with 174 transitions.
Support contains 63 out of 97 places (down from 65) after GAL structural reductions.
RANDOM walk for 40000 steps (2102 resets) in 1575 ms. (25 steps per ms) remains 9/53 properties
BEST_FIRST walk for 40002 steps (324 resets) in 158 ms. (251 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (322 resets) in 47 ms. (833 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (326 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (314 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (332 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (320 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (330 resets) in 42 ms. (930 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (322 resets) in 91 ms. (434 steps per ms) remains 6/7 properties
[2024-05-24 02:48:33] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
[2024-05-24 02:48:33] [INFO ] Invariant cache hit.
[2024-05-24 02:48:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 57/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 31/97 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 02:48:33] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-24 02:48:33] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
Problem AtomicPropp26 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 166/263 variables, 97/112 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/264 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/264 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 113 constraints, problems are : Problem set: 1 solved, 5 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 57/65 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 02:48:34] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:48:34] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
Problem AtomicPropp34 is UNSAT
[2024-05-24 02:48:34] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-24 02:48:34] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:48:34] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 7 (OVERLAPS) 31/97 variables, 6/18 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 2/20 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 02:48:34] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:48:34] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:48:34] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 3/23 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 02:48:34] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 1/24 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 166/263 variables, 97/121 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 3/124 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/124 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/264 variables, 1/125 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 02:48:34] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 1/126 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 0/126 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/264 variables, 0/126 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 126 constraints, problems are : Problem set: 3 solved, 3 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 12/12 constraints]
After SMT, in 1069ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 2 properties in 35 ms.
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 174/174 transitions.
Graph (trivial) has 133 edges and 97 vertex of which 14 / 97 are part of one of the 7 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 333 edges and 90 vertex of which 84 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 84 transition count 147
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 19 place count 79 transition count 140
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 77 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 77 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 33 place count 70 transition count 135
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 63 place count 40 transition count 75
Iterating global reduction 3 with 30 rules applied. Total rules applied 93 place count 40 transition count 75
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 102 place count 31 transition count 57
Iterating global reduction 3 with 9 rules applied. Total rules applied 111 place count 31 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 115 place count 31 transition count 53
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 28 transition count 44
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 28 transition count 44
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 124 place count 25 transition count 38
Iterating global reduction 4 with 3 rules applied. Total rules applied 127 place count 25 transition count 38
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 130 place count 25 transition count 35
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 132 place count 24 transition count 34
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 140 place count 20 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 20 transition count 48
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 151 place count 20 transition count 48
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 159 place count 20 transition count 48
Applied a total of 159 rules in 58 ms. Remains 20 /97 variables (removed 77) and now considering 48/174 (removed 126) transitions.
Running 40 sub problems to find dead transitions.
[2024-05-24 02:48:34] [INFO ] Flow matrix only has 47 transitions (discarded 1 similar events)
// Phase 1: matrix 47 rows 20 cols
[2024-05-24 02:48:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 02:48:34] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (OVERLAPS) 47/67 variables, 20/24 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 12/36 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/67 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 36 constraints, problems are : Problem set: 9 solved, 31 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 2/19 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 3/4 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 47/67 variables, 20/24 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 12/36 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 31/67 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/67 variables, 0/67 constraints. Problems are: Problem set: 9 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 67 constraints, problems are : Problem set: 9 solved, 31 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 31/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1125ms problems are : Problem set: 9 solved, 31 unsolved
Search for dead transitions found 9 dead transitions in 1127ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/97 places, 39/174 transitions.
Graph (complete) has 62 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 19 transition count 39
Applied a total of 3 rules in 4 ms. Remains 19 /20 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1190 ms. Remains : 19/97 places, 39/174 transitions.
RANDOM walk for 34860 steps (11609 resets) in 241 ms. (144 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA HealthRecord-PT-01-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 02:48:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 02:48:36] [INFO ] Flatten gal took : 11 ms
FORMULA HealthRecord-PT-01-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 02:48:36] [INFO ] Flatten gal took : 14 ms
[2024-05-24 02:48:36] [INFO ] Input system was already deterministic with 174 transitions.
Support contains 54 out of 97 places (down from 57) after GAL structural reductions.
Computed a total of 9 stabilizing places and 16 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Graph (trivial) has 118 edges and 97 vertex of which 12 / 97 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 57 transition count 107
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 57 transition count 107
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 73 place count 51 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 79 place count 51 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 81 place count 51 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 48 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 48 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 46 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 46 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 46 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 46 transition count 75
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 98 place count 45 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 43 transition count 72
Applied a total of 100 rules in 38 ms. Remains 43 /97 variables (removed 54) and now considering 72/174 (removed 102) transitions.
[2024-05-24 02:48:36] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
// Phase 1: matrix 66 rows 43 cols
[2024-05-24 02:48:36] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 02:48:36] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 02:48:36] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
[2024-05-24 02:48:36] [INFO ] Invariant cache hit.
[2024-05-24 02:48:36] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-24 02:48:36] [INFO ] Redundant transitions in 0 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-24 02:48:36] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
[2024-05-24 02:48:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-24 02:48:36] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-24 02:48:36] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:48:36] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-24 02:48:36] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 65/108 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/109 variables, and 54 constraints, problems are : Problem set: 0 solved, 58 unsolved in 906 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-24 02:48:37] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 65/108 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 58/113 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/108 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/109 variables, and 113 constraints, problems are : Problem set: 0 solved, 58 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 5/5 constraints]
After SMT, in 1738ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1739ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/97 places, 72/174 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1871 ms. Remains : 43/97 places, 72/174 transitions.
[2024-05-24 02:48:38] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:48:38] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:48:38] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-24 02:48:38] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:48:38] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:48:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality6032034163482545795.gal : 6 ms
[2024-05-24 02:48:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality7828840935985293786.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6032034163482545795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7828840935985293786.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,24484,0.024685,4012,2,390,5,2388,6,0,233,2316,0


Converting to forward existential form...Done !
original formula: AG(AF((EG(EF(((p33==0)||(p77==1)))) * (((AG(((p18==0)||(p26==1))) + E((p76==1) U (p57==0))) + ((p27==0)||(p102==1))) + (p112==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EG(E(TRUE U ((p33==0)||(p77==1)))) * (((!(E(TRUE U !(((p18==0)||(p26==1))))) + E((p76==...220
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, t16, t17, t18, t19, t20...305
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.165516,11128,1,0,185,41860,179,97,1668,40016,212
FORMULA HealthRecord-PT-01-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 60 transition count 106
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 60 transition count 106
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 53 transition count 92
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 53 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 91 place count 53 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 52 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 52 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 51 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 51 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 51 transition count 83
Applied a total of 96 rules in 6 ms. Remains 51 /97 variables (removed 46) and now considering 83/174 (removed 91) transitions.
[2024-05-24 02:48:38] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
// Phase 1: matrix 82 rows 51 cols
[2024-05-24 02:48:38] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 02:48:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 02:48:38] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2024-05-24 02:48:38] [INFO ] Invariant cache hit.
[2024-05-24 02:48:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:48:38] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-24 02:48:38] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2024-05-24 02:48:38] [INFO ] Invariant cache hit.
[2024-05-24 02:48:38] [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, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:48:38] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:48:38] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-24 02:48:38] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-24 02:48:38] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-24 02:48:38] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:48:38] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:48:38] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:48:39] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 81/132 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:48:39] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/133 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 68 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:48:40] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 81/132 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 82/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/133 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 151 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 10/10 constraints]
After SMT, in 4048ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4049ms
Starting structural reductions in LTL mode, iteration 1 : 51/97 places, 83/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4134 ms. Remains : 51/97 places, 83/174 transitions.
[2024-05-24 02:48:42] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:48:42] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:48:42] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-24 02:48:42] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:48:42] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:48:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17013695065264554881.gal : 1 ms
[2024-05-24 02:48:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality13468205748027626783.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/CTLCardinality17013695065264554881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13468205748027626783.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,71046,0.019262,4160,2,594,5,2937,6,0,285,2640,0


Converting to forward existential form...Done !
original formula: AG((EF(!(E(((p46==0)||(p88==1)) U ((p46==0)||(p75==1))))) * (AX(((p75==0)||(p6==1))) + (p58==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(E(((p46==0)||(p88==1)) U ((p46==0)||(p75==1)))))))] = FALSE * [(EY((FwdU(Init,...212
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...352
(forward)formula 0,0,0.102586,8384,1,0,187,23378,193,87,1915,18588,193
FORMULA HealthRecord-PT-01-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 58 transition count 102
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 58 transition count 102
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 50 transition count 86
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 50 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 98 place count 50 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 49 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 49 transition count 79
Applied a total of 100 rules in 11 ms. Remains 49 /97 variables (removed 48) and now considering 79/174 (removed 95) transitions.
[2024-05-24 02:48:42] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
// Phase 1: matrix 78 rows 49 cols
[2024-05-24 02:48:42] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:48:42] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 02:48:42] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
[2024-05-24 02:48:42] [INFO ] Invariant cache hit.
[2024-05-24 02:48:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:48:42] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-24 02:48:42] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
[2024-05-24 02:48:42] [INFO ] Invariant cache hit.
[2024-05-24 02:48:42] [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, 7/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 02:48:42] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-24 02:48:42] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 77/126 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 59 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 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, 7/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 02:48:43] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-24 02:48:44] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-24 02:48:44] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-24 02:48:44] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-24 02:48:44] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-24 02:48:44] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 77/126 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 78/142 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 143 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1892 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 8/8 constraints]
After SMT, in 3091ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3092ms
Starting structural reductions in LTL mode, iteration 1 : 49/97 places, 79/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3210 ms. Remains : 49/97 places, 79/174 transitions.
[2024-05-24 02:48:45] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:48:45] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:48:45] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 02:48:45] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:48:45] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:48:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality14459384014770708916.gal : 1 ms
[2024-05-24 02:48:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality13773032861469352819.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/CTLCardinality14459384014770708916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13773032861469352819.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,57600,0.015975,3884,2,443,5,2214,6,0,273,1946,0


Converting to forward existential form...Done !
original formula: AG((EX(((p58==0)&&(p89==1))) + EF((p55==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U (p55==1)))) * !(EX(((p58==0)&&(p89==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, t17, t18, t19, t20, t21, t...312
(forward)formula 0,0,0.080792,7104,1,0,171,17650,178,81,1813,13743,184
FORMULA HealthRecord-PT-01-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 60 transition count 105
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 60 transition count 105
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 53 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 53 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 53 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 50 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 50 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 47 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 47 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 47 transition count 72
Applied a total of 104 rules in 5 ms. Remains 47 /97 variables (removed 50) and now considering 72/174 (removed 102) transitions.
[2024-05-24 02:48:45] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
// Phase 1: matrix 70 rows 47 cols
[2024-05-24 02:48:45] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 02:48:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 02:48:45] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
[2024-05-24 02:48:45] [INFO ] Invariant cache hit.
[2024-05-24 02:48:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:48:45] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-05-24 02:48:45] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
[2024-05-24 02:48:45] [INFO ] Invariant cache hit.
[2024-05-24 02:48:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-24 02:48:46] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:48:46] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-24 02:48:46] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 69/116 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 1/117 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/117 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 59 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-24 02:48:47] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-24 02:48:47] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:48:47] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 69/116 variables, 47/61 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 71/132 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 1/117 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 0/117 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 133 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1559 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 6/6 constraints]
After SMT, in 2787ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2793ms
Starting structural reductions in LTL mode, iteration 1 : 47/97 places, 72/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2880 ms. Remains : 47/97 places, 72/174 transitions.
[2024-05-24 02:48:48] [INFO ] Flatten gal took : 7 ms
[2024-05-24 02:48:48] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:48:48] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-24 02:48:48] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:48:48] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:48:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality4195821849086253377.gal : 5 ms
[2024-05-24 02:48:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality6621268697757407265.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/CTLCardinality4195821849086253377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6621268697757407265.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,55656,0.016089,3844,2,452,5,2209,6,0,255,2156,0


Converting to forward existential form...Done !
original formula: (EX(EX(AG(((p12==0)||(p49==1))))) + AG(((AF(((p51==0)&&(p71==1))) * (p49==0)) * (p40==1))))
=> equivalent forward existential formula: (([FwdG(FwdU((Init * !(EX(EX(!(E(TRUE U !(((p12==0)||(p49==1))))))))),TRUE),!(((p51==0)&&(p71==1))))] = FALSE * ...346
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t19, t21, t22, t23, t24, t...282
(forward)formula 0,1,0.098431,8384,1,0,157,22994,177,73,1749,21441,173
FORMULA HealthRecord-PT-01-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 65 transition count 115
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 65 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 59 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 59 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 59 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 56 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 56 transition count 92
Applied a total of 84 rules in 8 ms. Remains 56 /97 variables (removed 41) and now considering 92/174 (removed 82) transitions.
[2024-05-24 02:48:48] [INFO ] Flow matrix only has 90 transitions (discarded 2 similar events)
// Phase 1: matrix 90 rows 56 cols
[2024-05-24 02:48:48] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 02:48:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 02:48:48] [INFO ] Flow matrix only has 90 transitions (discarded 2 similar events)
[2024-05-24 02:48:48] [INFO ] Invariant cache hit.
[2024-05-24 02:48:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:48:48] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 02:48:48] [INFO ] Flow matrix only has 90 transitions (discarded 2 similar events)
[2024-05-24 02:48:48] [INFO ] Invariant cache hit.
[2024-05-24 02:48:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:48:49] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:48:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:48:49] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 89/145 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:48:49] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:48:50] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:48:50] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 1/146 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 71 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:48:51] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:48:51] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:48:51] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:48:51] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 89/145 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 91/165 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 1/146 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/146 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 166 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2642 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 10/10 constraints]
After SMT, in 4804ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4805ms
Starting structural reductions in LTL mode, iteration 1 : 56/97 places, 92/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4882 ms. Remains : 56/97 places, 92/174 transitions.
[2024-05-24 02:48:53] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:48:53] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:48:53] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 02:48:53] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:48:53] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:48:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality12254654944241485993.gal : 1 ms
[2024-05-24 02:48:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality14134724259687222269.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/CTLCardinality12254654944241485993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14134724259687222269.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,107901,0.02017,4200,2,617,5,3069,6,0,311,2576,0


Converting to forward existential form...Done !
original formula: !(E((p57==0) U E(AX(AF((p98==1))) U ((((EF((p73==1)) * AG(((p112==0)||(p27==1)))) + (((p30==0)||(p23==1))&&(p81==1))) + AG((p101==1))) * ...217
=> equivalent forward existential formula: (([(EY((FwdU(FwdU(Init,(p57==0)),!(EX(!(!(EG(!((p98==1)))))))) * (((E(TRUE U (p73==1)) * !(E(TRUE U !(((p112==0)...704
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...352
Hit Full ! (commute/partial/dont) 89/0/3
(forward)formula 0,0,0.538285,29636,1,0,336,168659,227,162,2200,130870,380
FORMULA HealthRecord-PT-01-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Graph (trivial) has 132 edges and 97 vertex of which 14 / 97 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 53 transition count 100
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 53 transition count 100
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 82 place count 44 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 91 place count 44 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 95 place count 44 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 41 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 41 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 38 transition count 63
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 38 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 38 transition count 60
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 114 place count 38 transition count 56
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 116 place count 37 transition count 55
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 34 transition count 52
Applied a total of 119 rules in 14 ms. Remains 34 /97 variables (removed 63) and now considering 52/174 (removed 122) transitions.
[2024-05-24 02:48:54] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
// Phase 1: matrix 45 rows 34 cols
[2024-05-24 02:48:54] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:48:54] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 02:48:54] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2024-05-24 02:48:54] [INFO ] Invariant cache hit.
[2024-05-24 02:48:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-24 02:48:54] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-24 02:48:54] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2024-05-24 02:48:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-24 02:48:54] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-05-24 02:48:54] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-24 02:48:54] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-24 02:48:54] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 44/78 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/79 variables, and 45 constraints, problems are : Problem set: 0 solved, 38 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-24 02:48:54] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 44/78 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 38/84 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/79 variables, and 84 constraints, problems are : Problem set: 0 solved, 38 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 5/5 constraints]
After SMT, in 948ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 948ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/97 places, 52/174 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1038 ms. Remains : 34/97 places, 52/174 transitions.
[2024-05-24 02:48:55] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:48:55] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:48:55] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-24 02:48:55] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:48:55] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:48:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality4426103182636892820.gal : 5 ms
[2024-05-24 02:48:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality4811215780793874891.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/CTLCardinality4426103182636892820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4811215780793874891.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,7492,0.010598,3676,2,291,5,1351,6,0,176,1283,0


Converting to forward existential form...Done !
original formula: EF(AG((p50==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p50==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t17, t32, t33, t35, In...250
(forward)formula 0,1,0.041015,5312,1,0,110,9473,118,49,1158,7089,109
FORMULA HealthRecord-PT-01-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 58 transition count 101
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 58 transition count 101
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 87 place count 49 transition count 83
Iterating global reduction 0 with 9 rules applied. Total rules applied 96 place count 49 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 100 place count 49 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 47 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 47 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 45 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 45 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 110 place count 45 transition count 67
Applied a total of 110 rules in 4 ms. Remains 45 /97 variables (removed 52) and now considering 67/174 (removed 107) transitions.
[2024-05-24 02:48:55] [INFO ] Flow matrix only has 65 transitions (discarded 2 similar events)
// Phase 1: matrix 65 rows 45 cols
[2024-05-24 02:48:55] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 02:48:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 02:48:55] [INFO ] Flow matrix only has 65 transitions (discarded 2 similar events)
[2024-05-24 02:48:55] [INFO ] Invariant cache hit.
[2024-05-24 02:48:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:48:55] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-24 02:48:55] [INFO ] Flow matrix only has 65 transitions (discarded 2 similar events)
[2024-05-24 02:48:55] [INFO ] Invariant cache hit.
[2024-05-24 02:48:55] [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, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-24 02:48:55] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-24 02:48:55] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:48:55] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-24 02:48:55] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 64/109 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/110 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 58 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 64/109 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 66/123 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/110 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 124 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1084 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
After SMT, in 2328ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2329ms
Starting structural reductions in LTL mode, iteration 1 : 45/97 places, 67/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2398 ms. Remains : 45/97 places, 67/174 transitions.
[2024-05-24 02:48:57] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:48:57] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:48:57] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-24 02:48:57] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:48:57] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:48:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality302565301255075777.gal : 3 ms
[2024-05-24 02:48:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality12509929769335412937.ctl : 7 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/CTLCardinality302565301255075777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12509929769335412937.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,40104,0.014701,3812,2,380,5,1963,6,0,242,1850,0


Converting to forward existential form...Done !
original formula: EF(AX(EX(((p8==0)&&(p35==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(((p8==0)&&(p35==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, t34, t35, ...252
(forward)formula 0,1,0.054422,5976,1,0,120,10980,147,62,1546,9624,142
FORMULA HealthRecord-PT-01-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 62 transition count 110
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 62 transition count 110
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 55 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 55 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 86 place count 55 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 52 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 52 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 49 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 49 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 100 place count 49 transition count 77
Applied a total of 100 rules in 8 ms. Remains 49 /97 variables (removed 48) and now considering 77/174 (removed 97) transitions.
[2024-05-24 02:48:57] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
// Phase 1: matrix 76 rows 49 cols
[2024-05-24 02:48:57] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:48:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 02:48:57] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
[2024-05-24 02:48:57] [INFO ] Invariant cache hit.
[2024-05-24 02:48:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:48:57] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-24 02:48:57] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
[2024-05-24 02:48:57] [INFO ] Invariant cache hit.
[2024-05-24 02:48:57] [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, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:48:58] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-24 02:48:58] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-24 02:48:58] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 75/124 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:48:58] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 1/125 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 61 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1537 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:48:59] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:48:59] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 75/124 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 76/138 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/125 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 139 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1877 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints]
After SMT, in 3430ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3430ms
Starting structural reductions in LTL mode, iteration 1 : 49/97 places, 77/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3508 ms. Remains : 49/97 places, 77/174 transitions.
[2024-05-24 02:49:01] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:49:01] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:49:01] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-24 02:49:01] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:49:01] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:49:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality12371339262093625872.gal : 0 ms
[2024-05-24 02:49:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality349389401388696717.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/CTLCardinality12371339262093625872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality349389401388696717.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,73234,0.017764,4176,2,569,5,2646,6,0,271,2606,0


Converting to forward existential form...Done !
original formula: EX((E(AF(AG(((p81==0)||(p39==1)))) U ((AX(((p28==0)&&((p46==0)||(p81==1)))) + (p69==0)) + (p101==1))) * AX(AG(((p67==0)||(p13==1))))))
=> equivalent forward existential formula: [((EY(Init) * E(!(EG(!(!(E(TRUE U !(((p81==0)||(p39==1)))))))) U ((!(EX(!(((p28==0)&&((p46==0)||(p81==1)))))) + ...239
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...297
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.166919,11304,1,0,213,40874,191,113,1874,39053,259
FORMULA HealthRecord-PT-01-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 60 transition count 105
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 60 transition count 105
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 55 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 55 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 55 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 53 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 53 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 51 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 51 transition count 84
Applied a total of 93 rules in 7 ms. Remains 51 /97 variables (removed 46) and now considering 84/174 (removed 90) transitions.
[2024-05-24 02:49:01] [INFO ] Flow matrix only has 82 transitions (discarded 2 similar events)
// Phase 1: matrix 82 rows 51 cols
[2024-05-24 02:49:01] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 02:49:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 02:49:01] [INFO ] Flow matrix only has 82 transitions (discarded 2 similar events)
[2024-05-24 02:49:01] [INFO ] Invariant cache hit.
[2024-05-24 02:49:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:49:01] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-24 02:49:01] [INFO ] Flow matrix only has 82 transitions (discarded 2 similar events)
[2024-05-24 02:49:01] [INFO ] Invariant cache hit.
[2024-05-24 02:49:01] [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, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 02:49:01] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-24 02:49:01] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 81/132 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 02:49:02] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 1/133 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 63 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 02:49:03] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:49:03] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:49:03] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 81/132 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 83/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 1/133 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 149 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 6/6 constraints]
After SMT, in 3733ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3734ms
Starting structural reductions in LTL mode, iteration 1 : 51/97 places, 84/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3819 ms. Remains : 51/97 places, 84/174 transitions.
[2024-05-24 02:49:05] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:49:05] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:49:05] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-24 02:49:05] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:49:05] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:49:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality17210253763845715061.gal : 1 ms
[2024-05-24 02:49:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality17551396698865981699.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/CTLCardinality17210253763845715061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17551396698865981699.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,66591,0.020702,4168,2,619,5,3060,6,0,284,2589,0


Converting to forward existential form...Done !
original formula: AX((A((E(EX(TRUE) U (p11==0)) * !(((p82!=0)||((p52==0)&&(p76==1))))) U A(EG((p104==1)) U EF((p47==1)))) + AF(((p102==0)&&(p13==1)))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(!((E(!(!((E(!(E(TRUE U (p47==1))) U (!(EG((p104==1))) * !(E(TRUE U (p47==1))))) + EG(!(E(TRU...503
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...322
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.66281,32884,1,0,383,180815,213,229,2041,181239,412
FORMULA HealthRecord-PT-01-CTLCardinality-2024-11 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 : 97/97 places, 174/174 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 57 transition count 100
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 57 transition count 100
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 48 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 48 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 48 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 45 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 45 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 42 transition count 63
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 42 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 117 place count 42 transition count 60
Applied a total of 117 rules in 3 ms. Remains 42 /97 variables (removed 55) and now considering 60/174 (removed 114) transitions.
[2024-05-24 02:49:06] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
// Phase 1: matrix 59 rows 42 cols
[2024-05-24 02:49:06] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:49:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 02:49:06] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-24 02:49:06] [INFO ] Invariant cache hit.
[2024-05-24 02:49:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:49:06] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-24 02:49:06] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-24 02:49:06] [INFO ] Invariant cache hit.
[2024-05-24 02:49:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-24 02:49:06] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-24 02:49:06] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/100 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 1/101 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 52 constraints, problems are : Problem set: 0 solved, 59 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-24 02:49:07] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-24 02:49:07] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-24 02:49:07] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 58/100 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 59/113 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 1/101 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 114 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1320 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 5/5 constraints]
After SMT, in 2172ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2172ms
Starting structural reductions in LTL mode, iteration 1 : 42/97 places, 60/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2247 ms. Remains : 42/97 places, 60/174 transitions.
[2024-05-24 02:49:08] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:49:08] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:49:08] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-24 02:49:08] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:49:08] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:49:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7221144302127954242.gal : 1 ms
[2024-05-24 02:49:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality7336324117508089309.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/CTLCardinality7221144302127954242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7336324117508089309.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,35730,0.015305,4064,2,450,5,2453,6,0,226,2375,0


Converting to forward existential form...Done !
original formula: EF((AX(FALSE) + EF(EX(((p14==1)||(p0==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE + [(EY(FwdU(FwdU(Init,TRUE),TRUE)) * ((p14==1)||(p0==1)))] != FA...159
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t31, t32, t33, t34, Inter...247
(forward)formula 0,1,0.053636,5912,1,0,109,10955,133,54,1412,10077,124
FORMULA HealthRecord-PT-01-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 64 transition count 113
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 64 transition count 113
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 59 transition count 103
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 59 transition count 103
Applied a total of 76 rules in 4 ms. Remains 59 /97 variables (removed 38) and now considering 103/174 (removed 71) transitions.
[2024-05-24 02:49:08] [INFO ] Flow matrix only has 101 transitions (discarded 2 similar events)
// Phase 1: matrix 101 rows 59 cols
[2024-05-24 02:49:08] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 02:49:08] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 02:49:08] [INFO ] Flow matrix only has 101 transitions (discarded 2 similar events)
[2024-05-24 02:49:08] [INFO ] Invariant cache hit.
[2024-05-24 02:49:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:49:08] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 02:49:08] [INFO ] Flow matrix only has 101 transitions (discarded 2 similar events)
[2024-05-24 02:49:08] [INFO ] Invariant cache hit.
[2024-05-24 02:49:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 02:49:08] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:49:09] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-24 02:49:09] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:49:09] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 02:49:09] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 100/159 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 73 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 02:49:11] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 100/159 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 102/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/160 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/160 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 176 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 6/6 constraints]
After SMT, in 4894ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 4895ms
Starting structural reductions in LTL mode, iteration 1 : 59/97 places, 103/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4991 ms. Remains : 59/97 places, 103/174 transitions.
[2024-05-24 02:49:13] [INFO ] Flatten gal took : 9 ms
[2024-05-24 02:49:13] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:49:13] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-24 02:49:13] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:49:13] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:49:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality4182771386745835901.gal : 1 ms
[2024-05-24 02:49:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality16550016171210666325.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/CTLCardinality4182771386745835901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16550016171210666325.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,83844,0.027767,4552,2,868,5,4871,6,0,334,4202,0


Converting to forward existential form...Done !
original formula: E(((p0==0)||(p3==1)) U (!(AG((AX((p9==0)) * ((p78==1) + EX((p35==0)))))) * (EG(E(AF(((p2==0)||(p92==1))) U (((p83==0)||(p81==1))&&(p15==0...178
=> equivalent forward existential formula: ([FwdG((FwdU(Init,((p0==0)||(p3==1))) * !(!(E(TRUE U !((!(EX(!((p9==0)))) * ((p78==1) + EX((p35==0))))))))),E(!(...374
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...383
Hit Full ! (commute/partial/dont) 99/0/4
(forward)formula 0,1,0.28707,16420,1,0,252,69265,248,126,2394,58164,300
FORMULA HealthRecord-PT-01-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Graph (trivial) has 129 edges and 97 vertex of which 14 / 97 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 35 place count 55 transition count 103
Iterating global reduction 0 with 34 rules applied. Total rules applied 69 place count 55 transition count 103
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 78 place count 46 transition count 85
Iterating global reduction 0 with 9 rules applied. Total rules applied 87 place count 46 transition count 85
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 92 place count 46 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 43 transition count 71
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 43 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 41 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 41 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 41 transition count 65
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 108 place count 41 transition count 61
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 110 place count 40 transition count 60
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 37 transition count 57
Applied a total of 113 rules in 11 ms. Remains 37 /97 variables (removed 60) and now considering 57/174 (removed 117) transitions.
[2024-05-24 02:49:13] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
// Phase 1: matrix 49 rows 37 cols
[2024-05-24 02:49:13] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 02:49:13] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 02:49:13] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
[2024-05-24 02:49:13] [INFO ] Invariant cache hit.
[2024-05-24 02:49:13] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-24 02:49:13] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-24 02:49:13] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
[2024-05-24 02:49:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-24 02:49:13] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2024-05-24 02:49:14] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-24 02:49:14] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-24 02:49:14] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-24 02:49:14] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-24 02:49:14] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 5/37 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 48/85 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/85 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/86 variables, and 51 constraints, problems are : Problem set: 0 solved, 43 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 5/37 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-24 02:49:14] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 48/85 variables, 37/52 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 43/95 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/85 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/86 variables, and 95 constraints, problems are : Problem set: 0 solved, 43 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 7/7 constraints]
After SMT, in 1241ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1242ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/97 places, 57/174 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1336 ms. Remains : 37/97 places, 57/174 transitions.
[2024-05-24 02:49:15] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:49:15] [INFO ] Flatten gal took : 1 ms
[2024-05-24 02:49:15] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-24 02:49:15] [INFO ] Flatten gal took : 1 ms
[2024-05-24 02:49:15] [INFO ] Flatten gal took : 1 ms
[2024-05-24 02:49:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality6167961666774056714.gal : 1 ms
[2024-05-24 02:49:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality10933780831076619240.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/CTLCardinality6167961666774056714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10933780831076619240.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,9652,0.013064,3708,2,307,5,1699,6,0,190,1570,0


Converting to forward existential form...Done !
original formula: E((p57!=1) U !(EF(((p64==0)||(p20==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(p57!=1)) * !(E(TRUE U ((p64==0)||(p20==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...275
(forward)formula 0,0,0.044833,5344,1,0,123,9921,126,51,1257,7932,118
FORMULA HealthRecord-PT-01-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 174/174 transitions.
Graph (trivial) has 133 edges and 97 vertex of which 14 / 97 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 53 transition count 99
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 53 transition count 99
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 83 place count 43 transition count 79
Iterating global reduction 0 with 10 rules applied. Total rules applied 93 place count 43 transition count 79
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 98 place count 43 transition count 74
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 40 transition count 65
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 40 transition count 65
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 37 transition count 59
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 37 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 113 place count 37 transition count 56
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 117 place count 37 transition count 52
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 119 place count 36 transition count 51
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 33 transition count 48
Applied a total of 122 rules in 14 ms. Remains 33 /97 variables (removed 64) and now considering 48/174 (removed 126) transitions.
[2024-05-24 02:49:15] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 33 cols
[2024-05-24 02:49:15] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 02:49:15] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 02:49:15] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2024-05-24 02:49:15] [INFO ] Invariant cache hit.
[2024-05-24 02:49:15] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-24 02:49:15] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2024-05-24 02:49:15] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2024-05-24 02:49:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 2/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 02:49:15] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-24 02:49:15] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-24 02:49:15] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 5/33 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 39/72 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/73 variables, and 44 constraints, problems are : Problem set: 0 solved, 34 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 2/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 02:49:15] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-24 02:49:15] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 5/33 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 39/72 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 34/80 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/73 variables, and 80 constraints, problems are : Problem set: 0 solved, 34 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 5/5 constraints]
After SMT, in 974ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 977ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/97 places, 48/174 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1065 ms. Remains : 33/97 places, 48/174 transitions.
[2024-05-24 02:49:16] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:49:16] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:49:16] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-24 02:49:16] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:49:16] [INFO ] Flatten gal took : 1 ms
[2024-05-24 02:49:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality16650992013680747210.gal : 1 ms
[2024-05-24 02:49:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality12742951319660342176.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/CTLCardinality16650992013680747210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12742951319660342176.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,5908,0.008921,3640,2,247,5,1106,6,0,166,990,0


Converting to forward existential form...Done !
original formula: AG(AF(EG((p74==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG((p74==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, Intersection with reachable at e...220
(forward)formula 0,0,0.115659,9500,1,0,173,36692,113,97,1080,35395,216
FORMULA HealthRecord-PT-01-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-24 02:49:16] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:49:16] [INFO ] Flatten gal took : 5 ms
Total runtime 68018 ms.

BK_STOP 1716518956455

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

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