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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K 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-13-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716520666183

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-24 03:17:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:17:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:17:47] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-24 03:17:47] [INFO ] Transformed 161 places.
[2024-05-24 03:17:47] [INFO ] Transformed 341 transitions.
[2024-05-24 03:17:47] [INFO ] Found NUPN structural information;
[2024-05-24 03:17:47] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-13-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 102 transition count 198
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 102 transition count 198
Applied a total of 118 rules in 25 ms. Remains 102 /161 variables (removed 59) and now considering 198/313 (removed 115) transitions.
[2024-05-24 03:17:47] [INFO ] Flow matrix only has 189 transitions (discarded 9 similar events)
// Phase 1: matrix 189 rows 102 cols
[2024-05-24 03:17:47] [INFO ] Computed 15 invariants in 10 ms
[2024-05-24 03:17:47] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-24 03:17:47] [INFO ] Flow matrix only has 189 transitions (discarded 9 similar events)
[2024-05-24 03:17:47] [INFO ] Invariant cache hit.
[2024-05-24 03:17:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:48] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-24 03:17:48] [INFO ] Flow matrix only has 189 transitions (discarded 9 similar events)
[2024-05-24 03:17:48] [INFO ] Invariant cache hit.
[2024-05-24 03:17:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 12 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:17:49] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:17:50] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-24 03:17:51] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:17:52] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 4 ms to minimize.
[2024-05-24 03:17:52] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:17:52] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:17:52] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:17:52] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:17:52] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:17:52] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-24 03:17:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:17:52] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-24 03:17:53] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-24 03:17:54] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:17:54] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:17:54] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:17:54] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:17:54] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:17:55] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (OVERLAPS) 188/290 variables, 102/169 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (OVERLAPS) 1/291 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 14 (OVERLAPS) 0/291 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 170 constraints, problems are : Problem set: 0 solved, 197 unsolved in 11722 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 188/290 variables, 102/169 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 197/366 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-24 03:18:01] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:18:02] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (OVERLAPS) 1/291 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-24 03:18:08] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (OVERLAPS) 0/291 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 370 constraints, problems are : Problem set: 0 solved, 197 unsolved in 18360 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 55/55 constraints]
After SMT, in 30237ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 30271ms
Starting structural reductions in LTL mode, iteration 1 : 102/161 places, 198/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30677 ms. Remains : 102/161 places, 198/313 transitions.
Support contains 60 out of 102 places after structural reductions.
[2024-05-24 03:18:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 03:18:18] [INFO ] Flatten gal took : 49 ms
FORMULA HealthRecord-PT-13-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:18:18] [INFO ] Flatten gal took : 17 ms
[2024-05-24 03:18:18] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 56 out of 102 places (down from 60) after GAL structural reductions.
RANDOM walk for 40000 steps (3104 resets) in 2036 ms. (19 steps per ms) remains 19/37 properties
BEST_FIRST walk for 4003 steps (38 resets) in 63 ms. (62 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (43 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (40 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (37 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (43 resets) in 32 ms. (121 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (45 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (41 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (42 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (42 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (40 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (44 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (41 resets) in 9 ms. (400 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (44 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (41 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (42 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (43 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
[2024-05-24 03:18:19] [INFO ] Flow matrix only has 189 transitions (discarded 9 similar events)
[2024-05-24 03:18:19] [INFO ] Invariant cache hit.
[2024-05-24 03:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp24 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 37/65 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 37/102 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-24 03:18:19] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:18:19] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 10 ms to minimize.
[2024-05-24 03:18:19] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:18:19] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:18:19] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:18:19] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:18:19] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 10/25 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/29 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
Problem AtomicPropp23 is UNSAT
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 4/33 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 3/36 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 188/290 variables, 102/138 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:18:20] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 2/140 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 1/291 variables, 1/141 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 2 solved, 15 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 2 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 40/63 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-05-24 03:18:21] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:18:21] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:18:21] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:18:21] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 4/15 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 39/102 variables, 8/23 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 19/42 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-05-24 03:18:21] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:18:21] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:18:21] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:18:21] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:18:21] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:18:22] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 6/48 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 188/290 variables, 102/150 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 15/165 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 1/291 variables, 1/166 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/166 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-05-24 03:18:22] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/291 variables, 1/167 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/291 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 167 constraints, problems are : Problem set: 2 solved, 15 unsolved in 1498 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/17 constraints, Known Traps: 34/34 constraints]
After SMT, in 3491ms problems are : Problem set: 2 solved, 15 unsolved
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 11 properties in 1345 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 198/198 transitions.
Graph (trivial) has 124 edges and 102 vertex of which 8 / 102 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 446 edges and 98 vertex of which 94 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 178
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 92 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 92 transition count 175
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 10 place count 91 transition count 175
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 41 place count 60 transition count 114
Iterating global reduction 2 with 31 rules applied. Total rules applied 72 place count 60 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 60 transition count 113
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 81 place count 52 transition count 97
Iterating global reduction 3 with 8 rules applied. Total rules applied 89 place count 52 transition count 97
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 98 place count 52 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 50 transition count 82
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 50 transition count 82
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 48 transition count 78
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 48 transition count 78
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 112 place count 48 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 116 place count 46 transition count 70
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 128 place count 40 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 40 transition count 107
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 40 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 131 place count 39 transition count 106
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 142 place count 39 transition count 106
Applied a total of 142 rules in 82 ms. Remains 39 /102 variables (removed 63) and now considering 106/198 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 39/102 places, 106/198 transitions.
RANDOM walk for 384 steps (31 resets) in 20 ms. (18 steps per ms) remains 0/4 properties
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA HealthRecord-PT-13-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:18:24] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:18:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HealthRecord-PT-13-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:18:24] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:18:24] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 43 out of 102 places (down from 47) after GAL structural reductions.
Computed a total of 8 stabilizing places and 12 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 65 transition count 128
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 65 transition count 128
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 57 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 57 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 99 place count 57 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 54 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 54 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 51 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 51 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 120 place count 51 transition count 79
Applied a total of 120 rules in 6 ms. Remains 51 /102 variables (removed 51) and now considering 79/198 (removed 119) transitions.
[2024-05-24 03:18:24] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 51 cols
[2024-05-24 03:18:24] [INFO ] Computed 11 invariants in 5 ms
[2024-05-24 03:18:24] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 03:18:24] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2024-05-24 03:18:24] [INFO ] Invariant cache hit.
[2024-05-24 03:18:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:24] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-24 03:18:24] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2024-05-24 03:18:24] [INFO ] Invariant cache hit.
[2024-05-24 03:18:24] [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, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:18:24] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:18:24] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:18:24] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 73/124 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/125 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 66 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1428 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 73/124 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 78/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 144 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1636 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints]
After SMT, in 3086ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3087ms
Starting structural reductions in LTL mode, iteration 1 : 51/102 places, 79/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3188 ms. Remains : 51/102 places, 79/198 transitions.
[2024-05-24 03:18:27] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:18:27] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:18:27] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 03:18:27] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:18:27] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:18:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality15434742514072422281.gal : 2 ms
[2024-05-24 03:18:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality10731952723191865427.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/CTLCardinality15434742514072422281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10731952723191865427.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,484794,0.078265,6516,2,1233,5,14464,6,0,273,12501,0


Converting to forward existential form...Done !
original formula: A(!(AF((p70==1))) U EF(EX(EG((p40!=0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U EX(EG((p40!=0)))))))) * !(E(!(E(TRUE U EX(EG((p40!=0))))) U (!(!(!(EG(!((p70==1)))))) ...200
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, Intersection with reachab...227
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.10119,102856,1,0,395,596697,191,234,2099,564714,473
FORMULA HealthRecord-PT-13-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Graph (trivial) has 123 edges and 102 vertex of which 8 / 102 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 61 transition count 127
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 61 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 74 place count 61 transition count 126
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 54 transition count 112
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 54 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 94 place count 54 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 53 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 53 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 52 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 52 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 52 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 52 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 51 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 50 transition count 94
Applied a total of 106 rules in 30 ms. Remains 50 /102 variables (removed 52) and now considering 94/198 (removed 104) transitions.
[2024-05-24 03:18:30] [INFO ] Flow matrix only has 88 transitions (discarded 6 similar events)
// Phase 1: matrix 88 rows 50 cols
[2024-05-24 03:18:30] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:18:30] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-24 03:18:30] [INFO ] Flow matrix only has 88 transitions (discarded 6 similar events)
[2024-05-24 03:18:30] [INFO ] Invariant cache hit.
[2024-05-24 03:18:30] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-24 03:18:30] [INFO ] Redundant transitions in 16 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-24 03:18:30] [INFO ] Flow matrix only has 88 transitions (discarded 6 similar events)
[2024-05-24 03:18:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 7/50 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:18:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:18:31] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 87/137 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/138 variables, and 61 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 7/50 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:18:32] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:18:32] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:18:32] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:18:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 87/137 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 80/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/138 variables, and 145 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1929 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints]
After SMT, in 3058ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3060ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/102 places, 94/198 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3208 ms. Remains : 50/102 places, 94/198 transitions.
[2024-05-24 03:18:34] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:18:34] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:18:34] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-24 03:18:34] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:18:34] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:18:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality16463333951183757423.gal : 2 ms
[2024-05-24 03:18:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality486075217820955709.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/CTLCardinality16463333951183757423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality486075217820955709.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,555016,0.252268,13288,2,2011,5,38822,6,0,284,41224,0


Converting to forward existential form...Done !
original formula: (AF(EG(EF(!(E((p88==0) U ((p82==0)||(p8==1))))))) * AG(((p140==0)||(p124==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(EG(E(TRUE U !(E((p88==0) U ((p82==0)||(p8==1))))))))] = FALSE * [(FwdU(Init,TRUE) * !(((p140==0)||...177
(forward)formula 0,0,0.253883,13552,1,0,8,38822,9,2,295,41224,1
FORMULA HealthRecord-PT-13-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 74 transition count 147
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 74 transition count 147
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 68 transition count 135
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 68 transition count 135
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 68 transition count 127
Applied a total of 76 rules in 10 ms. Remains 68 /102 variables (removed 34) and now considering 127/198 (removed 71) transitions.
[2024-05-24 03:18:34] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
// Phase 1: matrix 123 rows 68 cols
[2024-05-24 03:18:34] [INFO ] Computed 10 invariants in 5 ms
[2024-05-24 03:18:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-24 03:18:34] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
[2024-05-24 03:18:34] [INFO ] Invariant cache hit.
[2024-05-24 03:18:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:34] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-24 03:18:34] [INFO ] Flow matrix only has 123 transitions (discarded 4 similar events)
[2024-05-24 03:18:34] [INFO ] Invariant cache hit.
[2024-05-24 03:18:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:18:34] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:18:34] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:18:35] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:18:35] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:18:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:18:35] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:18:35] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 122/190 variables, 68/85 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 1/191 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 86 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3258 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:18:38] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:18:38] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:18:38] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:18:38] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 122/190 variables, 68/89 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 126/215 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 1/191 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 216 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4855 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 11/11 constraints]
After SMT, in 8156ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 8157ms
Starting structural reductions in LTL mode, iteration 1 : 68/102 places, 127/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8295 ms. Remains : 68/102 places, 127/198 transitions.
[2024-05-24 03:18:42] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:18:42] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:18:42] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-24 03:18:42] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:18:42] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:18:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality7038632997788846367.gal : 3 ms
[2024-05-24 03:18:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality2673642188250964606.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/CTLCardinality7038632997788846367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2673642188250964606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75174e+06,1.13087,38512,2,7552,5,133612,6,0,392,171982,0


Converting to forward existential form...Done !
original formula: (E(EG(((p125==0)||(p127==1))) U !((!((AX(((p90==0)||(p46==1))) * (((p134==0)||(p71==0))||((p9==1)||(p45==1))))) + EG(((EG((p102==1)) * (p...194
=> equivalent forward existential formula: ([(Init * !(E(EG(((p125==0)||(p127==1))) U !((!((!(EX(!(((p90==0)||(p46==1))))) * (((p134==0)||(p71==0))||((p9==...276
(forward)formula 0,0,1.14064,38512,1,0,8,133612,9,2,397,171982,1
FORMULA HealthRecord-PT-13-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 64 transition count 128
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 64 transition count 128
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 57 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 57 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 96 place count 57 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 54 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 54 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 51 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 51 transition count 93
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 117 place count 51 transition count 84
Applied a total of 117 rules in 4 ms. Remains 51 /102 variables (removed 51) and now considering 84/198 (removed 114) transitions.
[2024-05-24 03:18:43] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 51 cols
[2024-05-24 03:18:43] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:18:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:18:43] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2024-05-24 03:18:43] [INFO ] Invariant cache hit.
[2024-05-24 03:18:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-24 03:18:43] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2024-05-24 03:18:43] [INFO ] Invariant cache hit.
[2024-05-24 03:18:43] [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, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 03:18:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:18:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:18:44] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:18:44] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:18:44] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 80/131 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 66 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1541 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 5/5 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, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 03:18:45] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:18:45] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:18:45] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 80/131 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 83/151 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 152 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2313 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 8/8 constraints]
After SMT, in 3880ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3881ms
Starting structural reductions in LTL mode, iteration 1 : 51/102 places, 84/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3977 ms. Remains : 51/102 places, 84/198 transitions.
[2024-05-24 03:18:47] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:18:47] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:18:47] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-24 03:18:47] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:18:47] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality16995706970776215305.gal : 1 ms
[2024-05-24 03:18:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality4972407340407214864.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/CTLCardinality16995706970776215305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4972407340407214864.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,536553,0.046352,5300,2,940,5,8976,6,0,284,7025,0


Converting to forward existential form...Done !
original formula: AX(EG(!(E(EX((p124==0)) U !(EF((p117==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(E(EX((p124==0)) U !(E(TRUE U (p117==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t20, t22, t43, t44, t...282
(forward)formula 0,0,0.182286,10316,1,0,177,31906,196,84,2113,29028,199
FORMULA HealthRecord-PT-13-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 64 transition count 128
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 64 transition count 128
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 56 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 56 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 101 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 53 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 53 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 50 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 50 transition count 88
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 121 place count 50 transition count 80
Applied a total of 121 rules in 3 ms. Remains 50 /102 variables (removed 52) and now considering 80/198 (removed 118) transitions.
[2024-05-24 03:18:48] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 50 cols
[2024-05-24 03:18:48] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:18:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-24 03:18:48] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 03:18:48] [INFO ] Invariant cache hit.
[2024-05-24 03:18:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:48] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-24 03:18:48] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 03:18:48] [INFO ] Invariant cache hit.
[2024-05-24 03:18:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:18:48] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:18:48] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 76/126 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:18:48] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 1/127 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:18:49] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 64 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1818 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:18:50] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 76/126 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 79/143 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 144 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1832 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
After SMT, in 3674ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3676ms
Starting structural reductions in LTL mode, iteration 1 : 50/102 places, 80/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3771 ms. Remains : 50/102 places, 80/198 transitions.
[2024-05-24 03:18:51] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:18:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:18:51] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-24 03:18:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:18:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:18:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality12134828835364322521.gal : 3 ms
[2024-05-24 03:18:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality6648836080715666606.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/CTLCardinality12134828835364322521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6648836080715666606.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,601434,0.080429,6864,2,1066,5,16198,6,0,276,14572,0


Converting to forward existential form...Done !
original formula: AG(AF(EX((p13==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX((p13==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t37, t38, Intersection wi...237
(forward)formula 0,0,0.277463,13728,1,0,138,50753,178,64,2006,42382,170
FORMULA HealthRecord-PT-13-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 69 transition count 137
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 69 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 62 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 62 transition count 123
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 89 place count 62 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 60 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 60 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 58 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 58 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 103 place count 58 transition count 98
Applied a total of 103 rules in 3 ms. Remains 58 /102 variables (removed 44) and now considering 98/198 (removed 100) transitions.
[2024-05-24 03:18:52] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
// Phase 1: matrix 94 rows 58 cols
[2024-05-24 03:18:52] [INFO ] Computed 10 invariants in 4 ms
[2024-05-24 03:18:52] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:18:52] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
[2024-05-24 03:18:52] [INFO ] Invariant cache hit.
[2024-05-24 03:18:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:52] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-24 03:18:52] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
[2024-05-24 03:18:52] [INFO ] Invariant cache hit.
[2024-05-24 03:18:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:18:52] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:18:52] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 93/151 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:18:53] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:18:53] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 73 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:18:55] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:18:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 93/151 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 97/175 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 1/152 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/152 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 176 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 10/10 constraints]
After SMT, in 5719ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 5720ms
Starting structural reductions in LTL mode, iteration 1 : 58/102 places, 98/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5819 ms. Remains : 58/102 places, 98/198 transitions.
[2024-05-24 03:18:57] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:18:57] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:18:57] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-24 03:18:57] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:18:57] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:18:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality10441575301037360642.gal : 1 ms
[2024-05-24 03:18:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality2573874257479365688.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/CTLCardinality10441575301037360642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2573874257479365688.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,951355,0.23069,13044,2,2743,5,44681,6,0,323,40107,0


Converting to forward existential form...Done !
original formula: AG((((p150==1)||(p44==1)) + (AF(EX(EG(((p63==0)||(p153==1))))) * E(((p159==1)&&(((p116!=1)||(p131==1))||((p15==0)||(p134==1)))) U !(AX((p...167
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(((p150==1)||(p44==1)))),!(EX(EG(((p63==0)||(p153==1))))))] = FALSE * [((FwdU(Init,TR...290
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t23, ...333
(forward)formula 0,0,0.941989,31572,1,0,194,142079,214,84,2338,139377,207
FORMULA HealthRecord-PT-13-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 67 transition count 134
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 67 transition count 134
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 60 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 60 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 87 place count 60 transition count 117
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 57 transition count 108
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 57 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 54 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 54 transition count 102
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 108 place count 54 transition count 93
Applied a total of 108 rules in 4 ms. Remains 54 /102 variables (removed 48) and now considering 93/198 (removed 105) transitions.
[2024-05-24 03:18:58] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 54 cols
[2024-05-24 03:18:58] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:18:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:18:58] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2024-05-24 03:18:58] [INFO ] Invariant cache hit.
[2024-05-24 03:18:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:58] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-24 03:18:59] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2024-05-24 03:18:59] [INFO ] Invariant cache hit.
[2024-05-24 03:18:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:18:59] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:18:59] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:18:59] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 89/143 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/144 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 67 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1828 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:19:01] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:19:01] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:19:01] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:19:01] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 89/143 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 92/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 163 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2639 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints]
After SMT, in 4531ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4532ms
Starting structural reductions in LTL mode, iteration 1 : 54/102 places, 93/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4629 ms. Remains : 54/102 places, 93/198 transitions.
[2024-05-24 03:19:03] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:19:03] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:19:03] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-24 03:19:03] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:19:03] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:19:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality16687033821078043496.gal : 1 ms
[2024-05-24 03:19:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality15910415528203647246.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/CTLCardinality16687033821078043496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15910415528203647246.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,887202,0.098705,7208,2,1363,5,17688,6,0,305,16547,0


Converting to forward existential form...Done !
original formula: AG((EF((EX((p146==1)) * !(A(((p85==0)||(p61==1)) U (p93==1))))) + ((p121==0)&&(p74==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p121==0)&&(p74==1)))) * !(E(TRUE U (EX((p146==1)) * !(!((E(!((p93==1)) U (!(((p85==0)||...215
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t23, t...317
(forward)formula 0,0,4.0022,121544,1,0,411,682002,217,196,2260,682050,464
FORMULA HealthRecord-PT-13-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Graph (trivial) has 130 edges and 102 vertex of which 8 / 102 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 39 place count 59 transition count 123
Iterating global reduction 0 with 38 rules applied. Total rules applied 77 place count 59 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 78 place count 59 transition count 122
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 86 place count 51 transition count 106
Iterating global reduction 1 with 8 rules applied. Total rules applied 94 place count 51 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 103 place count 51 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 48 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 48 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 45 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 45 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 45 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 45 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 44 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 43 transition count 69
Applied a total of 129 rules in 32 ms. Remains 43 /102 variables (removed 59) and now considering 69/198 (removed 129) transitions.
[2024-05-24 03:19:07] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 43 cols
[2024-05-24 03:19:07] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:19:08] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-24 03:19:08] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2024-05-24 03:19:08] [INFO ] Invariant cache hit.
[2024-05-24 03:19:08] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-24 03:19:08] [INFO ] Redundant transitions in 14 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 03:19:08] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2024-05-24 03:19:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 03:19:08] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-24 03:19:08] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:19:08] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:19:08] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:19:08] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:19:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 62/105 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/106 variables, and 58 constraints, problems are : Problem set: 0 solved, 55 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 62/105 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 55/113 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/106 variables, and 113 constraints, problems are : Problem set: 0 solved, 55 unsolved in 747 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 6/6 constraints]
After SMT, in 1602ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1602ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/102 places, 69/198 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2142 ms. Remains : 43/102 places, 69/198 transitions.
[2024-05-24 03:19:09] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:19:09] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:19:09] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-24 03:19:09] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:19:09] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:19:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality7136612947601196507.gal : 1 ms
[2024-05-24 03:19:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality11809408680066807906.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/CTLCardinality7136612947601196507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11809408680066807906.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,323194,0.112684,7892,2,1137,5,20391,6,0,231,18679,0


Converting to forward existential form...Done !
original formula: AG(AF((p154==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p154==0)))] = FALSE
Hit Full ! (commute/partial/dont) 66/0/3
(forward)formula 0,0,0.211572,9740,1,0,8,36169,20,2,1255,18679,8
FORMULA HealthRecord-PT-13-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Graph (trivial) has 124 edges and 102 vertex of which 8 / 102 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 63 transition count 130
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 63 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 72 place count 63 transition count 129
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 57 transition count 117
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 57 transition count 117
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 89 place count 57 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 55 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 55 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 53 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 53 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 103 place count 53 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 53 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 51 transition count 92
Applied a total of 109 rules in 21 ms. Remains 51 /102 variables (removed 51) and now considering 92/198 (removed 106) transitions.
[2024-05-24 03:19:09] [INFO ] Flow matrix only has 86 transitions (discarded 6 similar events)
// Phase 1: matrix 86 rows 51 cols
[2024-05-24 03:19:10] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:19:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:19:10] [INFO ] Flow matrix only has 86 transitions (discarded 6 similar events)
[2024-05-24 03:19:10] [INFO ] Invariant cache hit.
[2024-05-24 03:19:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:19:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-24 03:19:10] [INFO ] Redundant transitions in 14 ms returned []
Running 91 sub problems to find dead transitions.
[2024-05-24 03:19:10] [INFO ] Flow matrix only has 86 transitions (discarded 6 similar events)
[2024-05-24 03:19:10] [INFO ] Invariant cache hit.
[2024-05-24 03:19:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:19:10] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:19:10] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:19:10] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 85/136 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/137 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 64 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1591 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:19:11] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:19:12] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:19:12] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 85/136 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 91/157 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 1/137 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/137 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 158 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2845 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 6/6 constraints]
After SMT, in 4476ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4478ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/102 places, 92/198 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4607 ms. Remains : 51/102 places, 92/198 transitions.
[2024-05-24 03:19:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:19:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:19:14] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 03:19:14] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:19:14] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:19:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8178890268553416876.gal : 0 ms
[2024-05-24 03:19:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4711611136806514122.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8178890268553416876.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4711611136806514122.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 21380 steps (1968 resets) in 246 ms. (86 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-13-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 65 transition count 130
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 65 transition count 130
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 58 transition count 116
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 58 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 97 place count 58 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 56 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 56 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 55 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 55 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 106 place count 55 transition count 96
Applied a total of 106 rules in 3 ms. Remains 55 /102 variables (removed 47) and now considering 96/198 (removed 102) transitions.
[2024-05-24 03:19:14] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
// Phase 1: matrix 93 rows 55 cols
[2024-05-24 03:19:14] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:19:14] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-24 03:19:14] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2024-05-24 03:19:14] [INFO ] Invariant cache hit.
[2024-05-24 03:19:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:19:14] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-24 03:19:14] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2024-05-24 03:19:14] [INFO ] Invariant cache hit.
[2024-05-24 03:19:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 03:19:15] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:19:15] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 03:19:15] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 92/147 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 03:19:15] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:19:15] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:19:16] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 71 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2290 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 03:19:17] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:19:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 03:19:17] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 92/147 variables, 55/73 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 95/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 169 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2935 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints]
After SMT, in 5249ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 5250ms
Starting structural reductions in LTL mode, iteration 1 : 55/102 places, 96/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5480 ms. Remains : 55/102 places, 96/198 transitions.
[2024-05-24 03:19:20] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:19:20] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:19:20] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-24 03:19:20] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:19:20] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:19:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality4344287608756664488.gal : 1 ms
[2024-05-24 03:19:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality17076184485712558301.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/CTLCardinality4344287608756664488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17076184485712558301.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,839088,0.095825,7240,2,1447,5,17927,6,0,312,15646,0


Converting to forward existential form...Done !
original formula: AF(EX((EF((p103==1)) * E((p98==0) U (p0!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((E(TRUE U (p103==1)) * E((p98==0) U (p0!=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, t22, t...302
(forward)formula 0,1,0.570482,22080,1,0,203,92085,220,88,2343,87760,230
FORMULA HealthRecord-PT-13-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 03:19:20] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:19:20] [INFO ] Flatten gal took : 5 ms
Total runtime 93492 ms.

BK_STOP 1716520760852

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-13"
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-13, 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-171640604200793"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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