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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:30 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 73K 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-15-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716520975143

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:22:56] [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:22:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:22:56] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-24 03:22:56] [INFO ] Transformed 163 places.
[2024-05-24 03:22:56] [INFO ] Transformed 348 transitions.
[2024-05-24 03:22:56] [INFO ] Found NUPN structural information;
[2024-05-24 03:22:56] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 177 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 90 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 319/319 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 122 transition count 242
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 122 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 121 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 121 transition count 240
Applied a total of 84 rules in 28 ms. Remains 121 /163 variables (removed 42) and now considering 240/319 (removed 79) transitions.
[2024-05-24 03:22:56] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
// Phase 1: matrix 233 rows 121 cols
[2024-05-24 03:22:56] [INFO ] Computed 13 invariants in 13 ms
[2024-05-24 03:22:56] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-24 03:22:56] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2024-05-24 03:22:56] [INFO ] Invariant cache hit.
[2024-05-24 03:22:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:22:57] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2024-05-24 03:22:57] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2024-05-24 03:22:57] [INFO ] Invariant cache hit.
[2024-05-24 03:22:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:22:58] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 13 ms to minimize.
[2024-05-24 03:22:58] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:22:58] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:22:58] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
[2024-05-24 03:22:58] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:22:58] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:22:58] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 9 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:22:59] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:23:00] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:00] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:23:00] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:23:00] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:23:00] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:23:00] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:23:00] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:23:00] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 0 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 9 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 4 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:23:02] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 3 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:23:03] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:23:04] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:23:04] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:23:04] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:23:04] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:23:04] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 15/88 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:05] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:23:05] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:23:05] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 232/353 variables, 121/212 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:08] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (OVERLAPS) 1/354 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:11] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:23:12] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:23:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:23:12] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:23:12] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:23:12] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:15] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/354 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/354 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 17 (OVERLAPS) 0/354 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 222 constraints, problems are : Problem set: 0 solved, 239 unsolved in 23574 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:21] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:23:22] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:23:22] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:23:22] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:23:22] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:23:22] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:22] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:23:22] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:22] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:22] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:23] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:23] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:23:23] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:24] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:23:24] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:23:24] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:23:24] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:24] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:24] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:23:24] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:25] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:23:25] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:23:25] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:23:26] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:26] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 0 ms to minimize.
[2024-05-24 03:23:26] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 0 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:27] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:28] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:23:28] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:23:28] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:23:28] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (OVERLAPS) 232/353 variables, 121/266 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 239/505 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:30] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:23:31] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-24 03:23:35] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:23:36] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 17 (OVERLAPS) 1/354 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 510 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 136/136 constraints]
After SMT, in 53787ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 53803ms
Starting structural reductions in LTL mode, iteration 1 : 121/163 places, 240/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54231 ms. Remains : 121/163 places, 240/319 transitions.
Support contains 90 out of 121 places after structural reductions.
[2024-05-24 03:23:51] [INFO ] Flatten gal took : 45 ms
[2024-05-24 03:23:51] [INFO ] Flatten gal took : 18 ms
[2024-05-24 03:23:51] [INFO ] Input system was already deterministic with 240 transitions.
RANDOM walk for 40000 steps (3691 resets) in 2301 ms. (17 steps per ms) remains 38/73 properties
BEST_FIRST walk for 4002 steps (46 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (47 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (49 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (45 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (45 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (47 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (44 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (49 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (49 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (43 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (48 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (46 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (44 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (49 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (47 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (48 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (46 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (47 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (45 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (48 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (47 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (47 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (39 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (60 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (47 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (44 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (49 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (48 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
[2024-05-24 03:23:52] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2024-05-24 03:23:52] [INFO ] Invariant cache hit.
[2024-05-24 03:23:52] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp60 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/91 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 36 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 3 (OVERLAPS) 30/121 variables, 8/13 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:23:52] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/33 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 15/48 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 232/353 variables, 121/169 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/171 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 14/185 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/186 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 1/354 variables, 1/187 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 0/354 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 187 constraints, problems are : Problem set: 2 solved, 35 unsolved in 4607 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 2 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 34/88 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 8/13 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-05-24 03:23:56] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:23:56] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 5/18 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 35 unsolved
Problem AtomicPropp51 is UNSAT
At refinement iteration 5 (OVERLAPS) 33/121 variables, 8/26 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 44/70 constraints. Problems are: Problem set: 3 solved, 34 unsolved
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 11/81 constraints. Problems are: Problem set: 3 solved, 34 unsolved
[2024-05-24 03:23:57] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 8/89 constraints. Problems are: Problem set: 3 solved, 34 unsolved
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:23:58] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 4/93 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/93 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 232/353 variables, 121/214 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 34/248 constraints. Problems are: Problem set: 3 solved, 34 unsolved
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2024-05-24 03:23:59] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 5/253 constraints. Problems are: Problem set: 3 solved, 34 unsolved
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:24:00] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 7/260 constraints. Problems are: Problem set: 3 solved, 34 unsolved
[2024-05-24 03:24:01] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 1/261 constraints. Problems are: Problem set: 3 solved, 34 unsolved
[2024-05-24 03:24:01] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
SMT process timed out in 9681ms, After SMT, problems are : Problem set: 3 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 240/240 transitions.
Graph (trivial) has 29 edges and 121 vertex of which 4 / 121 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 506 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 226
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 116 transition count 224
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 33 place count 91 transition count 174
Iterating global reduction 2 with 25 rules applied. Total rules applied 58 place count 91 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 90 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 90 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 90 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 89 transition count 171
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 89 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 89 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 88 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 88 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 87 transition count 168
Applied a total of 68 rules in 96 ms. Remains 87 /121 variables (removed 34) and now considering 168/240 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 87/121 places, 168/240 transitions.
RANDOM walk for 40000 steps (4024 resets) in 445 ms. (89 steps per ms) remains 25/34 properties
BEST_FIRST walk for 4004 steps (54 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (52 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (47 resets) in 7 ms. (500 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (57 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (52 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (53 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (50 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (53 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (56 resets) in 6 ms. (572 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (55 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (50 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (55 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (52 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (54 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (51 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (55 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (54 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (59 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (52 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (52 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (70 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (50 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (56 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (54 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (56 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
// Phase 1: matrix 168 rows 87 cols
[2024-05-24 03:24:02] [INFO ] Computed 12 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 26/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 19/87 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 5 ms to minimize.
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:24:02] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-24 03:24:03] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:24:03] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 168/255 variables, 87/113 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-24 03:24:03] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 114 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 26/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-24 03:24:03] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:24:03] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:24:03] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:24:03] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 19/87 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-24 03:24:03] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:24:03] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:24:03] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:24:03] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 168/255 variables, 87/122 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 25/147 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-24 03:24:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:24:04] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-24 03:24:04] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 3 ms to minimize.
[2024-05-24 03:24:04] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:24:04] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (OVERLAPS) 0/255 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 152 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1756 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 28/28 constraints]
After SMT, in 3092ms problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 21 different solutions.
Parikh walk visited 22 properties in 2394 ms.
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 168/168 transitions.
Graph (complete) has 385 edges and 87 vertex of which 84 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 3 place count 84 transition count 166
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 82 transition count 165
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 28 place count 60 transition count 121
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 60 transition count 121
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 54 transition count 109
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 54 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 54 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 53 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 53 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 52 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 52 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 75 place count 52 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 51 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 79 place count 50 transition count 104
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 86 place count 50 transition count 97
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 93 place count 43 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 94 place count 43 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 96 place count 42 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 42 transition count 108
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 98 place count 42 transition count 287
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 100 place count 41 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 107 place count 41 transition count 279
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 108 place count 40 transition count 232
Iterating global reduction 6 with 1 rules applied. Total rules applied 109 place count 40 transition count 232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 110 place count 39 transition count 230
Iterating global reduction 6 with 1 rules applied. Total rules applied 111 place count 39 transition count 230
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 131 place count 39 transition count 210
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 144 place count 39 transition count 210
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 156 place count 39 transition count 210
Applied a total of 156 rules in 54 ms. Remains 39 /87 variables (removed 48) and now considering 210/168 (removed -42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 39/87 places, 210/168 transitions.
RANDOM walk for 40000 steps (2979 resets) in 691 ms. (57 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (545 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-05-24 03:24:07] [INFO ] Flow matrix only has 150 transitions (discarded 60 similar events)
// Phase 1: matrix 150 rows 39 cols
[2024-05-24 03:24:07] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:24:07] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/31 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/39 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 150/189 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 27/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/31 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/39 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:24:08] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:24:08] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 150/189 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 232ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 210/210 transitions.
Graph (trivial) has 8 edges and 39 vertex of which 2 / 39 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 200 edges and 38 vertex of which 30 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 30 transition count 190
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 46 place count 27 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 26 transition count 131
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 26 transition count 131
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 25 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 25 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 24 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 24 transition count 126
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 58 place count 24 transition count 120
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 3 with 6 rules applied. Total rules applied 64 place count 21 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 82 place count 21 transition count 99
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 112 place count 21 transition count 99
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 21 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 121 place count 21 transition count 90
Applied a total of 121 rules in 18 ms. Remains 21 /39 variables (removed 18) and now considering 90/210 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 21/39 places, 90/210 transitions.
RANDOM walk for 40000 steps (5040 resets) in 609 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1441 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2309 steps, run visited all 1 properties in 19 ms. (steps per millisecond=121 )
Probabilistic random walk after 2309 steps, saw 645 distinct states, run finished after 22 ms. (steps per millisecond=104 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-15-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:24:08] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:24:08] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:24:08] [INFO ] Input system was already deterministic with 240 transitions.
Computed a total of 13 stabilizing places and 22 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Graph (trivial) has 165 edges and 121 vertex of which 6 / 121 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.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 54 place count 65 transition count 134
Iterating global reduction 0 with 53 rules applied. Total rules applied 107 place count 65 transition count 134
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 114 place count 58 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 121 place count 58 transition count 120
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 128 place count 58 transition count 113
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 55 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 55 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 137 place count 52 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 140 place count 52 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 149 place count 52 transition count 89
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 151 place count 52 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 50 transition count 85
Applied a total of 155 rules in 19 ms. Remains 50 /121 variables (removed 71) and now considering 85/240 (removed 155) transitions.
[2024-05-24 03:24:08] [INFO ] Flow matrix only has 79 transitions (discarded 6 similar events)
// Phase 1: matrix 79 rows 50 cols
[2024-05-24 03:24:08] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:24:08] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-24 03:24:08] [INFO ] Flow matrix only has 79 transitions (discarded 6 similar events)
[2024-05-24 03:24:08] [INFO ] Invariant cache hit.
[2024-05-24 03:24:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:08] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-24 03:24:08] [INFO ] Redundant transitions in 21 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-24 03:24:08] [INFO ] Flow matrix only has 79 transitions (discarded 6 similar events)
[2024-05-24 03:24:08] [INFO ] Invariant cache hit.
[2024-05-24 03:24:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:24:08] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:24:08] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:24:09] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 78/128 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 64 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 78/128 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 84/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 148 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1787 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
After SMT, in 3410ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3412ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/121 places, 85/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3569 ms. Remains : 50/121 places, 85/240 transitions.
[2024-05-24 03:24:12] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:12] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:12] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-24 03:24:12] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:12] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2690005315426551208.gal : 2 ms
[2024-05-24 03:24:12] [INFO ] Time to serialize properties into /tmp/CTLFireability313648437791711409.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/CTLFireability2690005315426551208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability313648437791711409.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 -...282
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,830093,0.122719,8664,2,1439,5,25832,6,0,276,22655,0


Converting to forward existential form...Done !
original formula: AG(E((EG((p145==1)) + EF((p122==1))) U A((p2!=1) U (p71!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((EG((p145==1)) + E(TRUE U (p122==1))) U !((E(!((p71!=1)) U (!((p2!=1)) * !((p71!=1)))) +...185
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, t18, t19, t78, Inters...246
(forward)formula 0,0,1.02125,38616,1,0,244,202052,204,115,2104,167660,307
FORMULA HealthRecord-PT-15-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 : 121/121 places, 240/240 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 65 transition count 132
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 65 transition count 132
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 118 place count 59 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 124 place count 59 transition count 120
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 59 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 57 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 57 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 55 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 55 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 144 place count 55 transition count 98
Applied a total of 144 rules in 5 ms. Remains 55 /121 variables (removed 66) and now considering 98/240 (removed 142) transitions.
[2024-05-24 03:24:13] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
// Phase 1: matrix 95 rows 55 cols
[2024-05-24 03:24:13] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:24:13] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:24:13] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2024-05-24 03:24:13] [INFO ] Invariant cache hit.
[2024-05-24 03:24:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:13] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-24 03:24:13] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2024-05-24 03:24:13] [INFO ] Invariant cache hit.
[2024-05-24 03:24:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:24:13] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:24:13] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/150 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 67 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1594 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:24:15] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 94/149 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 97/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/150 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 165 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2760 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 3/3 constraints]
After SMT, in 4391ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 4393ms
Starting structural reductions in LTL mode, iteration 1 : 55/121 places, 98/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4495 ms. Remains : 55/121 places, 98/240 transitions.
[2024-05-24 03:24:17] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:24:17] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:24:17] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-24 03:24:17] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:17] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:17] [INFO ] Time to serialize gal into /tmp/CTLFireability4660207508384085267.gal : 2 ms
[2024-05-24 03:24:17] [INFO ] Time to serialize properties into /tmp/CTLFireability5315135896911163366.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/CTLFireability4660207508384085267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5315135896911163366.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,707868,0.217148,12008,2,3481,5,40482,6,0,314,33504,0


Converting to forward existential form...Done !
original formula: (EX(AG((p141==0))) + EF((p123==1)))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((p141==0)))))] != FALSE + [(FwdU(Init,TRUE) * (p123==1))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...272
(forward)formula 0,1,1.17635,36132,1,0,170,164472,215,77,2372,111995,207
FORMULA HealthRecord-PT-15-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Graph (trivial) has 155 edges and 121 vertex of which 6 / 121 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 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 61 transition count 128
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 61 transition count 128
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 122 place count 52 transition count 110
Iterating global reduction 0 with 9 rules applied. Total rules applied 131 place count 52 transition count 110
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 141 place count 52 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 144 place count 49 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 147 place count 49 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 150 place count 46 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 153 place count 46 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 162 place count 46 transition count 76
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 164 place count 46 transition count 74
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 168 place count 44 transition count 72
Applied a total of 168 rules in 18 ms. Remains 44 /121 variables (removed 77) and now considering 72/240 (removed 168) transitions.
[2024-05-24 03:24:18] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
// Phase 1: matrix 67 rows 44 cols
[2024-05-24 03:24:18] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:24:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:24:18] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
[2024-05-24 03:24:18] [INFO ] Invariant cache hit.
[2024-05-24 03:24:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:18] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 03:24:18] [INFO ] Redundant transitions in 11 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-24 03:24:18] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
[2024-05-24 03:24:18] [INFO ] Invariant cache hit.
[2024-05-24 03:24:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-24 03:24:19] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:24:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:24:19] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 66/110 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/111 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 57 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1044 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: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 66/110 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 58/114 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 1/111 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 115 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1100 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: 3/3 constraints]
After SMT, in 2169ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2170ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/121 places, 72/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2290 ms. Remains : 44/121 places, 72/240 transitions.
[2024-05-24 03:24:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:21] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-24 03:24:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9677582848450568369.gal : 1 ms
[2024-05-24 03:24:21] [INFO ] Time to serialize properties into /tmp/CTLFireability16805866627211969786.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/CTLFireability9677582848450568369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16805866627211969786.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,484789,0.119059,9228,2,1907,5,26379,6,0,240,22128,0


Converting to forward existential form...Done !
original formula: AF(EG(((p90==1)&&(p160==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p90==1)&&(p160==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, Intersection with reachable at e...220
(forward)formula 0,0,1.81716,64668,1,0,220,281710,164,136,1738,363218,254
FORMULA HealthRecord-PT-15-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 : 121/121 places, 240/240 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 65 transition count 132
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 65 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 120 place count 57 transition count 116
Iterating global reduction 0 with 8 rules applied. Total rules applied 128 place count 57 transition count 116
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 135 place count 57 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 138 place count 54 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 141 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 144 place count 51 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 147 place count 51 transition count 94
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 156 place count 51 transition count 85
Applied a total of 156 rules in 5 ms. Remains 51 /121 variables (removed 70) and now considering 85/240 (removed 155) transitions.
[2024-05-24 03:24:23] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 51 cols
[2024-05-24 03:24:23] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:24:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:24:23] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:24:23] [INFO ] Invariant cache hit.
[2024-05-24 03:24:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:23] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-24 03:24:23] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:24:23] [INFO ] Invariant cache hit.
[2024-05-24 03:24:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:24:23] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:24:23] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/132 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 63 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1297 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:24:24] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 81/132 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 84/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/133 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 148 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1997 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
After SMT, in 3314ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3316ms
Starting structural reductions in LTL mode, iteration 1 : 51/121 places, 85/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3399 ms. Remains : 51/121 places, 85/240 transitions.
[2024-05-24 03:24:26] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:24:26] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:26] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-24 03:24:26] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:26] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11849776188608023101.gal : 1 ms
[2024-05-24 03:24:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6351605324793142316.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/CTLFireability11849776188608023101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6351605324793142316.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,742860,0.159049,10328,2,2070,5,33441,6,0,285,30335,0


Converting to forward existential form...Done !
original formula: !(E(AF(E(((!((p55==1)&&(p160==1)))&&(p55==1)) U AG((p35==1)))) U EX(((p157==1) + EX(AX((p54==1)))))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,!(EG(!(E(((!((p55==1)&&(p160==1)))&&(p55==1)) U !(E(TRUE U !((p35==1)))))))))) * (p157==1))] = F...291
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t31, t32, t36, t37, Inter...247
(forward)formula 0,1,2.82208,93124,1,0,209,502465,202,101,2134,438965,262
FORMULA HealthRecord-PT-15-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 72 transition count 146
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 72 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 68 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 68 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 109 place count 68 transition count 135
Applied a total of 109 rules in 10 ms. Remains 68 /121 variables (removed 53) and now considering 135/240 (removed 105) transitions.
[2024-05-24 03:24:29] [INFO ] Flow matrix only has 132 transitions (discarded 3 similar events)
// Phase 1: matrix 132 rows 68 cols
[2024-05-24 03:24:29] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:24:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:24:29] [INFO ] Flow matrix only has 132 transitions (discarded 3 similar events)
[2024-05-24 03:24:29] [INFO ] Invariant cache hit.
[2024-05-24 03:24:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:29] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-24 03:24:29] [INFO ] Flow matrix only has 132 transitions (discarded 3 similar events)
[2024-05-24 03:24:29] [INFO ] Invariant cache hit.
[2024-05-24 03:24:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 03:24:29] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:24:30] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:24:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:24:30] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 03:24:30] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:24:30] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 131/199 variables, 68/83 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 1/200 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 03:24:31] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 85 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3820 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 03:24:33] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:24:33] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:24:33] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 03:24:34] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 03:24:34] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 03:24:34] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:24:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 03:24:34] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 03:24:35] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 131/199 variables, 68/93 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 134/227 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 1/200 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 228 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6629 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 16/16 constraints]
After SMT, in 10500ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 10502ms
Starting structural reductions in LTL mode, iteration 1 : 68/121 places, 135/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10633 ms. Remains : 68/121 places, 135/240 transitions.
[2024-05-24 03:24:39] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:24:39] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:24:39] [INFO ] Input system was already deterministic with 135 transitions.
[2024-05-24 03:24:39] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:39] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5023640629694178250.gal : 2 ms
[2024-05-24 03:24:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13396026407227198914.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/CTLFireability5023640629694178250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13396026407227198914.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX((((A((p129==1) U (((p17==1)&&(p36==1))&&((p55==1)&&(p150==1)))) + EG((((p68==0)||(p45==0))||(p80==0)))) + (EG((p139==0)) * EG((p104==0...279
=> equivalent forward existential formula: (([(FwdU(((EY(Init) * !((EG((p139==0)) * EG((p104==0))))) * !(EG((((p68==0)||(p45==0))||(p80==0))))),!((((p17==1...582
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...428
(forward)formula 0,1,10.3373,291848,1,0,815,1.69272e+06,324,404,3042,1.60182e+06,965
FORMULA HealthRecord-PT-15-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 71 transition count 142
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 71 transition count 142
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 65 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 65 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 117 place count 65 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 64 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 64 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 63 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 63 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 124 place count 63 transition count 117
Applied a total of 124 rules in 12 ms. Remains 63 /121 variables (removed 58) and now considering 117/240 (removed 123) transitions.
[2024-05-24 03:24:50] [INFO ] Flow matrix only has 112 transitions (discarded 5 similar events)
// Phase 1: matrix 112 rows 63 cols
[2024-05-24 03:24:50] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 03:24:50] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-24 03:24:50] [INFO ] Flow matrix only has 112 transitions (discarded 5 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 53 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-24 03:24:50] [INFO ] Flow matrix only has 112 transitions (discarded 5 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/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:24:50] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:24:51] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:24:51] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 111/174 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 1/175 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 78 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2565 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:24:53] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:24:53] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:24:53] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:24:53] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:24:53] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 111/174 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 116/198 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 1/175 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (OVERLAPS) 0/175 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 199 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3804 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 8/8 constraints]
After SMT, in 6406ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 6408ms
Starting structural reductions in LTL mode, iteration 1 : 63/121 places, 117/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6535 ms. Remains : 63/121 places, 117/240 transitions.
[2024-05-24 03:24:56] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:24:56] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:24:56] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-24 03:24:56] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:56] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11633436421698154691.gal : 1 ms
[2024-05-24 03:24:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16704037183674264795.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/CTLFireability11633436421698154691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16704037183674264795.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.62398e+06,0.376241,17668,2,2784,5,60869,6,0,360,66732,0


Converting to forward existential form...Done !
original formula: (AG(A(((AX(((p90==1)&&(p160==1))) * !(AX((p79==1)))) * AF((p152!=1))) U A(!(((p41==1)&&(p95==1))) U !(((p130==1)||(p80==1)))))) * AF(((p0...237
=> equivalent forward existential formula: ((([(FwdU((FwdU(FwdU(Init,TRUE),!(!((E(!(!(((p130==1)||(p80==1)))) U (!(!(((p41==1)&&(p95==1)))) * !(!(((p130==1...1021
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...381
(forward)formula 0,0,9.56999,285052,1,0,550,1.59882e+06,278,267,2698,1.76464e+06,645
FORMULA HealthRecord-PT-15-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 72 transition count 146
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 72 transition count 146
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 104 place count 66 transition count 134
Iterating global reduction 0 with 6 rules applied. Total rules applied 110 place count 66 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 115 place count 66 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 65 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 65 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 64 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 64 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 121 place count 64 transition count 122
Applied a total of 121 rules in 7 ms. Remains 64 /121 variables (removed 57) and now considering 122/240 (removed 118) transitions.
[2024-05-24 03:25:06] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
// Phase 1: matrix 119 rows 64 cols
[2024-05-24 03:25:06] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:25:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:25:06] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
[2024-05-24 03:25:06] [INFO ] Invariant cache hit.
[2024-05-24 03:25:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:06] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-24 03:25:06] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
[2024-05-24 03:25:06] [INFO ] Invariant cache hit.
[2024-05-24 03:25:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:25:07] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 118/182 variables, 64/85 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 1/183 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 86 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2723 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:25:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:25:09] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:25:09] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:25:10] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 118/182 variables, 64/89 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 121/210 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 1/183 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 211 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4638 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 16/16 constraints]
After SMT, in 7404ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 7406ms
Starting structural reductions in LTL mode, iteration 1 : 64/121 places, 122/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7531 ms. Remains : 64/121 places, 122/240 transitions.
[2024-05-24 03:25:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:14] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:25:14] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-24 03:25:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:14] [INFO ] Time to serialize gal into /tmp/CTLFireability18087997097552678123.gal : 1 ms
[2024-05-24 03:25:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3975186471965141914.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/CTLFireability18087997097552678123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3975186471965141914.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EF(AG(((AG((p121==0)) * AF((p30==0))) * AX((p47==0))))) + E((p133==1) U E((E((p29!=1) U ((p111==1)||(p57==1))) * ((p59==1) + AG((p5==1))...191
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((!(E(TRUE U !((p121==0)))) * !(EG(!((p30==0))))) * !(EX(!((p47==0)))))))))] !...319
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...393
(forward)formula 0,1,7.78538,217772,1,0,327,1.22895e+06,272,141,2817,999660,368
FORMULA HealthRecord-PT-15-CTLFireability-2024-07 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 : 121/121 places, 240/240 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 74 transition count 149
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 74 transition count 149
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 69 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 69 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 69 transition count 136
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 67 transition count 130
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 67 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 66 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 66 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 116 place count 66 transition count 125
Applied a total of 116 rules in 9 ms. Remains 66 /121 variables (removed 55) and now considering 125/240 (removed 115) transitions.
[2024-05-24 03:25:22] [INFO ] Flow matrix only has 121 transitions (discarded 4 similar events)
// Phase 1: matrix 121 rows 66 cols
[2024-05-24 03:25:22] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 03:25:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:25:22] [INFO ] Flow matrix only has 121 transitions (discarded 4 similar events)
[2024-05-24 03:25:22] [INFO ] Invariant cache hit.
[2024-05-24 03:25:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:22] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-05-24 03:25:22] [INFO ] Flow matrix only has 121 transitions (discarded 4 similar events)
[2024-05-24 03:25:22] [INFO ] Invariant cache hit.
[2024-05-24 03:25:22] [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, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-24 03:25:22] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:25:22] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:25:22] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-24 03:25:23] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:25:23] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:25:23] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 120/186 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/187 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 83 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-24 03:25:25] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-24 03:25:25] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:25:26] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-24 03:25:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:25:26] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:25:26] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-24 03:25:26] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 120/186 variables, 66/89 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 124/213 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-24 03:25:27] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (OVERLAPS) 1/187 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-24 03:25:30] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-24 03:25:31] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/187 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 18 (OVERLAPS) 0/187 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 217 constraints, problems are : Problem set: 0 solved, 124 unsolved in 9443 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 16/16 constraints]
After SMT, in 12615ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 12616ms
Starting structural reductions in LTL mode, iteration 1 : 66/121 places, 125/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12724 ms. Remains : 66/121 places, 125/240 transitions.
[2024-05-24 03:25:34] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:25:34] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:25:34] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-24 03:25:34] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:25:34] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:25:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14820484069049092587.gal : 2 ms
[2024-05-24 03:25:34] [INFO ] Time to serialize properties into /tmp/CTLFireability8557974756058773097.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/CTLFireability14820484069049092587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8557974756058773097.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.64274e+06,0.809482,31436,2,3757,5,119785,6,0,383,144218,0


Converting to forward existential form...Done !
original formula: EG(((((EG(((p126==1)||(p25==1))) + EX((p148==0))) + (!(A((p145==1) U ((p36==1)&&(p160==1)))) + AF((p96==0)))) + (((p82==1)||(p49==1)) + (...255
=> equivalent forward existential formula: [FwdG(Init,((((EG(((p126==1)||(p25==1))) + EX((p148==0))) + (!(!((E(!(((p36==1)&&(p160==1))) U (!((p145==1)) * !...375
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...450
(forward)formula 0,1,11.8661,344764,1,0,534,1.99915e+06,291,235,2951,2.08682e+06,590
FORMULA HealthRecord-PT-15-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 64 transition count 130
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 64 transition count 130
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 56 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 56 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 139 place count 56 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 53 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 53 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 50 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 50 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 159 place count 50 transition count 82
Applied a total of 159 rules in 6 ms. Remains 50 /121 variables (removed 71) and now considering 82/240 (removed 158) transitions.
[2024-05-24 03:25:46] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 50 cols
[2024-05-24 03:25:46] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:25:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:25:46] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:25:46] [INFO ] Invariant cache hit.
[2024-05-24 03:25:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:46] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-24 03:25:46] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:25:46] [INFO ] Invariant cache hit.
[2024-05-24 03:25:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:25:47] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:25:47] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 78/128 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/129 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 62 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:25:48] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:25:48] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 78/128 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 81/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2280 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints]
After SMT, in 3554ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3555ms
Starting structural reductions in LTL mode, iteration 1 : 50/121 places, 82/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3647 ms. Remains : 50/121 places, 82/240 transitions.
[2024-05-24 03:25:50] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:25:50] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:50] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-24 03:25:50] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:50] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:50] [INFO ] Time to serialize gal into /tmp/CTLFireability6362945456395116927.gal : 1 ms
[2024-05-24 03:25:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17305488500585436801.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/CTLFireability6362945456395116927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17305488500585436801.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EX(AX(EF((p52==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!(E(TRUE U (p52==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t31, t32, Intersection wi...237
(forward)formula 0,0,0.592559,22984,1,0,143,103382,181,66,2041,86389,175
FORMULA HealthRecord-PT-15-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 69 transition count 140
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 69 transition count 140
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 112 place count 61 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 61 transition count 124
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 128 place count 61 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 59 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 59 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 57 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 57 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 142 place count 57 transition count 100
Applied a total of 142 rules in 5 ms. Remains 57 /121 variables (removed 64) and now considering 100/240 (removed 140) transitions.
[2024-05-24 03:25:51] [INFO ] Flow matrix only has 97 transitions (discarded 3 similar events)
// Phase 1: matrix 97 rows 57 cols
[2024-05-24 03:25:51] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:25:51] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:25:51] [INFO ] Flow matrix only has 97 transitions (discarded 3 similar events)
[2024-05-24 03:25:51] [INFO ] Invariant cache hit.
[2024-05-24 03:25:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:51] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-05-24 03:25:51] [INFO ] Flow matrix only has 97 transitions (discarded 3 similar events)
[2024-05-24 03:25:51] [INFO ] Invariant cache hit.
[2024-05-24 03:25:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-24 03:25:52] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 96/153 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-24 03:25:52] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:25:52] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/154 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/154 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 76 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2700 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-24 03:25:54] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:25:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:25:54] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-24 03:25:54] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:25:54] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:25:54] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-24 03:25:54] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-24 03:25:54] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 96/153 variables, 57/83 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 99/182 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 1/154 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (OVERLAPS) 0/154 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 183 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4095 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 17/17 constraints]
After SMT, in 6823ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 6824ms
Starting structural reductions in LTL mode, iteration 1 : 57/121 places, 100/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6920 ms. Remains : 57/121 places, 100/240 transitions.
[2024-05-24 03:25:58] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:25:58] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:58] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-24 03:25:58] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:58] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8361394012893894631.gal : 2 ms
[2024-05-24 03:25:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4346298542036748893.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/CTLFireability8361394012893894631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4346298542036748893.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.14324e+06,0.456368,20508,2,3933,5,71700,6,0,324,81108,0


Converting to forward existential form...Done !
original formula: AG((EF(EX((p119==0))) * (((p113==0) + AG((p10==0))) + (!(A(((p90==1)&&(p160==1)) U (p29==1))) * ((p4==0)||(p59==0))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U EX((p119==0)))))] = FALSE * [(FwdU(((FwdU(Init,TRUE) * !((!(!((E(!((p29==1)) U (...288
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t22, t24, t...373
(forward)formula 0,0,6.87112,225684,1,0,387,1.26734e+06,234,175,2419,1.36694e+06,409
FORMULA HealthRecord-PT-15-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 64 transition count 130
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 64 transition count 130
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 56 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 56 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 138 place count 56 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 141 place count 53 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 144 place count 53 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 147 place count 50 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 150 place count 50 transition count 91
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 159 place count 50 transition count 82
Applied a total of 159 rules in 2 ms. Remains 50 /121 variables (removed 71) and now considering 82/240 (removed 158) transitions.
[2024-05-24 03:26:05] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 50 cols
[2024-05-24 03:26:05] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:26:05] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:26:05] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:26:05] [INFO ] Invariant cache hit.
[2024-05-24 03:26:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:26:05] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-24 03:26:05] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:26:05] [INFO ] Invariant cache hit.
[2024-05-24 03:26:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:26:05] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:26:05] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 78/128 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/129 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 62 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1314 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:26:06] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 78/128 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 81/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 144 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1923 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
After SMT, in 3257ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3258ms
Starting structural reductions in LTL mode, iteration 1 : 50/121 places, 82/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3342 ms. Remains : 50/121 places, 82/240 transitions.
[2024-05-24 03:26:08] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:26:08] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:26:08] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-24 03:26:08] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:08] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:26:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17027638662601777378.gal : 0 ms
[2024-05-24 03:26:08] [INFO ] Time to serialize properties into /tmp/CTLFireability17197020002629761974.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/CTLFireability17027638662601777378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17197020002629761974.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,599976,0.13235,9256,2,2000,5,27339,6,0,278,24818,0


Converting to forward existential form...Done !
original formula: EX(EF((p23==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (p23==1))] != FALSE
(forward)formula 0,1,0.211805,9520,1,0,9,28225,9,1,559,25939,4
FORMULA HealthRecord-PT-15-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 63 transition count 128
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 63 transition count 128
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 124 place count 55 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 132 place count 55 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 141 place count 55 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 144 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 147 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 150 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 153 place count 49 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 162 place count 49 transition count 79
Applied a total of 162 rules in 5 ms. Remains 49 /121 variables (removed 72) and now considering 79/240 (removed 161) transitions.
[2024-05-24 03:26:08] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 49 cols
[2024-05-24 03:26:08] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:26:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:26:08] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 03:26:08] [INFO ] Invariant cache hit.
[2024-05-24 03:26:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:26:08] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-24 03:26:08] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 03:26:08] [INFO ] Invariant cache hit.
[2024-05-24 03:26:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:26:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:26:09] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 75/124 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/125 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 61 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:26:10] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 75/124 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 78/139 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 140 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1848 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints]
After SMT, in 3123ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3124ms
Starting structural reductions in LTL mode, iteration 1 : 49/121 places, 79/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3220 ms. Remains : 49/121 places, 79/240 transitions.
[2024-05-24 03:26:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:11] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 03:26:11] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:26:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability7165090459022926585.gal : 1 ms
[2024-05-24 03:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability5512587417980223032.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/CTLFireability7165090459022926585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5512587417980223032.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,484794,0.09679,7916,2,1824,5,21471,6,0,271,19214,0


Converting to forward existential form...Done !
original formula: AG(EX(EF((p55==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U (p55==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, Intersection with reachab...227
(forward)formula 0,0,0.498087,22188,1,0,140,99061,175,65,1966,83827,169
FORMULA HealthRecord-PT-15-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Graph (trivial) has 168 edges and 121 vertex of which 6 / 121 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 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 56 place count 62 transition count 130
Iterating global reduction 0 with 55 rules applied. Total rules applied 111 place count 62 transition count 130
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 120 place count 53 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 129 place count 53 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 138 place count 53 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 141 place count 50 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 144 place count 50 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 48 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 48 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 154 place count 48 transition count 84
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 156 place count 48 transition count 82
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 160 place count 46 transition count 80
Applied a total of 160 rules in 20 ms. Remains 46 /121 variables (removed 75) and now considering 80/240 (removed 160) transitions.
[2024-05-24 03:26:12] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
// Phase 1: matrix 75 rows 46 cols
[2024-05-24 03:26:12] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:26:12] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:26:12] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
[2024-05-24 03:26:12] [INFO ] Invariant cache hit.
[2024-05-24 03:26:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:26:12] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-24 03:26:12] [INFO ] Redundant transitions in 18 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-24 03:26:12] [INFO ] Flow matrix only has 75 transitions (discarded 5 similar events)
[2024-05-24 03:26:12] [INFO ] Invariant cache hit.
[2024-05-24 03:26:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-24 03:26:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-24 03:26:12] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:26:12] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 74/120 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/121 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/121 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 59 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-24 03:26:13] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-24 03:26:13] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 74/120 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 66/126 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 1/121 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 0/121 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 127 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 5/5 constraints]
After SMT, in 2892ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2894ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/121 places, 80/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3013 ms. Remains : 46/121 places, 80/240 transitions.
[2024-05-24 03:26:15] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:26:15] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:15] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-24 03:26:15] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:15] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:26:15] [INFO ] Time to serialize gal into /tmp/CTLFireability2499116205126552625.gal : 0 ms
[2024-05-24 03:26:15] [INFO ] Time to serialize properties into /tmp/CTLFireability11978478710741499671.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/CTLFireability2499116205126552625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11978478710741499671.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,656833,0.170033,10272,2,1753,5,32472,6,0,256,29079,0


Converting to forward existential form...Done !
original formula: AG(EF(((p16==1) + EF((p136==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p16==1) + E(TRUE U (p136==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t33, t34, Intersection with...235
(forward)formula 0,0,0.929336,34096,1,0,151,172190,176,66,1856,137512,179
FORMULA HealthRecord-PT-15-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 69 transition count 140
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 69 transition count 140
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 62 transition count 126
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 62 transition count 126
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 127 place count 62 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 61 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 61 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 60 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 60 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 134 place count 60 transition count 109
Applied a total of 134 rules in 6 ms. Remains 60 /121 variables (removed 61) and now considering 109/240 (removed 131) transitions.
[2024-05-24 03:26:16] [INFO ] Flow matrix only has 106 transitions (discarded 3 similar events)
// Phase 1: matrix 106 rows 60 cols
[2024-05-24 03:26:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:26:16] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:26:16] [INFO ] Flow matrix only has 106 transitions (discarded 3 similar events)
[2024-05-24 03:26:16] [INFO ] Invariant cache hit.
[2024-05-24 03:26:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:26:16] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-24 03:26:16] [INFO ] Flow matrix only has 106 transitions (discarded 3 similar events)
[2024-05-24 03:26:16] [INFO ] Invariant cache hit.
[2024-05-24 03:26:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-24 03:26:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:26:16] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 105/165 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-24 03:26:18] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 1/166 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 82 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3508 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-24 03:26:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:26:20] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:26:20] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:26:20] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:26:20] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:26:20] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-24 03:26:20] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 105/165 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 108/196 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 1/166 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 197 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4264 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 19/19 constraints]
After SMT, in 7803ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7804ms
Starting structural reductions in LTL mode, iteration 1 : 60/121 places, 109/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7914 ms. Remains : 60/121 places, 109/240 transitions.
[2024-05-24 03:26:24] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:26:24] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:26:24] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-24 03:26:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14131462902199555507.gal : 1 ms
[2024-05-24 03:26:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6453089685718895213.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/CTLFireability14131462902199555507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6453089685718895213.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.27284e+06,0.287083,14184,2,2868,5,51877,6,0,345,53358,0


Converting to forward existential form...Done !
original formula: AG((EX(EF((p99==0))) + E((AX((p162!=1)) * !(((p74==1)||((p6==1)&&(p15==1))))) U (p45==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E((!(EX(!((p162!=1)))) * !(((p74==1)||((p6==1)&&(p15==1))))) U (p45==1)))) * !(EX(E(TRUE ...178
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...408
(forward)formula 0,0,2.21453,75676,1,0,381,370482,243,197,2580,501102,357
FORMULA HealthRecord-PT-15-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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

BK_STOP 1716521186579

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-15"
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-15, 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-171640604200810"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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