About the Execution of ITS-Tools for HealthRecord-PT-08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
616.319 | 128787.00 | 168330.00 | 527.90 | TFTTFTTTTFFTTTTF | normal |
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-171640604100754.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-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604100754
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 20:17 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 68K 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-08-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716519891210
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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:04:52] [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:04:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:04:52] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-24 03:04:52] [INFO ] Transformed 156 places.
[2024-05-24 03:04:52] [INFO ] Transformed 326 transitions.
[2024-05-24 03:04:52] [INFO ] Found NUPN structural information;
[2024-05-24 03:04:52] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Support contains 69 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 300/300 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 112 transition count 217
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 112 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 110 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 110 transition count 213
Applied a total of 92 rules in 24 ms. Remains 110 /156 variables (removed 46) and now considering 213/300 (removed 87) transitions.
[2024-05-24 03:04:52] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
// Phase 1: matrix 206 rows 110 cols
[2024-05-24 03:04:52] [INFO ] Computed 13 invariants in 18 ms
[2024-05-24 03:04:53] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-24 03:04:53] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-24 03:04:53] [INFO ] Invariant cache hit.
[2024-05-24 03:04:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:04:53] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-24 03:04:53] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-24 03:04:53] [INFO ] Invariant cache hit.
[2024-05-24 03:04:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:04:54] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 19 ms to minimize.
[2024-05-24 03:04:54] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 4 ms to minimize.
[2024-05-24 03:04:55] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:55] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:04:55] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:04:55] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:04:55] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:04:55] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
[2024-05-24 03:04:55] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:04:55] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:04:55] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:04:55] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:04:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:04:56] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2024-05-24 03:04:56] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:04:56] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:04:56] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:04:56] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:04:57] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:04:57] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 4 ms to minimize.
[2024-05-24 03:04:57] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 205/315 variables, 110/144 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:04:59] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:04:59] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 1/316 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (OVERLAPS) 0/316 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 147 constraints, problems are : Problem set: 0 solved, 212 unsolved in 10974 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:05:04] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:05:05] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:05:05] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:05:05] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:05:05] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:05:05] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 205/315 variables, 110/152 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 212/364 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:05:07] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:05:08] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:05:10] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:05:10] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:05:10] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 2 ms to minimize.
[2024-05-24 03:05:10] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:05:10] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:05:10] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (OVERLAPS) 1/316 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:05:15] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:05:16] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/316 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (OVERLAPS) 0/316 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 375 constraints, problems are : Problem set: 0 solved, 212 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 39/39 constraints]
After SMT, in 31203ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 31227ms
Starting structural reductions in LTL mode, iteration 1 : 110/156 places, 213/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31700 ms. Remains : 110/156 places, 213/300 transitions.
Support contains 69 out of 110 places after structural reductions.
[2024-05-24 03:05:24] [INFO ] Flatten gal took : 39 ms
[2024-05-24 03:05:24] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:05:24] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 64 out of 110 places (down from 69) after GAL structural reductions.
RANDOM walk for 40000 steps (2204 resets) in 1764 ms. (22 steps per ms) remains 19/58 properties
BEST_FIRST walk for 4004 steps (26 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (30 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (29 resets) in 47 ms. (83 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (26 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (28 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (23 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (26 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
[2024-05-24 03:05:25] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-05-24 03:05:25] [INFO ] Invariant cache hit.
[2024-05-24 03:05:25] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/71 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 3 (OVERLAPS) 39/110 variables, 8/13 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-24 03:05:25] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-24 03:05:25] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:05:25] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:05:25] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:05:25] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 4/18 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 205/315 variables, 110/128 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/128 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/316 variables, 1/129 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-24 03:05:26] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/316 variables, 1/130 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 0/130 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/316 variables, 0/130 constraints. Problems are: Problem set: 2 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 130 constraints, problems are : Problem set: 2 solved, 17 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 2 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 44/70 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-24 03:05:26] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:05:26] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:05:26] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:05:26] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
Problem AtomicPropp16 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-24 03:05:26] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 40/110 variables, 8/19 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 5/24 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-24 03:05:26] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:05:26] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 8 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 20/44 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:05:27] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 8/52 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 3/55 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 3/58 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:05:28] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 2/60 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 205/315 variables, 110/170 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 16/186 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 0/186 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 1/316 variables, 1/187 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/316 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 0/316 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 187 constraints, problems are : Problem set: 3 solved, 16 unsolved in 3083 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/19 constraints, Known Traps: 47/47 constraints]
After SMT, in 4161ms problems are : Problem set: 3 solved, 16 unsolved
Parikh walk visited 14 properties in 1778 ms.
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 151 edges and 110 vertex of which 10 / 110 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 452 edges and 105 vertex of which 101 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 101 transition count 190
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 19 place count 96 transition count 183
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 94 transition count 182
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 22 place count 94 transition count 179
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 89 transition count 179
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 69 place count 50 transition count 101
Iterating global reduction 3 with 39 rules applied. Total rules applied 108 place count 50 transition count 101
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 117 place count 41 transition count 81
Iterating global reduction 3 with 9 rules applied. Total rules applied 126 place count 41 transition count 81
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 135 place count 41 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 138 place count 38 transition count 65
Iterating global reduction 4 with 3 rules applied. Total rules applied 141 place count 38 transition count 65
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 147 place count 38 transition count 59
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 37 transition count 57
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 37 transition count 57
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 152 place count 37 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 154 place count 36 transition count 53
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 164 place count 31 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 31 transition count 84
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 167 place count 31 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 169 place count 29 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 171 place count 29 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 29 transition count 129
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 174 place count 28 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 177 place count 28 transition count 125
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 178 place count 27 transition count 98
Iterating global reduction 8 with 1 rules applied. Total rules applied 179 place count 27 transition count 98
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 180 place count 26 transition count 95
Iterating global reduction 8 with 1 rules applied. Total rules applied 181 place count 26 transition count 95
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 191 place count 26 transition count 85
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 198 place count 26 transition count 85
Applied a total of 198 rules in 58 ms. Remains 26 /110 variables (removed 84) and now considering 85/213 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 26/110 places, 85/213 transitions.
RANDOM walk for 40000 steps (9325 resets) in 770 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1198 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1187 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 642 steps, run visited all 2 properties in 11 ms. (steps per millisecond=58 )
Probabilistic random walk after 642 steps, saw 258 distinct states, run finished after 14 ms. (steps per millisecond=45 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-08-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:05:31] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:05:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HealthRecord-PT-08-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:05:31] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:05:31] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 58 out of 110 places (down from 59) after GAL structural reductions.
Computed a total of 7 stabilizing places and 11 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 153 edges and 110 vertex of which 12 / 110 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 60 transition count 124
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 60 transition count 124
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 97 place count 50 transition count 102
Iterating global reduction 0 with 10 rules applied. Total rules applied 107 place count 50 transition count 102
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 117 place count 50 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 47 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 47 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 129 place count 47 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 46 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 46 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 134 place count 46 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 139 place count 46 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 44 transition count 67
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 41 transition count 64
Applied a total of 146 rules in 22 ms. Remains 41 /110 variables (removed 69) and now considering 64/213 (removed 149) transitions.
[2024-05-24 03:05:31] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 41 cols
[2024-05-24 03:05:31] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:05:31] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:05:31] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
[2024-05-24 03:05:31] [INFO ] Invariant cache hit.
[2024-05-24 03:05:31] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-24 03:05:31] [INFO ] Redundant transitions in 17 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 03:05:31] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
[2024-05-24 03:05:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:05:32] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:05:32] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:05:32] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-24 03:05:32] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 55/96 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/97 variables, and 54 constraints, problems are : Problem set: 0 solved, 48 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:05:32] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 55/96 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 48/103 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/97 variables, and 103 constraints, problems are : Problem set: 0 solved, 48 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints]
After SMT, in 1360ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1362ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/110 places, 64/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1482 ms. Remains : 41/110 places, 64/213 transitions.
[2024-05-24 03:05:33] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:05:33] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:05:33] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-24 03:05:33] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:05:33] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14518987258038226026.gal : 3 ms
[2024-05-24 03:05:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9892537371461342512.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14518987258038226026.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9892537371461342512.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (3690 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (490 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9892537371461342512.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 120
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :120 after 164
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :164 after 190
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :190 after 13008
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :13008 after 13534
Reachability property HealthRecord-PT-08-CTLFireability-2024-00 is true.
FORMULA HealthRecord-PT-08-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,62988,0.036368,4496,2,719,13,4597,6,0,215,3489,0
Total reachable state count : 62988
Verifying 1 reachability properties.
Reachability property HealthRecord-PT-08-CTLFireability-2024-00 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-08-CTLFireability-2024-00,1,0.03674,4756,2,42,13,4597,7,0,218,3489,0
Finished probabilistic random walk after 28686 steps, run visited all 1 properties in 45 ms. (steps per millisecond=637 )
Probabilistic random walk after 28686 steps, saw 5042 distinct states, run finished after 45 ms. (steps per millisecond=637 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 63 transition count 123
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 63 transition count 123
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 55 transition count 105
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 55 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 55 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 52 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 52 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 52 transition count 83
Applied a total of 131 rules in 14 ms. Remains 52 /110 variables (removed 58) and now considering 83/213 (removed 130) transitions.
[2024-05-24 03:05:33] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 52 cols
[2024-05-24 03:05:33] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:05:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 03:05:33] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-05-24 03:05:33] [INFO ] Invariant cache hit.
[2024-05-24 03:05:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:05:33] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-24 03:05:33] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-05-24 03:05:33] [INFO ] Invariant cache hit.
[2024-05-24 03:05:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:05:33] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:05:33] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 79/131 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:05:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 65 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1769 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:05:35] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:05:35] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:05:35] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 79/131 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 82/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 150 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2137 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints]
After SMT, in 3931ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3933ms
Starting structural reductions in LTL mode, iteration 1 : 52/110 places, 83/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4049 ms. Remains : 52/110 places, 83/213 transitions.
[2024-05-24 03:05:37] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:05:37] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:05:37] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-24 03:05:37] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:05:37] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:05:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1744224645354345054.gal : 1 ms
[2024-05-24 03:05:37] [INFO ] Time to serialize properties into /tmp/CTLFireability4326571658978982252.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1744224645354345054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4326571658978982252.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,583209,0.130943,8376,2,2314,5,23142,6,0,287,16181,0
Converting to forward existential form...Done !
original formula: EF((EG(EX(E((p90==1) U (p143==1)))) * AF((p97==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EG(EX(E((p90==1) U (p143==1))))) * !(EG(!((p97==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, t19, t21, t22, t23, t...282
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.58548,110868,1,0,340,670863,196,165,2128,593038,377
FORMULA HealthRecord-PT-08-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 : 110/110 places, 213/213 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 73 transition count 143
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 73 transition count 143
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 66 transition count 129
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 66 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 96 place count 66 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 65 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 65 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 64 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 64 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 64 transition count 114
Applied a total of 102 rules in 5 ms. Remains 64 /110 variables (removed 46) and now considering 114/213 (removed 99) transitions.
[2024-05-24 03:05:41] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
// Phase 1: matrix 111 rows 64 cols
[2024-05-24 03:05:41] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:05:41] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-24 03:05:41] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
[2024-05-24 03:05:41] [INFO ] Invariant cache hit.
[2024-05-24 03:05:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:05:41] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-24 03:05:41] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
[2024-05-24 03:05:41] [INFO ] Invariant cache hit.
[2024-05-24 03:05:41] [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, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:05:41] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:05:41] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:05:41] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:05:41] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:05:41] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:05:41] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:05:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:05:42] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:05:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 110/174 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 1/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 83 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2970 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-24 03:05:44] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:05:44] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 110/174 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 113/197 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 1/175 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 198 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3598 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 11/11 constraints]
After SMT, in 6603ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 6604ms
Starting structural reductions in LTL mode, iteration 1 : 64/110 places, 114/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6708 ms. Remains : 64/110 places, 114/213 transitions.
[2024-05-24 03:05:47] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:05:47] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:05:47] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-24 03:05:47] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:05:47] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:05:47] [INFO ] Time to serialize gal into /tmp/CTLFireability6400040004774376348.gal : 2 ms
[2024-05-24 03:05:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7185507587069250047.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/CTLFireability6400040004774376348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7185507587069250047.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,3.78001e+06,1.39129,42740,2,4313,5,151350,6,0,366,200111,0
Converting to forward existential form...Done !
original formula: EF(((A((p148!=1) U !(EF((p46==1)))) + (((EF(((p14==1)||(p32==1))) * AX((p56==1))) * ((p12==1)&&(p7==0))) * ((p96==0) * ((p41==0) + AX(((p...208
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (!((E(!(!(E(TRUE U (p46==1)))) U (!((p148!=1)) * !(!(E(TRUE U (p46==1)))))) + EG(!(!(E(TRU...639
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...423
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.04021,151256,1,0,421,884313,264,236,2770,807283,481
FORMULA HealthRecord-PT-08-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 151 edges and 110 vertex of which 12 / 110 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 61 transition count 126
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 61 transition count 126
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 94 place count 52 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 103 place count 52 transition count 107
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 113 place count 52 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 50 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 50 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 50 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 49 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 49 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 49 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 130 place count 49 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 47 transition count 77
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 44 transition count 74
Applied a total of 137 rules in 46 ms. Remains 44 /110 variables (removed 66) and now considering 74/213 (removed 139) transitions.
[2024-05-24 03:05:54] [INFO ] Flow matrix only has 66 transitions (discarded 8 similar events)
// Phase 1: matrix 66 rows 44 cols
[2024-05-24 03:05:54] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:05:54] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 03:05:54] [INFO ] Flow matrix only has 66 transitions (discarded 8 similar events)
[2024-05-24 03:05:54] [INFO ] Invariant cache hit.
[2024-05-24 03:05:54] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-24 03:05:54] [INFO ] Redundant transitions in 15 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-24 03:05:54] [INFO ] Flow matrix only has 66 transitions (discarded 8 similar events)
[2024-05-24 03:05:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-24 03:05:54] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:05:54] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:05:54] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-24 03:05:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 65/109 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 57 constraints, problems are : Problem set: 0 solved, 58 unsolved in 783 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 65/109 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 58/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 115 constraints, problems are : Problem set: 0 solved, 58 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 4/4 constraints]
After SMT, in 1565ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1567ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/110 places, 74/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1737 ms. Remains : 44/110 places, 74/213 transitions.
[2024-05-24 03:05:55] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:05:55] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:05:55] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-24 03:05:55] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:55] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6149085451944274226.gal : 5 ms
[2024-05-24 03:05:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6650127698727387439.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6149085451944274226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6650127698727387439.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,191164,0.046376,5536,2,647,5,8888,6,0,237,8964,0
Converting to forward existential form...Done !
original formula: EF((EG(EF(AG((p74==0)))) * (p28==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (p28==1)),E(TRUE U !(E(TRUE U !((p74==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t13, t14, t16, t17, t21, t22, t31, t32, t42, t4...261
(forward)formula 0,1,0.210851,12400,1,0,153,47796,166,71,1807,38335,174
FORMULA HealthRecord-PT-08-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 62 transition count 121
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 62 transition count 121
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 54 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 54 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 54 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 52 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 52 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 52 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 51 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 51 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 51 transition count 82
Applied a total of 133 rules in 3 ms. Remains 51 /110 variables (removed 59) and now considering 82/213 (removed 131) transitions.
[2024-05-24 03:05:55] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 51 cols
[2024-05-24 03:05:55] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:05:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:05:55] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:05:55] [INFO ] Invariant cache hit.
[2024-05-24 03:05:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:05:56] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-24 03:05:56] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:05:56] [INFO ] Invariant cache hit.
[2024-05-24 03:05:56] [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, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:05:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:05:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:05:56] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 78/129 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 64 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1374 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:05:57] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:05:57] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 78/129 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 81/146 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:05:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 148 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2472 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 6/6 constraints]
After SMT, in 3868ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3868ms
Starting structural reductions in LTL mode, iteration 1 : 51/110 places, 82/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3950 ms. Remains : 51/110 places, 82/213 transitions.
[2024-05-24 03:05:59] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:05:59] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:59] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-24 03:05:59] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:59] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:05:59] [INFO ] Time to serialize gal into /tmp/CTLFireability267879245770353020.gal : 1 ms
[2024-05-24 03:05:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17246040550947437490.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/CTLFireability267879245770353020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17246040550947437490.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,518328,0.158199,10556,2,2411,5,35139,6,0,282,22429,0
Converting to forward existential form...Done !
original formula: AG(EF(AX(AX((p45==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(!(EX(!((p45==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t15, t16, t18, t20, t22, t34, t35, t53, Inter...247
(forward)formula 0,0,1.47878,52704,1,0,153,287020,182,76,2068,212896,186
FORMULA HealthRecord-PT-08-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 153 edges and 110 vertex of which 12 / 110 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 60 transition count 124
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 60 transition count 124
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 97 place count 50 transition count 102
Iterating global reduction 0 with 10 rules applied. Total rules applied 107 place count 50 transition count 102
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 117 place count 50 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 47 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 47 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 129 place count 47 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 47 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 138 place count 45 transition count 72
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 42 transition count 69
Applied a total of 141 rules in 31 ms. Remains 42 /110 variables (removed 68) and now considering 69/213 (removed 144) transitions.
[2024-05-24 03:06:01] [INFO ] Flow matrix only has 61 transitions (discarded 8 similar events)
// Phase 1: matrix 61 rows 42 cols
[2024-05-24 03:06:01] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:06:01] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-24 03:06:01] [INFO ] Flow matrix only has 61 transitions (discarded 8 similar events)
[2024-05-24 03:06:01] [INFO ] Invariant cache hit.
[2024-05-24 03:06:01] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-24 03:06:01] [INFO ] Redundant transitions in 12 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-24 03:06:01] [INFO ] Flow matrix only has 61 transitions (discarded 8 similar events)
[2024-05-24 03:06:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-24 03:06:01] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:06:01] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:06:01] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:06:01] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:06:01] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:06:02] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 60/102 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/103 variables, and 57 constraints, problems are : Problem set: 0 solved, 53 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-24 03:06:02] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 60/102 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 53/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/103 variables, and 111 constraints, problems are : Problem set: 0 solved, 53 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 7/7 constraints]
After SMT, in 1619ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1620ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/110 places, 69/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1794 ms. Remains : 42/110 places, 69/213 transitions.
[2024-05-24 03:06:03] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:06:03] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:03] [INFO ] Input system was already deterministic with 69 transitions.
RANDOM walk for 2986 steps (275 resets) in 8 ms. (331 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-08-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 03:06:03] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:06:03] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:06:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12317762034732118896.gal : 2 ms
[2024-05-24 03:06:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality873434054416601609.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12317762034732118896.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality873434054416601609.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 70 transition count 137
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 70 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 66 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 66 transition count 129
Applied a total of 88 rules in 2 ms. Remains 66 /110 variables (removed 44) and now considering 129/213 (removed 84) transitions.
[2024-05-24 03:06:03] [INFO ] Flow matrix only has 126 transitions (discarded 3 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-05-24 03:06:03] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:06:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:06:03] [INFO ] Flow matrix only has 126 transitions (discarded 3 similar events)
[2024-05-24 03:06:03] [INFO ] Invariant cache hit.
[2024-05-24 03:06:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:06:03] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-24 03:06:03] [INFO ] Flow matrix only has 126 transitions (discarded 3 similar events)
[2024-05-24 03:06:03] [INFO ] Invariant cache hit.
[2024-05-24 03:06:03] [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, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-24 03:06:03] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:06:03] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:06:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:06:04] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:06:04] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:06:04] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-24 03:06:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 125/191 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-24 03:06:05] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 84 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3493 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-24 03:06:07] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:06:07] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-24 03:06:07] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 125/191 variables, 66/86 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 128/214 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 1/192 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-24 03:06:11] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/192 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 216 constraints, problems are : Problem set: 0 solved, 128 unsolved in 6748 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 12/12 constraints]
After SMT, in 10291ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 10292ms
Starting structural reductions in LTL mode, iteration 1 : 66/110 places, 129/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10389 ms. Remains : 66/110 places, 129/213 transitions.
[2024-05-24 03:06:13] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:06:13] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:06:13] [INFO ] Input system was already deterministic with 129 transitions.
[2024-05-24 03:06:13] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:06:13] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:06:13] [INFO ] Time to serialize gal into /tmp/CTLFireability7496829836369742998.gal : 1 ms
[2024-05-24 03:06:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17682170619008976914.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/CTLFireability7496829836369742998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17682170619008976914.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.43203e+06,0.128078,9328,2,1918,5,23066,6,0,389,27453,0
Converting to forward existential form...Done !
original formula: E(EF(!(A((p143==1) U (p75==1)))) U (EX(EX((((p75==1)||(p115==1))&&(p44==1)))) * (AX((((A((p142==1) U ((p110==1)&&(p117==1))) + (p45==1)) ...262
=> equivalent forward existential formula: ([((FwdU(Init,E(TRUE U !(!((E(!((p75==1)) U (!((p143==1)) * !((p75==1)))) + EG(!((p75==1)))))))) * EX(EX((((p75=...592
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...398
(forward)formula 0,1,8.05497,239216,1,0,571,1.4698e+06,308,282,3066,1.35836e+06,674
FORMULA HealthRecord-PT-08-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 : 110/110 places, 213/213 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 65 transition count 126
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 65 transition count 126
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 57 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 57 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 115 place count 57 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 56 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 56 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 56 transition count 95
Applied a total of 120 rules in 3 ms. Remains 56 /110 variables (removed 54) and now considering 95/213 (removed 118) transitions.
[2024-05-24 03:06:21] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
// Phase 1: matrix 91 rows 56 cols
[2024-05-24 03:06:21] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 03:06:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:06:21] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2024-05-24 03:06:21] [INFO ] Invariant cache hit.
[2024-05-24 03:06:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:06:21] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-24 03:06:21] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2024-05-24 03:06:21] [INFO ] Invariant cache hit.
[2024-05-24 03:06:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-24 03:06:22] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:06:22] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-24 03:06:22] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 90/146 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 70 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1825 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 90/146 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 94/163 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 164 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 3/3 constraints]
After SMT, in 3988ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 3989ms
Starting structural reductions in LTL mode, iteration 1 : 56/110 places, 95/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4077 ms. Remains : 56/110 places, 95/213 transitions.
[2024-05-24 03:06:25] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:06:25] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:06:25] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-24 03:06:25] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:25] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:06:25] [INFO ] Time to serialize gal into /tmp/CTLFireability7084430166394175441.gal : 2 ms
[2024-05-24 03:06:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15301141010359855993.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/CTLFireability7084430166394175441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15301141010359855993.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,801910,0.044895,5372,2,655,5,8205,6,0,312,7572,0
Converting to forward existential form...Done !
original formula: EF((EG(AF((p145==1))) + (!(E(A((p7==1) U (p61==1)) U (p132==1))) * (AX(EG((p144==1))) + (p79==1)))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(EG(!((p145==1)))))] != FALSE + ([((FwdU(Init,TRUE) * !(E(!((E(!((p61==1)) U (!((p7==1))...376
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t14, t15, t17, t18, t20, t21, t23, t25, t27, t47, ...268
(forward)formula 0,1,1.45598,58684,1,0,287,356084,212,153,2256,318707,369
FORMULA HealthRecord-PT-08-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 133 edges and 110 vertex of which 10 / 110 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 64 transition count 130
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 64 transition count 130
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 90 place count 55 transition count 111
Iterating global reduction 0 with 9 rules applied. Total rules applied 99 place count 55 transition count 111
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 106 place count 55 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 54 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 54 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 111 place count 54 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 54 transition count 95
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 119 place count 52 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 50 transition count 91
Applied a total of 121 rules in 19 ms. Remains 50 /110 variables (removed 60) and now considering 91/213 (removed 122) transitions.
[2024-05-24 03:06:27] [INFO ] Flow matrix only has 83 transitions (discarded 8 similar events)
// Phase 1: matrix 83 rows 50 cols
[2024-05-24 03:06:27] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 03:06:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:06:27] [INFO ] Flow matrix only has 83 transitions (discarded 8 similar events)
[2024-05-24 03:06:27] [INFO ] Invariant cache hit.
[2024-05-24 03:06:27] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-24 03:06:27] [INFO ] Redundant transitions in 13 ms returned []
Running 75 sub problems to find dead transitions.
[2024-05-24 03:06:27] [INFO ] Flow matrix only has 83 transitions (discarded 8 similar events)
[2024-05-24 03:06:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 2/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:06:27] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:06:27] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 6/50 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 82/132 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/133 variables, and 62 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1251 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 2/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:06:28] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 6/50 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 82/132 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 75/138 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/133 variables, and 138 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 3/3 constraints]
After SMT, in 2685ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2686ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/110 places, 91/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2811 ms. Remains : 50/110 places, 91/213 transitions.
[2024-05-24 03:06:30] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:06:30] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:30] [INFO ] Input system was already deterministic with 91 transitions.
[2024-05-24 03:06:30] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:30] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7898802336511489028.gal : 1 ms
[2024-05-24 03:06:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13729737458270409564.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/CTLFireability7898802336511489028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13729737458270409564.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,463324,0.088952,6912,2,1738,5,14240,6,0,278,14292,0
Converting to forward existential form...Done !
original formula: (AG(!(E((p59==1) U (((((p15!=1)||(p22==1))||(p127==1))&&(p110==1))&&(p144==1))))) + AG(((p132==0) + ((p86==0) * EF((p4==1))))))
=> equivalent forward existential formula: ([((FwdU((Init * !(!(E(TRUE U !(!(E((p59==1) U (((((p15!=1)||(p22==1))||(p127==1))&&(p110==1))&&(p144==1))))))))...373
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...290
(forward)formula 0,0,1.04506,41748,1,0,246,219141,202,117,2159,170860,288
FORMULA HealthRecord-PT-08-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 63 transition count 123
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 63 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 54 transition count 103
Iterating global reduction 0 with 9 rules applied. Total rules applied 112 place count 54 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 120 place count 54 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 51 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 51 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 51 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 50 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 50 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 137 place count 50 transition count 77
Applied a total of 137 rules in 5 ms. Remains 50 /110 variables (removed 60) and now considering 77/213 (removed 136) transitions.
[2024-05-24 03:06:31] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 50 cols
[2024-05-24 03:06:31] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:06:31] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:06:31] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 03:06:31] [INFO ] Invariant cache hit.
[2024-05-24 03:06:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:06:31] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-24 03:06:31] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 03:06:31] [INFO ] Invariant cache hit.
[2024-05-24 03:06:31] [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, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:06:31] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:06:31] [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, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 73/123 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 62 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:06:32] [INFO ] Deduced a trap composed of 12 places in 39 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, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 73/123 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 76/138 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 139 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1775 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 2956ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2957ms
Starting structural reductions in LTL mode, iteration 1 : 50/110 places, 77/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3049 ms. Remains : 50/110 places, 77/213 transitions.
[2024-05-24 03:06:34] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:06:34] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:06:34] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-24 03:06:34] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:34] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:06:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1429450064068944041.gal : 1 ms
[2024-05-24 03:06:34] [INFO ] Time to serialize properties into /tmp/CTLFireability8178211412710010069.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/CTLFireability1429450064068944041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8178211412710010069.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,544572,0.055616,5760,2,1074,5,10438,6,0,273,9230,0
Converting to forward existential form...Done !
original formula: EG(!(E(EF(EG((p24==1))) U AG(AX((p40==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(E(TRUE U EG((p24==1))) U !(E(TRUE U !(!(EX(!((p40==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t15, t17, t19, t33, t34, t36, t37, t53, Inter...247
(forward)formula 0,1,0.873115,36208,1,0,276,165170,186,161,2003,178692,306
FORMULA HealthRecord-PT-08-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 153 edges and 110 vertex of which 12 / 110 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 60 transition count 124
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 60 transition count 124
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 97 place count 50 transition count 102
Iterating global reduction 0 with 10 rules applied. Total rules applied 107 place count 50 transition count 102
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 117 place count 50 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 47 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 47 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 129 place count 47 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 46 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 46 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 134 place count 46 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 139 place count 46 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 44 transition count 67
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 41 transition count 64
Applied a total of 146 rules in 15 ms. Remains 41 /110 variables (removed 69) and now considering 64/213 (removed 149) transitions.
[2024-05-24 03:06:35] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 41 cols
[2024-05-24 03:06:35] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:06:35] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:06:35] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
[2024-05-24 03:06:35] [INFO ] Invariant cache hit.
[2024-05-24 03:06:35] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-24 03:06:35] [INFO ] Redundant transitions in 13 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 03:06:35] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
[2024-05-24 03:06:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:06:35] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:06:35] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:06:35] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:06:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 55/96 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/97 variables, and 54 constraints, problems are : Problem set: 0 solved, 48 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:06:36] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 55/96 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 48/103 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/97 variables, and 103 constraints, problems are : Problem set: 0 solved, 48 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints]
After SMT, in 1326ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1326ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/110 places, 64/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1435 ms. Remains : 41/110 places, 64/213 transitions.
[2024-05-24 03:06:36] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:06:36] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:06:36] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-24 03:06:36] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:36] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:06:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality86591060120446577.gal : 1 ms
[2024-05-24 03:06:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16020306799228196615.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality86591060120446577.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16020306799228196615.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (3650 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality16020306799228196615.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 120
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :120 after 164
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :164 after 190
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :190 after 13008
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :13008 after 13534
BEST_FIRST walk for 40003 steps (485 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Reachability property HealthRecord-PT-08-CTLFireability-2023-12 is true.
FORMULA HealthRecord-PT-08-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,62988,0.027034,4644,2,719,13,4597,6,0,215,3489,0
Total reachable state count : 62988
Verifying 1 reachability properties.
Reachability property HealthRecord-PT-08-CTLFireability-2023-12 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-08-CTLFireability-2023-12,1,0.027625,4644,2,42,13,4597,7,0,218,3489,0
Finished probabilistic random walk after 28686 steps, run visited all 1 properties in 32 ms. (steps per millisecond=896 )
Probabilistic random walk after 28686 steps, saw 5042 distinct states, run finished after 32 ms. (steps per millisecond=896 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 64 transition count 125
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 64 transition count 125
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 56 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 56 transition count 108
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 115 place count 56 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 54 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 54 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 122 place count 54 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 53 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 53 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 53 transition count 88
Applied a total of 127 rules in 3 ms. Remains 53 /110 variables (removed 57) and now considering 88/213 (removed 125) transitions.
[2024-05-24 03:06:36] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 53 cols
[2024-05-24 03:06:36] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:06:36] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 03:06:36] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 03:06:36] [INFO ] Invariant cache hit.
[2024-05-24 03:06:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:06:36] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-24 03:06:36] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 03:06:36] [INFO ] Invariant cache hit.
[2024-05-24 03:06:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 03:06:37] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:06:37] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 84/137 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 65 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1543 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 03:06:38] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:06:38] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:06:38] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 03:06:38] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 84/137 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 87/155 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 1/138 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 156 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2536 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 6/6 constraints]
After SMT, in 4124ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 4125ms
Starting structural reductions in LTL mode, iteration 1 : 53/110 places, 88/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4230 ms. Remains : 53/110 places, 88/213 transitions.
[2024-05-24 03:06:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:06:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:06:41] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-24 03:06:41] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:41] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:06:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15059616469934197897.gal : 1 ms
[2024-05-24 03:06:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2232187984902325454.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/CTLFireability15059616469934197897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2232187984902325454.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,675793,0.131739,9284,2,1930,5,27375,6,0,296,19158,0
Converting to forward existential form...Done !
original formula: !(E(!(EF((AX((p59==1)) * (p40!=1)))) U (!(A((p104==1) U ((p128!=1) * EF((p128==1))))) * (p34==1))))
=> equivalent forward existential formula: (([((FwdU((FwdU(Init,!(E(TRUE U (!(EX(!((p59==1)))) * (p40!=1))))) * (p34==1)),!(((p128!=1) * E(TRUE U (p128==1)...494
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t15, t16, t18, t20, t22, t24, t38, t39, t41, t...257
(forward)formula 0,1,1.82391,62080,1,0,184,348091,214,95,2171,261480,235
FORMULA HealthRecord-PT-08-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 68 transition count 133
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 68 transition count 133
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 62 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 62 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 102 place count 62 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 61 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 61 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 60 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 60 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 60 transition count 106
Applied a total of 109 rules in 3 ms. Remains 60 /110 variables (removed 50) and now considering 106/213 (removed 107) transitions.
[2024-05-24 03:06:42] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
// Phase 1: matrix 103 rows 60 cols
[2024-05-24 03:06:42] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:06:42] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-24 03:06:42] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2024-05-24 03:06:42] [INFO ] Invariant cache hit.
[2024-05-24 03:06:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:06:43] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-24 03:06:43] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2024-05-24 03:06:43] [INFO ] Invariant cache hit.
[2024-05-24 03:06:43] [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, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:06:43] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 102/162 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:06:44] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 77 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2662 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:06:45] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 102/162 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 105/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 183 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2984 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 8/8 constraints]
After SMT, in 5678ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 5681ms
Starting structural reductions in LTL mode, iteration 1 : 60/110 places, 106/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5815 ms. Remains : 60/110 places, 106/213 transitions.
[2024-05-24 03:06:48] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:48] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:48] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-24 03:06:48] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:48] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:48] [INFO ] Time to serialize gal into /tmp/CTLFireability20839099084807971.gal : 1 ms
[2024-05-24 03:06:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6682875212765679503.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/CTLFireability20839099084807971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6682875212765679503.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.9466e+06,0.105631,8328,2,953,5,17384,6,0,342,22291,0
Converting to forward existential form...Done !
original formula: AX((E(A((p124==1) U (EG((p96==1)) + ((p114==1)&&(p80==1)))) U EF((p95==1))) + (((AF((p114==1)) * EF((p152==1))) * ((p35==1)&&(p153==1))) ...198
=> equivalent forward existential formula: ((([FwdG((EY(Init) * !(E(!((E(!((EG((p96==1)) + ((p114==1)&&(p80==1)))) U (!((p124==1)) * !((EG((p96==1)) + ((p1...1024
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...353
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.41983,123496,1,0,453,763810,265,244,2587,716682,491
FORMULA HealthRecord-PT-08-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 65 transition count 127
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 65 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 58 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 58 transition count 112
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 112 place count 58 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 56 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 56 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 119 place count 56 transition count 96
Applied a total of 119 rules in 5 ms. Remains 56 /110 variables (removed 54) and now considering 96/213 (removed 117) transitions.
[2024-05-24 03:06:52] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
// Phase 1: matrix 93 rows 56 cols
[2024-05-24 03:06:52] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:06:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 03:06:52] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2024-05-24 03:06:52] [INFO ] Invariant cache hit.
[2024-05-24 03:06:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:06:52] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-24 03:06:52] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2024-05-24 03:06:52] [INFO ] Invariant cache hit.
[2024-05-24 03:06:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 03:06:52] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:06:52] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:06:52] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 92/148 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 1/149 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 69 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1670 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 03:06:54] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:06:54] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 92/148 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 95/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 1/149 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 166 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2559 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 5/5 constraints]
After SMT, in 4268ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 4269ms
Starting structural reductions in LTL mode, iteration 1 : 56/110 places, 96/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4396 ms. Remains : 56/110 places, 96/213 transitions.
[2024-05-24 03:06:56] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:06:56] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:06:56] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-24 03:06:56] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:06:56] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:06:56] [INFO ] Time to serialize gal into /tmp/CTLFireability1678160712753901081.gal : 0 ms
[2024-05-24 03:06:56] [INFO ] Time to serialize properties into /tmp/CTLFireability4007881697982601555.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/CTLFireability1678160712753901081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4007881697982601555.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.35919e+06,0.065552,6424,2,1076,5,11643,6,0,316,12096,0
Converting to forward existential form...Done !
original formula: (AG(AX(EG((p97==0)))) + !(A(AG(A(((p66==1)||(p152==1)) U (((p35==1)&&(p153==1))||(p34==1)))) U E(EG(!((((p16==1)&&(p35==1))&&((p54==1)&&(...186
=> equivalent forward existential formula: [(EY(FwdU((Init * !(!(!((E(!(E(EG(!((((p16==1)&&(p35==1))&&((p54==1)&&(p124==1))))) U !(EX(!((p11!=1)))))) U (!(...537
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...322
(forward)formula 0,0,3.27131,113972,1,0,486,695605,233,239,2298,634517,558
FORMULA HealthRecord-PT-08-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-24 03:06:59] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:06:59] [INFO ] Flatten gal took : 5 ms
Total runtime 127511 ms.
BK_STOP 1716520019997
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-08"
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-08, 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-171640604100754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-08.tgz
mv HealthRecord-PT-08 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 '
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 ;