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-171640604200770.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is HealthRecord-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604200770
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-10-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716520212130

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:10:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:10:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:10:13] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-24 03:10:13] [INFO ] Transformed 158 places.
[2024-05-24 03:10:13] [INFO ] Transformed 333 transitions.
[2024-05-24 03:10:13] [INFO ] Found NUPN structural information;
[2024-05-24 03:10:13] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Support contains 70 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 113 transition count 220
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 113 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 112 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 112 transition count 218
Applied a total of 92 rules in 25 ms. Remains 112 /158 variables (removed 46) and now considering 218/306 (removed 88) transitions.
[2024-05-24 03:10:13] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 112 cols
[2024-05-24 03:10:13] [INFO ] Computed 14 invariants in 15 ms
[2024-05-24 03:10:13] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-24 03:10:13] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-24 03:10:13] [INFO ] Invariant cache hit.
[2024-05-24 03:10:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:10:13] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-24 03:10:13] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-24 03:10:13] [INFO ] Invariant cache hit.
[2024-05-24 03:10:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:15] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 14 ms to minimize.
[2024-05-24 03:10:15] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:10:15] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:10:15] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:10:15] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:10:15] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:10:15] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:10:15] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:10:16] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:10:16] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:10:16] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:10:16] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:17] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:10:17] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:17] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:10:17] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:10:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:10:17] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:10:17] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:10:17] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 3 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:10:18] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 2 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 4 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:10:19] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 2 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:20] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:10:21] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 209/321 variables, 112/176 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:23] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:10:23] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:24] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:10:24] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:26] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (OVERLAPS) 1/322 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 17 (OVERLAPS) 0/322 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 182 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16591 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:31] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:32] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:10:32] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:10:32] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:10:32] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:10:32] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:10:32] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:10:32] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:32] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2024-05-24 03:10:33] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:10:33] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:10:33] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:10:33] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:10:33] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 209/321 variables, 112/195 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 217/412 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:35] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (OVERLAPS) 1/322 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:41] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:10:41] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:10:42] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-24 03:10:45] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:10:45] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 16 (OVERLAPS) 0/322 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 419 constraints, problems are : Problem set: 0 solved, 217 unsolved in 25496 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 75/75 constraints]
After SMT, in 42241ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 42262ms
Starting structural reductions in LTL mode, iteration 1 : 112/158 places, 218/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42669 ms. Remains : 112/158 places, 218/306 transitions.
Support contains 70 out of 112 places after structural reductions.
[2024-05-24 03:10:56] [INFO ] Flatten gal took : 39 ms
[2024-05-24 03:10:56] [INFO ] Flatten gal took : 16 ms
[2024-05-24 03:10:56] [INFO ] Input system was already deterministic with 218 transitions.
RANDOM walk for 40000 steps (2501 resets) in 2053 ms. (19 steps per ms) remains 32/73 properties
BEST_FIRST walk for 4004 steps (29 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (30 resets) in 41 ms. (95 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (29 resets) in 40 ms. (97 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (24 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (23 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (29 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (29 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (31 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (33 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (32 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (32 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 9 ms. (400 steps per ms) remains 28/32 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (30 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (20 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
[2024-05-24 03:10:57] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-24 03:10:57] [INFO ] Invariant cache hit.
[2024-05-24 03:10:57] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/78 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 26 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 3 (OVERLAPS) 34/112 variables, 8/14 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 209/321 variables, 112/126 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/126 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/127 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/127 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/127 constraints. Problems are: Problem set: 3 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 127 constraints, problems are : Problem set: 3 solved, 25 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 42/77 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 8/14 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 2/16 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 35/112 variables, 8/24 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:10:58] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 20/44 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:10:59] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 20/64 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:11:00] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 20/84 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:11:01] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 6/90 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 3/93 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 1/94 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 5/99 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:11:02] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 2/101 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/112 variables, 0/101 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 209/321 variables, 112/213 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 25/238 constraints. Problems are: Problem set: 3 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/322 variables, and 238 constraints, problems are : Problem set: 3 solved, 25 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 25/28 constraints, Known Traps: 87/87 constraints]
After SMT, in 5755ms problems are : Problem set: 3 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 74 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 477 edges and 107 vertex of which 103 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 103 transition count 197
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 101 transition count 194
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 100 transition count 193
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 100 transition count 191
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 16 place count 97 transition count 191
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 37 place count 76 transition count 150
Iterating global reduction 3 with 21 rules applied. Total rules applied 58 place count 76 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 76 transition count 149
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 64 place count 71 transition count 139
Iterating global reduction 4 with 5 rules applied. Total rules applied 69 place count 71 transition count 139
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 76 place count 71 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 70 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
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 82 place count 68 transition count 136
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 83 place count 68 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 84 place count 67 transition count 135
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 99 place count 67 transition count 135
Applied a total of 99 rules in 52 ms. Remains 67 /112 variables (removed 45) and now considering 135/218 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 67/112 places, 135/218 transitions.
RANDOM walk for 40000 steps (2659 resets) in 1027 ms. (38 steps per ms) remains 18/25 properties
BEST_FIRST walk for 4003 steps (61 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (57 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (46 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (54 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (56 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (54 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (54 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (65 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (55 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (59 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (52 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (55 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (58 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (53 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (44 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
[2024-05-24 03:11:03] [INFO ] Flow matrix only has 132 transitions (discarded 3 similar events)
// Phase 1: matrix 132 rows 67 cols
[2024-05-24 03:11:03] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:11:03] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 43/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 132/199 variables, 67/76 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 79 constraints, problems are : Problem set: 0 solved, 18 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 43/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-24 03:11:03] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:11:04] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 132/199 variables, 67/112 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 18/133 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:11:05] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-24 03:11:06] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/199 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-24 03:11:06] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:11:06] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/199 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 139 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2958 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 42/42 constraints]
After SMT, in 3237ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 13 different solutions.
Parikh walk visited 14 properties in 1991 ms.
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 135/135 transitions.
Graph (complete) has 318 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 50 transition count 103
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 50 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 34 place count 50 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 49 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 49 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 48 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 46 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 46 transition count 107
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 46 transition count 104
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 43 transition count 104
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 68 place count 43 transition count 104
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 43 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 42 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 42 transition count 102
Applied a total of 74 rules in 25 ms. Remains 42 /67 variables (removed 25) and now considering 102/135 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 42/67 places, 102/135 transitions.
RANDOM walk for 40000 steps (2575 resets) in 641 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (577 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (507 resets) in 27 ms. (1428 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (591 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (564 resets) in 28 ms. (1379 steps per ms) remains 2/3 properties
[2024-05-24 03:11:09] [INFO ] Flow matrix only has 92 transitions (discarded 10 similar events)
// Phase 1: matrix 92 rows 42 cols
[2024-05-24 03:11:09] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 03:11:09] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/42 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 92/134 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 23/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 73 constraints, problems are : Problem set: 0 solved, 2 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/42 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 92/134 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 23/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 75 constraints, problems are : Problem set: 0 solved, 2 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 102/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 40 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 40 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 39 transition count 98
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 39 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 38 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 38 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 37 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 37 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 36 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 36 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 36 transition count 87
Applied a total of 17 rules in 19 ms. Remains 36 /42 variables (removed 6) and now considering 87/102 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 36/42 places, 87/102 transitions.
RANDOM walk for 40000 steps (2587 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (612 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (636 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1382 steps, run visited all 2 properties in 14 ms. (steps per millisecond=98 )
Probabilistic random walk after 1382 steps, saw 487 distinct states, run finished after 17 ms. (steps per millisecond=81 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-10-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:11:09] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:11:09] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:11:09] [INFO ] Input system was already deterministic with 218 transitions.
Computed a total of 9 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 69 transition count 137
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 69 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 64 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 64 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 64 transition count 125
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 62 transition count 119
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 62 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 60 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 60 transition count 115
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 111 place count 60 transition count 110
Applied a total of 111 rules in 8 ms. Remains 60 /112 variables (removed 52) and now considering 110/218 (removed 108) transitions.
[2024-05-24 03:11:09] [INFO ] Flow matrix only has 107 transitions (discarded 3 similar events)
// Phase 1: matrix 107 rows 60 cols
[2024-05-24 03:11:09] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:11:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:11:09] [INFO ] Flow matrix only has 107 transitions (discarded 3 similar events)
[2024-05-24 03:11:09] [INFO ] Invariant cache hit.
[2024-05-24 03:11:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:09] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-24 03:11:09] [INFO ] Flow matrix only has 107 transitions (discarded 3 similar events)
[2024-05-24 03:11:09] [INFO ] Invariant cache hit.
[2024-05-24 03:11:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:11:10] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:11:10] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:11:10] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 106/166 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 1/167 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 73 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:11:11] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:11:11] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:11:12] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:11:12] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:11:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:11:12] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:11:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:11:12] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:11:12] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:11:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:11:13] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 106/166 variables, 60/83 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 109/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 1/167 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (OVERLAPS) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 193 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4767 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 14/14 constraints]
After SMT, in 6795ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6796ms
Starting structural reductions in LTL mode, iteration 1 : 60/112 places, 110/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6898 ms. Remains : 60/112 places, 110/218 transitions.
[2024-05-24 03:11:16] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:11:16] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:11:16] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-24 03:11:16] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:11:16] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:11:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5363670862840911888.gal : 3 ms
[2024-05-24 03:11:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17540051486496557488.ctl : 4 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/CTLFireability5363670862840911888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17540051486496557488.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.77974e+06,0.215746,11988,2,1722,5,38155,6,0,346,37831,0


Converting to forward existential form...Done !
original formula: EX((((AX(((p76==1)&&(p143==0))) * (p8==0)) * ((AG(EX((p153==1))) + AX(((p42==0)&&(((p16==0)||(p35==0))||((p54==0)||(p130==0)))))) * ((p11...266
=> equivalent forward existential formula: (([(((EY(Init) * (!(EX(!(((p76==1)&&(p143==0))))) * (p8==0))) * ((p112==0)||(p117==0))) * !(E(TRUE U !(EX((p153=...482
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...373
(forward)formula 0,0,1.19568,42244,1,0,256,231638,244,114,2568,172618,288
FORMULA HealthRecord-PT-10-CTLFireability-2024-00 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 : 112/112 places, 218/218 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 70 transition count 137
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 70 transition count 137
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 62 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 62 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 109 place count 62 transition count 112
Applied a total of 109 rules in 4 ms. Remains 62 /112 variables (removed 50) and now considering 112/218 (removed 106) transitions.
[2024-05-24 03:11:17] [INFO ] Flow matrix only has 107 transitions (discarded 5 similar events)
// Phase 1: matrix 107 rows 62 cols
[2024-05-24 03:11:17] [INFO ] Computed 11 invariants in 3 ms
[2024-05-24 03:11:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:11:17] [INFO ] Flow matrix only has 107 transitions (discarded 5 similar events)
[2024-05-24 03:11:17] [INFO ] Invariant cache hit.
[2024-05-24 03:11:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:17] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-24 03:11:17] [INFO ] Flow matrix only has 107 transitions (discarded 5 similar events)
[2024-05-24 03:11:17] [INFO ] Invariant cache hit.
[2024-05-24 03:11:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 03:11:18] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:11:18] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:11:18] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:11:18] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:11:18] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 106/168 variables, 62/78 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 1/169 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 79 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2518 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 03:11:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 03:11:20] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:11:20] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:11:20] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:11:20] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:11:20] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 03:11:21] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:11:21] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 03:11:21] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:11:21] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 106/168 variables, 62/88 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 111/199 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (OVERLAPS) 1/169 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 14 (OVERLAPS) 0/169 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 200 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4362 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 15/15 constraints]
After SMT, in 6914ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 6915ms
Starting structural reductions in LTL mode, iteration 1 : 62/112 places, 112/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7018 ms. Remains : 62/112 places, 112/218 transitions.
[2024-05-24 03:11:24] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:11:24] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:11:24] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-24 03:11:24] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:11:24] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:11:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4665056869070673233.gal : 2 ms
[2024-05-24 03:11:24] [INFO ] Time to serialize properties into /tmp/CTLFireability2473374048281368965.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/CTLFireability4665056869070673233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2473374048281368965.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A((((p45==1) * !((!((EG((p67==1)) * ((p1==1)||(p6==1)))) + AF((p46==1))))) * (AX((p11!=1)) * EG(EF(((p85==1)&&(p155==1)))))) U !(EF((((p1...186
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (((p104==1)||(p37==1))&&(p11==1)))))))) * !(E(!(!(E(TRUE U (((p104==1)||(p37==1))&&(...379
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...373
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.89962,248232,1,0,481,1.54301e+06,266,245,2767,1.30638e+06,560
FORMULA HealthRecord-PT-10-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 62 transition count 123
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 62 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 109 place count 53 transition count 104
Iterating global reduction 0 with 9 rules applied. Total rules applied 118 place count 53 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 127 place count 53 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 50 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 50 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 136 place count 50 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 48 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 48 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 146 place count 48 transition count 74
Applied a total of 146 rules in 12 ms. Remains 48 /112 variables (removed 64) and now considering 74/218 (removed 144) transitions.
[2024-05-24 03:11:32] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
// Phase 1: matrix 71 rows 48 cols
[2024-05-24 03:11:32] [INFO ] Computed 9 invariants in 4 ms
[2024-05-24 03:11:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:11:32] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
[2024-05-24 03:11:32] [INFO ] Invariant cache hit.
[2024-05-24 03:11:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:32] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-24 03:11:32] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
[2024-05-24 03:11:32] [INFO ] Invariant cache hit.
[2024-05-24 03:11:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-24 03:11:33] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:11:33] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 70/118 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 60 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-24 03:11:34] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 70/118 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 73/133 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 134 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1642 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 3/3 constraints]
After SMT, in 2798ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2800ms
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 74/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2896 ms. Remains : 48/112 places, 74/218 transitions.
[2024-05-24 03:11:35] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:11:35] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:11:35] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-24 03:11:35] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:35] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14713999821412976570.gal : 1 ms
[2024-05-24 03:11:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17826257626537392011.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/CTLFireability14713999821412976570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17826257626537392011.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,369612,0.035579,4972,2,633,5,7014,6,0,262,6018,0


Converting to forward existential form...Done !
original formula: EF(AX(AF(EG((p150==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EG(!(EG((p150==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t15, t17, t19, Intersection with reachable at...222
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.18065,48228,1,0,292,276529,172,175,1920,250322,333
FORMULA HealthRecord-PT-10-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 67 transition count 132
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 67 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 99 place count 58 transition count 113
Iterating global reduction 0 with 9 rules applied. Total rules applied 108 place count 58 transition count 113
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 116 place count 58 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 56 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 56 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 123 place count 56 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 55 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 55 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 55 transition count 92
Applied a total of 128 rules in 4 ms. Remains 55 /112 variables (removed 57) and now considering 92/218 (removed 126) transitions.
[2024-05-24 03:11:36] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
// Phase 1: matrix 88 rows 55 cols
[2024-05-24 03:11:36] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:11:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 03:11:36] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2024-05-24 03:11:36] [INFO ] Invariant cache hit.
[2024-05-24 03:11:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:36] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 03:11:36] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2024-05-24 03:11:36] [INFO ] Invariant cache hit.
[2024-05-24 03:11:36] [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, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:11:37] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:11:37] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:11:37] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:11:37] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:11:37] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 87/142 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:11:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:11:38] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 73 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2214 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:11:39] [INFO ] Deduced a trap composed of 12 places in 41 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, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 87/142 variables, 55/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 91/164 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 165 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2477 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 8/8 constraints]
After SMT, in 4713ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4714ms
Starting structural reductions in LTL mode, iteration 1 : 55/112 places, 92/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4798 ms. Remains : 55/112 places, 92/218 transitions.
[2024-05-24 03:11:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:41] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:11:41] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 03:11:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:41] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16896639921169671863.gal : 1 ms
[2024-05-24 03:11:41] [INFO ] Time to serialize properties into /tmp/CTLFireability10715662271509202317.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/CTLFireability16896639921169671863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10715662271509202317.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,742860,0.096534,7720,2,1658,5,18235,6,0,305,18144,0


Converting to forward existential form...Done !
original formula: (EG(A((p35==1) U (!(((p14!=1) * A((p40==1) U ((p16==1)&&(p155==1))))) * !(EF((p114==1)))))) + AX(EF((((p74==1)||(p127==1))&&((p45==1)||((...179
=> equivalent forward existential formula: [(EY((Init * !(EG(!((E(!((!(((p14!=1) * !((E(!(((p16==1)&&(p155==1))) U (!((p40==1)) * !(((p16==1)&&(p155==1))))...639
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t22, t24, t...332
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.59951,84896,1,0,562,517238,225,316,2412,467988,600
FORMULA HealthRecord-PT-10-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 67 transition count 132
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 67 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 60 transition count 118
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 60 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 109 place count 60 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 58 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 58 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 56 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 56 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 123 place count 56 transition count 97
Applied a total of 123 rules in 12 ms. Remains 56 /112 variables (removed 56) and now considering 97/218 (removed 121) transitions.
[2024-05-24 03:11:44] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
// Phase 1: matrix 93 rows 56 cols
[2024-05-24 03:11:44] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:11:44] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:11:44] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
[2024-05-24 03:11:44] [INFO ] Invariant cache hit.
[2024-05-24 03:11:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:44] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 03:11:44] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
[2024-05-24 03:11:44] [INFO ] Invariant cache hit.
[2024-05-24 03:11:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:11:44] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:11:44] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:11:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:11:44] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:11:45] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:11:45] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 92/148 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/149 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 73 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:11:46] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:11:46] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:11:47] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:11:47] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:11:47] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 92/148 variables, 56/77 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 96/173 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 1/149 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/149 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 174 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 11/11 constraints]
After SMT, in 5311ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 5313ms
Starting structural reductions in LTL mode, iteration 1 : 56/112 places, 97/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5410 ms. Remains : 56/112 places, 97/218 transitions.
[2024-05-24 03:11:49] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:49] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:49] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-24 03:11:49] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:49] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:11:49] [INFO ] Time to serialize gal into /tmp/CTLFireability9437413171649041222.gal : 1 ms
[2024-05-24 03:11:49] [INFO ] Time to serialize properties into /tmp/CTLFireability11153071838121543394.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/CTLFireability9437413171649041222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11153071838121543394.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,956943,0.090614,7232,2,1427,5,16958,6,0,315,16052,0


Converting to forward existential form...Done !
original formula: AF(E(E(!(AX(((p112==1)&&(p143==1)))) U ((p53==1) * (E((p8==1) U (p88==1)) + (p3==1)))) U (p104==1)))
=> equivalent forward existential formula: [FwdG(Init,!(E(E(!(!(EX(!(((p112==1)&&(p143==1)))))) U ((p53==1) * (E((p8==1) U (p88==1)) + (p3==1)))) U (p104==...169
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t23, t...362
(forward)formula 0,1,1.25091,49756,1,0,403,271617,226,228,2331,267529,398
FORMULA HealthRecord-PT-10-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 68 transition count 135
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 68 transition count 135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 60 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 60 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 113 place count 60 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 58 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 58 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 56 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 56 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 127 place count 56 transition count 94
Applied a total of 127 rules in 9 ms. Remains 56 /112 variables (removed 56) and now considering 94/218 (removed 124) transitions.
[2024-05-24 03:11:51] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
// Phase 1: matrix 91 rows 56 cols
[2024-05-24 03:11:51] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:11:51] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:11:51] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2024-05-24 03:11:51] [INFO ] Invariant cache hit.
[2024-05-24 03:11:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-24 03:11:51] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2024-05-24 03:11:51] [INFO ] Invariant cache hit.
[2024-05-24 03:11:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:11:51] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 4 ms to minimize.
[2024-05-24 03:11:51] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:11:51] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:11:51] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:11:51] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 90/146 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 71 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2061 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:11:53] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:11:53] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:11:53] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:11:53] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:11:53] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:11:53] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:11:54] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:11:54] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 90/146 variables, 56/78 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 93/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 1/147 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:11:55] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/147 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/147 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 0/147 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 173 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4173 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 14/14 constraints]
After SMT, in 6255ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 6257ms
Starting structural reductions in LTL mode, iteration 1 : 56/112 places, 94/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6351 ms. Remains : 56/112 places, 94/218 transitions.
[2024-05-24 03:11:57] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:11:57] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:11:57] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-24 03:11:57] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:11:57] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:11:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14414670670260929474.gal : 1 ms
[2024-05-24 03:11:57] [INFO ] Time to serialize properties into /tmp/CTLFireability8931245383737160463.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/CTLFireability14414670670260929474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8931245383737160463.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18293e+06,0.12428,9316,2,1591,5,24918,6,0,314,26161,0


Converting to forward existential form...Done !
original formula: AG((AX(((((AX(((p35==1)&&(p155==1))) + (p27==1)) + ((p16==1)&&(p155==1))) * (p104==1)) * (p5==1))) + (AG(((p31==0)&&(p83==0))) * (p8==0))...157
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(!(EX(!(((((!(EX(!(((p35==1)&&(p155==1))))) + (p27==1)) + ((p16==1)&&(p155==1))) * (...380
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t22, t23, t...372
(forward)formula 0,0,0.388826,19020,1,0,205,82066,207,89,2224,78288,200
FORMULA HealthRecord-PT-10-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 69 transition count 137
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 69 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 64 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 64 transition count 127
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 102 place count 64 transition count 121
Applied a total of 102 rules in 8 ms. Remains 64 /112 variables (removed 48) and now considering 121/218 (removed 97) transitions.
[2024-05-24 03:11:57] [INFO ] Flow matrix only has 118 transitions (discarded 3 similar events)
// Phase 1: matrix 118 rows 64 cols
[2024-05-24 03:11:57] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:11:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:11:57] [INFO ] Flow matrix only has 118 transitions (discarded 3 similar events)
[2024-05-24 03:11:57] [INFO ] Invariant cache hit.
[2024-05-24 03:11:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:11:57] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-24 03:11:57] [INFO ] Flow matrix only has 118 transitions (discarded 3 similar events)
[2024-05-24 03:11:57] [INFO ] Invariant cache hit.
[2024-05-24 03:11:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-24 03:11:58] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:11:58] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:11:58] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:11:58] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 117/181 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 1/182 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 78 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2424 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-24 03:12:00] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:12:00] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-24 03:12:00] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:12:00] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:12:00] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:12:01] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:12:01] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:12:01] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:12:01] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 117/181 variables, 64/86 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 120/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 1/182 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/182 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 207 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4568 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 13/13 constraints]
After SMT, in 7033ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 7034ms
Starting structural reductions in LTL mode, iteration 1 : 64/112 places, 121/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7124 ms. Remains : 64/112 places, 121/218 transitions.
[2024-05-24 03:12:04] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:12:04] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:12:04] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-24 03:12:04] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:12:04] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:12:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8291935044883893738.gal : 1 ms
[2024-05-24 03:12:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12738135720385483186.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/CTLFireability8291935044883893738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12738135720385483186.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.75252e+06,0.236496,12940,2,2047,5,34664,6,0,373,41445,0


Converting to forward existential form...Done !
original formula: E(!((((EX(!(((p35==1)&&(p155==1)))) * ((EG((p16==1)) + (p150==1)) + ((p35==1)&&(p155==1)))) * ((AX((p96==1)) * AF((p68==1))) + AF(AX((p25...275
=> equivalent forward existential formula: ([((EY(FwdU(Init,!((((EX(!(((p35==1)&&(p155==1)))) * ((EG((p16==1)) + (p150==1)) + ((p35==1)&&(p155==1)))) * ((!...635
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...408
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,12.6041,368532,1,0,674,2.13035e+06,293,357,2890,2.30341e+06,761
FORMULA HealthRecord-PT-10-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 72 transition count 142
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 72 transition count 142
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 65 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 65 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 99 place count 65 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 64 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 64 transition count 120
Applied a total of 101 rules in 11 ms. Remains 64 /112 variables (removed 48) and now considering 120/218 (removed 98) transitions.
[2024-05-24 03:12:17] [INFO ] Flow matrix only has 116 transitions (discarded 4 similar events)
// Phase 1: matrix 116 rows 64 cols
[2024-05-24 03:12:17] [INFO ] Computed 10 invariants in 3 ms
[2024-05-24 03:12:17] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 03:12:17] [INFO ] Flow matrix only has 116 transitions (discarded 4 similar events)
[2024-05-24 03:12:17] [INFO ] Invariant cache hit.
[2024-05-24 03:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:12:17] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-24 03:12:17] [INFO ] Flow matrix only has 116 transitions (discarded 4 similar events)
[2024-05-24 03:12:17] [INFO ] Invariant cache hit.
[2024-05-24 03:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-24 03:12:18] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:12:18] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:12:18] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:12:18] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 115/179 variables, 64/78 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 1/180 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/180 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 79 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2600 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-24 03:12:20] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:12:20] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 115/179 variables, 64/80 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 119/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/180 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/180 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 200 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3583 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 6/6 constraints]
After SMT, in 6216ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 6217ms
Starting structural reductions in LTL mode, iteration 1 : 64/112 places, 120/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6349 ms. Remains : 64/112 places, 120/218 transitions.
[2024-05-24 03:12:24] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:12:24] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:12:24] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-24 03:12:24] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:12:24] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:12:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3663640849899452669.gal : 1 ms
[2024-05-24 03:12:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13599242449321823356.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/CTLFireability3663640849899452669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13599242449321823356.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,2.93934e+06,0.223167,12128,2,1524,5,35589,6,0,369,40801,0


Converting to forward existential form...Done !
original formula: (A(AG(((AF(AX((p63==1))) * (p98==1)) * (EG((p22==1)) + EX((p84==1))))) U AX((EG(EF((p58==1))) * EF(EG((p1==1)))))) + E(A(EF((p26==1)) U E...213
=> equivalent forward existential formula: ([((Init * !(EG(!(!(EX(!((EG(E(TRUE U (p58==1))) * E(TRUE U EG((p1==1))))))))))) * !(E(!(!(EX(!((EG(E(TRUE U (p5...610
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, t21, t22, t23, ...339
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.92582,95432,1,0,376,550440,284,196,2850,452959,466
FORMULA HealthRecord-PT-10-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 63 transition count 125
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 63 transition count 125
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 54 transition count 106
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 54 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 125 place count 54 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 51 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 51 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 134 place count 51 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 49 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 49 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 144 place count 49 transition count 76
Applied a total of 144 rules in 3 ms. Remains 49 /112 variables (removed 63) and now considering 76/218 (removed 142) transitions.
[2024-05-24 03:12:27] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 49 cols
[2024-05-24 03:12:27] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:12:27] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:12:27] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2024-05-24 03:12:27] [INFO ] Invariant cache hit.
[2024-05-24 03:12:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:12:27] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-24 03:12:27] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2024-05-24 03:12:27] [INFO ] Invariant cache hit.
[2024-05-24 03:12:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:12:27] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:12:27] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 72/121 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 61 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 72/121 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 75/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/122 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 137 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 3/3 constraints]
After SMT, in 2871ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2873ms
Starting structural reductions in LTL mode, iteration 1 : 49/112 places, 76/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2961 ms. Remains : 49/112 places, 76/218 transitions.
[2024-05-24 03:12:30] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:12:30] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:12:30] [INFO ] Input system was already deterministic with 76 transitions.
[2024-05-24 03:12:30] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:12:30] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:12:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15206370506123797519.gal : 1 ms
[2024-05-24 03:12:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16116922134744773538.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/CTLFireability15206370506123797519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16116922134744773538.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,435222,0.045505,5236,2,764,5,8946,6,0,268,7726,0


Converting to forward existential form...Done !
original formula: (EX((p24==1)) + AG(((p24==1) + AX(((p54==0)||(p155==0))))))
=> equivalent forward existential formula: [(EY((FwdU((Init * !(EX((p24==1)))),TRUE) * !((p24==1)))) * !(((p54==0)||(p155==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t15, t17, t19, t34, t35, t54, Intersection wi...237
(forward)formula 0,0,0.192929,11572,1,0,136,40843,168,66,2012,34771,159
FORMULA HealthRecord-PT-10-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 63 transition count 125
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 63 transition count 125
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 55 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 place count 55 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 120 place count 55 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 52 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 129 place count 52 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 50 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 50 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 139 place count 50 transition count 81
Applied a total of 139 rules in 6 ms. Remains 50 /112 variables (removed 62) and now considering 81/218 (removed 137) transitions.
[2024-05-24 03:12:30] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 50 cols
[2024-05-24 03:12:30] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:12:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 03:12:30] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-05-24 03:12:30] [INFO ] Invariant cache hit.
[2024-05-24 03:12:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:12:30] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-24 03:12:30] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-05-24 03:12:30] [INFO ] Invariant cache hit.
[2024-05-24 03:12:30] [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, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:12:30] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:12:30] [INFO ] Deduced a trap composed of 5 places in 25 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, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 77/127 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:12:31] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 63 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1664 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:12:32] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 77/127 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 80/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 144 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1903 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 4/4 constraints]
After SMT, in 3612ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3613ms
Starting structural reductions in LTL mode, iteration 1 : 50/112 places, 81/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3708 ms. Remains : 50/112 places, 81/218 transitions.
[2024-05-24 03:12:33] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:12:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:12:33] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-24 03:12:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:12:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:12:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6078128743053079768.gal : 1 ms
[2024-05-24 03:12:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7461009388892128217.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/CTLFireability6078128743053079768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7461009388892128217.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,439596,0.049615,5272,2,775,5,9078,6,0,277,7249,0


Converting to forward existential form...Done !
original formula: EF((AX(EX((p35==0))) * (p118==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p118==1)) * !(EX(!(EX((p35==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t15, t16, t18, t20, t22, Intersection with re...232
(forward)formula 0,1,0.271266,15040,1,0,140,64654,175,69,1936,52517,170
FORMULA HealthRecord-PT-10-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 127
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 127
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 56 transition count 111
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 56 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 56 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 55 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 55 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 54 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 54 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 54 transition count 94
Applied a total of 128 rules in 6 ms. Remains 54 /112 variables (removed 58) and now considering 94/218 (removed 124) transitions.
[2024-05-24 03:12:34] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
// Phase 1: matrix 91 rows 54 cols
[2024-05-24 03:12:34] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:12:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:12:34] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2024-05-24 03:12:34] [INFO ] Invariant cache hit.
[2024-05-24 03:12:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:12:34] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-24 03:12:34] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2024-05-24 03:12:34] [INFO ] Invariant cache hit.
[2024-05-24 03:12:34] [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, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:12:34] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:12:34] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:12:34] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 90/144 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 1/145 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:12:35] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/145 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 68 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2249 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:12:36] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 90/144 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 93/161 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 03:12:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 1/145 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 163 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2773 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 6/6 constraints]
After SMT, in 5043ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 5045ms
Starting structural reductions in LTL mode, iteration 1 : 54/112 places, 94/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5135 ms. Remains : 54/112 places, 94/218 transitions.
[2024-05-24 03:12:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:12:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:12:39] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-24 03:12:39] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:12:39] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:12:39] [INFO ] Time to serialize gal into /tmp/CTLFireability10824561516833318010.gal : 1 ms
[2024-05-24 03:12:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11753686753173609584.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/CTLFireability10824561516833318010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11753686753173609584.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,693288,0.091164,7224,2,1030,5,17344,6,0,306,17271,0


Converting to forward existential form...Done !
original formula: (AX(AG(AX((p46==0)))) + EX((AF((p16==0)) * AG(EX(((p59==1)||(p25==1)))))))
=> equivalent forward existential formula: [(EY(FwdU(EY((Init * !(EX((!(EG(!((p16==0)))) * !(E(TRUE U !(EX(((p59==1)||(p25==1))))))))))),TRUE)) * !((p46==0...167
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t15, t16, t18, t19, t21, t23, t25, t37, t38, t...272
(forward)formula 0,0,0.5715,24620,1,0,169,116265,210,79,2420,98314,206
FORMULA HealthRecord-PT-10-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 145 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 58 transition count 121
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 58 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 98 place count 58 transition count 120
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 50 transition count 103
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 50 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 120 place count 50 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 48 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 48 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 48 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 47 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 47 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 132 place count 47 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 135 place count 47 transition count 81
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 4 with 2 rules applied. Total rules applied 137 place count 46 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 44 transition count 78
Applied a total of 139 rules in 24 ms. Remains 44 /112 variables (removed 68) and now considering 78/218 (removed 140) transitions.
[2024-05-24 03:12:39] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
// Phase 1: matrix 71 rows 44 cols
[2024-05-24 03:12:39] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:12:40] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:12:40] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-05-24 03:12:40] [INFO ] Invariant cache hit.
[2024-05-24 03:12:40] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-24 03:12:40] [INFO ] Redundant transitions in 15 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-24 03:12:40] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-05-24 03:12:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 57 constraints, problems are : Problem set: 0 solved, 62 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 62/119 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 119 constraints, problems are : Problem set: 0 solved, 62 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints]
After SMT, in 1666ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 1667ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/112 places, 78/218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1796 ms. Remains : 44/112 places, 78/218 transitions.
[2024-05-24 03:12:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:12:41] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:12:41] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-24 03:12:41] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:12:41] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:12:41] [INFO ] Time to serialize gal into /tmp/CTLFireability6040423067392290327.gal : 2 ms
[2024-05-24 03:12:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3235846092010915802.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/CTLFireability6040423067392290327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3235846092010915802.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,210928,0.049436,5244,2,1947,5,9447,6,0,243,7660,0


Converting to forward existential form...Done !
original formula: !(E(!(((p112==1)&&(p117==1))) U (p126==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(((p112==1)&&(p117==1)))) * (p126==1))] = FALSE
Hit Full ! (commute/partial/dont) 66/0/12
(forward)formula 0,0,0.127516,8412,1,0,8,21247,16,1,489,21954,4
FORMULA HealthRecord-PT-10-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 68 transition count 135
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 68 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 62 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 62 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 101 place count 62 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 60 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 60 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 58 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 58 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 115 place count 58 transition count 106
Applied a total of 115 rules in 6 ms. Remains 58 /112 variables (removed 54) and now considering 106/218 (removed 112) transitions.
[2024-05-24 03:12:41] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
// Phase 1: matrix 103 rows 58 cols
[2024-05-24 03:12:41] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:12:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-24 03:12:42] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2024-05-24 03:12:42] [INFO ] Invariant cache hit.
[2024-05-24 03:12:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:12:42] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-24 03:12:42] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2024-05-24 03:12:42] [INFO ] Invariant cache hit.
[2024-05-24 03:12:42] [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, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:12:42] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:12:42] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:12:42] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:12:42] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 102/160 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 72 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1971 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:12:44] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:12:44] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:12:44] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 105/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 180 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2952 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 7/7 constraints]
After SMT, in 4955ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 4956ms
Starting structural reductions in LTL mode, iteration 1 : 58/112 places, 106/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5083 ms. Remains : 58/112 places, 106/218 transitions.
[2024-05-24 03:12:47] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:12:47] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:12:47] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-24 03:12:47] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:12:47] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:12:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7280283718694823603.gal : 1 ms
[2024-05-24 03:12:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10490650597449152345.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/CTLFireability7280283718694823603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10490650597449152345.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.30127e+06,0.161918,9932,2,1702,5,26497,6,0,334,26617,0


Converting to forward existential form...Done !
original formula: EF(((AG((p120==0)) * EG(EX((p3==0)))) * (AG(((p43==0)||(p34==0))) * !(A(E(((p54==1)&&(p155==1)) U ((p112==1)&&(p129==1))) U EX((p89==1)))...159
=> equivalent forward existential formula: ([((FwdU(((FwdU(Init,TRUE) * (!(E(TRUE U !((p120==0)))) * EG(EX((p3==0))))) * !(E(TRUE U !(((p43==0)||(p34==0)))...403
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...348
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.78517,65900,1,0,287,354234,251,140,2582,297533,332
FORMULA HealthRecord-PT-10-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 154 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 59 transition count 123
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 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 96 place count 59 transition count 122
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 51 transition count 105
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 51 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 121 place count 51 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 49 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 49 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 49 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 48 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 48 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 133 place count 48 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 136 place count 48 transition count 80
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 4 with 2 rules applied. Total rules applied 138 place count 47 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 45 transition count 77
Applied a total of 140 rules in 30 ms. Remains 45 /112 variables (removed 67) and now considering 77/218 (removed 141) transitions.
[2024-05-24 03:12:48] [INFO ] Flow matrix only has 70 transitions (discarded 7 similar events)
// Phase 1: matrix 70 rows 45 cols
[2024-05-24 03:12:48] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:12:48] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-24 03:12:48] [INFO ] Flow matrix only has 70 transitions (discarded 7 similar events)
[2024-05-24 03:12:48] [INFO ] Invariant cache hit.
[2024-05-24 03:12:48] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-24 03:12:49] [INFO ] Redundant transitions in 15 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-24 03:12:49] [INFO ] Flow matrix only has 70 transitions (discarded 7 similar events)
[2024-05-24 03:12:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 8/45 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-24 03:12:49] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:12:49] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:12:49] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:12:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 69/114 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 58 constraints, problems are : Problem set: 0 solved, 61 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 8/45 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-24 03:12:50] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-24 03:12:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 69/114 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 61/121 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/114 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 121 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 1997ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1998ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/112 places, 77/218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2159 ms. Remains : 45/112 places, 77/218 transitions.
[2024-05-24 03:12:51] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:12:51] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:12:51] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-24 03:12:51] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:12:51] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:12:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6492532982061287170.gal : 1 ms
[2024-05-24 03:12:51] [INFO ] Time to serialize properties into /tmp/CTLFireability84110322385744642.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/CTLFireability6492532982061287170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability84110322385744642.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 -...281
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,212872,0.054247,5760,2,902,5,10863,6,0,246,8904,0


Converting to forward existential form...Done !
original formula: AF(AG(EF((p124==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U (p124==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t16, t17, t19, t20, Intersectio...241
(forward)formula 0,0,0.323407,16252,1,0,142,68663,171,70,1867,51646,174
FORMULA HealthRecord-PT-10-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 128 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 61 transition count 126
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 61 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 92 place count 61 transition count 125
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 101 place count 52 transition count 106
Iterating global reduction 1 with 9 rules applied. Total rules applied 110 place count 52 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 119 place count 52 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 49 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 49 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 49 transition count 86
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 47 transition count 82
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 47 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 137 place count 47 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 140 place count 47 transition count 74
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 4 with 2 rules applied. Total rules applied 142 place count 46 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 44 transition count 71
Applied a total of 144 rules in 17 ms. Remains 44 /112 variables (removed 68) and now considering 71/218 (removed 147) transitions.
[2024-05-24 03:12:51] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
// Phase 1: matrix 63 rows 44 cols
[2024-05-24 03:12:51] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:12:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:12:51] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-24 03:12:51] [INFO ] Invariant cache hit.
[2024-05-24 03:12:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-24 03:12:51] [INFO ] Redundant transitions in 13 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 03:12:51] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-24 03:12:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 03:12:51] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-24 03:12:51] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:12:51] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:12:51] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:12:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 03:12:51] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 6/44 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 03:12:52] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:12:52] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 62/106 variables, 44/62 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/107 variables, and 62 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 6/44 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 62/106 variables, 44/62 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 55/117 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/107 variables, and 117 constraints, problems are : Problem set: 0 solved, 55 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 8/8 constraints]
After SMT, in 1900ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1901ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/112 places, 71/218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2014 ms. Remains : 44/112 places, 71/218 transitions.
[2024-05-24 03:12:53] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:12:53] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:12:53] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-24 03:12:53] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:12:53] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:12:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13874427957630447243.gal : 1 ms
[2024-05-24 03:12:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15423612817605882369.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/CTLFireability13874427957630447243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15423612817605882369.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,266980,0.067381,4976,2,809,5,7495,6,0,233,6441,0


Converting to forward existential form...Done !
original formula: AF(AG(!(A((((((p35==1)&&(p155==1))||(p76==1))&&(p10==1))&&((p35==1)&&(p155==1))) U A((p150==1) U (p57==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(!((E(!(!((E(!((p57==1)) U (!((p150==1)) * !((p57==1)))) + EG(!((p57==1)))))) U (!(((...395
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t13, t14, t18, t19, t32, t33, t41, t42, t48, t4...256
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.45163,87808,1,0,341,495200,177,240,1820,537004,441
FORMULA HealthRecord-PT-10-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-24 03:12:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:12:55] [INFO ] Flatten gal took : 5 ms
Total runtime 162579 ms.

BK_STOP 1716520375996

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640604200770"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-10.tgz
mv HealthRecord-PT-10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;