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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717201308202

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:21:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:21:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:21:49] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-01 00:21:49] [INFO ] Transformed 158 places.
[2024-06-01 00:21:49] [INFO ] Transformed 333 transitions.
[2024-06-01 00:21:49] [INFO ] Found NUPN structural information;
[2024-06-01 00:21:49] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Support contains 70 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 113 transition count 220
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 113 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 112 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 112 transition count 218
Applied a total of 92 rules in 24 ms. Remains 112 /158 variables (removed 46) and now considering 218/306 (removed 88) transitions.
[2024-06-01 00:21:49] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 112 cols
[2024-06-01 00:21:49] [INFO ] Computed 14 invariants in 17 ms
[2024-06-01 00:21:49] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 00:21:49] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-06-01 00:21:49] [INFO ] Invariant cache hit.
[2024-06-01 00:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:21:49] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-01 00:21:49] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-06-01 00:21:49] [INFO ] Invariant cache hit.
[2024-06-01 00:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:21:51] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 12 ms to minimize.
[2024-06-01 00:21:51] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:21:51] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:21:51] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:21:51] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:21:51] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:21:51] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:21:51] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:21:51] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:21:51] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:21:53] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:21:53] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:21:53] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:53] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 8 ms to minimize.
[2024-06-01 00:21:53] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:21:53] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:21:53] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:21:54] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:21:55] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 3 ms to minimize.
[2024-06-01 00:21:55] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:21:55] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:55] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:21:55] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:56] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 2 ms to minimize.
[2024-06-01 00:21:56] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:21:56] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:21:56] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:21:56] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:21:56] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:21:56] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:56] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:21:56] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:21:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:21:57] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 209/321 variables, 112/176 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:21:59] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-06-01 00:21:59] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:21:59] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:21:59] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:22:01] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (OVERLAPS) 1/322 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 17 (OVERLAPS) 0/322 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 182 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16225 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:22:07] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:22:07] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:22:07] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:22:07] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:22:07] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:22:07] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:22:08] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:22:08] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:22:08] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-06-01 00:22:08] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:22:08] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:22:08] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:22:08] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:22:08] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 209/321 variables, 112/195 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 217/412 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:22:10] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (OVERLAPS) 1/322 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:22:17] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:22:17] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:22:17] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-01 00:22:21] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:22:21] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 16 (OVERLAPS) 0/322 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 419 constraints, problems are : Problem set: 0 solved, 217 unsolved in 25655 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 75/75 constraints]
After SMT, in 42021ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 42042ms
Starting structural reductions in LTL mode, iteration 1 : 112/158 places, 218/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42445 ms. Remains : 112/158 places, 218/306 transitions.
Support contains 70 out of 112 places after structural reductions.
[2024-06-01 00:22:32] [INFO ] Flatten gal took : 39 ms
[2024-06-01 00:22:32] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:22:32] [INFO ] Input system was already deterministic with 218 transitions.
RANDOM walk for 40000 steps (2515 resets) in 2228 ms. (17 steps per ms) remains 32/73 properties
BEST_FIRST walk for 4003 steps (30 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 18 ms. (210 steps per ms) remains 28/32 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (23 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (26 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (32 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (30 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (32 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (30 resets) in 7 ms. (500 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (30 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (33 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (31 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
[2024-06-01 00:22:33] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-06-01 00:22:33] [INFO ] Invariant cache hit.
[2024-06-01 00:22:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/74 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 25 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 3 (OVERLAPS) 38/112 variables, 8/14 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 209/321 variables, 112/126 constraints. Problems are: Problem set: 3 solved, 24 unsolved
[2024-06-01 00:22:33] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:22:33] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:22:33] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 3/129 constraints. Problems are: Problem set: 3 solved, 24 unsolved
[2024-06-01 00:22:33] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:22:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 2/131 constraints. Problems are: Problem set: 3 solved, 24 unsolved
[2024-06-01 00:22:33] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 1/132 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/132 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 1/322 variables, 1/133 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/133 constraints. Problems are: Problem set: 3 solved, 24 unsolved
[2024-06-01 00:22:34] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-06-01 00:22:34] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/322 variables, 2/135 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 0/322 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 135 constraints, problems are : Problem set: 3 solved, 24 unsolved in 1689 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 43/73 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 24 unsolved
[2024-06-01 00:22:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:22:34] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:22:34] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 6/14 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 39/112 variables, 8/22 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 6/28 constraints. Problems are: Problem set: 3 solved, 24 unsolved
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 14/42 constraints. Problems are: Problem set: 3 solved, 24 unsolved
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:22:35] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 3 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 12/54 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/54 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 209/321 variables, 112/166 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 24/190 constraints. Problems are: Problem set: 3 solved, 24 unsolved
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:22:36] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:22:37] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 4/194 constraints. Problems are: Problem set: 3 solved, 24 unsolved
[2024-06-01 00:22:37] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:22:37] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 2/196 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 1/322 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 24 unsolved
[2024-06-01 00:22:38] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/322 variables, 1/198 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/322 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 0/322 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 198 constraints, problems are : Problem set: 3 solved, 24 unsolved in 4057 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/27 constraints, Known Traps: 47/47 constraints]
After SMT, in 5762ms problems are : Problem set: 3 solved, 24 unsolved
Fused 24 Parikh solutions to 17 different solutions.
Parikh walk visited 21 properties in 2162 ms.
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 149 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 477 edges and 107 vertex of which 102 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 102 transition count 195
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 98 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 97 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 97 transition count 188
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 21 place count 94 transition count 188
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 61 place count 54 transition count 108
Iterating global reduction 3 with 40 rules applied. Total rules applied 101 place count 54 transition count 108
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 110 place count 45 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 119 place count 45 transition count 89
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 128 place count 45 transition count 80
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 131 place count 42 transition count 72
Iterating global reduction 4 with 3 rules applied. Total rules applied 134 place count 42 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 42 transition count 69
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 139 place count 40 transition count 65
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 40 transition count 65
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 147 place count 40 transition count 59
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
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 157 place count 35 transition count 88
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 159 place count 35 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 161 place count 33 transition count 86
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 162 place count 33 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 163 place count 32 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 167 place count 32 transition count 145
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 168 place count 31 transition count 111
Iterating global reduction 8 with 1 rules applied. Total rules applied 169 place count 31 transition count 111
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 170 place count 30 transition count 109
Iterating global reduction 8 with 1 rules applied. Total rules applied 171 place count 30 transition count 109
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 181 place count 30 transition count 99
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 190 place count 30 transition count 99
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 197 place count 30 transition count 99
Applied a total of 197 rules in 93 ms. Remains 30 /112 variables (removed 82) and now considering 99/218 (removed 119) transitions.
Running 83 sub problems to find dead transitions.
[2024-06-01 00:22:41] [INFO ] Flow matrix only has 81 transitions (discarded 18 similar events)
// Phase 1: matrix 81 rows 30 cols
[2024-06-01 00:22:41] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 00:22:41] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 4 (OVERLAPS) 81/111 variables, 30/38 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 18/56 constraints. Problems are: Problem set: 8 solved, 75 unsolved
[2024-06-01 00:22:41] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:22:41] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD90 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/58 constraints. Problems are: Problem set: 10 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/58 constraints. Problems are: Problem set: 10 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/58 constraints. Problems are: Problem set: 10 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 58 constraints, problems are : Problem set: 10 solved, 73 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 30/30 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 2/29 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 2/3 constraints. Problems are: Problem set: 10 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 1/30 variables, 7/10 constraints. Problems are: Problem set: 10 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 81/111 variables, 30/40 constraints. Problems are: Problem set: 10 solved, 73 unsolved
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 18/58 constraints. Problems are: Problem set: 12 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 71/129 constraints. Problems are: Problem set: 12 solved, 71 unsolved
[2024-06-01 00:22:42] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 1/130 constraints. Problems are: Problem set: 12 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/130 constraints. Problems are: Problem set: 12 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 0/111 variables, 0/130 constraints. Problems are: Problem set: 12 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 130 constraints, problems are : Problem set: 12 solved, 71 unsolved in 1962 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 30/30 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 71/83 constraints, Known Traps: 3/3 constraints]
After SMT, in 2906ms problems are : Problem set: 12 solved, 71 unsolved
Search for dead transitions found 12 dead transitions in 2907ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 30/112 places, 87/218 transitions.
Graph (complete) has 109 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 28 transition count 86
Applied a total of 3 rules in 10 ms. Remains 28 /30 variables (removed 2) and now considering 86/87 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3011 ms. Remains : 28/112 places, 86/218 transitions.
RANDOM walk for 40000 steps (12 resets) in 441 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (20 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (21 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (18 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 783 steps, run visited all 3 properties in 20 ms. (steps per millisecond=39 )
Probabilistic random walk after 783 steps, saw 302 distinct states, run finished after 23 ms. (steps per millisecond=34 ) properties seen :3
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-10-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 218 transitions.
Computed a total of 9 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 69 transition count 137
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 69 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 64 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 64 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 64 transition count 125
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 62 transition count 119
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 62 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 60 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 60 transition count 115
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 111 place count 60 transition count 110
Applied a total of 111 rules in 7 ms. Remains 60 /112 variables (removed 52) and now considering 110/218 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 60/112 places, 110/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 70 transition count 137
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 70 transition count 137
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 62 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 62 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 109 place count 62 transition count 112
Applied a total of 109 rules in 5 ms. Remains 62 /112 variables (removed 50) and now considering 112/218 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 62/112 places, 112/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 62 transition count 123
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 62 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 109 place count 53 transition count 104
Iterating global reduction 0 with 9 rules applied. Total rules applied 118 place count 53 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 127 place count 53 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 50 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 50 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 136 place count 50 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 48 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 48 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 146 place count 48 transition count 74
Applied a total of 146 rules in 6 ms. Remains 48 /112 variables (removed 64) and now considering 74/218 (removed 144) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 48/112 places, 74/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 67 transition count 132
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 67 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 99 place count 58 transition count 113
Iterating global reduction 0 with 9 rules applied. Total rules applied 108 place count 58 transition count 113
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 116 place count 58 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 56 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 56 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 123 place count 56 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 55 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 55 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 55 transition count 92
Applied a total of 128 rules in 6 ms. Remains 55 /112 variables (removed 57) and now considering 92/218 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 55/112 places, 92/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 67 transition count 132
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 67 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 60 transition count 118
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 60 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 109 place count 60 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 58 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 58 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 56 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 56 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 123 place count 56 transition count 97
Applied a total of 123 rules in 5 ms. Remains 56 /112 variables (removed 56) and now considering 97/218 (removed 121) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 56/112 places, 97/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 68 transition count 135
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 68 transition count 135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 60 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 60 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 113 place count 60 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 58 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 58 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 56 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 56 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 127 place count 56 transition count 94
Applied a total of 127 rules in 4 ms. Remains 56 /112 variables (removed 56) and now considering 94/218 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 56/112 places, 94/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 69 transition count 137
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 69 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 64 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 64 transition count 127
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 102 place count 64 transition count 121
Applied a total of 102 rules in 3 ms. Remains 64 /112 variables (removed 48) and now considering 121/218 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/112 places, 121/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 72 transition count 142
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 72 transition count 142
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 65 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 65 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 99 place count 65 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 64 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 64 transition count 120
Applied a total of 101 rules in 3 ms. Remains 64 /112 variables (removed 48) and now considering 120/218 (removed 98) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/112 places, 120/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 63 transition count 125
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 63 transition count 125
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 54 transition count 106
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 54 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 125 place count 54 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 51 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 51 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 134 place count 51 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 49 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 49 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 144 place count 49 transition count 76
Applied a total of 144 rules in 2 ms. Remains 49 /112 variables (removed 63) and now considering 76/218 (removed 142) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 49/112 places, 76/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 63 transition count 125
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 63 transition count 125
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 55 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 place count 55 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 120 place count 55 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 52 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 129 place count 52 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 50 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 50 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 139 place count 50 transition count 81
Applied a total of 139 rules in 2 ms. Remains 50 /112 variables (removed 62) and now considering 81/218 (removed 137) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 50/112 places, 81/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 127
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 127
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 56 transition count 111
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 56 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 56 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 55 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 55 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 54 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 54 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 54 transition count 94
Applied a total of 128 rules in 3 ms. Remains 54 /112 variables (removed 58) and now considering 94/218 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 54/112 places, 94/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 145 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 58 transition count 121
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 58 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 98 place count 58 transition count 120
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 50 transition count 103
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 50 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 120 place count 50 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 48 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 48 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 48 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 47 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 47 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 132 place count 47 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 135 place count 47 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 46 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 44 transition count 78
Applied a total of 139 rules in 17 ms. Remains 44 /112 variables (removed 68) and now considering 78/218 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 44/112 places, 78/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 68 transition count 135
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 68 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 62 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 62 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 101 place count 62 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 60 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 60 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 58 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 58 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 115 place count 58 transition count 106
Applied a total of 115 rules in 3 ms. Remains 58 /112 variables (removed 54) and now considering 106/218 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 58/112 places, 106/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 154 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 59 transition count 123
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 59 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 96 place count 59 transition count 122
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 51 transition count 105
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 51 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 121 place count 51 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 49 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 49 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 49 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 48 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 48 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 133 place count 48 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 136 place count 48 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 47 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 45 transition count 77
Applied a total of 140 rules in 20 ms. Remains 45 /112 variables (removed 67) and now considering 77/218 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 45/112 places, 77/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 218/218 transitions.
Graph (trivial) has 128 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 61 transition count 126
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 61 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 92 place count 61 transition count 125
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 101 place count 52 transition count 106
Iterating global reduction 1 with 9 rules applied. Total rules applied 110 place count 52 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 119 place count 52 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 49 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 49 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 49 transition count 86
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 47 transition count 82
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 47 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 137 place count 47 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 140 place count 47 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 46 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 44 transition count 71
Applied a total of 144 rules in 14 ms. Remains 44 /112 variables (removed 68) and now considering 71/218 (removed 147) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 44/112 places, 71/218 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:22:44] [INFO ] Input system was already deterministic with 71 transitions.
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:22:44] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:22:44] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 00:22:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 218 transitions and 632 arcs took 4 ms.
Total runtime 55530 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2024-00
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2024-01
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2024-03
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2024-04
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2024-05
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2024-06
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2024-07
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2024-08
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2024-09
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2024-10
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2024-11
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2023-12
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2023-13
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2023-14
Could not compute solution for formula : HealthRecord-PT-10-CTLFireability-2023-15

BK_STOP 1717201365214

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name HealthRecord-PT-10-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/905/ctl_0_
ctl formula name HealthRecord-PT-10-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/905/ctl_1_
ctl formula name HealthRecord-PT-10-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/905/ctl_2_
ctl formula name HealthRecord-PT-10-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/905/ctl_3_
ctl formula name HealthRecord-PT-10-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/905/ctl_4_
ctl formula name HealthRecord-PT-10-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/905/ctl_5_
ctl formula name HealthRecord-PT-10-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/905/ctl_6_
ctl formula name HealthRecord-PT-10-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/905/ctl_7_
ctl formula name HealthRecord-PT-10-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/905/ctl_8_
ctl formula name HealthRecord-PT-10-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/905/ctl_9_
ctl formula name HealthRecord-PT-10-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/905/ctl_10_
ctl formula name HealthRecord-PT-10-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/905/ctl_11_
ctl formula name HealthRecord-PT-10-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/905/ctl_12_
ctl formula name HealthRecord-PT-10-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/905/ctl_13_
ctl formula name HealthRecord-PT-10-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/905/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HealthRecord-PT-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640604200770"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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