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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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 72K 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-14-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716520845012

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:20:46] [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:20:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:20:46] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-24 03:20:46] [INFO ] Transformed 162 places.
[2024-05-24 03:20:46] [INFO ] Transformed 347 transitions.
[2024-05-24 03:20:46] [INFO ] Found NUPN structural information;
[2024-05-24 03:20:46] [INFO ] Parsed PT model containing 162 places and 347 transitions and 915 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Support contains 93 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 318/318 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 129 transition count 259
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 129 transition count 259
Applied a total of 66 rules in 23 ms. Remains 129 /162 variables (removed 33) and now considering 259/318 (removed 59) transitions.
[2024-05-24 03:20:46] [INFO ] Flow matrix only has 254 transitions (discarded 5 similar events)
// Phase 1: matrix 254 rows 129 cols
[2024-05-24 03:20:46] [INFO ] Computed 11 invariants in 15 ms
[2024-05-24 03:20:46] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-24 03:20:46] [INFO ] Flow matrix only has 254 transitions (discarded 5 similar events)
[2024-05-24 03:20:46] [INFO ] Invariant cache hit.
[2024-05-24 03:20:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:20:46] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-24 03:20:46] [INFO ] Flow matrix only has 254 transitions (discarded 5 similar events)
[2024-05-24 03:20:46] [INFO ] Invariant cache hit.
[2024-05-24 03:20:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:20:48] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 13 ms to minimize.
[2024-05-24 03:20:48] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:20:48] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2024-05-24 03:20:48] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:20:48] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:20:48] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:20:48] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:20:48] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 2 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 2 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:20:49] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:20:50] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:20:50] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2024-05-24 03:20:50] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:20:50] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:20:50] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 4 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 3 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 2 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:20:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:20:55] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:20:56] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:20:56] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:20:56] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:20:56] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:20:58] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:20:58] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 11/106 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 253/382 variables, 129/235 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:00] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:21:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:02] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:21:02] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:21:02] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:21:02] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:21:02] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:21:02] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:21:02] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 7/244 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 14 (OVERLAPS) 1/383 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:06] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:21:07] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:21:07] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:21:07] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:10] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:21:10] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:21:10] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:21:10] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:14] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/383 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/383 variables, and 254 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:18] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:21:18] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:21:18] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:21:18] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:21:18] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:21:18] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:21:19] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:21:19] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:19] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:21:19] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:21:19] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:21:20] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:21:20] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:20] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:21:20] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:21:22] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:21:22] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:21:22] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:21:22] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:21:22] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:22] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:23] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:21:23] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:21:24] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:21:24] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:21:24] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:21:24] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:21:24] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:21:24] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:21:24] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:21:24] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:21:24] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:21:24] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:21:24] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:21:25] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:21:25] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 15/173 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:26] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:21:26] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:21:26] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:21:26] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:21:26] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:21:28] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 17/190 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:30] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:21:30] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:21:30] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:21:30] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2024-05-24 03:21:30] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 5/195 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:33] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:36] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:21:36] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:21:36] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:40] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:21:40] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:21:40] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:21:40] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:21:40] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:21:40] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 6 ms to minimize.
[2024-05-24 03:21:41] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:21:41] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:21:41] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-24 03:21:45] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:21:45] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:21:45] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:21:45] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:21:45] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:21:45] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:21:45] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:21:46] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:21:46] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:21:46] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:21:46] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:21:46] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:21:46] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:21:46] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 129/383 variables, and 222 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/129 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/258 constraints, Known Traps: 211/211 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Starting structural reductions in LTL mode, iteration 1 : 129/162 places, 259/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60689 ms. Remains : 129/162 places, 259/318 transitions.
Support contains 93 out of 129 places after structural reductions.
[2024-05-24 03:21:47] [INFO ] Flatten gal took : 41 ms
[2024-05-24 03:21:47] [INFO ] Flatten gal took : 17 ms
[2024-05-24 03:21:47] [INFO ] Input system was already deterministic with 259 transitions.
RANDOM walk for 40000 steps (3370 resets) in 1530 ms. (26 steps per ms) remains 38/92 properties
BEST_FIRST walk for 4004 steps (37 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (36 resets) in 38 ms. (102 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (37 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (37 resets) in 35 ms. (111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (37 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (36 resets) in 48 ms. (81 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (40 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (38 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (37 resets) in 14 ms. (266 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (40 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (37 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (36 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (38 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (35 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (37 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (40 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (25 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (40 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (36 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (40 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (40 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (36 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (38 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (36 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (38 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (40 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (39 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (37 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
[2024-05-24 03:21:48] [INFO ] Flow matrix only has 254 transitions (discarded 5 similar events)
[2024-05-24 03:21:48] [INFO ] Invariant cache hit.
[2024-05-24 03:21:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 42/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 40/129 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp35 is UNSAT
At refinement iteration 5 (OVERLAPS) 253/382 variables, 129/140 constraints. Problems are: Problem set: 1 solved, 36 unsolved
[2024-05-24 03:21:48] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:21:48] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:21:48] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:21:48] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:21:48] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:21:48] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
Problem AtomicPropp32 is UNSAT
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 15/155 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-05-24 03:21:49] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:21:50] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
Problem AtomicPropp84 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 8/163 constraints. Problems are: Problem set: 3 solved, 34 unsolved
[2024-05-24 03:21:50] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:21:50] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 2/165 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 166 constraints, problems are : Problem set: 3 solved, 34 unsolved in 3011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 3 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 45/89 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 4/7 constraints. Problems are: Problem set: 3 solved, 34 unsolved
[2024-05-24 03:21:51] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:21:51] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:21:51] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:21:51] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:21:51] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:21:51] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 6/13 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 40/129 variables, 8/21 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 21/42 constraints. Problems are: Problem set: 3 solved, 34 unsolved
[2024-05-24 03:21:51] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:21:51] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:21:51] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:21:51] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
Problem AtomicPropp53 is UNSAT
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 4 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
Problem AtomicPropp53 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 20/62 constraints. Problems are: Problem set: 4 solved, 33 unsolved
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:21:52] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
Problem AtomicPropp83 is UNSAT
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 11/73 constraints. Problems are: Problem set: 5 solved, 32 unsolved
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 3/76 constraints. Problems are: Problem set: 5 solved, 32 unsolved
[2024-05-24 03:21:53] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 2/78 constraints. Problems are: Problem set: 5 solved, 32 unsolved
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 7/85 constraints. Problems are: Problem set: 5 solved, 32 unsolved
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:21:54] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:21:55] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:21:55] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:21:55] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 2 ms to minimize.
[2024-05-24 03:21:55] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:21:55] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:21:55] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:21:55] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:21:55] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:21:55] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 15/100 constraints. Problems are: Problem set: 5 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/100 constraints. Problems are: Problem set: 5 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 253/382 variables, 129/229 constraints. Problems are: Problem set: 5 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/382 variables, 32/261 constraints. Problems are: Problem set: 5 solved, 32 unsolved
[2024-05-24 03:21:56] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/383 variables, and 262 constraints, problems are : Problem set: 5 solved, 32 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 129/129 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 32/37 constraints, Known Traps: 90/90 constraints]
After SMT, in 8041ms problems are : Problem set: 5 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 87 edges and 129 vertex of which 4 / 129 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 524 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 125 transition count 247
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 123 transition count 245
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 42 place count 89 transition count 178
Iterating global reduction 2 with 34 rules applied. Total rules applied 76 place count 89 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 89 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 86 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 86 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 86 place count 86 transition count 168
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 88 place count 85 transition count 167
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 96 place count 81 transition count 184
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 114 place count 81 transition count 184
Applied a total of 114 rules in 59 ms. Remains 81 /129 variables (removed 48) and now considering 184/259 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 81/129 places, 184/259 transitions.
RANDOM walk for 40000 steps (2530 resets) in 723 ms. (55 steps per ms) remains 20/32 properties
BEST_FIRST walk for 4004 steps (43 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (48 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (43 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (41 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (43 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (46 resets) in 27 ms. (143 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (47 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (41 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (44 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (31 resets) in 23 ms. (166 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4002 steps (46 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (45 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (40 resets) in 20 ms. (190 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (46 resets) in 26 ms. (148 steps per ms) remains 14/14 properties
[2024-05-24 03:21:56] [INFO ] Flow matrix only has 177 transitions (discarded 7 similar events)
// Phase 1: matrix 177 rows 81 cols
[2024-05-24 03:21:56] [INFO ] Computed 9 invariants in 8 ms
[2024-05-24 03:21:56] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-24 03:21:56] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:21:56] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:21:56] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 5 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:21:58] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 177/258 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 131 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2435 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-24 03:21:59] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:21:59] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:21:59] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:21:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:21:59] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 177/258 variables, 81/133 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 14/150 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-24 03:21:59] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:21:59] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:21:59] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-24 03:21:59] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 154 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1202 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 47/47 constraints]
After SMT, in 3653ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 11 properties in 1498 ms.
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 184/184 transitions.
Graph (complete) has 375 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 56 transition count 136
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 56 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 51 place count 54 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 53 place count 54 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 56 place count 54 transition count 129
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 51 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 49 transition count 140
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 49 transition count 134
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 43 transition count 134
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 98 place count 43 transition count 134
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 102 place count 43 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 41 transition count 129
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 41 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 40 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 40 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 39 transition count 123
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 39 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 39 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 39 transition count 117
Applied a total of 116 rules in 43 ms. Remains 39 /81 variables (removed 42) and now considering 117/184 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 39/81 places, 117/184 transitions.
RANDOM walk for 40000 steps (3016 resets) in 595 ms. (67 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (514 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (537 resets) in 25 ms. (1538 steps per ms) remains 3/3 properties
BEST_FIRST walk for 32807 steps (430 resets) in 34 ms. (937 steps per ms) remains 0/3 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-14-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:22:02] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:22:02] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:22:02] [INFO ] Input system was already deterministic with 259 transitions.
Support contains 85 out of 129 places (down from 87) after GAL structural reductions.
Computed a total of 13 stabilizing places and 23 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 149 edges and 129 vertex of which 4 / 129 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 59 place count 69 transition count 143
Iterating global reduction 0 with 58 rules applied. Total rules applied 117 place count 69 transition count 143
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 123 place count 63 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 129 place count 63 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 135 place count 63 transition count 125
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 137 place count 63 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 141 place count 61 transition count 121
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 61 transition count 121
Applied a total of 142 rules in 25 ms. Remains 61 /129 variables (removed 68) and now considering 121/259 (removed 138) transitions.
[2024-05-24 03:22:02] [INFO ] Flow matrix only has 116 transitions (discarded 5 similar events)
// Phase 1: matrix 116 rows 61 cols
[2024-05-24 03:22:02] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:22:02] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:22:02] [INFO ] Flow matrix only has 116 transitions (discarded 5 similar events)
[2024-05-24 03:22:02] [INFO ] Invariant cache hit.
[2024-05-24 03:22:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:22:02] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-24 03:22:02] [INFO ] Redundant transitions in 16 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-24 03:22:02] [INFO ] Flow matrix only has 116 transitions (discarded 5 similar events)
[2024-05-24 03:22:02] [INFO ] Invariant cache hit.
[2024-05-24 03:22:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-24 03:22:02] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:22:02] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:22:02] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:22:02] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:22:02] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:22:03] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 115/176 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 1/177 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 77 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2570 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-24 03:22:05] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:22:05] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-24 03:22:05] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 115/176 variables, 61/79 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 120/199 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 1/177 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 200 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4407 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 9/9 constraints]
After SMT, in 7028ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 7032ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/129 places, 121/259 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7188 ms. Remains : 61/129 places, 121/259 transitions.
[2024-05-24 03:22:09] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:22:09] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:22:09] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-24 03:22:09] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:22:09] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:22:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6038277424110997027.gal : 4 ms
[2024-05-24 03:22:09] [INFO ] Time to serialize properties into /tmp/CTLFireability16791456996624250034.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6038277424110997027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16791456996624250034.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.93753e+06,0.574863,21080,2,5149,5,74676,6,0,359,88908,0


Converting to forward existential form...Done !
original formula: A(A(E((p26==1) U (p112!=1)) U E((((p46==1) * E((p111==1) U (p70==1))) + (E((p112==1) U (p35==1)) * ((p134==1)||(p101==1)))) U AG(((p99==1...196
=> equivalent forward existential formula: [((Init * !(EG(!((p63==1))))) * !(E(!((p63==1)) U (!(!((E(!(E((((p46==1) * E((p111==1) U (p70==1))) + (E((p112==...624
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t2...368
(forward)formula 0,0,15.4787,399792,1,0,531,2.29216e+06,287,254,2793,2.35776e+06,631
FORMULA HealthRecord-PT-14-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 182 edges and 129 vertex of which 6 / 129 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 62 place count 64 transition count 135
Iterating global reduction 0 with 61 rules applied. Total rules applied 123 place count 64 transition count 135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 131 place count 56 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 139 place count 56 transition count 119
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 145 place count 56 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 146 place count 55 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 55 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 148 place count 54 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 149 place count 54 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 152 place count 54 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 54 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 52 transition count 101
Applied a total of 158 rules in 18 ms. Remains 52 /129 variables (removed 77) and now considering 101/259 (removed 158) transitions.
[2024-05-24 03:22:25] [INFO ] Flow matrix only has 96 transitions (discarded 5 similar events)
// Phase 1: matrix 96 rows 52 cols
[2024-05-24 03:22:25] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:22:25] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:22:25] [INFO ] Flow matrix only has 96 transitions (discarded 5 similar events)
[2024-05-24 03:22:25] [INFO ] Invariant cache hit.
[2024-05-24 03:22:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:22:25] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-24 03:22:25] [INFO ] Redundant transitions in 14 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-24 03:22:25] [INFO ] Flow matrix only has 96 transitions (discarded 5 similar events)
[2024-05-24 03:22:25] [INFO ] Invariant cache hit.
[2024-05-24 03:22:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 8/52 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:22:25] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:22:25] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:22:25] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:22:25] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 95/147 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 66 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 8/52 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:22:27] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:22:27] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 95/147 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 85/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/148 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/148 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 153 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2277 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 6/6 constraints]
After SMT, in 4096ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4097ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/129 places, 101/259 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4230 ms. Remains : 52/129 places, 101/259 transitions.
[2024-05-24 03:22:29] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:22:29] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:22:29] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-24 03:22:29] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:22:29] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:22:29] [INFO ] Time to serialize gal into /tmp/CTLFireability13697196501590799153.gal : 3 ms
[2024-05-24 03:22:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7741932953958287597.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/CTLFireability13697196501590799153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7741932953958287597.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.18876e+06,0.292615,13856,2,1951,5,45915,6,0,302,52497,0


Converting to forward existential form...Done !
original formula: AG((EG((p4==0)) + !(E(A((p105==1) U (p47==1)) U (p46==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EG((p4==0)))),!((E(!((p47==1)) U (!((p105==1)) * !((p47==1)))) + EG(!((p47==1)))))) ...175
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...351
(forward)formula 0,0,8.34789,217160,1,0,509,1.16515e+06,233,256,2224,1.5071e+06,588
FORMULA HealthRecord-PT-14-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 72 transition count 147
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 72 transition count 147
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 121 place count 65 transition count 133
Iterating global reduction 0 with 7 rules applied. Total rules applied 128 place count 65 transition count 133
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 137 place count 65 transition count 124
Applied a total of 137 rules in 12 ms. Remains 65 /129 variables (removed 64) and now considering 124/259 (removed 135) transitions.
[2024-05-24 03:22:37] [INFO ] Flow matrix only has 121 transitions (discarded 3 similar events)
// Phase 1: matrix 121 rows 65 cols
[2024-05-24 03:22:37] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:22:37] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 03:22:37] [INFO ] Flow matrix only has 121 transitions (discarded 3 similar events)
[2024-05-24 03:22:37] [INFO ] Invariant cache hit.
[2024-05-24 03:22:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:22:37] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-24 03:22:37] [INFO ] Flow matrix only has 121 transitions (discarded 3 similar events)
[2024-05-24 03:22:37] [INFO ] Invariant cache hit.
[2024-05-24 03:22:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:22:38] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:22:38] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:22:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:22:38] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:22:38] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:22:38] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:22:38] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:22:38] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:22:38] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:22:38] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:22:38] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:22:39] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:22:39] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:22:39] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:22:39] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 120/185 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 1/186 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 90 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3570 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:22:41] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:22:41] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:22:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/185 variables, 65/97 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 123/220 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 1/186 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 221 constraints, problems are : Problem set: 0 solved, 123 unsolved in 6144 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 23/23 constraints]
After SMT, in 9755ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 9756ms
Starting structural reductions in LTL mode, iteration 1 : 65/129 places, 124/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9869 ms. Remains : 65/129 places, 124/259 transitions.
[2024-05-24 03:22:47] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:22:47] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:22:47] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-24 03:22:47] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:22:47] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:22:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10702207038537542564.gal : 2 ms
[2024-05-24 03:22:47] [INFO ] Time to serialize properties into /tmp/CTLFireability5652814313657732147.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/CTLFireability10702207038537542564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5652814313657732147.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.4585e+06,1.85436,56252,2,9063,5,181945,6,0,380,266024,0


Converting to forward existential form...Done !
original formula: AX(((((p13==1) + A((AF(((p116==1)&&(p129==1))) * (p161==1)) U (p25!=1))) * (EF(!(E((p118==1) U ((p89==1)&&(p159==1))))) + (!(A((p14==1) U...213
=> equivalent forward existential formula: (((([FwdG((FwdU((EY(Init) * !((p13==1))),!((p25!=1))) * !((p25!=1))),!(((p116==1)&&(p129==1))))] = FALSE * [((Fw...523
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...473
Hit Full ! (commute/partial/dont) 121/0/3
(forward)formula 0,1,17.4279,409344,1,0,460,2.25018e+06,303,197,2957,2.2049e+06,475
FORMULA HealthRecord-PT-14-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 183 edges and 129 vertex of which 4 / 129 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 64 place count 63 transition count 132
Iterating global reduction 0 with 63 rules applied. Total rules applied 127 place count 63 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 136 place count 54 transition count 114
Iterating global reduction 0 with 9 rules applied. Total rules applied 145 place count 54 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 154 place count 54 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 157 place count 51 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 160 place count 51 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 163 place count 48 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 166 place count 48 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 175 place count 48 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 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 2 with 2 rules applied. Total rules applied 178 place count 47 transition count 79
Applied a total of 178 rules in 28 ms. Remains 47 /129 variables (removed 82) and now considering 79/259 (removed 180) transitions.
[2024-05-24 03:23:05] [INFO ] Flow matrix only has 75 transitions (discarded 4 similar events)
// Phase 1: matrix 75 rows 47 cols
[2024-05-24 03:23:05] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:23:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 03:23:05] [INFO ] Flow matrix only has 75 transitions (discarded 4 similar events)
[2024-05-24 03:23:05] [INFO ] Invariant cache hit.
[2024-05-24 03:23:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:23:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-24 03:23:05] [INFO ] Redundant transitions in 13 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-24 03:23:05] [INFO ] Flow matrix only has 75 transitions (discarded 4 similar events)
[2024-05-24 03:23:05] [INFO ] Invariant cache hit.
[2024-05-24 03:23:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 8/47 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-24 03:23:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:23:05] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 74/121 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/122 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 59 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1106 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 8/47 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-24 03:23:06] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 74/121 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 63/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 1/122 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 123 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints]
After SMT, in 2514ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2515ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/129 places, 79/259 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2654 ms. Remains : 47/129 places, 79/259 transitions.
[2024-05-24 03:23:07] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:23:07] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:23:07] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 03:23:07] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:23:07] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:23:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2285728866618572780.gal : 1 ms
[2024-05-24 03:23:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17265233617013354078.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/CTLFireability2285728866618572780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17265233617013354078.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,568626,0.167574,9200,2,1695,5,29930,6,0,261,26598,0


Converting to forward existential form...Done !
original formula: EF(AG(((p40==1)&&((p80!=1)||(p151==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p40==1)&&((p80!=1)||(p151==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t8, t9, t10, t11, t13, t14, t16, t17, t21, t22, t33, t34, t48, t49, t...272
(forward)formula 0,0,0.566948,19588,1,0,151,85818,175,64,1863,70819,166
FORMULA HealthRecord-PT-14-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 68 transition count 139
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 68 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 127 place count 63 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 132 place count 63 transition count 129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 137 place count 63 transition count 124
Applied a total of 137 rules in 3 ms. Remains 63 /129 variables (removed 66) and now considering 124/259 (removed 135) transitions.
[2024-05-24 03:23:08] [INFO ] Flow matrix only has 121 transitions (discarded 3 similar events)
// Phase 1: matrix 121 rows 63 cols
[2024-05-24 03:23:08] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:23:08] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 03:23:08] [INFO ] Flow matrix only has 121 transitions (discarded 3 similar events)
[2024-05-24 03:23:08] [INFO ] Invariant cache hit.
[2024-05-24 03:23:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:23:08] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-24 03:23:08] [INFO ] Flow matrix only has 121 transitions (discarded 3 similar events)
[2024-05-24 03:23:08] [INFO ] Invariant cache hit.
[2024-05-24 03:23:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:23:09] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:23:09] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:23:09] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 120/183 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 1/184 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 76 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2343 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:23:11] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:23:11] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 120/183 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 123/200 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 1/184 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 201 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3893 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 5/5 constraints]
After SMT, in 6282ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 6284ms
Starting structural reductions in LTL mode, iteration 1 : 63/129 places, 124/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6390 ms. Remains : 63/129 places, 124/259 transitions.
[2024-05-24 03:23:14] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:23:14] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:23:14] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-24 03:23:14] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:23:14] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:23:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2678661746256947232.gal : 1 ms
[2024-05-24 03:23:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3093215624483798470.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/CTLFireability2678661746256947232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3093215624483798470.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.55424e+06,0.899681,30532,2,7375,5,91306,6,0,372,135540,0


Converting to forward existential form...Done !
original formula: !(E(EG((E((p22==1) U (p149==1)) * EX((p134==1)))) U ((((!(EX((p121==1))) + !(AF((p136==1)))) + (p65==1)) * AF((p100==1))) + !(A((EF((p46=...191
=> equivalent forward existential formula: ([((FwdU(Init,EG((E((p22==1) U (p149==1)) * EX((p134==1))))) * ((!(EX((p121==1))) + !(!(EG(!((p136==1)))))) + (p...457
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...430
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,16.1629,390740,1,0,689,2.28293e+06,307,336,2966,2.20081e+06,762
FORMULA HealthRecord-PT-14-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 72 transition count 146
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 72 transition count 146
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 121 place count 65 transition count 132
Iterating global reduction 0 with 7 rules applied. Total rules applied 128 place count 65 transition count 132
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 137 place count 65 transition count 123
Applied a total of 137 rules in 2 ms. Remains 65 /129 variables (removed 64) and now considering 123/259 (removed 136) transitions.
[2024-05-24 03:23:31] [INFO ] Flow matrix only has 119 transitions (discarded 4 similar events)
// Phase 1: matrix 119 rows 65 cols
[2024-05-24 03:23:31] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:23:31] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 03:23:31] [INFO ] Flow matrix only has 119 transitions (discarded 4 similar events)
[2024-05-24 03:23:31] [INFO ] Invariant cache hit.
[2024-05-24 03:23:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:23:31] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-24 03:23:31] [INFO ] Flow matrix only has 119 transitions (discarded 4 similar events)
[2024-05-24 03:23:31] [INFO ] Invariant cache hit.
[2024-05-24 03:23:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:23:31] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:23:31] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:23:31] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:23:32] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:23:32] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:23:32] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:23:32] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:23:32] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 118/183 variables, 65/83 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 1/184 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:23:34] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:34] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/184 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 0/184 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 86 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4098 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:23:35] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 118/183 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 122/208 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 1/184 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/184 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 209 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3950 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 11/11 constraints]
After SMT, in 8083ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8086ms
Starting structural reductions in LTL mode, iteration 1 : 65/129 places, 123/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8196 ms. Remains : 65/129 places, 123/259 transitions.
[2024-05-24 03:23:39] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:23:39] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:23:39] [INFO ] Input system was already deterministic with 123 transitions.
[2024-05-24 03:23:39] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:23:39] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:23:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6008764612504317852.gal : 2 ms
[2024-05-24 03:23:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4000074662750604412.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/CTLFireability6008764612504317852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4000074662750604412.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.75933e+06,0.18932,9784,2,1655,5,25915,6,0,376,25149,0


Converting to forward existential form...Done !
original formula: EF(((((p110==0)&&(p102==0)) * ((p107==1) * ((EX((p151==1)) + (p82==0)) + (p159==0)))) + ((AX(AG((p140==1))) * A((p67==1) U (p45==1))) * (...188
=> equivalent forward existential formula: ((([(EY(((FwdU(Init,TRUE) * ((p110==0)&&(p102==0))) * (p107==1))) * (p151==1))] != FALSE + [(((FwdU(Init,TRUE) *...481
(forward)formula 0,1,0.200603,10048,1,0,11,25915,11,4,576,25149,5
FORMULA HealthRecord-PT-14-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 69 transition count 141
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 69 transition count 141
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 127 place count 62 transition count 127
Iterating global reduction 0 with 7 rules applied. Total rules applied 134 place count 62 transition count 127
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 142 place count 62 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 144 place count 60 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 146 place count 60 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 148 place count 58 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 58 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 156 place count 58 transition count 103
Applied a total of 156 rules in 10 ms. Remains 58 /129 variables (removed 71) and now considering 103/259 (removed 156) transitions.
[2024-05-24 03:23:39] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
// Phase 1: matrix 100 rows 58 cols
[2024-05-24 03:23:39] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:23:39] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:23:39] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-24 03:23:39] [INFO ] Invariant cache hit.
[2024-05-24 03:23:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:23:39] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 03:23:39] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-24 03:23:39] [INFO ] Invariant cache hit.
[2024-05-24 03:23:39] [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, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:23:40] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:40] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 99/157 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:23:40] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:23:40] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:23:40] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:23:40] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:23:40] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 75 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2501 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 99/157 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 102/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/158 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 180 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3879 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 10/10 constraints]
After SMT, in 6410ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6411ms
Starting structural reductions in LTL mode, iteration 1 : 58/129 places, 103/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6514 ms. Remains : 58/129 places, 103/259 transitions.
[2024-05-24 03:23:46] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:23:46] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:23:46] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-24 03:23:46] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:23:46] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:23:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11291329106726104200.gal : 1 ms
[2024-05-24 03:23:46] [INFO ] Time to serialize properties into /tmp/CTLFireability7386993917056639711.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/CTLFireability11291329106726104200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7386993917056639711.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.36397e+06,0.361589,17036,2,3013,5,61088,6,0,331,66418,0


Converting to forward existential form...Done !
original formula: (AG(!(A((p15==1) U AX(EG((p161==1)))))) * EX(((((p136==1)||(((p87==1)||(p37==0))&&(p73==0)))||((p35==0)||(p159==0)))||(p59==0))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(!(EX(!(EG((p161==1))))))))) * !(E(!(!(EX(!(EG((p161==1)))))) U (!((p15==1)) * !(!(E...301
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...333
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.56642,75152,1,0,285,377402,233,137,2487,426743,332
FORMULA HealthRecord-PT-14-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 67 transition count 137
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 67 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 131 place count 60 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 138 place count 60 transition count 123
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 147 place count 60 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 148 place count 59 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 149 place count 59 transition count 111
Applied a total of 149 rules in 9 ms. Remains 59 /129 variables (removed 70) and now considering 111/259 (removed 148) transitions.
[2024-05-24 03:23:48] [INFO ] Flow matrix only has 108 transitions (discarded 3 similar events)
// Phase 1: matrix 108 rows 59 cols
[2024-05-24 03:23:48] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:23:48] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 03:23:48] [INFO ] Flow matrix only has 108 transitions (discarded 3 similar events)
[2024-05-24 03:23:48] [INFO ] Invariant cache hit.
[2024-05-24 03:23:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:23:48] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-24 03:23:49] [INFO ] Flow matrix only has 108 transitions (discarded 3 similar events)
[2024-05-24 03:23:49] [INFO ] Invariant cache hit.
[2024-05-24 03:23:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:23:49] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:23:49] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:23:49] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:23:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 107/166 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:23:50] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:23:50] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:23:50] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:23:50] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/167 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 77 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3003 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 107/166 variables, 59/77 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 110/187 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/167 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/167 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 190 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4785 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 11/11 constraints]
After SMT, in 7856ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 7858ms
Starting structural reductions in LTL mode, iteration 1 : 59/129 places, 111/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8012 ms. Remains : 59/129 places, 111/259 transitions.
[2024-05-24 03:23:56] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:23:56] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:23:56] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-24 03:23:56] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:23:56] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:23:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2551902068186193628.gal : 1 ms
[2024-05-24 03:23:56] [INFO ] Time to serialize properties into /tmp/CTLFireability2344418273667119125.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/CTLFireability2551902068186193628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2344418273667119125.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.04321e+06,0.370487,16048,2,3079,5,52060,6,0,343,57992,0


Converting to forward existential form...Done !
original formula: (E(!((((EX((p7!=1)) + (p104==1)) + ((p43==1)||(p140==1))) + (p139!=1))) U (p28==1)) + AF(EX(E((p142==1) U (p143==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(E(!((((EX((p7!=1)) + (p104==1)) + ((p43==1)||(p140==1))) + (p139!=1))) U (p28==1)))),!(EX(E((p14...185
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...358
(forward)formula 0,0,2.3012,66384,1,0,309,312966,252,153,2559,350646,309
FORMULA HealthRecord-PT-14-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 166 edges and 129 vertex of which 6 / 129 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 65 place count 61 transition count 129
Iterating global reduction 0 with 64 rules applied. Total rules applied 129 place count 61 transition count 129
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 138 place count 52 transition count 111
Iterating global reduction 0 with 9 rules applied. Total rules applied 147 place count 52 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 156 place count 52 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 159 place count 49 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 162 place count 49 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 165 place count 46 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 168 place count 46 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 177 place count 46 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 179 place count 46 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 183 place count 44 transition count 74
Applied a total of 183 rules in 15 ms. Remains 44 /129 variables (removed 85) and now considering 74/259 (removed 185) transitions.
[2024-05-24 03:23:59] [INFO ] Flow matrix only has 69 transitions (discarded 5 similar events)
// Phase 1: matrix 69 rows 44 cols
[2024-05-24 03:23:59] [INFO ] Computed 9 invariants in 5 ms
[2024-05-24 03:23:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:23:59] [INFO ] Flow matrix only has 69 transitions (discarded 5 similar events)
[2024-05-24 03:23:59] [INFO ] Invariant cache hit.
[2024-05-24 03:23:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:23:59] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-24 03:23:59] [INFO ] Redundant transitions in 14 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-24 03:23:59] [INFO ] Flow matrix only has 69 transitions (discarded 5 similar events)
[2024-05-24 03:23:59] [INFO ] Invariant cache hit.
[2024-05-24 03:23:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 68/112 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/113 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 59 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 68/112 variables, 44/64 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 1/113 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 123 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1474 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 11/11 constraints]
After SMT, in 2606ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2607ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/129 places, 74/259 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2737 ms. Remains : 44/129 places, 74/259 transitions.
[2024-05-24 03:24:01] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:24:01] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:01] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-24 03:24:01] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:24:01] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:24:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2690765731457633613.gal : 1 ms
[2024-05-24 03:24:01] [INFO ] Time to serialize properties into /tmp/CTLFireability17665330543688157018.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/CTLFireability2690765731457633613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17665330543688157018.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,457087,0.064718,6336,2,1855,5,16849,6,0,243,10618,0


Converting to forward existential form...Done !
original formula: (EF((EG((p16==0)) * (p34==1))) * EG(EF((p54==0))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U (EG((p16==0)) * (p34==1)))),E(TRUE U (p54==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t13, t14, t29, t30, Intersection with reachabl...226
(forward)formula 0,1,7.98464,217108,1,0,358,1.29283e+06,175,202,1823,1.18369e+06,420
FORMULA HealthRecord-PT-14-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 : 129/129 places, 259/259 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 69 transition count 141
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 69 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 124 place count 65 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 128 place count 65 transition count 133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 134 place count 65 transition count 127
Applied a total of 134 rules in 2 ms. Remains 65 /129 variables (removed 64) and now considering 127/259 (removed 132) transitions.
[2024-05-24 03:24:10] [INFO ] Flow matrix only has 124 transitions (discarded 3 similar events)
// Phase 1: matrix 124 rows 65 cols
[2024-05-24 03:24:10] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:24:10] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-24 03:24:10] [INFO ] Flow matrix only has 124 transitions (discarded 3 similar events)
[2024-05-24 03:24:10] [INFO ] Invariant cache hit.
[2024-05-24 03:24:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:10] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-24 03:24:10] [INFO ] Flow matrix only has 124 transitions (discarded 3 similar events)
[2024-05-24 03:24:10] [INFO ] Invariant cache hit.
[2024-05-24 03:24:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:24:10] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:24:10] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:24:10] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:24:10] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:24:10] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:24:10] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:24:11] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:24:11] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:24:11] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:24:11] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 123/188 variables, 65/84 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 1/189 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 85 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3335 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:24:13] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:24:13] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:24:13] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:24:14] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:24:14] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-24 03:24:14] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:24:14] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 123/188 variables, 65/91 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 126/217 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 1/189 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 218 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5607 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 17/17 constraints]
After SMT, in 8988ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 8989ms
Starting structural reductions in LTL mode, iteration 1 : 65/129 places, 127/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9131 ms. Remains : 65/129 places, 127/259 transitions.
[2024-05-24 03:24:19] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:24:19] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:19] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-24 03:24:19] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:19] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:19] [INFO ] Time to serialize gal into /tmp/CTLFireability10247805420459826906.gal : 2 ms
[2024-05-24 03:24:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13859373151467412965.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/CTLFireability10247805420459826906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13859373151467412965.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34793e+06,0.34075,15636,2,6614,5,46278,6,0,383,56812,0


Converting to forward existential form...Done !
original formula: A(E((A(AF(((p68==1)&&(p159==1))) U (EX((p14==1)) + AF((p132==1)))) + A((p52==1) U ((p104!=1) * EG((p24==1))))) U AF((EF((((p16==1)&&(p35=...277
=> equivalent forward existential formula: [((Init * !(EG(!((p137==1))))) * !(E(!((p137==1)) U (!(E((!((E(!((EX((p14==1)) + !(EG(!((p132==1)))))) U (!(!(EG...578
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...458
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
Detected timeout of ITS tools.
[2024-05-24 03:24:49] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:24:49] [INFO ] Applying decomposition
[2024-05-24 03:24:49] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17090897245612601592.txt' '-o' '/tmp/graph17090897245612601592.bin' '-w' '/tmp/graph17090897245612601592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17090897245612601592.bin' '-l' '-1' '-v' '-w' '/tmp/graph17090897245612601592.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:24:49] [INFO ] Decomposing Gal with order
[2024-05-24 03:24:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:24:49] [INFO ] Removed a total of 126 redundant transitions.
[2024-05-24 03:24:49] [INFO ] Flatten gal took : 43 ms
[2024-05-24 03:24:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 6 ms.
[2024-05-24 03:24:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6638805706639995962.gal : 2 ms
[2024-05-24 03:24:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16130642709889594930.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/CTLFireability6638805706639995962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16130642709889594930.ctl'

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 -...263
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.34793e+06,0.036527,4968,163,120,2052,1226,260,3535,128,4764,0


Converting to forward existential form...Done !
original formula: A(E((A(AF(((u5.p68==1)&&(i10.u13.p159==1))) U (EX((u0.p14==1)) + AF((i10.u14.p132==1)))) + A((u3.p52==1) U ((i8.u9.p104!=1) * EG((i1.u2.p...382
=> equivalent forward existential formula: [((Init * !(EG(!((i10.u14.p137==1))))) * !(E(!((i10.u14.p137==1)) U (!(E((!((E(!((EX((u0.p14==1)) + !(EG(!((i10....745
Reverse transition relation is NOT exact ! Due to transitions t5, t67, t68, t69, t70, t71, t84, t85, t101, t103, t104, t105, t122, u0.t62, u0.t63, u0.t64, ...690
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,0.723597,37440,1,0,74844,4717,1527,118188,622,10598,85316
FORMULA HealthRecord-PT-14-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 72 transition count 147
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 72 transition count 147
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 119 place count 67 transition count 137
Iterating global reduction 0 with 5 rules applied. Total rules applied 124 place count 67 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 130 place count 67 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 66 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 66 transition count 128
Applied a total of 132 rules in 5 ms. Remains 66 /129 variables (removed 63) and now considering 128/259 (removed 131) transitions.
[2024-05-24 03:24:50] [INFO ] Flow matrix only has 125 transitions (discarded 3 similar events)
// Phase 1: matrix 125 rows 66 cols
[2024-05-24 03:24:50] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:24:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-24 03:24:50] [INFO ] Flow matrix only has 125 transitions (discarded 3 similar events)
[2024-05-24 03:24:50] [INFO ] Invariant cache hit.
[2024-05-24 03:24:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:50] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-24 03:24:50] [INFO ] Flow matrix only has 125 transitions (discarded 3 similar events)
[2024-05-24 03:24:50] [INFO ] Invariant cache hit.
[2024-05-24 03:24:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-24 03:24:50] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:24:50] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:24:50] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:24:50] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:24:50] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:24:51] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:24:51] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 124/190 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 1/191 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 83 constraints, problems are : Problem set: 0 solved, 127 unsolved in 2743 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-24 03:24:53] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:24:53] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 124/190 variables, 66/84 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 127/211 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-24 03:24:56] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/191 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 213 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6735 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 10/10 constraints]
After SMT, in 9520ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 9521ms
Starting structural reductions in LTL mode, iteration 1 : 66/129 places, 128/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9635 ms. Remains : 66/129 places, 128/259 transitions.
[2024-05-24 03:24:59] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:59] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:59] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-24 03:24:59] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:59] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9899727552882610691.gal : 1 ms
[2024-05-24 03:24:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10028385186645719065.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/CTLFireability9899727552882610691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10028385186645719065.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,3.47156e+06,1.97909,54924,2,15231,5,208411,6,0,388,265501,0


Converting to forward existential form...Done !
original formula: AF((((AG((!(E((p60==1) U (p132==1))) * AF((p77==0)))) * AX(AF((p29==0)))) * (AX(((p116==0)||(p143==0))) * (!(E(((p35==1)&&(p159==1)) U (p...392
=> equivalent forward existential formula: [FwdG(Init,!((((!(E(TRUE U !((!(E((p60==1) U (p132==1))) * !(EG(!((p77==0)))))))) * !(EX(!(!(EG(!((p29==0)))))))...568
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...370
Detected timeout of ITS tools.
[2024-05-24 03:25:29] [INFO ] Flatten gal took : 21 ms
[2024-05-24 03:25:29] [INFO ] Applying decomposition
[2024-05-24 03:25:29] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1598432422504795342.txt' '-o' '/tmp/graph1598432422504795342.bin' '-w' '/tmp/graph1598432422504795342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1598432422504795342.bin' '-l' '-1' '-v' '-w' '/tmp/graph1598432422504795342.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:25:29] [INFO ] Decomposing Gal with order
[2024-05-24 03:25:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:25:29] [INFO ] Removed a total of 122 redundant transitions.
[2024-05-24 03:25:29] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:25:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 3 ms.
[2024-05-24 03:25:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16522604010800556335.gal : 1 ms
[2024-05-24 03:25:29] [INFO ] Time to serialize properties into /tmp/CTLFireability2460847892459824680.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/CTLFireability16522604010800556335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2460847892459824680.ctl'

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 -...263
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,3.47156e+06,0.05262,6080,147,113,4143,1101,278,7433,129,5858,0


Converting to forward existential form...Done !
original formula: AF((((AG((!(E((u4.p60==1) U (i10.u16.p132==1))) * AF((i4.u7.p77==0)))) * AX(AF((u1.p29==0)))) * (AX(((i7.u13.p116==0)||(i10.u16.p143==0))...530
=> equivalent forward existential formula: [FwdG(Init,!((((!(E(TRUE U !((!(E((u4.p60==1) U (i10.u16.p132==1))) * !(EG(!((i4.u7.p77==0)))))))) * !(EX(!(!(EG...728
Reverse transition relation is NOT exact ! Due to transitions t5, t122, u0.t65, u0.t66, u1.t58, u1.t59, u1.t60, u1.t61, u1.t62, u1.t63, i2.t54, i2.u3.t53, ...524
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,0.808312,38288,1,0,76040,4219,1735,130945,648,10611,79401
FORMULA HealthRecord-PT-14-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 188 edges and 129 vertex of which 6 / 129 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 65 place count 61 transition count 129
Iterating global reduction 0 with 64 rules applied. Total rules applied 129 place count 61 transition count 129
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 138 place count 52 transition count 111
Iterating global reduction 0 with 9 rules applied. Total rules applied 147 place count 52 transition count 111
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 157 place count 52 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 49 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 49 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 166 place count 46 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 169 place count 46 transition count 86
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 178 place count 46 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 46 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 44 transition count 73
Applied a total of 184 rules in 21 ms. Remains 44 /129 variables (removed 85) and now considering 73/259 (removed 186) transitions.
[2024-05-24 03:25:30] [INFO ] Flow matrix only has 68 transitions (discarded 5 similar events)
// Phase 1: matrix 68 rows 44 cols
[2024-05-24 03:25:30] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:25:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:25:30] [INFO ] Flow matrix only has 68 transitions (discarded 5 similar events)
[2024-05-24 03:25:30] [INFO ] Invariant cache hit.
[2024-05-24 03:25:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:30] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 03:25:30] [INFO ] Redundant transitions in 13 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-24 03:25:30] [INFO ] Flow matrix only has 68 transitions (discarded 5 similar events)
[2024-05-24 03:25:30] [INFO ] Invariant cache hit.
[2024-05-24 03:25:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-24 03:25:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:25:31] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 67/111 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 1/112 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 56 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-24 03:25:32] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:25:32] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 67/111 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 57/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 1/112 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 115 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1238 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints]
After SMT, in 2322ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2326ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/129 places, 73/259 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2461 ms. Remains : 44/129 places, 73/259 transitions.
[2024-05-24 03:25:33] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:25:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:25:33] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-24 03:25:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:25:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:25:33] [INFO ] Time to serialize gal into /tmp/CTLFireability724842549826422514.gal : 11 ms
[2024-05-24 03:25:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15545848676403740027.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/CTLFireability724842549826422514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15545848676403740027.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,457087,0.071535,6624,2,1256,5,15706,6,0,242,14492,0


Converting to forward existential form...Done !
original formula: EG((p65==0))
=> equivalent forward existential formula: [FwdG(Init,(p65==0))] != FALSE
Hit Full ! (commute/partial/dont) 70/0/3
(forward)formula 0,1,0.231221,11640,1,0,8,45119,19,4,1309,29461,8
FORMULA HealthRecord-PT-14-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 68 transition count 138
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 68 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 125 place count 65 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 128 place count 65 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 64 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 64 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 63 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 63 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 135 place count 63 transition count 124
Applied a total of 135 rules in 21 ms. Remains 63 /129 variables (removed 66) and now considering 124/259 (removed 135) transitions.
[2024-05-24 03:25:33] [INFO ] Flow matrix only has 120 transitions (discarded 4 similar events)
// Phase 1: matrix 120 rows 63 cols
[2024-05-24 03:25:33] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:25:33] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:25:33] [INFO ] Flow matrix only has 120 transitions (discarded 4 similar events)
[2024-05-24 03:25:33] [INFO ] Invariant cache hit.
[2024-05-24 03:25:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:33] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-24 03:25:33] [INFO ] Flow matrix only has 120 transitions (discarded 4 similar events)
[2024-05-24 03:25:33] [INFO ] Invariant cache hit.
[2024-05-24 03:25:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:25:34] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:25:34] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:25:34] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:25:34] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:25:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 119/182 variables, 63/78 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 1/183 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 79 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2877 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 119/182 variables, 63/78 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 123/201 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 1/183 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 202 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3921 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 5/5 constraints]
After SMT, in 6883ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 6884ms
Starting structural reductions in LTL mode, iteration 1 : 63/129 places, 124/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7025 ms. Remains : 63/129 places, 124/259 transitions.
[2024-05-24 03:25:40] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:25:40] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:40] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-24 03:25:40] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:40] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1774891717337464850.gal : 1 ms
[2024-05-24 03:25:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12473020610773911850.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/CTLFireability1774891717337464850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12473020610773911850.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.1234e+06,0.502216,19372,2,8949,5,65826,6,0,369,76565,0


Converting to forward existential form...Done !
original formula: E(EG((!(((AG((p136==1)) + (p54==1)) + ((p116==1)&&(p141==1)))) * EX(((p39==1)||((p122==1)&&(p24==1)))))) U EF((EX(!(EF((p4==1)))) * AX(((...198
=> equivalent forward existential formula: [((FwdU(FwdU(Init,EG((!(((!(E(TRUE U !((p136==1)))) + (p54==1)) + ((p116==1)&&(p141==1)))) * EX(((p39==1)||((p12...275
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...350
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.32871,168912,1,0,295,832179,285,141,3111,797179,348
FORMULA HealthRecord-PT-14-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 65 transition count 133
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 65 transition count 133
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 134 place count 59 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 140 place count 59 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 143 place count 59 transition count 118
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 146 place count 56 transition count 109
Iterating global reduction 1 with 3 rules applied. Total rules applied 149 place count 56 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 152 place count 53 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 155 place count 53 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 163 place count 53 transition count 95
Applied a total of 163 rules in 4 ms. Remains 53 /129 variables (removed 76) and now considering 95/259 (removed 164) transitions.
[2024-05-24 03:25:47] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
// Phase 1: matrix 92 rows 53 cols
[2024-05-24 03:25:47] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:25:47] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:25:47] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2024-05-24 03:25:47] [INFO ] Invariant cache hit.
[2024-05-24 03:25:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:47] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-24 03:25:47] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2024-05-24 03:25:47] [INFO ] Invariant cache hit.
[2024-05-24 03:25:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-24 03:25:47] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:25:47] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 91/144 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 1/145 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 65 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1644 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-24 03:25:49] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:25:49] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:25:49] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 91/144 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 94/161 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 162 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2594 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 5/5 constraints]
After SMT, in 4285ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 4286ms
Starting structural reductions in LTL mode, iteration 1 : 53/129 places, 95/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4386 ms. Remains : 53/129 places, 95/259 transitions.
[2024-05-24 03:25:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:51] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-24 03:25:51] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:25:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:51] [INFO ] Time to serialize gal into /tmp/CTLFireability8110832555773941762.gal : 1 ms
[2024-05-24 03:25:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17453512402335792562.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/CTLFireability8110832555773941762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17453512402335792562.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,709326,0.113846,8048,2,1453,5,23620,6,0,303,21746,0


Converting to forward existential form...Done !
original formula: E(AF(!((((AX((p122==1)) * (p35==1)) * ((p11==1)&&(p5!=1))) * (p122!=1)))) U !(EF(((!(AG((p35==1))) * (p116==1)) * (p125==1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(!((((!(EX(!((p122==1)))) * (p35==1)) * ((p11==1)&&(p5!=1))) * (p122!=1))))))) * !(E(TRUE U ((...221
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t14, t15, t16, t17, t19, t21, t23, t41, t42, t...277
(forward)formula 0,1,1.04062,38044,1,0,190,189796,221,83,2360,167272,229
FORMULA HealthRecord-PT-14-CTLFireability-2023-13 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 : 129/129 places, 259/259 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 66 transition count 135
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 66 transition count 135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 134 place count 58 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 142 place count 58 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 151 place count 58 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 154 place count 55 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 157 place count 55 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 52 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 52 transition count 95
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 172 place count 52 transition count 86
Applied a total of 172 rules in 2 ms. Remains 52 /129 variables (removed 77) and now considering 86/259 (removed 173) transitions.
[2024-05-24 03:25:52] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 52 cols
[2024-05-24 03:25:52] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:25:52] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:25:52] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:25:52] [INFO ] Invariant cache hit.
[2024-05-24 03:25:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:52] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-24 03:25:52] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:25:52] [INFO ] Invariant cache hit.
[2024-05-24 03:25:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:25:52] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
[2024-05-24 03:25:52] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 5 ms to minimize.
[2024-05-24 03:25:52] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:25:53] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:25:53] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/134 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 67 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1499 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/134 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 85/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/135 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 152 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1887 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints]
After SMT, in 3427ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 3429ms
Starting structural reductions in LTL mode, iteration 1 : 52/129 places, 86/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3516 ms. Remains : 52/129 places, 86/259 transitions.
[2024-05-24 03:25:55] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:25:56] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:56] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-24 03:25:56] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:25:56] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:25:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16674856565432295810.gal : 18 ms
[2024-05-24 03:25:56] [INFO ] Time to serialize properties into /tmp/CTLFireability17561654547348263500.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/CTLFireability16674856565432295810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17561654547348263500.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,614314,0.177327,11140,2,3500,5,35025,6,0,290,33866,0


Converting to forward existential form...Done !
original formula: !(A(E(((p16==1)&&(p159==1)) U (p151==1)) U (AG((EG((p37==1)) + !((((p82==1)&&(p159==1))||(p18==1))))) + AG(AX(AF((p118==1)))))))
=> equivalent forward existential formula: ([FwdG(EY(FwdU(((FwdU(Init,!((!(E(TRUE U !((EG((p37==1)) + !((((p82==1)&&(p159==1))||(p18==1))))))) + !(E(TRUE U...491
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t17, t18, t19, t21, t23, t38, t39, ...313
Hit Full ! (commute/partial/dont) 83/0/3
(forward)formula 0,1,7.59665,238808,1,0,493,1.26784e+06,220,249,2279,1.4997e+06,561
FORMULA HealthRecord-PT-14-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-24 03:26:03] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:26:03] [INFO ] Flatten gal took : 5 ms
Total runtime 317543 ms.

BK_STOP 1716521163816

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-14"
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-14, 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-171640604200802"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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